Christian Rieck

Orcid: 0000-0003-0846-5163

Affiliations:
  • TU Braunschweig, Department of Computer Science, Germany


According to our database1, Christian Rieck authored at least 27 papers between 2017 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Flipping odd matchings in geometric and combinatorial settings.
CoRR, August, 2025

Counterexample to Winkler's conjecture on Venn diagrams.
CoRR, March, 2025

Moving Matter: Efficient Reconfiguration of Tile Arrangements by a Single Active Robot.
CoRR, February, 2025

Guarding Offices with Maximum Dispersion.
Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

Drainability and Fillability of Polyominoes in Diverse Models of Global Control.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Sliding Squares in Parallel.
Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks.
Proceedings of the 21st IEEE International Conference on Automation Science and Engineering, 2025

2024
On the Connectivity of the Flip Graph of Plane Spanning Paths.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

Guarding Polyominoes Under k-Hop Visibility.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Reconfiguration of a 2D Structure Using Spatio-Temporal Planning and Load Transferring.
Proceedings of the IEEE International Conference on Robotics and Automation, 2024

Dispersive Vertex Guarding for Simple and Non-Simple Polygons.
Proceedings of the 36th Canadian Conference on Computational Geometry, 2024

2023
Guarding and Reconfiguration: Computational Complexity and Algorithm Design.
PhD thesis, 2023

Minimum k-Hop Dominating Sets in Grid Graphs.
CoRR, 2023

The Lawn Mowing Problem: From Algebra to Algorithms.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

A Closer Cut: Computing Near-Optimal Lawn Mowing Tours.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022
Cooperative 2D Reconfiguration using Spatio-Temporal Planning and Load Transferring.
CoRR, 2022

The Dispersive Art Gallery Problem.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Efficiently Reconfiguring a Connected Swarm of Labeled Robots.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Connected Reconfiguration of Polyominoes Amid Obstacles using RRT.
Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2022

Space Ants: Episode II - Coordinating Connected Catoms (Media Exposition).
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
Particle-Based Assembly Using Precise Global Control.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Connected Coordinated Motion Planning with Bounded Stretch.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020
Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform, External Forces.
Proceedings of the 2020 IEEE International Conference on Robotics and Automation, 2020

Space Ants: Constructing and Reconfiguring Large-Scale Structures with Finite Automata (Media Exposition).
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2018
Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External Forces.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017


  Loading...