On the public citation graph

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion

0 signed · 59 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jagm.2001.1186openalex-snapshot
Vertex Cover: Further Observations and Further Improvements
inferredcites →https://doi.org/10.1007/3-540-29953-xopenalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/978-1-4471-5559-1openalex-snapshot
Fundamentals of Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-3-642-30891-8openalex-snapshot
The Multivariate Algorithmic Revolution and Beyond: essays dedicated to Michael R. Fellows on the occasion of His 60th birthday
inferredcites →https://doi.org/10.1007/978-3-662-44777-2_48openalex-snapshot
Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes
inferredcites →https://doi.org/10.1007/978-3-662-47672-7_51openalex-snapshot
Uniform Kernelization Complexity of Hitting Forbidden Minors
inferredcites →https://doi.org/10.1007/s00453-008-9233-8openalex-snapshot
Chordal Deletion is Fixed-Parameter Tractable
inferredcites →https://doi.org/10.1007/s00453-010-9428-7openalex-snapshot
Solving MAX-r-SAT Above a Tight Lower Bound
inferredcites →https://doi.org/10.1007/s00453-011-9559-5openalex-snapshot
Polynomial Kernelizations for MIN F+Π1 and MAX NP
inferredcites →https://doi.org/10.1007/s00453-015-0014-xopenalex-snapshot
Chordal Editing is Fixed-Parameter Tractable
inferredcites →https://doi.org/10.1016/0022-0000(80)90060-4openalex-snapshot
The node-deletion problem for hereditary properties is NP-complete
inferredcites →https://doi.org/10.1016/b978-0-12-289260-8.50010-8openalex-snapshot
Perfect Graphs
inferredcites →https://doi.org/10.1016/j.jcss.2009.04.001openalex-snapshot
On problems without polynomial kernels
inferredcites →https://doi.org/10.1016/j.jcss.2009.09.002openalex-snapshot
A kernelization algorithm for d-Hitting Set
inferredcites →https://doi.org/10.1016/j.jcss.2010.06.007openalex-snapshot
Infeasibility of instance compression and succinct PCPs for NP
inferredcites →https://doi.org/10.1016/j.jcss.2018.01.001openalex-snapshot
Unit interval vertex deletion: Fewer vertices are relevant
inferredcites →https://doi.org/10.1016/j.tcs.2012.03.013openalex-snapshot
Parameterized complexity of vertex deletion into perfect graph classes
inferredcites →https://doi.org/10.1016/s0166-218x(98)00035-3openalex-snapshot
A unified approximation algorithm for node-deletion problems
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1017/9781108637435.004openalex-snapshot
Parameterized Algorithms
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.003.0013openalex-snapshot
PARAMETERIZED COMPLEXITY THEORY
inferredcites →https://doi.org/10.1109/focs.2012.46openalex-snapshot
Representative Sets and Irrelevant Vertices: New Tools for Kernelization
inferredcites →https://doi.org/10.1109/focs.2012.62openalex-snapshot
Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms
inferredcites →https://doi.org/10.1109/focs.2014.37openalex-snapshot
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
inferredcites →https://doi.org/10.1137/1.9781611974331.ch77openalex-snapshot
Linear Recognition of Almost Interval Graphs
inferredcites →https://doi.org/10.1137/12089051xopenalex-snapshot
A Polynomial Kernel for Proper Interval Vertex Deletion
inferredcites →https://doi.org/10.1137/120903518openalex-snapshot
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
inferredcites →https://doi.org/10.1145/1721837.1721848openalex-snapshot
A 4 k 2 kernel for feedback vertex set
inferredcites →https://doi.org/10.1145/185675.306789openalex-snapshot
On the hardness of approximating minimization problems
inferredcites →https://doi.org/10.1145/2500119openalex-snapshot
Finding small separators in linear time via treewidth reduction
inferredcites →https://doi.org/10.1145/2629595openalex-snapshot
Interval Deletion Is Fixed-Parameter Tractable
inferredcites →https://doi.org/10.1145/2629620openalex-snapshot
Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
inferredcites →https://doi.org/10.1145/2635810openalex-snapshot
Compression via Matroids
inferredcites →https://doi.org/10.1145/2797140openalex-snapshot
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
inferredcites →https://doi.org/10.1145/2973749openalex-snapshot
(Meta) Kernelization
inferredcites →https://doi.org/10.1145/800133.804355openalex-snapshot
Node-and edge-deletion NP-complete problems
inferredcites →https://doi.org/10.48550/arxiv.1502.03965openalex-snapshot
Uniform Kernelization Complexity of Hitting Forbidden Minors

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-30786-8_9openalex-snapshot
A Turing Kernelization Dichotomy for Structural Parameterizations of $$\mathcal {F}$$ -Minor-Free Deletion
inferred← citeshttps://doi.org/10.1007/978-3-032-11835-6_6openalex-snapshot
Subset Feedback Vertex Set Parameterized by Multiway Cut is FPT
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_43openalex-snapshot
A Polynomial Kernel for Distance-Hereditary Vertex Deletion
inferred← citeshttps://doi.org/10.1007/s00453-021-00820-zopenalex-snapshot
A Polynomial Kernel for Distance-Hereditary Vertex Deletion
inferred← citeshttps://doi.org/10.1007/s00453-021-00822-xopenalex-snapshot
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
inferred← citeshttps://doi.org/10.1007/s00453-022-00963-7openalex-snapshot
Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion
inferred← citeshttps://doi.org/10.1007/s00453-023-01129-9openalex-snapshot
A Polynomial Kernel for 3-Leaf Power Deletion
inferred← citeshttps://doi.org/10.1007/s00453-025-01293-0openalex-snapshot
Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth
inferred← citeshttps://doi.org/10.1016/j.cosrev.2023.100556openalex-snapshot
A survey of parameterized algorithms and the complexity of edge modification
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.101035openalex-snapshot
Quo Vadis, Kernelization?
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.02.005openalex-snapshot
A Turing kernelization dichotomy for structural parameterizations of F -Minor-Free Deletion
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103617openalex-snapshot
A constant-factor approximation for weighted bond cover
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.05.002openalex-snapshot
Erdős-Pósa property of chordless cycles and its applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115483openalex-snapshot
Smaller kernels for 3-leaf power modifications problems
inferred← citeshttps://doi.org/10.1137/1.9781611975031.109openalex-snapshot
Erd\H{o}s-P\'osa property of chordless cycles and its applications
inferred← citeshttps://doi.org/10.1137/1.9781611977073.79openalex-snapshot
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent
inferred← citeshttps://doi.org/10.1145/3571075openalex-snapshot
Polynomial Kernel for Interval Vertex Deletion
inferred← citeshttps://doi.org/10.1145/3618260.3649747openalex-snapshot
Approximating Small Sparse Cuts
inferred← citeshttps://doi.org/10.4230/lipics.esa.2023.31openalex-snapshot
Designing Output Sensitive Algorithms for Subgraph Enumeration
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.23openalex-snapshot
Fixed-Parameter Sensitivity Oracles
inferred← citeshttps://doi.org/10.5555/3310435.3310538openalex-snapshot
Interval vertex deletion admits a polynomial kernel
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.