No. Title Author Year
1 Geometric Embeddability of Complexes Is ∃ℝ-Complete Abrahamsen, Mikkel et al. 2023
2 The Complexity of the Hausdorff Distance Jungeblut, Paul et al. 2022
3 A Practical Algorithm with Performance Guarantees for the Art Gallery Problem Hengeveld, Simon B. et al. 2021
4 Chasing Puppies: Mobile Beacon Routing on Closed Curves Abrahamsen, Mikkel et al. 2021
5 Between Shapes, Using the Hausdorff Distance van Kreveld, Marc et al. 2020
6 Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy (Media Exposition) Miltzow, Tillmann et al. 2020
7 Maximum Clique in Disk-Like Intersection Graphs Bonnet, Édouard et al. 2020
8 Parameterized Streaming Algorithms for Min-Ones d-SAT Agrawal, Akanksha et al. 2019
9 An Approximation Algorithm for the Art Gallery Problem Bonnet, Édouard et al. 2017
10 Complexity of Token Swapping and its Variants Bonnet, Édouard et al. 2017
11 Fine-Grained Complexity of Coloring Unit Disks and Balls Biró, Csaba et al. 2017
12 Irrational Guards are Sometimes Needed Abrahamsen, Mikkel et al. 2017
13 Approximation and Hardness of Token Swapping Miltzow, Tillmann et al. 2016
14 Parameterized Hardness of Art Gallery Problems Bonnet, Édouard et al. 2016
15 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: 15

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