On the public citation graph

Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$

0 signed · 54 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/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/11534273_5openalex-snapshot
Parameterized Complexity of Generalized Vertex Cover Problems
inferredcites →https://doi.org/10.1007/11785293openalex-snapshot
Algorithm Theory - SWAT 2006: 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings
inferredcites →https://doi.org/10.1007/11785293_17openalex-snapshot
Exact Computation of Maximum Induced Forest
inferredcites →https://doi.org/10.1007/11809678_34openalex-snapshot
Improved On-Line Broadcast Scheduling with Deadlines
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/978-1-4684-2001-2openalex-snapshot
Complexity of Computer Computations
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-1-4757-3023-4_4openalex-snapshot
Feedback Set Problems
inferredcites →https://doi.org/10.1016/s0166-218x(00)00339-5openalex-snapshot
On enumerating all minimal solutions of feedback problems
inferredcites →https://doi.org/10.1145/1109557.1109560openalex-snapshot
Measure and conquer
inferredcites →https://doi.org/10.5555/1109557.1109560openalex-snapshot
Measure and conquer: a simple O(20.288n) independent set algorithm

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11944836_15openalex-snapshot
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
inferred← citeshttps://doi.org/10.1007/11944836_16openalex-snapshot
Solving Connected Dominating Set Faster Than 2 n
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_450openalex-snapshot
Undirected Feedback Vertex Set
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-73951-7_44openalex-snapshot
Branch and Recharge: Exact Algorithms for Generalized Domination
inferred← citeshttps://doi.org/10.1007/978-3-540-77891-2_14openalex-snapshot
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_42openalex-snapshot
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree
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-642-02094-0_4openalex-snapshot
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_8openalex-snapshot
Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number
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-21527-8_66openalex-snapshot
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_11openalex-snapshot
Feedback Vertex Set in Mixed Graphs
inferred← citeshttps://doi.org/10.1007/978-981-16-0010-4_2openalex-snapshot
On the Decycling Problem in a Torus
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-9234-2openalex-snapshot
A Cubic Kernel for Feedback Vertex Set and Loop Cutset
inferred← citeshttps://doi.org/10.1007/s00453-007-9145-zopenalex-snapshot
Solving Connected Dominating Set Faster than 2 n
inferred← citeshttps://doi.org/10.1007/s00453-007-9148-9openalex-snapshot
Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles
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-010-9418-9openalex-snapshot
Branch and Recharge: Exact Algorithms for Generalized Domination
inferred← citeshttps://doi.org/10.1007/s13235-022-00469-5openalex-snapshot
Robust Networked Multiagent Optimization: Designing Agents to Repair Their Own Utility Functions
inferred← citeshttps://doi.org/10.1016/j.aml.2011.04.022openalex-snapshot
Extremal properties of the bipartite vertex frustration of graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.03.016openalex-snapshot
An improved FPT algorithm for Almost Forest Deletion problem
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.tcs.2015.02.004openalex-snapshot
Fixed-parameter tractability for subset feedback set problems with parity constraints
inferred← citeshttps://doi.org/10.1109/access.2017.2724065openalex-snapshot
Nonuniform Neighborhood Sampling Based Simulated Annealing for the Directed Feedback Vertex Set Problem
inferred← citeshttps://doi.org/10.1109/focs.2006.41openalex-snapshot
Inclusion--Exclusion Algorithms for Counting Set Partitions
inferred← citeshttps://doi.org/10.1111/itor.13299openalex-snapshot
MIP formulations for induced graph optimization problems: a tutorial
inferred← citeshttps://doi.org/10.1137/070683933openalex-snapshot
Set Partitioning via Inclusion-Exclusion
inferred← citeshttps://doi.org/10.1140/epjb/e2014-50289-7openalex-snapshot
Solving the undirected feedback vertex set problem by local search
inferred← citeshttps://doi.org/10.1142/9789812770998_0010openalex-snapshot
COMPUTING MINIMUM DIRECTED FEEDBACK VERTEX SET IN O*(1.9977n)
inferred← citeshttps://doi.org/10.1145/1514274.1514303openalex-snapshot
Towards a theory for securing time synchronization in wireless sensor networks
inferred← citeshttps://doi.org/10.1145/1552285.1552286openalex-snapshot
A measure & conquer approach for the analysis of exact algorithms
inferred← citeshttps://doi.org/10.1145/1721837.1721848openalex-snapshot
A 4 k 2 kernel for feedback vertex set
inferred← citeshttps://doi.org/10.1155/2021/5598173openalex-snapshot
On Solving the Decycling Problem in a Torus Network
inferred← citeshttps://doi.org/10.4230/dagsemproc.07281.5openalex-snapshot
Directed Feedback Vertex Set Problem is FPT
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2010.2470openalex-snapshot
Finding Induced Subgraphs via Minimal Triangulations
inferred← citeshttps://doi.org/10.48550/arxiv.1010.5974openalex-snapshot
Feedback Vertex Set in Mixed Graphs
inferred← citeshttps://doi.org/10.5555/1496770.1496783openalex-snapshot
A quadratic kernel for feedback vertex set
inferred← citeshttps://doi.org/10.5555/2095116.2095253openalex-snapshot
Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
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.