No. Title Author Year
1 Hardness of Token Swapping on Trees Aichholzer, Oswin et al. 2022
2 Circumscribing Polygons and Polygonizations for Disjoint Line Segments Akitaya, Hugo A. et al. 2019
3 Computational Complexity of Generalized Push Fight Bosboom, Jeffrey et al. 2018
4 Computational Complexity of Motion Planning of a Robot through Simple Gadgets Demaine, Erik D. et al. 2018
5 Solving the Rubik's Cube Optimally is NP-complete Demaine, Erik D. et al. 2018
6 Tree-Residue Vertex-Breaking: a new tool for proving hardness Demaine, Erik D. et al. 2018
7 Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible Abel, Zachary et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 7

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI