On the public citation graph

Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover

0 signed · 22 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.1002/net.3230010302openalex-snapshot
The steiner problem in graphs
inferredcites →https://doi.org/10.1006/jagm.2001.1186openalex-snapshot
Vertex Cover: Further Observations and Further Improvements
inferredcites →https://doi.org/10.1007/11534273_5openalex-snapshot
Parameterized Complexity of Generalized Vertex Cover Problems
inferredcites →https://doi.org/10.1007/11672142_46openalex-snapshot
A Faster Algorithm for the Steiner Tree Problem
inferredcites →https://doi.org/10.1007/11809678_29openalex-snapshot
Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants
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/978-1-4612-0515-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1016/j.ipl.2004.10.003openalex-snapshot
Refined memorization for vertex cover
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.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11809678_29openalex-snapshot
Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants
inferred← citeshttps://doi.org/10.1007/11940128_60openalex-snapshot
Intuitive Algorithms and t-Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_18openalex-snapshot
Counting Minimum Weighted Dominating Sets
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-540-79723-4_9openalex-snapshot
Capacitated Domination and Covering: A Parameterized Perspective
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_9openalex-snapshot
Deterministic Parameterized Connected Vertex Cover
inferred← citeshttps://doi.org/10.1007/s00224-007-1309-3openalex-snapshot
Parameterized Complexity of Vertex Cover Variants
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.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
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.