On the public citation graph
Vertex Cover Reconfiguration and Beyond
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.
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.1007/11847250_22openalex-snapshot
Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
inferredcites →https://doi.org/10.1007/3-540-29953-xopenalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/978-1-4471-5559-1openalex-snapshot
Fundamentals of Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-3-319-13075-0_36openalex-snapshot
Vertex Cover Reconfiguration and Beyond
inferredcites →https://doi.org/10.1007/978-3-540-30559-0_22openalex-snapshot
Linear Kernels in Linear Time, or How to Save k Colors in O(n 2) Steps
inferredcites →https://doi.org/10.1007/978-3-642-27875-4openalex-snapshot
Sparsity (Graphs, Structures, and Algorithms)
inferredcites →https://doi.org/10.1007/978-3-642-32589-2_22openalex-snapshot
The Complexity of Rerouting Shortest Paths
inferredcites →https://doi.org/10.1007/978-3-642-35261-4_7openalex-snapshot
Reconfiguration of List L(2,1)-Labelings in a Graph
inferredcites →https://doi.org/10.1007/s00453-016-0159-2openalex-snapshot
On the Parameterized Complexity of Reconfiguration Problems
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/j.dam.2012.05.014openalex-snapshot
Reconfiguration of list edge-colorings in a graph
inferredcites →https://doi.org/10.1016/j.disc.2007.07.028openalex-snapshot
Connectedness of the graph of vertex-colourings
inferredcites →https://doi.org/10.1016/j.jcss.2011.10.003openalex-snapshot
Local search: Is brute-force avoidable?
inferredcites →https://doi.org/10.1016/j.jcss.2017.11.003openalex-snapshot
Reconfiguration in bounded bandwidth and tree-depth
inferredcites →https://doi.org/10.1016/j.tcs.2008.09.065openalex-snapshot
On the parameterized complexity of multiple-interval graph problems
inferredcites →https://doi.org/10.1016/j.tcs.2010.12.005openalex-snapshot
On the complexity of reconfiguration problems
inferredcites →https://doi.org/10.1016/j.tcs.2011.05.021openalex-snapshot
Shortest paths between shortest paths
inferredcites →https://doi.org/10.1016/j.tcs.2012.03.004openalex-snapshot
Complexity of independent set reconfigurability problems
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1112/jlms/s1-10.37.26openalex-snapshot
On Representatives of Subsets
inferredcites →https://doi.org/10.1137/07070440xopenalex-snapshot
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
inferredcites →https://doi.org/10.1145/3051095openalex-snapshot
Deciding First-Order Properties of Nowhere Dense Graphs
inferredcites →https://doi.org/10.1587/transinf.2015fcp0010openalex-snapshot
Reconfiguration of Vertex Covers in a Graph
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-10801-4_18openalex-snapshot
On the Complexity of Optimal Matching Reconfiguration
inferred← citeshttps://doi.org/10.1007/978-3-030-96731-4_3openalex-snapshot
Invitation to Combinatorial Reconfiguration
inferred← citeshttps://doi.org/10.1007/978-3-031-75409-8_3openalex-snapshot
Independent Set Reconfiguration in H-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-13524-3_19openalex-snapshot
Finding Shortest Paths Between Graph Colourings
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_42openalex-snapshot
Reconfiguration on Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-981-96-2845-2_16openalex-snapshot
Reconfiguration Using Generalized Token Jumping
inferred← citeshttps://doi.org/10.1007/s00236-019-00336-8openalex-snapshot
Using contracted solution graphs for solving reconfiguration problems
inferred← citeshttps://doi.org/10.1007/s00453-024-01261-0openalex-snapshot
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited
inferred← citeshttps://doi.org/10.1007/s00453-024-01263-yopenalex-snapshot
Reconfiguring Shortest Paths in Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.01.026openalex-snapshot
Reconfiguration of cliques in a graph
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103574openalex-snapshot
Minimum separator reconfiguration
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103578openalex-snapshot
On finding short reconfiguration sequences between independent sets
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.11.036openalex-snapshot
On reconfigurability of target sets
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116157openalex-snapshot
On kernelization with access to NP-oracles
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch141openalex-snapshot
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
inferred← citeshttps://doi.org/10.1587/transinf.2015fcp0010openalex-snapshot
Reconfiguration of Vertex Covers in a Graph
inferred← citeshttps://doi.org/10.1609/aaai.v36i9.21211openalex-snapshot
Reconfiguring Shortest Paths in Graphs
inferred← citeshttps://doi.org/10.3390/a11110187openalex-snapshot
Special Issue on Reconfiguration Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1403.6347openalex-snapshot
Finding Shortest Paths between Graph Colourings
inferred← citeshttps://doi.org/10.48550/arxiv.1404.0337openalex-snapshot
The Complexity of Bounded Length Graph Recoloring
inferred← citeshttps://doi.org/10.48550/arxiv.1404.3801openalex-snapshot
Shortest reconfiguration paths in the solution space of Boolean formulas
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.