Panic Room: Experiencing Overload and Having Fun in the Process. - Björn Bankowski; Thiemo Clausen; Dirk Ehmen; Maximilian Ernestus; Henning Hasemann; Tobias Jura; Alexander Kröller; Dominik Krupke; Marco Nikander (HCI (21), 2014)

Distributed cohesive control for robot swarms: Maintaining good connectivity in the presence of exterior forces. - Dominik Krupke; Maximilian Ernestus; Michael Hemmer; Sándor P. Fekete (IROS, 2015)

A parallel distributed strategy for arraying a scattered robot swarm. - Dominik Krupke; Michael Hemmer; James McLurkin; Yu Zhou 027; Sándor P. Fekete (IROS, 2015)

Collecting a swarm in a grid environment using shared, global inputs. - Arun V. Mahadev; Dominik Krupke; Jan-Marc Reinhardt; Sándor P. Fekete; Aaron T. Becker (CASE, 2016)

Zapping Zika with a Mosquito-Managing Drone: Computing Optimal Flight Patterns with Minimum Turn Cost (Multimedia Contribution). - Aaron T. Becker; Mustapha Debboun; Sándor P. Fekete; Dominik Krupke; An Nguyen (SoCG, 2017)

Mapping and coverage with a particle swarm controlled by uniform inputs. - Arun Mahadev; Dominik Krupke; Sándor P. Fekete; Aaron T. Becker (IROS, 2017)

Computing nonsimple polygons of minimum perimeter. - Sándor P. Fekete; Andreas Haas; Michael Hemmer; Michael Hoffmann 001; Irina Kostitsyna; Dominik Krupke; Florian Maurer 001; Joseph S. B. Mitchell; Arne Schmidt 001; Christiane Schmidt 001; Julian Troegel (J. Comput. Geom., 2017)

U sing a UAV for Destructive Surveys of Mosquito Population. - An Nguyen; Dominik Krupke; Mary Burbage; Shriya Bhatnagar; Sándor P. Fekete; Aaron T. Becker (ICRA, 2018)

On Designing 2D Discrete Workspaces to Sort or Classify Polynminoes. - Phillip Keldenich; Sheryl Manzoor; Li Huang; Dominik Krupke; Arne Schmidt 001; Sándor P. Fekete; Aaron T. Becker (IROS, 2018)

Practical Methods for Computing Large Covering Tours and Cycle Covers with Turn Cost. - Sándor P. Fekete; Dominik Krupke (ALENEX, 2019)

Automated Data Retrieval from Large-Scale Distributed Satellite Systems. - Dominik Krupke; Volker Schaus; Andreas Haas; Michael Perk; Jonas Dippel; Benjamin Grzesik; Mohamed Khalil Ben Larbi; Enrico Stoll; Tom Haylock; Harald Konstanski; Kattia Flores Pozo; Mirue Choi; et al. (CASE, 2019)

Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation. - Sándor P. Fekete; Dominik Krupke (CIAC, 2019)

Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform, External Forces. - Aaron T. Becker; Sándor P. Fekete; Li Huang; Phillip Keldenich; Linda Kleist; Dominik Krupke; Christian Rieck; Arne Schmidt 001 (ICRA, 2020)

Probing a Set of Trajectories to Maximize Captured Information. - Sándor P. Fekete; Alexander Hill; Dominik Krupke; Tyler Mayer; Joseph S. B. Mitchell; Ojas Parekh; Cynthia A. Phillips (SEA, 2020)

Tilt Assembly: Algorithms for Micro-factories That Build Objects with Uniform External Forces. - Aaron T. Becker; Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Christian Rieck; Christian Scheffer; Arne Schmidt 001 (Algorithmica, 2020)

Computing Convex Partitions for Point Sets in the Plane: The CG: SHOP Challenge 2020. - Erik D. Demaine; Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Joseph S. B. Mitchell (CoRR, 2020)

Minimum Scan Cover with Angular Transition Costs. - Sándor P. Fekete; Linda Kleist; Dominik Krupke (SIAM J. Discret. Math., 2021)

Robust disease module mining via enumeration of diverse prize-collecting Steiner trees. - Judith Bernett; Dominik Krupke; Sepideh Sadegh; Jan Baumbach; Sándor P. Fekete; Tim Kacprowski; Markus List; David B. Blumenthal (Bioinform., 2022)

Minimum Partition into Plane Subgraphs: The CG: SHOP Challenge 2022. - Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Stefan Schirra (CoRR, 2022)

Minimum Scan Cover and Variants: Theory and Experiments. - Kevin Buchin; Alexander Hill; Sándor P. Fekete; Linda Kleist; Irina Kostitsyna; Dominik Krupke; Roel Lambers; Martijn Struijs (ACM J. Exp. Algorithmics, 2022)

Area-Optimal Simple Polygonalizations: The CG Challenge 2019. - Erik D. Demaine; Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Joseph S. B. Mitchell (ACM J. Exp. Algorithmics, 2022)

Computing Coordinated Motion Plans for Robot Swarms: The CG: SHOP Challenge 2021. - Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Joseph S. B. Mitchell (ACM J. Exp. Algorithmics, 2022)

Algorithm Engineering for Hard Problems in Computational Geometry / Dominik Michael Krupke ; Sándor Fekete, William Cook, Joseph S.B. Mitchell. - Dominik Krupke (2022)

A Closer Cut: Computing Near-Optimal Lawn Mowing Tours. - Sándor P. Fekete; Dominik Krupke; Michael Perk; Christian Rieck; Christian Scheffer (ALENEX, 2023)

The Lawn Mowing Problem: From Algebra to Algorithms. - Sándor P. Fekete; Dominik Krupke; Michael Perk; Christian Rieck; Christian Scheffer (ESA, 2023)

Minimum Coverage by Convex Polygons: The CG: SHOP Challenge 2023. - Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Stefan Schirra (CoRR, 2023)

Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022. - Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Stefan Schirra (ACM J. Exp. Algorithmics, 2023)

Near-Optimal Coverage Path Planning with Turn Costs. - Dominik Krupke (ALENEX, 2024)

Edge Sparsification for Geometric Tour Problems. - Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Eike Niehs (Comput. Geom. Topol., 2024)

Maximum Polygon Packing: The CG: SHOP Challenge 2024. - Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Stefan Schirra (CoRR, 2024)

What Goes Around Comes Around: Covering Tours and Cycle Covers with Turn Costs. - Sándor P. Fekete; Dominik Krupke (Theory Comput. Syst., 2024)

Guarding Offices with Maximum Dispersion. - Sándor P. Fekete; Kai Kobbe; Dominik Krupke; Joseph S. B. Mitchell; Christian Rieck; Christian Scheffer (MFCS, 2025)

Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025. - Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Stefan Schirra (CoRR, 2025)

AlgoTune: Can Language Models Speed Up General-Purpose Numerical Programs? - Ori Press; Brandon Amos; Haoyu Zhao; Yikai Wu 001; Samuel K. Ainsworth; Dominik Krupke; Patrick Kidger; Touqir Sajed; Bartolomeo Stellato; Jisun Park 003; Nathanael Bosch; Eli Meril; et al. (CoRR, 2025)

How Low Can We Go? Minimizing Interaction Samples for Configurable Systems. - Dominik Michael Krupke; Ahmad Moradi; Michael Perk; Phillip Keldenich; Gabriel Gehrke; Sebastian Krieter; Thomas Thüm; Sándor P. Fekete (ACM Trans. Softw. Eng. Methodol., 2025)