On the public citation graph
Randomized Contractions Meet Lean Decompositions
0 signed · 51 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.1016/0095-8956(90)90130-ropenalex-snapshot
A menger-like property of tree-width: The finite case
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.ic.2012.10.016openalex-snapshot
Clustering with local restrictions
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.2016.03.003openalex-snapshot
Parameterized complexity dichotomy for Steiner Multicut
inferredcites →https://doi.org/10.1016/j.tcs.2005.10.007openalex-snapshot
Parameterized graph separation problems
inferredcites →https://doi.org/10.1017/s0963548302005369openalex-snapshot
Two Short Proofs Concerning Tree-Decompositions
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.29openalex-snapshot
Designing FPT Algorithms for Cut Problems Using Randomized Contractions
inferredcites →https://doi.org/10.1109/focs.2012.46openalex-snapshot
Representative Sets and Irrelevant Vertices: New Tools for Kernelization
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/12086217xopenalex-snapshot
Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset
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.1145/1411509.1411511openalex-snapshot
A fixed-parameter algorithm for the directed feedback vertex set problem
inferredcites →https://doi.org/10.1145/2462896.2462899openalex-snapshot
On multiway cut parameterized above lower bounds
inferredcites →https://doi.org/10.1145/2500119openalex-snapshot
Finding small separators in linear time via treewidth reduction
inferredcites →https://doi.org/10.1145/2591796.2591852openalex-snapshot
Minimum bisection is fixed parameter tractable
inferredcites →https://doi.org/10.1145/2933575.2934508openalex-snapshot
Definability equals recognizability for graphs of bounded treewidth
inferredcites →https://doi.org/10.1609/aaai.v26i1.8128openalex-snapshot
Don't Be Strict in Local Search!
inferredcites →https://doi.org/10.4230/lipics.icalp.2018.135openalex-snapshot
Reducing CMSO Model Checking to Highly Connected Graphs
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-79987-8_37openalex-snapshot
An FPT Algorithm for Matching Cut and d-Cut
inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_21openalex-snapshot
Partitioning Subclasses of Chordal Graphs with Few Deletions
inferred← citeshttps://doi.org/10.1007/s10107-022-01842-3openalex-snapshot
Fixed parameter approximation scheme for min-max k-cut
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100796openalex-snapshot
Parameterized algorithms on geometric intersection graphs
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100869openalex-snapshot
Applications of flow-augmentation
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.100918openalex-snapshot
Parameterized complexity of graph isomorphism testing
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.jctb.2020.12.005openalex-snapshot
A Menger-like property of tree-cut width
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114288openalex-snapshot
Partitioning subclasses of chordal graphs with few deletions
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00079openalex-snapshot
A Parameterized Approximation Scheme for Min $k$-Cut
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00026openalex-snapshot
A Single-Exponential Time 2-Approximation Algorithm for Treewidth
inferred← citeshttps://doi.org/10.1137/1.9781611976465.11openalex-snapshot
Solving hard cut problems via flow-augmentation
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/20m1383197openalex-snapshot
A Parameterized Approximation Scheme for Min $k$-Cut
inferred← citeshttps://doi.org/10.1137/22m153118xopenalex-snapshot
On Weighted Graph Separation Problems and Flow Augmentation
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.3520076openalex-snapshot
Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor
inferred← citeshttps://doi.org/10.1145/3618260.3649747openalex-snapshot
Approximating Small Sparse Cuts
inferred← citeshttps://doi.org/10.1145/3641105openalex-snapshot
Flow-augmentation II: Undirected Graphs
inferred← citeshttps://doi.org/10.1145/3717823.3718123openalex-snapshot
Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More
inferred← citeshttps://doi.org/10.21833/ijaas.2024.07.007openalex-snapshot
Rethinking the implementation and application of the Benczur-Karger minimum cuts algorithm
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2022.102openalex-snapshot
Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2021.10openalex-snapshot
The Strongish Planted Clique Hypothesis and Its Consequences
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2021.50openalex-snapshot
Exploiting Dense Structures in Parameterized Complexity
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.