On the public citation graph
Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
0 signed · 103 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/3-540-29953-xopenalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/3-540-36136-7_22openalex-snapshot
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set
inferredcites →https://doi.org/10.1007/3-540-59408-6_38openalex-snapshot
Approximating minimum feedback sets and multi-cuts in directed graphs
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-319-03898-8_14openalex-snapshot
Faster Exact Algorithms for Some Terminal Set Problems
inferredcites →https://doi.org/10.1007/978-3-540-28639-4_21openalex-snapshot
Parameterized Algorithms for Feedback Vertex Set
inferredcites →https://doi.org/10.1007/978-3-540-78773-0_61openalex-snapshot
Fixed-Parameter Algorithms for Cluster Vertex Deletion
inferredcites →https://doi.org/10.1007/978-3-540-85238-4_27openalex-snapshot
Iterative Compression and Exact Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-13731-0_10openalex-snapshot
On Feedback Vertex Set New Measure and New Structures
inferredcites →https://doi.org/10.1007/978-3-642-22300-6_11openalex-snapshot
Feedback Vertex Set in Mixed Graphs
inferredcites →https://doi.org/10.1007/978-3-642-31594-7_20openalex-snapshot
Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
inferredcites →https://doi.org/10.1007/978-3-642-31594-7_49openalex-snapshot
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
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/bf01200760openalex-snapshot
Packing directed circuits fractionally
inferredcites →https://doi.org/10.1007/pl00009191openalex-snapshot
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs
inferredcites →https://doi.org/10.1007/s00224-007-1345-zopenalex-snapshot
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
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.1016/j.cosrev.2007.09.001openalex-snapshot
Invitation to fixed-parameter algorithms
inferredcites →https://doi.org/10.1016/j.ic.2012.10.016openalex-snapshot
Clustering with local restrictions
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.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.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.11.012openalex-snapshot
Iterative compression and exact algorithms
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
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.0013openalex-snapshot
PARAMETERIZED COMPLEXITY THEORY
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.2012.46openalex-snapshot
Representative Sets and Irrelevant Vertices: New Tools for Kernelization
inferredcites →https://doi.org/10.1109/sfcs.1995.492475openalex-snapshot
Splitters and near-optimal derandomization
inferredcites →https://doi.org/10.1109/sfcs.1996.548490openalex-snapshot
An 8-approximation algorithm for the subset feedback vertex set problem
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/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/12086217xopenalex-snapshot
Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset
inferredcites →https://doi.org/10.1137/120904202openalex-snapshot
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
inferredcites →https://doi.org/10.1137/s0097539792228228openalex-snapshot
Fixed-Parameter Tractability and Completeness I: Basic Results
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/s0895480196305124openalex-snapshot
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
inferredcites →https://doi.org/10.1142/9789812770998_0010openalex-snapshot
COMPUTING MINIMUM DIRECTED FEEDBACK VERTEX SET IN O*(1.9977n)
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/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/2566616openalex-snapshot
Faster Parameterized Algorithms Using Linear Programming
inferredcites →https://doi.org/10.1613/jair.638openalex-snapshot
Randomized Algorithms for the Loop Cutset 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-1-4939-2864-4_762openalex-snapshot
Shadowless Solutions for Fixed-Parameter Tractability of Directed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-00256-5_6openalex-snapshot
On Directed Feedback Vertex Set Parameterized by Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-030-17402-6_21openalex-snapshot
Parameterized Algorithms for Generalizations of Directed 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-030-24766-9_38openalex-snapshot
Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS
inferred← citeshttps://doi.org/10.1007/978-3-030-59267-7_34openalex-snapshot
FPT Algorithms for Generalized Feedback Vertex Set Problems
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-27051-2_27openalex-snapshot
Recognizing When a Preference System is Close to Admitting a Master List
inferred← citeshttps://doi.org/10.1007/978-3-319-57586-5_15openalex-snapshot
Parameterized Resiliency Problems via Integer Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-96151-4_16openalex-snapshot
Efficient Algorithms for Measuring the Funnel-Likeness of DAGs
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5openalex-snapshot
Automata, Languages, and Programming
inferred← citeshttps://doi.org/10.1007/s00224-018-9852-7openalex-snapshot
Parameterised Algorithms for Deletion to Classes of DAGs
inferred← citeshttps://doi.org/10.1007/s00373-026-03031-xopenalex-snapshot
On a Variant of Dichromatic Number for Digraphs with Prescribed Sets of Arcs
inferred← citeshttps://doi.org/10.1007/s00453-016-0139-6openalex-snapshot
List H-Coloring a Graph by Removing Few Vertices
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-00777-5openalex-snapshot
Towards a Polynomial Kernel for Directed Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/s00453-023-01196-yopenalex-snapshot
Domination and Cut Problems on Chordal Graphs with Bounded Leafage
inferred← citeshttps://doi.org/10.1007/s10878-019-00464-4openalex-snapshot
Efficient algorithms for measuring the funnel-likeness of DAGs
inferred← citeshttps://doi.org/10.1016/j.asoc.2022.109607openalex-snapshot
Stochastic simulated annealing for directed feedback vertex set
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.2025.100869openalex-snapshot
Applications of flow-augmentation
inferred← citeshttps://doi.org/10.1016/j.disopt.2020.100596openalex-snapshot
Integer programming in parameterized complexity: Five miniatures
inferred← citeshttps://doi.org/10.1016/j.disopt.2022.100740openalex-snapshot
Parameterized algorithms for generalizations of Directed Feedback Vertex Set
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.07.008openalex-snapshot
Kernels for deletion to classes of acyclic digraphs
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.2023.113798openalex-snapshot
Fixed parameterized algorithms for generalized feedback vertex set problems
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.2023.114174openalex-snapshot
Parameterized complexity of multicut in weighted trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114445openalex-snapshot
Recognizing when a preference system is close to admitting a master list
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.9781611976465.14openalex-snapshot
FPT-approximation for FPT Problems
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.ch121openalex-snapshot
Almost Consistent Systems of Linear Equations
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/15m1032077openalex-snapshot
Designing FPT Algorithms for Cut Problems Using Randomized Contractions
inferred← citeshttps://doi.org/10.1137/18m1176087openalex-snapshot
Odd Multiway Cut in Directed Acyclic Graphs
inferred← citeshttps://doi.org/10.1137/22m153118xopenalex-snapshot
On Weighted Graph Separation Problems and Flow Augmentation
inferred← citeshttps://doi.org/10.1137/23m1548591openalex-snapshot
On the Parameterized Complexity of Deletion to \(\boldsymbol{\mathcal{H}}\)-Free Strong Components
inferred← citeshttps://doi.org/10.1145/3155299openalex-snapshot
Linear Time Parameterized Algorithms for S ubset F eedback V ertex S et
inferred← citeshttps://doi.org/10.1145/3711669openalex-snapshot
Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for Directed Feedback Vertex Set
inferred← citeshttps://doi.org/10.1145/3733107openalex-snapshot
Almost Consistent Systems of Linear Equations
inferred← citeshttps://doi.org/10.1609/aaai.v36i4.20286openalex-snapshot
Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach
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.icalp.2020.59openalex-snapshot
Hitting Long Directed Cycles Is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.4230/lipics.ipec.2019.8openalex-snapshot
FPT Inapproximability of Directed Cut and Connectivity Problems
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2020.75openalex-snapshot
On the Parameterized Complexity of Deletion to $\mathcal{H}$-free Strong Components
inferred← citeshttps://doi.org/10.48550/arxiv.2011.12500openalex-snapshot
Solving the r-pseudoforest Deletion Problem in Time Independent of r
inferred← citeshttps://doi.org/10.48550/arxiv.2012.14174openalex-snapshot
Bounded-Degree Cut is Fixed-Parameter Tractable
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.