On the public citation graph
Reconfiguration on Nowhere Dense Graph Classes
0 signed · 45 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/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-06089-7_24openalex-snapshot
On the Parameterized Complexity for Token Jumping on Graphs
inferredcites →https://doi.org/10.1007/978-3-319-13075-0_17openalex-snapshot
Fixed-Parameter Tractability of Token Jumping on Planar Graphs
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-319-13524-3_10openalex-snapshot
The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration
inferredcites →https://doi.org/10.1007/978-3-319-13524-3_21openalex-snapshot
Reconfiguration over Tree Decompositions
inferredcites →https://doi.org/10.1007/978-3-319-21840-3_33openalex-snapshot
The Complexity of Dominating Set Reconfiguration
inferredcites →https://doi.org/10.1007/978-3-319-21840-3_42openalex-snapshot
Reconfiguration on Sparse Graphs
inferredcites →https://doi.org/10.1007/978-3-642-20877-5_7openalex-snapshot
Approximability of the Subset Sum Reconfiguration Problem
inferredcites →https://doi.org/10.1007/978-3-662-47672-7_80openalex-snapshot
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas
inferredcites →https://doi.org/10.1007/978-3-662-55751-8_12openalex-snapshot
Token Jumping in Minor-Closed Classes
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.ejc.2009.03.011openalex-snapshot
Mixing 3-colourings in bipartite graphs
inferredcites →https://doi.org/10.1016/j.endm.2013.10.040openalex-snapshot
Recoloring bounded treewidth graphs
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.2005.05.008openalex-snapshot
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
inferredcites →https://doi.org/10.1016/j.tcs.2009.08.023openalex-snapshot
Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances
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/j.tcs.2013.09.012openalex-snapshot
The complexity of rerouting shortest paths
inferredcites →https://doi.org/10.1017/cbo9781139506748.005openalex-snapshot
The complexity of change
inferredcites →https://doi.org/10.1137/07070440xopenalex-snapshot
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
inferredcites →https://doi.org/10.1137/1.9781611975031.13openalex-snapshot
The Complexity of Independent Set Reconfiguration on Bipartite Graphs
inferredcites →https://doi.org/10.1145/3051095openalex-snapshot
Deciding First-Order Properties of Nowhere Dense Graphs
inferredcites →https://doi.org/10.1201/9780429246593openalex-snapshot
An Introduction to the Bootstrap
inferredcites →https://doi.org/10.2178/jsl/1278682204openalex-snapshot
First order properties on nowhere dense structures
inferredcites →https://doi.org/10.3233/sat190097openalex-snapshot
A Computational Trichotomy for Connectivity of Boolean Satisfiability
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2009.2315openalex-snapshot
Domination Problems in Nowhere-Dense Classes
inferredcites →https://doi.org/10.4230/lipics.icalp.2017.63openalex-snapshot
Neighborhood Complexity and Kernelization for Nowhere Dense Classes of 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-031-27051-2_22openalex-snapshot
On the Complexity of Distance-d Independent Set Reconfiguration
inferred← citeshttps://doi.org/10.1007/978-981-96-1090-7_22openalex-snapshot
The Complexity of Distance-r Dominating Set Reconfiguration
inferred← citeshttps://doi.org/10.1007/s00453-021-00909-5openalex-snapshot
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets
inferred← citeshttps://doi.org/10.1007/s10878-026-01406-7openalex-snapshot
The complexity of distance-r dominating set reconfiguration
inferred← citeshttps://doi.org/10.1016/j.cosrev.2024.100663openalex-snapshot
A survey on the parameterized complexity of reconfiguration problems
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.02.004openalex-snapshot
Reconfiguration on sparse graphs
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.1145/3368630openalex-snapshot
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness
inferred← citeshttps://doi.org/10.70675/79b52188zb0a0z489az82e6zcdec747b6b39openalex-snapshot
Combinatorial and Algorithmic aspects of Reconfiguration
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.