On the public citation graph
Subquadratic Kernels for Implicit 3-H itting S et and 3-S et P acking Problems
0 signed · 53 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-0-8176-4842-8_15openalex-snapshot
Maximal Flow Through a Network
inferredcites →https://doi.org/10.1007/978-1-4471-5559-1openalex-snapshot
Fundamentals of Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-3-319-33461-5_20openalex-snapshot
Improved Approximation Algorithms for Hitting 3-Vertex Paths
inferredcites →https://doi.org/10.1007/978-3-540-95891-8_37openalex-snapshot
A Problem Kernelization for Graph Packing
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/s00224-008-9150-xopenalex-snapshot
Fixed-Parameter Algorithms for Cluster Vertex Deletion
inferredcites →https://doi.org/10.1007/s00224-015-9631-7openalex-snapshot
A Fast Branching Algorithm for Cluster Vertex Deletion
inferredcites →https://doi.org/10.1007/s00453-007-9146-yopenalex-snapshot
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
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.2016.11.007openalex-snapshot
Approximate association via dissociation
inferredcites →https://doi.org/10.1016/j.ipl.2010.04.020openalex-snapshot
An improved kernelization algorithm for r-Set Packing
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.2010.10.001openalex-snapshot
Kernels for feedback arc set in tournaments
inferredcites →https://doi.org/10.1016/j.jda.2009.08.001openalex-snapshot
Fixed-parameter tractability results for feedback set problems in tournaments
inferredcites →https://doi.org/10.1017/cbo9781139177801.010openalex-snapshot
Kernelization Methods for Fixed-Parameter Tractability
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.003.0013openalex-snapshot
PARAMETERIZED COMPLEXITY THEORY
inferredcites →https://doi.org/10.1137/1.9780898715859openalex-snapshot
Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1137/130927115openalex-snapshot
New Limits to Classical and Quantum Instance Compression
inferredcites →https://doi.org/10.1137/s0097539798338163openalex-snapshot
An Approximation Algorithm for Feedback Vertex Sets in Tournaments
inferredcites →https://doi.org/10.1145/1233481.1233493openalex-snapshot
Invitation to data reduction and problem 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/2629620openalex-snapshot
Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
inferredcites →https://doi.org/10.1145/2897518.2897551openalex-snapshot
Exact Algorithms via Monotone Local Search
inferredcites →https://doi.org/10.4153/cjm-1956-045-5openalex-snapshot
Maximal Flow Through a Network
inferredcites →https://doi.org/10.4230/lipics.esa.2017.14openalex-snapshot
Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization
inferredcites →https://doi.org/10.4230/lipics.stacs.2016.0openalex-snapshot
Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents
inferredcites →https://doi.org/10.48550/arxiv.1510.08276openalex-snapshot
Approximate Association via Dissociation
inferredcites →https://doi.org/10.5555/2722129.2722171openalex-snapshot
Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing 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-17402-6_30openalex-snapshot
Subset Feedback Vertex Set in Chordal and Split Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_38openalex-snapshot
Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS
inferred← citeshttps://doi.org/10.1007/978-3-032-11835-6_24openalex-snapshot
Polynomial-Size Enumeration Kernelizations for Long Path Enumeration
inferred← citeshttps://doi.org/10.1007/s00453-019-00590-9openalex-snapshot
Subset Feedback Vertex Set in Chordal and Split Graphs
inferred← citeshttps://doi.org/10.1007/s00453-020-00788-2openalex-snapshot
Packing Arc-Disjoint Cycles in Tournaments
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/s10107-021-01744-wopenalex-snapshot
A tight approximation algorithm for the cluster vertex deletion problem
inferred← citeshttps://doi.org/10.1007/s10898-018-0694-2openalex-snapshot
The maximum independent union of cliques problem: complexity and exact approaches
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.101035openalex-snapshot
Quo Vadis, Kernelization?
inferred← citeshttps://doi.org/10.1016/j.dam.2021.02.040openalex-snapshot
Polyhedral properties of the induced cluster subgraphs
inferred← citeshttps://doi.org/10.1016/j.ic.2026.105463openalex-snapshot
Solving subset feedback vertex set in chordal graphs faster than 2k
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103530openalex-snapshot
Packing arc-disjoint cycles in oriented graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103818openalex-snapshot
Subset feedback vertex set in tournaments as fast as without the subset
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.08.028openalex-snapshot
Vertex deletion on split graphs: Beyond 4-hitting set
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114139openalex-snapshot
A parameterized algorithm for subset feedback vertex set in tournaments
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115483openalex-snapshot
Smaller kernels for 3-leaf power modifications problems
inferred← citeshttps://doi.org/10.1145/3599722openalex-snapshot
Forgetfulness Can Make You Faster: An O * (8.097 k ) -time Algorithm for Weighted 3-set k -packing
inferred← citeshttps://doi.org/10.1360/ssi-2024-0129openalex-snapshot
Exact algorithms for maximum independent set problem on hypergraphs
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2357961/v1openalex-snapshot
Breaking the Barrier 2k for Subset Feedback Vertex Set in Chordal Graphs
inferred← citeshttps://doi.org/10.3390/a13060146openalex-snapshot
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
inferred← citeshttps://doi.org/10.3390/a16030144openalex-snapshot
Expansion Lemma—Variations and Applications to Polynomial-Time Preprocessing
inferred← citeshttps://doi.org/10.48550/arxiv.1802.07090openalex-snapshot
The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments
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.