On the public citation graph
Uniform Kernelization Complexity of Hitting Forbidden Minors
0 signed · 65 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 this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jctb.1995.1006openalex-snapshot
Graph Minors .XIII. The Disjoint Paths Problem
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-11269-0_2openalex-snapshot
Kernelization: New Upper and Lower Bound Techniques
inferredcites →https://doi.org/10.1007/978-3-642-28050-4_13openalex-snapshot
On the Hardness of Losing Width
inferredcites →https://doi.org/10.1007/978-3-642-30891-8_10openalex-snapshot
Kernelization – Preprocessing with a Guarantee
inferredcites →https://doi.org/10.1007/978-3-642-31155-0_31openalex-snapshot
Kernel Bounds for Structural Parameterizations of Pathwidth
inferredcites →https://doi.org/10.1007/978-3-642-40450-4_45openalex-snapshot
Kernelization Using Structural Parameters on Sparse Graph Classes
inferredcites →https://doi.org/10.1007/978-3-662-43948-7_77openalex-snapshot
A Faster Parameterized Algorithm for Treedepth
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-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.1016/0095-8956(83)90079-5openalex-snapshot
Graph minors. I. Excluding a forest
inferredcites →https://doi.org/10.1016/0095-8956(86)90030-4openalex-snapshot
Graph minors. V. Excluding a planar graph
inferredcites →https://doi.org/10.1016/j.ejc.2005.01.010openalex-snapshot
Tree-depth, subgraph coloring and homomorphism bounds
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.2013.09.004openalex-snapshot
Preprocessing subgraph and minor problems: When does a small vertex cover help?
inferredcites →https://doi.org/10.1016/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferredcites →https://doi.org/10.1051/ita/1992260302571openalex-snapshot
The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
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.9780898716474openalex-snapshot
Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1137/120903518openalex-snapshot
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
inferredcites →https://doi.org/10.1137/140997889openalex-snapshot
Hitting Forbidden Minors: Approximation and Kernelization
inferredcites →https://doi.org/10.1142/9789812796936_others05openalex-snapshot
Combinatorial Optimization
inferredcites →https://doi.org/10.1145/2591796.2591813openalex-snapshot
Polynomial bounds for the grid-minor theorem
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/2635820openalex-snapshot
FPT is characterized by useful obstruction sets
inferredcites →https://doi.org/10.1145/2797140openalex-snapshot
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
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-25005-8_27openalex-snapshot
An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number
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-030-77883-5_17openalex-snapshot
Non-Interactive Anonymous Router
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_6openalex-snapshot
General Max-Min Fair Allocation
inferred← citeshttps://doi.org/10.1007/978-3-031-15914-5_15openalex-snapshot
On the Lossy Kernelization for Connected Treedepth Deletion Set
inferred← citeshttps://doi.org/10.1007/978-3-319-17142-5_35openalex-snapshot
Kernelization Algorithms for Packing Problems Allowing Overlaps
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-020-00734-2openalex-snapshot
Fault Tolerant Approximate BFS Structures with Additive Stretch
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-022-00984-2openalex-snapshot
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size
inferred← citeshttps://doi.org/10.1007/s10878-020-00542-yopenalex-snapshot
Randomized selection algorithm for online stochastic unrelated machines scheduling
inferred← citeshttps://doi.org/10.1007/s10878-020-00612-1openalex-snapshot
Approximation algorithms for two variants of correlation clustering problem
inferred← citeshttps://doi.org/10.1007/s11227-021-03744-1openalex-snapshot
A novel state transition simulated annealing algorithm for the multiple traveling salesmen problem
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.101035openalex-snapshot
Quo Vadis, Kernelization?
inferred← citeshttps://doi.org/10.1016/j.dam.2019.10.021openalex-snapshot
Sparse obstructions for minor-covering parameters
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.2021.12.003openalex-snapshot
Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.07.009openalex-snapshot
Polynomial kernels for hitting forbidden minors under structural parameterizations
inferred← citeshttps://doi.org/10.1137/1.9781611973099.6openalex-snapshot
Kernelization of Packing Problems
inferred← citeshttps://doi.org/10.1137/140968975openalex-snapshot
Explicit Linear Kernels via Dynamic Programming
inferred← citeshttps://doi.org/10.1137/17m112035xopenalex-snapshot
Approximation and Kernelization for Chordal Vertex Deletion
inferred← citeshttps://doi.org/10.1137/18m1228839openalex-snapshot
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
inferred← citeshttps://doi.org/10.1137/20m1353782openalex-snapshot
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs
inferred← citeshttps://doi.org/10.1137/23m1614031openalex-snapshot
Highly Connected Steiner Subgraph: Parameterized Algorithms and Applications to Hitting Set Problems
inferred← citeshttps://doi.org/10.1145/2786015openalex-snapshot
Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps
inferred← citeshttps://doi.org/10.1145/3519028openalex-snapshot
k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1411.6915openalex-snapshot
Kernelization Algorithms for Packing Problems Allowing Overlaps (Extended Version)
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.