On the public citation graph
Kernelization for Graph Packing and Hitting Problems via Rainbow Matching
0 signed · 19 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.1007/978-3-540-28639-4_24openalex-snapshot
Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover
inferredcites →https://doi.org/10.1007/978-3-642-30891-8_10openalex-snapshot
Kernelization – Preprocessing with a Guarantee
inferredcites →https://doi.org/10.1007/bf01793010openalex-snapshot
A condition for matchability in hypergraphs
inferredcites →https://doi.org/10.1007/s00453-014-9910-8openalex-snapshot
A Completeness Theory for Polynomial (Turing) Kernelization
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/0168-0072(94)00034-zopenalex-snapshot
Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues
inferredcites →https://doi.org/10.1016/0304-3975(94)00097-3openalex-snapshot
Fixed-parameter tractability and completeness II: On completeness for W[1]
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.1017/s0963548320000127openalex-snapshot
Finding independent transversals efficiently
inferredcites →https://doi.org/10.1093/comjnl/bxm038openalex-snapshot
An Overview of Techniques for Designing Parameterized Algorithms
inferredcites →https://doi.org/10.1109/focs.2013.61openalex-snapshot
Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search
inferredcites →https://doi.org/10.1137/1.9781611973099.6openalex-snapshot
Kernelization of Packing Problems
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/130927115openalex-snapshot
New Limits to Classical and Quantum Instance Compression
inferredcites →https://doi.org/10.1137/s0097539792228228openalex-snapshot
Fixed-Parameter Tractability and Completeness I: Basic Results
inferredcites →https://doi.org/10.1145/1233481.1233493openalex-snapshot
Invitation to data reduction and problem kernelization
inferredcites →https://doi.org/10.1145/2629620openalex-snapshot
Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
inferredcites →https://doi.org/10.1287/moor.27.2.361.328openalex-snapshot
A Min-Max Theorem on Feedback Vertex Sets
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.