On the public citation graph

Reconfiguration on sparse graphs

0 signed · 67 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/jgt.20514openalex-snapshot
Finding paths between 3-colorings
inferredcites →https://doi.org/10.1007/978-1-4612-0515-9openalex-snapshot
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-540-85221-6_13openalex-snapshot
Structural Properties of Sparse Graphs
inferredcites →https://doi.org/10.1007/978-3-642-04128-0_62openalex-snapshot
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
inferredcites →https://doi.org/10.1007/978-3-642-33090-2_69openalex-snapshot
FPT Algorithms for Domination in Biclique-Free Graphs
inferredcites →https://doi.org/10.1007/978-3-642-45030-3openalex-snapshot
Algorithms and Computation 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings
inferredcites →https://doi.org/10.1007/978-3-662-55751-8_12openalex-snapshot
Token Jumping in Minor-Closed Classes
inferredcites →https://doi.org/10.1007/s00453-008-9204-0openalex-snapshot
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
inferredcites →https://doi.org/10.1007/s00453-016-0159-2openalex-snapshot
On the Parameterized Complexity of Reconfiguration Problems
inferredcites →https://doi.org/10.1016/j.comgeo.2008.04.001openalex-snapshot
Flips in planar graphs
inferredcites →https://doi.org/10.1016/j.comgeo.2014.11.001openalex-snapshot
Flip distance between two triangulations of a point set is NP-complete
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.dam.2016.05.024openalex-snapshot
Rerouting shortest paths in planar graphs
inferredcites →https://doi.org/10.1016/j.ipl.2009.04.023openalex-snapshot
Rotation distance is fixed-parameter tractable
inferredcites →https://doi.org/10.1016/j.jcss.2009.10.005openalex-snapshot
Homomorphism preservation on quasi-wide classes
inferredcites →https://doi.org/10.1016/j.jcss.2016.09.002openalex-snapshot
Kernelization using structural parameters on sparse graph classes
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.2010.12.005openalex-snapshot
On the complexity of reconfiguration problems
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.1017/cbo9781139506748.005openalex-snapshot
The complexity of change
inferredcites →https://doi.org/10.1112/jlms/s1-35.1.85openalex-snapshot
Intersection Theorems for Systems of Sets
inferredcites →https://doi.org/10.1137/07070440xopenalex-snapshot
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
inferredcites →https://doi.org/10.1137/1.9781611974782.100openalex-snapshot
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes
inferredcites →https://doi.org/10.1145/2591796.2591851openalex-snapshot
Deciding first-order properties of nowhere dense graphs
inferredcites →https://doi.org/10.1145/3618260openalex-snapshot
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
inferredcites →https://doi.org/10.2178/jsl/1278682204openalex-snapshot
First order properties on nowhere dense structures
inferredcites →https://doi.org/10.37236/7458openalex-snapshot
Reconfiguration on Nowhere Dense Graph Classes
inferredcites →https://doi.org/10.4153/cjm-1970-125-1openalex-snapshot
k -Degenerate Graphs
inferredcites →https://doi.org/10.4171/077-1/7openalex-snapshot
From sparse graphs to nowhere dense structures: decompositions, independence, dualities and limits
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2009.2315openalex-snapshot
Domination Problems in Nowhere-Dense Classes

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-26176-4_26openalex-snapshot
Incremental Optimization of Independent Sets Under the Reconfiguration Framework
inferred← citeshttps://doi.org/10.1007/978-3-030-48966-3_6openalex-snapshot
Decremental Optimization of Dominating Sets Under the Reconfiguration Framework
inferred← citeshttps://doi.org/10.1007/978-3-031-15914-5_5openalex-snapshot
Token Sliding on Graphs of Girth Five
inferred← citeshttps://doi.org/10.1007/978-3-031-43587-4_24openalex-snapshot
Shortest Dominating Set Reconfiguration Under Token Sliding
inferred← citeshttps://doi.org/10.1007/978-3-032-11835-6_11openalex-snapshot
A Simple Quadratic Kernel for Token Jumping on Surfaces
inferred← citeshttps://doi.org/10.1007/978-981-95-0218-9_6openalex-snapshot
Reconfiguring Multiple Connected Components with Size Multiset Constraints
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/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/s00373-021-02341-6openalex-snapshot
Reconfiguring Dominating Sets in Minor-Closed Graph Classes
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/s00453-023-01181-5openalex-snapshot
Token Sliding on Graphs of Girth Five
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.1007/s00453-026-01371-xopenalex-snapshot
Bipartite Independent Set Reconfiguration: General and RNA-Inspired Parameterized Algorithms
inferred← citeshttps://doi.org/10.1007/s10878-020-00630-zopenalex-snapshot
Incremental optimization of independent sets under the reconfiguration framework
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.dam.2020.01.022openalex-snapshot
Parameterized complexity of independent set reconfiguration problems
inferred← citeshttps://doi.org/10.1016/j.dam.2021.05.014openalex-snapshot
Dominating sets reconfiguration under token sliding
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.ejc.2020.103223openalex-snapshot
Classes of graphs with low complexity: The case of classes with bounded linear rankwidth
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.03.008openalex-snapshot
Galactic token sliding
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103578openalex-snapshot
On finding short reconfiguration sequences between independent sets
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.1137/20m1367519openalex-snapshot
Kernelization of Whitney Switches
inferred← citeshttps://doi.org/10.1137/23m1552644openalex-snapshot
Independent Set Reconfiguration on Directed Graphs
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.1609/aaai.v36i9.21211openalex-snapshot
Reconfiguring Shortest Paths in Graphs
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2020.37openalex-snapshot
Linear Transformations Between Dominating Sets in the TAR-Model
inferred← citeshttps://doi.org/10.48550/arxiv.1912.03127openalex-snapshot
Dominating sets reconfiguration under token sliding
inferred← citeshttps://doi.org/10.70675/03c138dezf306z4f6cz913ez53d66dced624openalex-snapshot
Exact parameterized algorithmics for structural RNAbioinformatics
inferred← citeshttps://doi.org/10.70675/79b52188zb0a0z489az82e6zcdec747b6b39openalex-snapshot
Combinatorial and Algorithmic aspects of Reconfiguration
inferred← citeshttps://doi.org/10.70675/81cccf81zb873z4003za275zb21b3505db2eopenalex-snapshot
Reconfiguration problems in graphs
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.