- 10 March 2020
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 65 (4) , 662-686
Abstract
No abstract availableKeywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Linear-time algorithm for sliding tokens on treesTheoretical Computer Science, 2015
- Advanced kernelization algorithms2015
- Fixed-Parameter Tractability of Token Jumping on Planar Graphs2014
- Reconfiguring Independent Sets in Claw-Free GraphsLecture Notes in Computer Science, 2014
- On the Parameterized Complexity for Token Jumping on Graphs2014
- The complexity of change2013
- Complexity of independent set reconfigurability problemsTheoretical Computer Science, 2012
- On the complexity of reconfiguration problemsTheoretical Computer Science, 2011
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computationTheoretical Computer Science, 2005
- Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial TimeSIAM Journal on Algebraic Discrete Methods, 1980