scientific article; zbMATH DE number 7764106
From MaRDI portal
Publication:6089660
DOI10.4230/lipics.ipec.2020.15MaRDI QIDQ6089660
Takehiro Ito, Yusuke Kobayashi, Felix Hommelsheim, Tatsuhiko Hatanaka, Moritz Mühlenthaler, Akira Suzuki
Publication date: 13 November 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Complexity of independent set reconfigurability problems
- The complexity of dominating set reconfiguration
- \textsc{Snowman} is \(\mathsf{PSPACE}\)-complete
- On the complexity of reconfiguration problems
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Reconfiguring undirected paths
- Introduction to reconfiguration
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Proof equivalence in MLL is PSPACE-complete
- The complexity of change
- PSPACE-Completeness of Bloxorz and of Games with 2-Buttons
- Parameterized Complexity of Graph Constraint Logic
- Diameter of colorings under Kempe changes
- Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants
This page was built for publication:
