On the public citation graph

Representative Sets and Irrelevant Vertices

0 signed · 90 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.1006/jctb.1995.1006openalex-snapshot
Graph Minors .XIII. The Disjoint Paths Problem
inferredcites →https://doi.org/10.1007/978-3-662-47672-7_75openalex-snapshot
Deterministic Truncation of Linear Matroids
inferredcites →https://doi.org/10.1007/bf01580444openalex-snapshot
Vertex packings: Structural properties and algorithms
inferredcites →https://doi.org/10.1007/s00037-020-00200-zopenalex-snapshot
Linear Matroid Intersection is in Quasi-NC
inferredcites →https://doi.org/10.1007/s00224-012-9393-4openalex-snapshot
Vertex Cover Kernelization Revisited
inferredcites →https://doi.org/10.1007/s00453-010-9412-2openalex-snapshot
The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover
inferredcites →https://doi.org/10.1007/s00453-014-9966-5openalex-snapshot
On Group Feedback Vertex Set Parameterized by the Size of the Cutset
inferredcites →https://doi.org/10.1007/s00493-006-0030-1openalex-snapshot
Packing Non-Zero A-Paths In Group-Labelled Graphs
inferredcites →https://doi.org/10.1016/0022-247x(68)90163-7openalex-snapshot
Applications of Menger's graph theorem
inferredcites →https://doi.org/10.1016/j.disopt.2010.05.003openalex-snapshot
FPT algorithms for path-transversal and cycle-transversal problems
inferredcites →https://doi.org/10.1016/j.disopt.2010.07.004openalex-snapshot
Stable assignment with couples: Parameterized complexity and local search
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.04.002openalex-snapshot
Almost 2-SAT is fixed-parameter tractable
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.2018.10.001openalex-snapshot
Path-contractions, edge deletions and connectivity preservation
inferredcites →https://doi.org/10.1016/j.orl.2003.10.009openalex-snapshot
Finding odd cycle transversals
inferredcites →https://doi.org/10.1016/j.tcs.2005.10.007openalex-snapshot
Parameterized graph separation problems
inferredcites →https://doi.org/10.1016/j.tcs.2009.07.027openalex-snapshot
A parameterized view on matroid optimization 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.1093/comjnl/bxm056openalex-snapshot
Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems
inferredcites →https://doi.org/10.1109/ccc30504.2013openalex-snapshot
2013 IEEE Conference on Computational Complexity
inferredcites →https://doi.org/10.1109/focs.2009.28openalex-snapshot
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
inferredcites →https://doi.org/10.1109/sfcs.1978.37openalex-snapshot
Two theorems on random polynomial time
inferredcites →https://doi.org/10.1112/jlms/s1-35.1.85openalex-snapshot
Intersection Theorems for Systems of Sets
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/1.9781611974331.ch80openalex-snapshot
Raising The Bar For V ertex C over : Fixed-parameter Tractability Above A Higher Guarantee
inferredcites →https://doi.org/10.1137/110855247openalex-snapshot
Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
inferredcites →https://doi.org/10.1137/12089051xopenalex-snapshot
A Polynomial Kernel for Proper Interval Vertex Deletion
inferredcites →https://doi.org/10.1137/130927115openalex-snapshot
New Limits to Classical and Quantum Instance Compression
inferredcites →https://doi.org/10.1137/140962838openalex-snapshot
Half-integrality, LP-branching, and FPT Algorithms
inferredcites →https://doi.org/10.1137/15m1032077openalex-snapshot
Designing FPT Algorithms for Cut Problems Using Randomized Contractions
inferredcites →https://doi.org/10.1137/16m1104585openalex-snapshot
A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter
inferredcites →https://doi.org/10.1137/17m1154370openalex-snapshot
Rank Vertex Cover as a Natural Problem for Algebraic Compression
inferredcites →https://doi.org/10.1145/1806689.1806698openalex-snapshot
Extensions and limits to vertex sparsification
inferredcites →https://doi.org/10.1145/2213977.2214039openalex-snapshot
On vertex sparsifiers with Steiner nodes
inferredcites →https://doi.org/10.1145/2462896.2462899openalex-snapshot
On multiway cut parameterized above lower bounds
inferredcites →https://doi.org/10.1145/2566616openalex-snapshot
Faster Parameterized Algorithms Using Linear Programming
inferredcites →https://doi.org/10.1145/2594439openalex-snapshot
Clique Cover and Graph Separation
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/2635810openalex-snapshot
Compression via Matroids
inferredcites →https://doi.org/10.1145/2886094openalex-snapshot
Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
inferredcites →https://doi.org/10.1145/2897518.2897564openalex-snapshot
Bipartite perfect matching is in quasi-NC
inferredcites →https://doi.org/10.1145/2973749openalex-snapshot
(Meta) Kernelization
inferredcites →https://doi.org/10.1145/3390887openalex-snapshot
Representative Sets and Irrelevant Vertices
inferredcites →https://doi.org/10.1145/347476.347478openalex-snapshot
Divide-and-conquer approximation algorithms via spreading metrics
inferredcites →https://doi.org/10.4064/fm-10-1-96-115openalex-snapshot
Zur allgemeinen Kurventheorie
inferredcites →https://doi.org/10.4230/lipics.stacs.2011.177openalex-snapshot
Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter
inferredcites →https://doi.org/10.5555/1958016.1958017openalex-snapshot
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications

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-60440-0_15openalex-snapshot
Computing Subset Transversals in H-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-15914-5_19openalex-snapshot
Parameterized Complexity of Weighted Multicut in Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_39openalex-snapshot
An ETH-Tight Algorithm for Bidirected Steiner Connectivity
inferred← citeshttps://doi.org/10.1007/978-3-032-11835-6_1openalex-snapshot
Boundaried Kernelization
inferred← citeshttps://doi.org/10.1007/978-3-032-28691-8_24openalex-snapshot
Polynomial Kernels with Reachability for Weighted d-Matroid Intersection
inferred← citeshttps://doi.org/10.1007/978-3-032-36214-8_1openalex-snapshot
An Analysis of the Focused Jump-and-Repair EA on Parameterized Max-2-Sat
inferred← citeshttps://doi.org/10.1007/s00453-020-00708-4openalex-snapshot
On the Approximate Compressibility of Connected Vertex Cover
inferred← citeshttps://doi.org/10.1007/s00453-024-01265-wopenalex-snapshot
Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100869openalex-snapshot
Applications of flow-augmentation
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.101035openalex-snapshot
Quo Vadis, Kernelization?
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.07.002openalex-snapshot
Polynomial anonymous dynamic distributed computing without a unique leader
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.2024.103597openalex-snapshot
Single-exponential FPT algorithms for enumerating secluded F -free subgraphs and deleting to scattered graph classes
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103679openalex-snapshot
An FPT algorithm for timeline cover
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103720openalex-snapshot
Approximate Turing kernelization for problems parameterized by treewidth
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.12.010openalex-snapshot
Computing subset transversals in H-free graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115964openalex-snapshot
Partial temporal vertex cover with bounded activity intervals
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00080openalex-snapshot
Deterministic Small Vertex Connectivity in Almost Linear Time
inferred← citeshttps://doi.org/10.1137/1.9781611977073.82openalex-snapshot
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H -Minor-Free Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611977073.83openalex-snapshot
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch123openalex-snapshot
Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch91openalex-snapshot
Exact Flow Sparsification Requires Unbounded Size
inferred← citeshttps://doi.org/10.1137/20m1335285openalex-snapshot
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover
inferred← citeshttps://doi.org/10.1137/21m140482xopenalex-snapshot
Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm
inferred← citeshttps://doi.org/10.1137/22m152058xopenalex-snapshot
Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion
inferred← citeshttps://doi.org/10.1137/22m153118xopenalex-snapshot
On Weighted Graph Separation Problems and Flow Augmentation
inferred← citeshttps://doi.org/10.1137/23m1553698openalex-snapshot
Flow-Augmentation III: Complexity Dichotomy for Boolean CSPs Parameterized by the Number of Unsatisfied Constraints
inferred← citeshttps://doi.org/10.1137/23m1589347openalex-snapshot
Search-Space Reduction via Essential Vertices
inferred← citeshttps://doi.org/10.1145/3406325.3451068openalex-snapshot
Vertex deletion parameterized by elimination distance and even less
inferred← citeshttps://doi.org/10.1145/3501304openalex-snapshot
Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems
inferred← citeshttps://doi.org/10.1145/3519935.3520018openalex-snapshot
Directed flow-augmentation
inferred← citeshttps://doi.org/10.1145/3519935.3520021openalex-snapshot
Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
inferred← citeshttps://doi.org/10.1145/3731452openalex-snapshot
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs—Part I: Algorithmic Results
inferred← citeshttps://doi.org/10.1145/3798129.3800853openalex-snapshot
Improved Approximation Algorithms for Multiway Cut by Large Mixtures of New and Old Rounding Schemes
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.52openalex-snapshot
Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.101openalex-snapshot
On Quasipolynomial Multicut-Mimicking Networks and Kernelization of Multiway Cut Problems
inferred← citeshttps://doi.org/10.4230/lipics.sand.2022.16openalex-snapshot
Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring
inferred← citeshttps://doi.org/10.46298/dmtcs.10810openalex-snapshot
Representing Matroids over the Reals is $\exists \mathbb R$-complete
inferred← citeshttps://doi.org/10.46298/theoretics.24.24openalex-snapshot
On complete classes of valuated matroids
showing the first 39 of 40 · page through all 40
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.