On the public citation graph

Simultaneous Feedback Vertex Set

0 signed · 40 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.2000.1727openalex-snapshot
On the Complexity of k-SAT
inferredcites →https://doi.org/10.1006/jcss.2001.1774openalex-snapshot
Which Problems Have Strongly Exponential Complexity?
inferredcites →https://doi.org/10.1007/978-3-319-21275-3openalex-snapshot
Parameterized Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-79723-4_14openalex-snapshot
Wheel-Free Deletion Is W[2]-Hard
inferredcites →https://doi.org/10.1007/978-3-642-34611-8_19openalex-snapshot
Parameterized Algorithms for Even Cycle Transversal
inferredcites →https://doi.org/10.1007/978-3-662-44465-8_13openalex-snapshot
Dual Connectedness of Edge-Bicolored Graphs and Beyond
inferredcites →https://doi.org/10.1007/s00373-008-0789-5openalex-snapshot
Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey
inferredcites →https://doi.org/10.1007/s00453-008-9233-8openalex-snapshot
Chordal Deletion is Fixed-Parameter Tractable
inferredcites →https://doi.org/10.1007/s00453-010-9484-zopenalex-snapshot
Obtaining a Planar Graph by Vertex Deletion
inferredcites →https://doi.org/10.1007/s10878-014-9737-xopenalex-snapshot
An improved exact algorithm for undirected feedback vertex set
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.jctb.2008.06.004openalex-snapshot
On tree width, bramble size, and expansion
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.1016/s0012-365x(96)00160-4openalex-snapshot
Alternating Cycles and Paths in Edge-Coloured Multigraphs
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
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/focs.2012.62openalex-snapshot
Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms
inferredcites →https://doi.org/10.1137/s0895480196305124openalex-snapshot
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
inferredcites →https://doi.org/10.1145/1721837.1721848openalex-snapshot
A 4 k 2 kernel for feedback vertex set
inferredcites →https://doi.org/10.1145/2566616openalex-snapshot
Faster Parameterized Algorithms Using Linear Programming
inferredcites →https://doi.org/10.1145/2629595openalex-snapshot
Interval Deletion Is Fixed-Parameter Tractable
inferredcites →https://doi.org/10.1145/2797140openalex-snapshot
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
inferredcites →https://doi.org/10.4086/toc.2010.v006a005openalex-snapshot
inferredcites →https://doi.org/10.4230/lipics.swat.2016.12openalex-snapshot
Lower Bounds for Approximation Schemes for Closest String
inferredcites →https://doi.org/10.48550/arxiv.1510.00773openalex-snapshot
A Note on Finding Dual 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-030-00256-5_28openalex-snapshot
An Improved FPT Algorithm for Independent Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-031-55601-2_9openalex-snapshot
Sparsity in Covering Solutions
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-319-57586-5_12openalex-snapshot
Assessing the Computational Complexity of Multi-layer Subgraph Detection
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-024-10174-yopenalex-snapshot
Cluster Editing for Multi-Layer and Temporal Graphs
inferred← citeshttps://doi.org/10.1007/s00453-020-00773-9openalex-snapshot
Simultaneous Feedback Edge Set: A Parameterized Perspective
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.jcss.2026.103818openalex-snapshot
Subset feedback vertex set in tournaments as fast as without the subset
inferred← citeshttps://doi.org/10.1017/nws.2019.13openalex-snapshot
Assessing the computational complexity of multilayer subgraph detection
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2020.34openalex-snapshot
Improved FPT Algorithms for Deletion to Forest-Like Structures
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.