On the public citation graph

Improved Fixed-Parameter Algorithms for Two Feedback Set Problems

0 signed · 60 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/11427186_22openalex-snapshot
Algorithm Engineering for Optimal Graph Bipartization
inferredcites →https://doi.org/10.1007/11533719_87openalex-snapshot
An O(2 O(k) n 3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
inferredcites →https://doi.org/10.1007/11809678_34openalex-snapshot
Improved On-Line Broadcast Scheduling with Deadlines
inferredcites →https://doi.org/10.1007/11847250openalex-snapshot
Parameterized and Exact Computation
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
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-44634-6openalex-snapshot
Algorithms and Data Structures
inferredcites →https://doi.org/10.1007/3-540-44867-5openalex-snapshot
Experimental and Efficient Algorithms
inferredcites →https://doi.org/10.1007/3-540-56939-1_60openalex-snapshot
The approximation of maximum subgraph problems
inferredcites →https://doi.org/10.1007/978-1-4612-0515-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-1-4757-3023-4openalex-snapshot
Handbook of Combinatorial Optimization
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-28629-5_4openalex-snapshot
Ubiquitous Parameterization — Invitation to Fixed-Parameter Algorithms
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-45078-8_44openalex-snapshot
New Directions and New Challenges in Algorithm Design and Complexity, Parameterized
inferredcites →https://doi.org/10.1007/b99679openalex-snapshot
Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004 : proceedings
inferredcites →https://doi.org/10.1016/0022-0000(91)90023-xopenalex-snapshot
Optimization, approximation, and complexity classes
inferredcites →https://doi.org/10.1016/0304-3975(94)00097-3openalex-snapshot
Fixed-parameter tractability and completeness II: On completeness for W[1]
inferredcites →https://doi.org/10.1016/j.endm.2005.05.036openalex-snapshot
Planar graph bipartization in linear time
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/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.1101/gr.1536204openalex-snapshot
Hierarchical Scaffolding With Bambus
inferredcites →https://doi.org/10.1137/s0097539793243016openalex-snapshot
Approximate Max-Flow Min-(Multi)Cut Theorems and Their 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.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.1145/370155.370304openalex-snapshot
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout
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/11533719_87openalex-snapshot
An O(2 O(k) n 3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
inferred← citeshttps://doi.org/10.1007/11560586_30openalex-snapshot
Improved Exact Exponential Algorithms for Vertex Bipartization and Other 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_18openalex-snapshot
The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
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-540-70918-3_28openalex-snapshot
A Cubic Kernel for Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_28openalex-snapshot
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
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/s00224-007-1334-2openalex-snapshot
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques
inferred← citeshttps://doi.org/10.1007/s00224-009-9167-9openalex-snapshot
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
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.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.1016/j.tcs.2007.02.026openalex-snapshot
The multi-multiway cut problem
inferred← citeshttps://doi.org/10.1093/comjnl/bxm037openalex-snapshot
Combinatorial Optimization on Graphs of Bounded Treewidth
inferred← citeshttps://doi.org/10.1093/comjnl/bxm039openalex-snapshot
Some Parameterized Problems On Digraphs
inferred← citeshttps://doi.org/10.1093/comjnl/bxm048openalex-snapshot
Parameterized Complexity and Approximation Algorithms
inferred← citeshttps://doi.org/10.1093/comjnl/bxm056openalex-snapshot
Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems
inferred← citeshttps://doi.org/10.1109/cisis.2009.120openalex-snapshot
A Register Framework for Network Processors with Banked Register File
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/1411509.1411511openalex-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.1155/2010/986192openalex-snapshot
Balanced Bipartite Graph Based Register Allocation for Network Processors in Mobile and Wireless Networks
inferred← citeshttps://doi.org/10.2174/157489306775330570openalex-snapshot
Models and Algorithms for Haplotyping Problem
inferred← citeshttps://doi.org/10.4230/dagsemproc.07281.6openalex-snapshot
Exact Elimination of Cycles in Graphs
inferred← citeshttps://doi.org/10.5555/1496770.1496783openalex-snapshot
A quadratic kernel for feedback vertex set
inferred← citeshttps://doi.org/10.7155/jgaa.00177openalex-snapshot
Algorithm Engineering for Optimal Graph Bipartization
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.