On the public citation graph

Tight Kernel Bounds for Problems on Graphs with Small Degeneracy

0 signed · 72 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.1007/11847250_25openalex-snapshot
The Lost Continent of Polynomial Time: Preprocessing and Kernelization
inferredcites →https://doi.org/10.1007/978-1-4612-0515-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-540-39890-5_1openalex-snapshot
Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT
inferredcites →https://doi.org/10.1007/978-3-540-73420-8_34openalex-snapshot
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
inferredcites →https://doi.org/10.1007/bf01580444openalex-snapshot
Vertex packings: Structural properties and algorithms
inferredcites →https://doi.org/10.1007/s00224-010-9270-yopenalex-snapshot
Lower Bounds for Kernelizations and Other Preprocessing Procedures
inferredcites →https://doi.org/10.1007/s00453-014-9910-8openalex-snapshot
A Completeness Theory for Polynomial (Turing) Kernelization
inferredcites →https://doi.org/10.1016/j.dam.2010.08.026openalex-snapshot
Improved induced matchings in sparse graphs
inferredcites →https://doi.org/10.1016/j.dam.2012.05.016openalex-snapshot
Kernelization hardness of connectivity problems in d -degenerate 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.2010.06.007openalex-snapshot
Infeasibility of instance compression and succinct PCPs for NP
inferredcites →https://doi.org/10.1016/j.jcss.2010.09.001openalex-snapshot
On the induced matching problem
inferredcites →https://doi.org/10.1016/j.tcs.2008.09.065openalex-snapshot
On the parameterized complexity of multiple-interval graph problems
inferredcites →https://doi.org/10.1016/j.tcs.2011.04.039openalex-snapshot
Kernel bounds for disjoint cycles and disjoint paths
inferredcites →https://doi.org/10.1016/s0168-0072(95)00020-8openalex-snapshot
Advice classes of parameterized tractability
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1109/focs.2009.46openalex-snapshot
(Meta) Kernelization
inferredcites →https://doi.org/10.1137/060668092openalex-snapshot
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
inferredcites →https://doi.org/10.1137/1.9781611973075.43openalex-snapshot
Bidimensionality and Kernels
inferredcites →https://doi.org/10.1137/1.9781611973099.7openalex-snapshot
Linear Kernels for (Connected) Dominating Set on H -minor-free graphs
inferredcites →https://doi.org/10.1137/1.9781611973099.9openalex-snapshot
Weak Compositions and Their Applications to Polynomial Lower Bounds for Kernelization
inferredcites →https://doi.org/10.1137/120880240openalex-snapshot
Kernelization Lower Bounds by Cross-Composition
inferredcites →https://doi.org/10.1145/1233481.1233493openalex-snapshot
Invitation to data reduction and problem kernelization
inferredcites →https://doi.org/10.1145/2390176.2390187openalex-snapshot
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
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/2635808openalex-snapshot
Co-Nondeterminism in Compositions
inferredcites →https://doi.org/10.1145/2650261openalex-snapshot
Kernelization Lower Bounds Through Colors and IDs
inferredcites →https://doi.org/10.1145/990308.990309openalex-snapshot
Polynomial-time data reduction for dominating set
inferredcites →https://doi.org/10.48550/arxiv.1107.3704openalex-snapshot
Co-nondeterminism in compositions: A kernelization lower bound for a Ramsey-type problem
inferredcites →https://doi.org/10.48550/arxiv.1201.2780openalex-snapshot
Linear Kernels on Graphs Excluding Topological Minors
inferredcites →https://doi.org/10.5555/1873601.1873644openalex-snapshot
Bidimensionality and kernels

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-42071-0_3openalex-snapshot
Hans Bodlaender and the Theory of Kernelization Lower Bounds
inferred← citeshttps://doi.org/10.1007/s00453-022-00965-5openalex-snapshot
Twin-width and Polynomial Kernels
inferred← citeshttps://doi.org/10.1007/s00453-022-01088-7openalex-snapshot
Essentially Tight Kernels for (Weakly) Closed Graphs
inferred← citeshttps://doi.org/10.1007/s00453-022-01090-zopenalex-snapshot
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
inferred← citeshttps://doi.org/10.1017/9781107415157openalex-snapshot
Kernelization
inferred← citeshttps://doi.org/10.1017/9781107415157.001openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1017/9781107415157.002openalex-snapshot
Acknowledgements
inferred← citeshttps://doi.org/10.1017/9781107415157.003openalex-snapshot
What Is a Kernel?
inferred← citeshttps://doi.org/10.1017/9781107415157.004openalex-snapshot
Warm Up
inferred← citeshttps://doi.org/10.1017/9781107415157.005openalex-snapshot
Inductive Priorities
inferred← citeshttps://doi.org/10.1017/9781107415157.006openalex-snapshot
Crown Decomposition
inferred← citeshttps://doi.org/10.1017/9781107415157.007openalex-snapshot
Expansion Lemma
inferred← citeshttps://doi.org/10.1017/9781107415157.008openalex-snapshot
Linear Programming
inferred← citeshttps://doi.org/10.1017/9781107415157.009openalex-snapshot
Hypertrees
inferred← citeshttps://doi.org/10.1017/9781107415157.010openalex-snapshot
Sunflower Lemma
inferred← citeshttps://doi.org/10.1017/9781107415157.011openalex-snapshot
Modules
inferred← citeshttps://doi.org/10.1017/9781107415157.012openalex-snapshot
Matroids
inferred← citeshttps://doi.org/10.1017/9781107415157.013openalex-snapshot
Representative Families
inferred← citeshttps://doi.org/10.1017/9781107415157.014openalex-snapshot
Greedy Packing
inferred← citeshttps://doi.org/10.1017/9781107415157.015openalex-snapshot
Euler–s Formula
inferred← citeshttps://doi.org/10.1017/9781107415157.016openalex-snapshot
Introduction to Treewidth
inferred← citeshttps://doi.org/10.1017/9781107415157.017openalex-snapshot
Bidimensionality and Protrusions
inferred← citeshttps://doi.org/10.1017/9781107415157.018openalex-snapshot
Surgery on Graphs
inferred← citeshttps://doi.org/10.1017/9781107415157.019openalex-snapshot
Framework
inferred← citeshttps://doi.org/10.1017/9781107415157.020openalex-snapshot
Instance Selectors
inferred← citeshttps://doi.org/10.1017/9781107415157.021openalex-snapshot
Polynomial Parameter Transformation
inferred← citeshttps://doi.org/10.1017/9781107415157.022openalex-snapshot
Polynomial Lower Bounds
inferred← citeshttps://doi.org/10.1017/9781107415157.023openalex-snapshot
Extending Distillation
inferred← citeshttps://doi.org/10.1017/9781107415157.024openalex-snapshot
Turing Kernelization
inferred← citeshttps://doi.org/10.1017/9781107415157.025openalex-snapshot
Lossy Kernelization
inferred← citeshttps://doi.org/10.1017/9781107415157.026openalex-snapshot
Open Problems
inferred← citeshttps://doi.org/10.1017/9781107415157.027openalex-snapshot
Graphs and SAT Notation
inferred← citeshttps://doi.org/10.1017/9781107415157.028openalex-snapshot
Problem Definitions
inferred← citeshttps://doi.org/10.1017/9781107415157.029openalex-snapshot
Author Index
inferred← citeshttps://doi.org/10.1017/9781107415157.030openalex-snapshot
Index
inferred← citeshttps://doi.org/10.1137/21m1449476openalex-snapshot
Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems
inferred← citeshttps://doi.org/10.1145/3155298openalex-snapshot
Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors
inferred← citeshttps://doi.org/10.1145/3708510openalex-snapshot
Parameterized covering in semi-ladder-free hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1210.0257openalex-snapshot
Kernels for (connected) Dominating Set on graphs with Excluded Topological subgraphs
inferred← citeshttps://doi.org/10.48550/arxiv.2005.03986openalex-snapshot
Exploiting $\mathbf{c}$-Closure in Kernelization Algorithms for Graph Problems
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.