On the public citation graph

An O(2 O(k) n 3) FPT Algorithm for the Undirected Feedback Vertex Set Problem

0 signed · 81 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/jcss.2001.1774openalex-snapshot
Which Problems Have Strongly Exponential Complexity?
inferredcites →https://doi.org/10.1007/11534273_15openalex-snapshot
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
inferredcites →https://doi.org/10.1007/11917496_4openalex-snapshot
Chordal Deletion Is Fixed-Parameter Tractable
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-36478-1_17openalex-snapshot
Exact Algorithms for NP-Hard Problems: A Survey
inferredcites →https://doi.org/10.1007/3-540-68530-8_9openalex-snapshot
Analogs and Duals of the MAST Problem for Sequences and Trees
inferredcites →https://doi.org/10.1007/978-1-4612-0515-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-1-4757-3023-4_4openalex-snapshot
Feedback Set Problems
inferredcites →https://doi.org/10.1007/978-3-540-28639-4_10openalex-snapshot
On Miniaturized Problems in Parameterized Complexity Theory
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-28639-4_24openalex-snapshot
Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover
inferredcites →https://doi.org/10.1007/978-3-540-30559-0_22openalex-snapshot
Linear Kernels in Linear Time, or How to Save k Colors in O(n 2) Steps
inferredcites →https://doi.org/10.1007/978-3-540-31856-9_22openalex-snapshot
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
inferredcites →https://doi.org/10.1007/978-3-540-39890-5_16openalex-snapshot
An FPT Algorithm for Set Splitting
inferredcites →https://doi.org/10.1007/bf00137392openalex-snapshot
An analytical approach to the partial scan problem
inferredcites →https://doi.org/10.1007/pl00009191openalex-snapshot
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs
inferredcites →https://doi.org/10.1007/s00453-001-0116-5openalex-snapshot
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs
inferredcites →https://doi.org/10.1016/j.endm.2005.05.037openalex-snapshot
Faster algorithms for feedback vertex set
inferredcites →https://doi.org/10.1016/j.orl.2003.10.009openalex-snapshot
Finding odd cycle transversals
inferredcites →https://doi.org/10.1016/s0022-0000(03)00074-6openalex-snapshot
On the existence of subexponential parameterized algorithms
inferredcites →https://doi.org/10.1016/s0196-6774(03)00081-6openalex-snapshot
Analogs & duals of the MAST problem for sequences & trees
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1016/s1571-0661(04)81014-4openalex-snapshot
Cutting Up Is Hard To Do
inferredcites →https://doi.org/10.1021/ci030411+openalex-snapshot
The Footprint Sorting Problem
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/iros.2001.973394openalex-snapshot
Greedy localization
inferredcites →https://doi.org/10.1137/s0097539796305109openalex-snapshot
Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
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/s0129054194000049openalex-snapshot
ON DISJOINT CYCLES
inferredcites →https://doi.org/10.1613/jair.638openalex-snapshot
Randomized Algorithms for the Loop Cutset Problem

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11427186_22openalex-snapshot
Algorithm Engineering for Optimal Graph Bipartization
inferred← citeshttps://doi.org/10.1007/11534273_15openalex-snapshot
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
inferred← citeshttps://doi.org/10.1007/11758471_31openalex-snapshot
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
inferred← citeshttps://doi.org/10.1007/11847250_13openalex-snapshot
edge dominating set: Efficient Enumeration-Based Exact Algorithms
inferred← citeshttps://doi.org/10.1007/11847250_17openalex-snapshot
Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$
inferred← citeshttps://doi.org/10.1007/11847250_18openalex-snapshot
The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
inferred← citeshttps://doi.org/10.1007/11940128_27openalex-snapshot
Parameterized Problems on Coincidence Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_450openalex-snapshot
Undirected Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-1-60327-429-6_21openalex-snapshot
Developing Fixed-Parameter Algorithms to Solve Combinatorially Explosive Biological Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-03780-6_14openalex-snapshot
An Improved Exact Algorithm for Undirected Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-319-07956-1_26openalex-snapshot
A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_28openalex-snapshot
A Cubic Kernel for Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_37openalex-snapshot
Improved Algorithms for the Feedback Vertex Set Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-79723-4_16openalex-snapshot
A Linear Kernel for Planar Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_27openalex-snapshot
Iterative Compression and Exact Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-10217-2_14openalex-snapshot
Feedback Vertex Set on Graphs of Low Cliquewidth
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_25openalex-snapshot
FPT Algorithms for Connected Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_10openalex-snapshot
On Feedback Vertex Set New Measure and New Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_38openalex-snapshot
Subset Feedback Vertex Set Is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_19openalex-snapshot
FPT Suspects and Tough Customers: Open Problems of Downey and Fellows
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_25openalex-snapshot
An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_52openalex-snapshot
Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions
inferred← citeshttps://doi.org/10.1007/s00224-009-9234-2openalex-snapshot
A Cubic Kernel for Feedback Vertex Set and Loop Cutset
inferred← citeshttps://doi.org/10.1007/s00453-007-9152-0openalex-snapshot
On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-019-00607-3openalex-snapshot
Mim-Width II. The Feedback Vertex Set Problem
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.1007/s10601-015-9198-6openalex-snapshot
Tractability in constraint satisfaction problems: a survey
inferred← citeshttps://doi.org/10.1007/s10878-011-9394-2openalex-snapshot
FPT algorithms for Connected Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/s10878-014-9737-xopenalex-snapshot
An improved exact algorithm for undirected feedback vertex set
inferred← citeshttps://doi.org/10.1016/j.cosrev.2011.09.002openalex-snapshot
Confronting intractability via parameters
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.07.023openalex-snapshot
Feedback vertex set on graphs of low clique-width
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.02.001openalex-snapshot
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
inferred← citeshttps://doi.org/10.1016/j.jcss.2008.05.002openalex-snapshot
Improved algorithms for feedback vertex set problems
inferred← citeshttps://doi.org/10.1016/j.jda.2008.09.005openalex-snapshot
Parameterized complexity of finding regular induced subgraphs
inferred← citeshttps://doi.org/10.1016/j.jda.2009.08.001openalex-snapshot
Fixed-parameter tractability results for feedback set problems in tournaments
inferred← citeshttps://doi.org/10.1093/comjnl/bxm039openalex-snapshot
Some Parameterized Problems On Digraphs
inferred← citeshttps://doi.org/10.1093/comjnl/bxm040openalex-snapshot
Techniques for Practical Fixed-Parameter Algorithms
inferred← citeshttps://doi.org/10.1093/comjnl/bxm048openalex-snapshot
Parameterized Complexity and Approximation Algorithms
inferred← citeshttps://doi.org/10.1109/bibm.2008.75openalex-snapshot
Fast Alignments of Metabolic Networks
inferred← citeshttps://doi.org/10.1109/icdmw.2010.179openalex-snapshot
Fixed-Parameter Tractable Combinatorial Algorithms for Metabolic Networks Alignments
inferred← citeshttps://doi.org/10.1109/sc.2005.29openalex-snapshot
Genome-Scale Computational Approaches to Memory-Intensive Applications in Systems Biology
inferred← citeshttps://doi.org/10.1145/1159892.1159898openalex-snapshot
Faster fixed parameter tractable algorithms for finding feedback vertex sets
inferred← citeshttps://doi.org/10.1145/1374376.1374404openalex-snapshot
A fixed-parameter algorithm for the directed feedback vertex set problem
inferred← citeshttps://doi.org/10.1145/1721837.1721848openalex-snapshot
A 4 k 2 kernel for feedback vertex set
inferred← citeshttps://doi.org/10.1145/2797140openalex-snapshot
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
inferred← citeshttps://doi.org/10.1145/3506707openalex-snapshot
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
inferred← citeshttps://doi.org/10.4018/jkdb.2011010101openalex-snapshot
Combinatorial Optimization Algorithms for Metabolic Networks Alignments and Their Applications
inferred← citeshttps://doi.org/10.4230/dagsemproc.07281.5openalex-snapshot
Directed Feedback Vertex Set Problem is FPT
inferred← citeshttps://doi.org/10.4230/dagsemproc.07281.6openalex-snapshot
Exact Elimination of Cycles in Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0909.3180openalex-snapshot
FPT Algorithms for Connected Feedback Vertex Set
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.