On the public citation graph
Linear Time Parameterized Algorithms for S ubset F eedback V ertex S et
0 signed · 64 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.1006/jcss.2001.1774openalex-snapshot
Which Problems Have Strongly Exponential Complexity?
inferredcites →https://doi.org/10.1006/jctb.1995.1006openalex-snapshot
Graph Minors .XIII. The Disjoint Paths Problem
inferredcites →https://doi.org/10.1007/3-540-44541-2_8openalex-snapshot
A Linear Time Implementation of SPQR-Trees
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-3-642-31594-7_63openalex-snapshot
Parameterized Tractability of Multiway Cut with Parity Constraints
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-014-9904-6openalex-snapshot
On Feedback Vertex Set: New Measure and New Structures
inferredcites →https://doi.org/10.1016/j.ipl.2014.05.001openalex-snapshot
Faster deterministic Feedback Vertex Set
inferredcites →https://doi.org/10.1016/j.jcss.2008.05.002openalex-snapshot
Improved algorithms for feedback vertex set problems
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.jctb.2011.03.004openalex-snapshot
Packing cycles through prescribed vertices
inferredcites →https://doi.org/10.1016/j.jctb.2011.07.004openalex-snapshot
The disjoint paths problem in quadratic time
inferredcites →https://doi.org/10.1016/j.jctb.2011.12.001openalex-snapshot
Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem
inferredcites →https://doi.org/10.1016/j.jctb.2012.05.004openalex-snapshot
Disjoint cycles intersecting a set of vertices
inferredcites →https://doi.org/10.1016/j.tcs.2005.10.007openalex-snapshot
Parameterized graph separation problems
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.003.0001openalex-snapshot
INTRODUCTION TO FIXED-PARAMETER ALGORITHMS
inferredcites →https://doi.org/10.1109/focs.2008.53openalex-snapshot
A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width
inferredcites →https://doi.org/10.1109/focs.2009.45openalex-snapshot
Planarity Allowing Few Error Vertices in Linear Time
inferredcites →https://doi.org/10.1109/focs.2011.23openalex-snapshot
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
inferredcites →https://doi.org/10.1109/focs.2013.60openalex-snapshot
An O(c^k n) 5-Approximation Algorithm for Treewidth
inferredcites →https://doi.org/10.1137/0202012openalex-snapshot
Dividing a Graph into Triconnected Components
inferredcites →https://doi.org/10.1137/1.9781611973099.137openalex-snapshot
Erdős-Pósa Property and Its Algorithmic Applications — Parity Constraints, Subset Feedback Set, and Subset Packing
inferredcites →https://doi.org/10.1137/1.9781611973402.127openalex-snapshot
Linear-Time FPT Algorithms via Network Flow
inferredcites →https://doi.org/10.1137/1.9781611973402.128openalex-snapshot
Half-integrality, LP-branching and FPT Algorithms
inferredcites →https://doi.org/10.1137/1.9781611973402.130openalex-snapshot
A Near-Optimal Planarization Algorithm
inferredcites →https://doi.org/10.1137/110843071openalex-snapshot
Subset Feedback Vertex Set Is Fixed-Parameter Tractable
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/140962838openalex-snapshot
Half-integrality, LP-branching, and FPT Algorithms
inferredcites →https://doi.org/10.1137/s0097539793251219openalex-snapshot
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
inferredcites →https://doi.org/10.1137/s0097539798340047openalex-snapshot
An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem
inferredcites →https://doi.org/10.1137/s0895480195291874openalex-snapshot
Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications
inferredcites →https://doi.org/10.1145/1159892.1159898openalex-snapshot
Faster fixed parameter tractable algorithms for finding feedback vertex sets
inferredcites →https://doi.org/10.1145/1374376.1374443openalex-snapshot
Graph and map isomorphism and all polyhedral embeddings in linear time
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/2700209openalex-snapshot
Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
inferredcites →https://doi.org/10.1145/3128600openalex-snapshot
Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts
inferredcites →https://doi.org/10.1145/362248.362272openalex-snapshot
Algorithm 447: efficient algorithms for graph manipulation
inferredcites →https://doi.org/10.1198/jasa.2006.s74openalex-snapshot
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
inferredcites →https://doi.org/10.4153/cjm-1956-045-5openalex-snapshot
Maximal Flow Through a Network
inferredcites →https://doi.org/10.4230/lipics.stacs.2010.2460openalex-snapshot
Planar Subgraph Isomorphism Revisited
inferredcites →https://doi.org/10.5555/1496770.1496898openalex-snapshot
A nearly linear time algorithm for the half integral parity disjoint paths packing problem
inferredcites →https://doi.org/10.5555/2095116.2095253openalex-snapshot
Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
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-00256-5_28openalex-snapshot
An Improved FPT Algorithm for Independent Feedback Vertex Set
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-031-82670-2_3openalex-snapshot
Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints
inferred← citeshttps://doi.org/10.1007/978-3-032-11835-6_6openalex-snapshot
Subset Feedback Vertex Set Parameterized by Multiway Cut is FPT
inferred← citeshttps://doi.org/10.1007/s00224-020-09973-wopenalex-snapshot
An Improved FPT Algorithm for Independent Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/s00224-021-10045-wopenalex-snapshot
A Parameterized Complexity View on Collapsing k-Cores
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-023-01206-zopenalex-snapshot
Improved FPT Algorithms for Deletion to Forest-Like Structures
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.11.002openalex-snapshot
When recursion is better than iteration: A linear-time algorithm for directed acyclicity with few error vertices
inferred← citeshttps://doi.org/10.1109/focs.2018.00051openalex-snapshot
0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00076openalex-snapshot
Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations
inferred← citeshttps://doi.org/10.1137/1.9781611975031.125openalex-snapshot
When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices
inferred← citeshttps://doi.org/10.1137/1.9781611975031.177openalex-snapshot
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms
inferred← citeshttps://doi.org/10.1137/1.9781611975994.134openalex-snapshot
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
inferred← citeshttps://doi.org/10.4230/lipics.esa.2017.57openalex-snapshot
A Linear Time Parameterized Algorithm for Node Unique Label Cover
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2020.34openalex-snapshot
Improved FPT Algorithms for Deletion to Forest-Like Structures
inferred← citeshttps://doi.org/10.48550/arxiv.1609.04347openalex-snapshot
A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set
inferred← citeshttps://doi.org/10.7717/peerj-cs.1245openalex-snapshot
Dynamic thresholding search for the feedback vertex set problem
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.