On the public citation graph
Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants
0 signed · 26 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jagm.2001.1186openalex-snapshot
Vertex Cover: Further Observations and Further Improvements
inferredcites →https://doi.org/10.1007/11672142_46openalex-snapshot
A Faster Algorithm for the Steiner Tree Problem
inferredcites →https://doi.org/10.1007/11753728_28openalex-snapshot
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
inferredcites →https://doi.org/10.1007/3-540-45655-4_60openalex-snapshot
On Parameterized Enumeration
inferredcites →https://doi.org/10.1007/3-540-49116-3_53openalex-snapshot
Upper Bounds for Vertex Cover Further Improved
inferredcites →https://doi.org/10.1007/s00224-007-1324-4openalex-snapshot
Dynamic Programming for Minimum Steiner Trees
inferredcites →https://doi.org/10.1016/j.ipl.2004.10.003openalex-snapshot
Refined memorization for vertex cover
inferredcites →https://doi.org/10.1016/j.ipl.2005.10.012openalex-snapshot
Pathwidth of cubic graphs and exact algorithms
inferredcites →https://doi.org/10.1016/s0020-0190(97)00213-5openalex-snapshot
An improved fixed-parameter algorithm for vertex cover
inferredcites →https://doi.org/10.1016/s0196-6774(03)00005-1openalex-snapshot
On efficient fixed-parameter algorithms for weighted vertex cover
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
inferredcites →https://doi.org/10.1137/s0895480194275825openalex-snapshot
Algorithms for Vertex Partitioning Problems on Partial k-Trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11753728_28openalex-snapshot
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
inferred← citeshttps://doi.org/10.1007/11847250_20openalex-snapshot
On the Effective Enumerability of NP Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_20openalex-snapshot
Complexity and Approximation Results for the Connected Vertex Cover Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_8openalex-snapshot
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
inferred← citeshttps://doi.org/10.1007/s00224-007-9089-3openalex-snapshot
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
inferred← citeshttps://doi.org/10.1007/s00224-008-9130-1openalex-snapshot
Fixed-Parameter Enumerability of Cluster Editing and Related Problems
inferred← citeshttps://doi.org/10.1007/s10878-019-00403-3openalex-snapshot
The connected vertex cover problem in k-regular graphs
inferred← citeshttps://doi.org/10.1007/s11128-023-04010-4openalex-snapshot
Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm
inferred← citeshttps://doi.org/10.1016/j.amc.2016.12.004openalex-snapshot
Complexity and algorithms for the connected vertex cover problem in 4-regular graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2010.02.006openalex-snapshot
Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
inferred← citeshttps://doi.org/10.1016/j.jda.2008.09.007openalex-snapshot
Vertex and edge covers with clustering properties: Complexity and algorithms
inferred← citeshttps://doi.org/10.1016/j.jda.2009.01.005openalex-snapshot
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
inferred← citeshttps://doi.org/10.46298/dmtcs.1262openalex-snapshot
The Price of Connectivity for Vertex Cover
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.