On the public citation graph

The Price of Connectivity for Vertex Cover

0 signed · 29 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/(sici)1097-0118(199905)31:1<29::aid-jgt4>3.0.co;2-gopenalex-snapshot
A semi-induced subgraph characterization of upper domination perfect graphs
inferredcites →https://doi.org/10.1002/jgt.3190170106openalex-snapshot
A note on the characterization of domination perfect graphs
inferredcites →https://doi.org/10.1007/11534273_5openalex-snapshot
Parameterized Complexity of Generalized Vertex Cover Problems
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-44450-5_28openalex-snapshot
Θin2sup-Completeness: A Classical Approach for New Results
inferredcites →https://doi.org/10.1007/s00224-007-9089-3openalex-snapshot
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
inferredcites →https://doi.org/10.1016/j.dam.2011.12.025openalex-snapshot
On graphs for which the connected domination number is at most the total domination number
inferredcites →https://doi.org/10.1016/j.jda.2008.09.007openalex-snapshot
Vertex and edge covers with clustering properties: Complexity and algorithms
inferredcites →https://doi.org/10.1016/j.jda.2009.01.005openalex-snapshot
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
inferredcites →https://doi.org/10.1016/j.tcs.2010.03.021openalex-snapshot
Connected vertex covers in dense graphs
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/1.9780898719796openalex-snapshot
Graph Classes: A Survey
inferredcites →https://doi.org/10.48550/arxiv.1303.2868openalex-snapshot
A Note on Connected Dominating Set in Graphs Without Long Paths And Cycles
inferredcites →https://doi.org/10.7151/dmgt.1192openalex-snapshot
Perfect connected-dominant graphs

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_23openalex-snapshot
Connected Vertex Cover for $$(sP_1+P_5)$$-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_6openalex-snapshot
Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-662-48054-0_33openalex-snapshot
The Price of Connectivity for Cycle Transversals
inferred← citeshttps://doi.org/10.1007/978-88-7642-475-5_20openalex-snapshot
The price of connectivity for feedback vertex set
inferred← citeshttps://doi.org/10.1007/s00373-018-1981-xopenalex-snapshot
Price of Connectivity for the Vertex Cover Problem and the Dominating Set Problem: Conjectures and Investigation of Critical Graphs
inferred← citeshttps://doi.org/10.1007/s00453-019-00601-9openalex-snapshot
Connected Vertex Cover for (sP1+ P5) -Free Graphs
inferred← citeshttps://doi.org/10.1007/s00453-020-00706-6openalex-snapshot
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest
inferred← citeshttps://doi.org/10.1007/s10732-020-09465-7openalex-snapshot
Augmented intuition: a bridge between theory and practice
inferred← citeshttps://doi.org/10.1007/s10878-019-00380-7openalex-snapshot
Connected power domination in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2014.05.029openalex-snapshot
The price of connectivity for dominating set: Upper bounds and complexity
inferred← citeshttps://doi.org/10.1016/j.dam.2016.08.011openalex-snapshot
The price of connectivity for feedback vertex set
inferred← citeshttps://doi.org/10.1016/j.ejc.2016.06.003openalex-snapshot
The price of connectivity for cycle transversals
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103821openalex-snapshot
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.09.033openalex-snapshot
Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity
inferred← citeshttps://doi.org/10.48550/arxiv.1510.02639openalex-snapshot
The Price of Connectivity for Feedback Vertex Set
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.