No. Title Author Year
1 Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy (Media Exposition) Miltzow, Tillmann et al. 2020
2 Parameterized Streaming Algorithms for Min-Ones d-SAT Agrawal, Akanksha et al. 2019
3 An Approximation Algorithm for the Art Gallery Problem Bonnet, Édouard et al. 2017
4 Complexity of Token Swapping and its Variants Bonnet, Édouard et al. 2017
5 Fine-Grained Complexity of Coloring Unit Disks and Balls Biró, Csaba et al. 2017
6 Irrational Guards are Sometimes Needed Abrahamsen, Mikkel et al. 2017
7 Approximation and Hardness of Token Swapping Miltzow, Tillmann et al. 2016
8 Parameterized Hardness of Art Gallery Problems Bonnet, Édouard et al. 2016
9 Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems Marx, Dániel et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 9


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