On the public citation graph

Detecting Feedback Vertex Sets of Size k in O ⋆ (2.7 k ) Time

0 signed · 41 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.1007/3-540-36136-7_22openalex-snapshot
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set
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-21275-3openalex-snapshot
Parameterized Algorithms
inferredcites →https://doi.org/10.1007/978-3-319-21275-3_2openalex-snapshot
Kernelization
inferredcites →https://doi.org/10.1007/978-3-319-24318-4_4openalex-snapshot
Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP
inferredcites →https://doi.org/10.1007/978-3-319-57586-5_29openalex-snapshot
Fine-Grained Parameterized Complexity Analysis of Graph Coloring 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/bf02579206openalex-snapshot
Matching is as easy as matrix inversion
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-014-9904-6openalex-snapshot
On Feedback Vertex Set: New Measure and New Structures
inferredcites →https://doi.org/10.1016/0004-3702(90)90046-3openalex-snapshot
Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition
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.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.orl.2003.10.009openalex-snapshot
Finding odd cycle transversals
inferredcites →https://doi.org/10.1016/j.tcs.2010.06.026openalex-snapshot
Improved upper bounds for vertex cover
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/sfcs.1989.63480openalex-snapshot
On the complexity of fixed parameter problems
inferredcites →https://doi.org/10.1137/1.9781611975031.109openalex-snapshot
Erd\H{o}s-P\'osa property of chordless cycles and its applications
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.1142/s0129054194000049openalex-snapshot
ON DISJOINT CYCLES
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/2608628.2608664openalex-snapshot
Powers of tensors and fast matrix multiplication
inferredcites →https://doi.org/10.1145/2897518.2897551openalex-snapshot
Exact Algorithms via Monotone Local Search
inferredcites →https://doi.org/10.1145/2925416openalex-snapshot
On Problems as Hard as CNF-SAT
inferredcites →https://doi.org/10.1145/3149.3159openalex-snapshot
Feedback vertex sets and cyclically reducible graphs
inferredcites →https://doi.org/10.1613/jair.638openalex-snapshot
Randomized Algorithms for the Loop Cutset Problem
inferredcites →https://doi.org/10.4230/lipics.ipec.2016.2openalex-snapshot
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
inferredcites →https://doi.org/10.4230/lipics.ipec.2016.27openalex-snapshot
Cut and Count and Representative Sets on Branch Decompositions
inferredcites →https://doi.org/10.4230/lipics.ipec.2016.30openalex-snapshot
The First Parameterized Algorithms and Computational Experiments Challenge
inferredcites →https://doi.org/10.4230/oasics.sosa.2018.1openalex-snapshot
A Naive Algorithm for Feedback Vertex Set

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-031-75409-8_20openalex-snapshot
Roman Cycle Hitting Set
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-025-10248-5openalex-snapshot
The Ground-Set-Cost Budgeted Maximum Coverage 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.1016/j.cosrev.2026.100919openalex-snapshot
An invitation to “Fine-grained complexity of NP-complete problems”
inferred← citeshttps://doi.org/10.1016/j.ipl.2025.106570openalex-snapshot
Faster algorithms and a smaller kernel for Cliques or Trees Vertex Deletion
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.2026.116060openalex-snapshot
Parameterized approximation scheme for feedback vertex set
inferred← citeshttps://doi.org/10.1137/23m1589347openalex-snapshot
Search-Space Reduction via Essential Vertices
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.