On the public citation graph
The Lost Continent of Polynomial Time: Preprocessing and Kernelization
0 signed · 46 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.
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.
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-50026-9_2openalex-snapshot
Parameterized Analysis of Art Gallery and Terrain Guarding
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_1openalex-snapshot
Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-319-98355-4_19openalex-snapshot
What Is Known About Vertex Cover Kernelization?
inferred← citeshttps://doi.org/10.1007/978-3-540-73814-5_32openalex-snapshot
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_42openalex-snapshot
Kernelization and Complexity Results for Connectivity Augmentation Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_4openalex-snapshot
A More Effective Linear Kernelization for Cluster Editing
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_11openalex-snapshot
Clustering with Partial Information
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_49openalex-snapshot
A 2k Kernel for the Cluster Editing Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_10openalex-snapshot
Kernelization – Preprocessing with a Guarantee
inferred← citeshttps://doi.org/10.1007/978-3-642-31265-6_28openalex-snapshot
A Linear Kernel for the Complementary Maximal Strip Recovery Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-38233-8_2openalex-snapshot
Parameterized Complexity and Kernel Bounds for Hard Planning Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_41openalex-snapshot
Meta-kernelization with Structural Parameters
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_31openalex-snapshot
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy
inferred← citeshttps://doi.org/10.1007/978-3-642-41524-1_2openalex-snapshot
The Parameterized Complexity of Constraint Satisfaction and Reasoning
inferred← citeshttps://doi.org/10.1007/s00453-012-9663-1openalex-snapshot
A Cubic-Vertex Kernel for Flip Consensus Tree
inferred← citeshttps://doi.org/10.1007/s11390-023-1420-1openalex-snapshot
2k-Vertex Kernels for Cluster Deletion and Strong Triadic Closure
inferred← citeshttps://doi.org/10.1016/j.artint.2014.06.006openalex-snapshot
Guarantees and limits of preprocessing in constraint satisfaction and reasoning
inferred← citeshttps://doi.org/10.1016/j.dam.2008.07.011openalex-snapshot
The parameterized complexity of the induced matching problem
inferred← citeshttps://doi.org/10.1016/j.dam.2018.02.014openalex-snapshot
Color spanning objects: Algorithms and hardness results
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.04.023openalex-snapshot
Rotation distance is fixed-parameter tractable
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.04.022openalex-snapshot
An improved kernel size for rotation distance in binary trees
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106193openalex-snapshot
A simple and improved parameterized algorithm for bicluster editing
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.04.001openalex-snapshot
A 2k kernel for the cluster editing problem
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.03.005openalex-snapshot
A linear kernel for the complementary maximal strip recovery problem
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.04.002openalex-snapshot
A complete parameterized complexity analysis of bounded planning
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.08.003openalex-snapshot
Meta-kernelization with structural parameters
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103532openalex-snapshot
Preprocessing to reduce the search space: Antler structures for feedback vertex set
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103730openalex-snapshot
Search-space reduction via essential vertices revisited: Vertex multicut and cograph deletion
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103781openalex-snapshot
Parameterized analysis of the cops and robber problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.10.021openalex-snapshot
A more effective linear kernelization for cluster editing
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.12.016openalex-snapshot
Clustering with partial information
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00044openalex-snapshot
Planar Disjoint Paths, Treewidth, and Kernels
inferred← citeshttps://doi.org/10.1137/23m1589347openalex-snapshot
Search-Space Reduction via Essential Vertices
inferred← citeshttps://doi.org/10.1145/2344422.2344428openalex-snapshot
Kernel(s) for problems with no kernel
inferred← citeshttps://doi.org/10.1145/3108239openalex-snapshot
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy
inferred← citeshttps://doi.org/10.1145/3626526openalex-snapshot
Cluster Editing Parameterized above Modification-disjoint P 3 -packings
inferred← citeshttps://doi.org/10.21711/231766362015/rmc442openalex-snapshot
Editing to Cliques: A Survey of FPT Results and Recent Applications in Analyzing Large Datasets
inferred← citeshttps://doi.org/10.26756/th.2022.332openalex-snapshot
Correlation Clustering with Overlaps. (c2020)
inferred← citeshttps://doi.org/10.48550/arxiv.0903.0197openalex-snapshot
Rotation Distance is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.48550/arxiv.1104.2541openalex-snapshot
Kernels for Global Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1305.4914openalex-snapshot
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy
inferred← citeshttps://doi.org/10.48550/arxiv.1310.7828openalex-snapshot
A Complete Parameterized Complexity Analysis of Bounded Planning
inferred← citeshttps://doi.org/10.48550/arxiv.1811.09429openalex-snapshot
What is known about Vertex Cover Kernelization?
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.