On the public citation graph

Compression via Matroids

0 signed · 128 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/jagm.2001.1186openalex-snapshot
Vertex Cover: Further Observations and Further Improvements
inferredcites →https://doi.org/10.1007/978-3-540-79723-4_14openalex-snapshot
Wheel-Free Deletion Is W[2]-Hard
inferredcites →https://doi.org/10.1007/978-3-642-02927-1_32openalex-snapshot
Incompressibility through Colors and IDs
inferredcites →https://doi.org/10.1007/978-3-642-10217-2_37openalex-snapshot
Simpler Parameterized Algorithm for OCT
inferredcites →https://doi.org/10.1007/978-3-642-11269-0openalex-snapshot
Parameterized and Exact Computation: 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers
inferredcites →https://doi.org/10.1007/978-3-642-11269-0_22openalex-snapshot
Two Edge Modification Problems without Polynomial Kernels
inferredcites →https://doi.org/10.1007/978-3-642-11269-0_3openalex-snapshot
A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
inferredcites →https://doi.org/10.1007/978-3-642-31594-7_22openalex-snapshot
Clique Cover and Graph Separation: New Incompressibility Results
inferredcites →https://doi.org/10.1007/bf01580444openalex-snapshot
Vertex packings: Structural properties and algorithms
inferredcites →https://doi.org/10.1007/s00453-007-9130-6openalex-snapshot
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
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/s10878-009-9212-2openalex-snapshot
Separator-based data reduction for signed graph balancing
inferredcites →https://doi.org/10.1016/0022-247x(68)90163-7openalex-snapshot
Applications of Menger's graph theorem
inferredcites →https://doi.org/10.1016/0095-8956(80)90066-0openalex-snapshot
Matroid matching and some applications
inferredcites →https://doi.org/10.1016/j.dam.2007.08.013openalex-snapshot
Planar graph bipartization in linear time
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.10.001openalex-snapshot
Lower bounds on kernelization
inferredcites →https://doi.org/10.1016/j.jcss.2006.02.001openalex-snapshot
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
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.10.014openalex-snapshot
Comparing trees via crossing minimization
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.jcss.2011.04.001openalex-snapshot
A 2k kernel for the cluster editing problem
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.2007.02.026openalex-snapshot
The multi-multiway cut problem
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.1109/ccc30504.2013openalex-snapshot
2013 IEEE Conference on Computational Complexity
inferredcites →https://doi.org/10.1109/focs.2009.46openalex-snapshot
(Meta) Kernelization
inferredcites →https://doi.org/10.1109/focs.2011.53openalex-snapshot
The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable
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.71openalex-snapshot
New Limits to Classical and Quantum Instance Compression
inferredcites →https://doi.org/10.1137/060668092openalex-snapshot
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
inferredcites →https://doi.org/10.1137/s0097539793243016openalex-snapshot
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
inferredcites →https://doi.org/10.1137/s0097539798336073openalex-snapshot
A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
inferredcites →https://doi.org/10.1145/1060590.1060675openalex-snapshot
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
inferredcites →https://doi.org/10.1145/1721837.1721848openalex-snapshot
A 4 k 2 kernel for feedback vertex set
inferredcites →https://doi.org/10.1145/1806689.1806725openalex-snapshot
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
inferredcites →https://doi.org/10.1145/1993636.1993698openalex-snapshot
Multicut is FPT
inferredcites →https://doi.org/10.1145/1993636.1993699openalex-snapshot
Fixed-parameter tractability of multicut parameterized by the size of the cutset
inferredcites →https://doi.org/10.1145/258533.258590openalex-snapshot
P = BPP if E requires exponential circuits
inferredcites →https://doi.org/10.1145/509907.510017openalex-snapshot
On the power of unique 2-prover 1-round games
inferredcites →https://doi.org/10.4007/annals.2004.160.781openalex-snapshot
PRIMES is in P
inferredcites →https://doi.org/10.48550/arxiv.1203.0833openalex-snapshot
Faster Parameterized Algorithms using Linear Programming
inferredcites →https://doi.org/10.5555/1873601.1873644openalex-snapshot
Bidimensionality and kernels
inferredcites →https://doi.org/10.7155/jgaa.00177openalex-snapshot
Algorithm Engineering for Optimal Graph Bipartization

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.21904openalex-snapshot
Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
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-39881-1_20openalex-snapshot
On the Maximum Edge-Pair Embedding Bipartite Matching
inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0_11openalex-snapshot
Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices
inferred← citeshttps://doi.org/10.1007/978-3-030-70006-5_8openalex-snapshot
Energy-Aware Pattern Framework: The Energy-Efficiency Challenge for Embedded Systems from a Software Design Perspective
inferred← citeshttps://doi.org/10.1007/978-3-032-11835-6_25openalex-snapshot
Efficient Parameterized Approximation
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-981-99-3761-5_57openalex-snapshot
A Brief Overview of Randomized Algorithms
inferred← citeshttps://doi.org/10.1007/s00224-016-9716-yopenalex-snapshot
Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion
inferred← citeshttps://doi.org/10.1007/s00453-017-0319-zopenalex-snapshot
Edge Bipartization Faster than $$2^k$$ 2 k
inferred← citeshttps://doi.org/10.1007/s00453-018-0431-8openalex-snapshot
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
inferred← citeshttps://doi.org/10.1007/s00453-019-00609-1openalex-snapshot
Multi-budgeted Directed Cuts
inferred← citeshttps://doi.org/10.1007/s00453-022-00963-7openalex-snapshot
Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion
inferred← citeshttps://doi.org/10.1016/j.cosrev.2023.100556openalex-snapshot
A survey of parameterized algorithms and the complexity of edge modification
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.101035openalex-snapshot
Quo Vadis, Kernelization?
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.03.001openalex-snapshot
Your rugby mates don't need to know your colleagues: Triadic closure with edge colors
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.jcss.2024.103617openalex-snapshot
A constant-factor approximation for weighted bond cover
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.02.029openalex-snapshot
Linear representation of transversal matroids and gammoids parameterized by rank
inferred← citeshttps://doi.org/10.1017/9781107415157openalex-snapshot
Kernelization
inferred← citeshttps://doi.org/10.1017/9781107415157.001openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1017/9781107415157.002openalex-snapshot
Acknowledgements
inferred← citeshttps://doi.org/10.1017/9781107415157.003openalex-snapshot
What Is a Kernel?
inferred← citeshttps://doi.org/10.1017/9781107415157.004openalex-snapshot
Warm Up
inferred← citeshttps://doi.org/10.1017/9781107415157.005openalex-snapshot
Inductive Priorities
inferred← citeshttps://doi.org/10.1017/9781107415157.006openalex-snapshot
Crown Decomposition
inferred← citeshttps://doi.org/10.1017/9781107415157.007openalex-snapshot
Expansion Lemma
inferred← citeshttps://doi.org/10.1017/9781107415157.008openalex-snapshot
Linear Programming
inferred← citeshttps://doi.org/10.1017/9781107415157.009openalex-snapshot
Hypertrees
inferred← citeshttps://doi.org/10.1017/9781107415157.010openalex-snapshot
Sunflower Lemma
inferred← citeshttps://doi.org/10.1017/9781107415157.011openalex-snapshot
Modules
inferred← citeshttps://doi.org/10.1017/9781107415157.012openalex-snapshot
Matroids
inferred← citeshttps://doi.org/10.1017/9781107415157.013openalex-snapshot
Representative Families
inferred← citeshttps://doi.org/10.1017/9781107415157.014openalex-snapshot
Greedy Packing
inferred← citeshttps://doi.org/10.1017/9781107415157.015openalex-snapshot
Euler–s Formula
inferred← citeshttps://doi.org/10.1017/9781107415157.016openalex-snapshot
Introduction to Treewidth
inferred← citeshttps://doi.org/10.1017/9781107415157.017openalex-snapshot
Bidimensionality and Protrusions
inferred← citeshttps://doi.org/10.1017/9781107415157.018openalex-snapshot
Surgery on Graphs
inferred← citeshttps://doi.org/10.1017/9781107415157.019openalex-snapshot
Framework
inferred← citeshttps://doi.org/10.1017/9781107415157.020openalex-snapshot
Instance Selectors
inferred← citeshttps://doi.org/10.1017/9781107415157.021openalex-snapshot
Polynomial Parameter Transformation
inferred← citeshttps://doi.org/10.1017/9781107415157.022openalex-snapshot
Polynomial Lower Bounds
inferred← citeshttps://doi.org/10.1017/9781107415157.023openalex-snapshot
Extending Distillation
inferred← citeshttps://doi.org/10.1017/9781107415157.024openalex-snapshot
Turing Kernelization
inferred← citeshttps://doi.org/10.1017/9781107415157.025openalex-snapshot
Lossy Kernelization
inferred← citeshttps://doi.org/10.1017/9781107415157.026openalex-snapshot
Open Problems
inferred← citeshttps://doi.org/10.1017/9781107415157.027openalex-snapshot
Graphs and SAT Notation
inferred← citeshttps://doi.org/10.1017/9781107415157.028openalex-snapshot
Problem Definitions
inferred← citeshttps://doi.org/10.1017/9781107415157.029openalex-snapshot
Author Index
inferred← citeshttps://doi.org/10.1017/9781107415157.030openalex-snapshot
Index
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00044openalex-snapshot
Planar Disjoint Paths, Treewidth, and Kernels
inferred← citeshttps://doi.org/10.1137/1.9781611974782.102openalex-snapshot
LP-branching algorithms based on biased graphs
inferred← citeshttps://doi.org/10.1137/1.9781611975673.37openalex-snapshot
Mining Maximal Induced Bicliques using Odd Cycle Transversals
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.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/18m1176087openalex-snapshot
Odd Multiway Cut in Directed Acyclic Graphs
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/20m1375048openalex-snapshot
Proximity Search for Maximal Subgraph Enumeration
inferred← citeshttps://doi.org/10.1137/22m153118xopenalex-snapshot
On Weighted Graph Separation Problems and Flow Augmentation
inferred← citeshttps://doi.org/10.1145/2700209openalex-snapshot
Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1145/2973749openalex-snapshot
(Meta) Kernelization
inferred← citeshttps://doi.org/10.1145/3029051openalex-snapshot
Uniform Kernelization Complexity of Hitting Forbidden Minors
inferred← citeshttps://doi.org/10.1145/3239560openalex-snapshot
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
inferred← citeshttps://doi.org/10.1145/3284356openalex-snapshot
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
inferred← citeshttps://doi.org/10.1145/3313276.3316402openalex-snapshot
New polynomial delay bounds for maximal subgraph enumeration by proximity search
inferred← citeshttps://doi.org/10.1145/3390887openalex-snapshot
Representative Sets and Irrelevant Vertices
inferred← citeshttps://doi.org/10.1145/3426738openalex-snapshot
Randomized Contractions Meet Lean Decompositions
inferred← citeshttps://doi.org/10.1145/3467968openalex-snapshot
An Updated Experimental Evaluation of Graph Bipartization Methods
inferred← citeshttps://doi.org/10.1145/3501304openalex-snapshot
Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems
inferred← citeshttps://doi.org/10.1145/3708544openalex-snapshot
Odd Cycle Transversal on P 5 -free Graphs in Polynomial Time
inferred← citeshttps://doi.org/10.1145/3798129.3800813openalex-snapshot
Oracle Subset Problems: A Meta-algorithm for FPT Approximation via Random Walks
inferred← citeshttps://doi.org/10.3390/a12120256openalex-snapshot
Parameterized Algorithms in Bioinformatics: An Overview
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.48550/arxiv.1504.05515openalex-snapshot
Parameterized complexity dichotomy for $(r,\ell)$-Vertex Deletion
inferred← citeshttps://doi.org/10.48550/arxiv.1504.08120openalex-snapshot
Parameterized Algorithms for Deletion to (r,l)-graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1507.02168openalex-snapshot
Edge Bipartization faster than $2^k$
inferred← citeshttps://doi.org/10.48550/arxiv.1811.07779openalex-snapshot
Experimental Evaluation of Parameterized Algorithms for Graph Separation Problems: Half-Integral Relaxations and Matroid-based Kernelization
inferred← citeshttps://doi.org/10.48550/arxiv.2110.03279openalex-snapshot
Polynomial Turing Kernels for Clique with an Optimal Number of Queries
inferred← citeshttps://doi.org/10.48550/arxiv.2111.14005openalex-snapshot
A polynomial kernel for vertex deletion into bipartite permutation graphs
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.