scientific article; zbMATH DE number 7765402
From MaRDI portal
Publication:6087216
DOI10.4230/lipics.isaac.2020.44MaRDI QIDQ6087216
Clément Dallard, Nicolas Bousquet, Amer E. Mouawad, Kyle Lomer, Valentin Bartier
Publication date: 14 November 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- A dichotomy theorem for circular colouring reconfiguration
- Complexity of independent set reconfigurability problems
- On the complexity of reconfiguration problems
- Reconfiguration of list edge-colorings in a graph
- Flip distance between two triangulations of a point set is NP-complete
- Token jumping in minor-closed classes
- Token sliding on chordal graphs
- Reconfiguration on sparse graphs
- Introduction to reconfiguration
- Connectedness of the graph of vertex-colourings
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- The complexity of change
- Fixed-Parameter Tractability of Token Jumping on Planar Graphs
- Polynomial-Time Algorithm for Sliding Tokens on Trees
- Vertex Cover Reconfiguration and Beyond
- Reconfiguration of Vertex Covers in a Graph
- Homomorphism reconfiguration via homotopy
- Reconfiguring Independent Sets in Claw-Free Graphs
- Ground State Connectivity of Local Hamiltonians
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas
- Sliding Token on Bipartite Permutation Graphs
- The Complexity of Independent Set Reconfiguration on Bipartite Graphs
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Parameterized Complexity of Independent Set in H-Free Graphs.
- On the Parameterized Complexity for Token Jumping on Graphs
- Parameterized Algorithms
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
- Unnamed Item
- Unnamed Item
This page was built for publication:
