Christian Scheffer

CoRR, January, 2025

Guarding Offices with Maximum Dispersion.

[BibT_eX]

[DOI]

Kai Kobbe

Dominik Krupke

Christian Rieck

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

Drainability and Fillability of Polyominoes in Diverse Models of Global Control.

[BibT_eX]

[DOI]

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks.

[BibT_eX]

[DOI]

Proceedings of the 21st IEEE International Conference on Automation Science and Engineering, 2025

2024

Lessons Learned from Integrating a Metaverse App into a CS Math Course to Increase Commuter Student Participation.

[BibT_eX]

[DOI]

Philipp Kather

Proceedings of the 2024 ACM Virtual Global Computing Education Conference V. 1, 2024

Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Dispersive Vertex Guarding for Simple and Non-Simple Polygons.

[BibT_eX]

Christian Rieck

Christiane Schmidt

Proceedings of the 36th Canadian Conference on Computational Geometry, 2024

2023

The Lawn Mowing Problem: From Algebra to Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

A Closer Cut: Computing Near-Optimal Lawn Mowing Tours.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022

The Dispersive Art Gallery Problem.

[BibT_eX]

[DOI]

Christian Rieck

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Efficiently Reconfiguring a Connected Swarm of Labeled Robots.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Space Ants: Episode II - Coordinating Connected Catoms (Media Exposition).

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Worst-case optimal squares packing into disks.

[BibT_eX]

[DOI]

Vijaykrishna Gurunathan

J. Comput. Geom., 2021

Particle-Based Assembly Using Precise Global Control.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Connected Coordinated Motion Planning with Bounded Stretch.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Packing Squares into a Disk with Optimal Worst-Case Density.

[BibT_eX]

[DOI]

Vijaykrishna Gurunathan

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Train Scheduling: Hardness and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Recognition and Reconfiguration of Lattice-Based Cellular Structures by Simple Robots.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Robotics and Automation, 2020

Covering Rectangles by Disks: The Video (Media Exposition).

[BibT_eX]

[DOI]

Phillip Keldenich

Proceedings of the 36th International Symposium on Computational Geometry, 2020

Worst-Case Optimal Covering of Rectangles by Disks.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

Space Ants: Constructing and Reconfiguring Large-Scale Structures with Finite Automata (Media Exposition).

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

Scheduling Three Trains is NP-Complete.

[BibT_eX]

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2020

2019

Split Packing: Algorithms for Packing Circles with Optimal Worst-Case Density.

[BibT_eX]

[DOI]

Sebastian Morr

Discret. Comput. Geom., 2019

Connected Assembly and Reconfiguration by Finite Automata.

[BibT_eX]

[DOI]

CoRR, 2019

The Prefix Fréchet Similarity.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Online Circle Packing.

[BibT_eX]

[DOI]

Sven von Höveling

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Packing Disks into Disks with Optimal Worst-Case Density.

[BibT_eX]

[DOI]

Phillip Keldenich

Proceedings of the 35th International Symposium on Computational Geometry, 2019

Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition).

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

Conflict-Free Coloring of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Path Refinement in Weighted Regions.

[BibT_eX]

[DOI]

Algorithmica, 2018

CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Foundations of Robotics XIII, 2018

Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading.

[BibT_eX]

[DOI]

Sven von Höveling

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

Coordinated Motion Planning: The Video (Multimedia Exposition).

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

Split Packing: Packing Circles into Triangles with Optimal Worst-Case Density.

[BibT_eX]

[DOI]

Sebastian Morr

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Three Colors Suffice: Conflict-Free Coloring of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External Forces.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Resource-efficient dynamic partial reconfiguration on FPGAs for space instruments.

[BibT_eX]

[DOI]

Proceedings of the 2017 NASA/ESA Conference on Adaptive Hardware and Systems, 2017

2016

Near-linear time medial axis approximation of smooth curves in $\mathbb{R}^3$.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

More Flexible Curve Matching via the Partial Fréchet Similarity.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2016

Approximating the Integral Fréchet Distance.

[BibT_eX]

[DOI]

Anil Maheshwari

Jörg-Rüdiger Sack

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Approximate Shortest Distances Among Smooth Obstacles in 3D.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Universal Guard Problems.

[BibT_eX]

[DOI]

Qian Li

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

An Efficient Data Structure for Dynamic Two-Dimensional Reconfiguration.

[BibT_eX]

[DOI]

Jan-Marc Reinhardt

Proceedings of the Architecture of Computing Systems - ARCS 2016, 2016

2015

Subquadratic medial-axis approximation in $\mathbb{R}^3$.

[BibT_eX]

[DOI]

J. Comput. Geom., 2015

New Geometric Algorithms for Fully Connected Staged Self-Assembly.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing and Molecular Programming - 21st International Conference, 2015

2014

Approximating geodesic distances on 2-manifolds in R<sup>3</sup>: The weighted case.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Approximating geodesic distances on 2-manifolds in R<sup>3</sup>.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Similarity of polygonal curves in the presence of outliers.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Minimum backward fréchet distance.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014

Approximation algorithms for geometrical distance problems that are not solvable exactly.

[BibT_eX]

PhD thesis, 2014

2011

Approximating Geodesic Distances on 2-Manifolds in R3.

[BibT_eX]

[DOI]