Christiane Schmidt

Christian Rieck

Christian Scheffer

CoRR, 2024

Guarding Polyominoes Under k-Hop Visibility.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Two-Stage Weekly Shift Scheduling for Train Dispatchers.

[BibT_eX]

[DOI]

Tomas Lidén

Rabii Zahir

Proceedings of the 24th Symposium on Algorithmic Approaches for Transportation Modelling, 2024

2023

Minimum k-Hop Dominating Sets in Grid Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Rectangular Spiral Galaxies are still hard.

[BibT_eX]

[DOI]

Erik D. Demaine

Maarten Löffler

Comput. Geom., 2023

k-Transmitter Watchman Routes.

[BibT_eX]

[DOI]

Bengt J. Nilsson

Proceedings of the WALCOM: Algorithms and Computation, 2023

2022

Integrating weather impact in air traffic controller shift scheduling in remote and conventional towers.

[BibT_eX]

[DOI]

Eulalia Hernández-Romero

EURO J. Transp. Logist., 2022

Opposing Half Guards.

[BibT_eX]

Erik Krohn

Bengt J. Nilsson

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021

Railway timetabling: a maximum bottleneck path algorithm for finding an additional train path.

[BibT_eX]

[DOI]

Public Transp., 2021

Folding polyominoes with holes into a cube.

[BibT_eX]

[DOI]

Comput. Geom., 2021

Folding Points to a Point and Lines to a Line.

[BibT_eX]

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

Special Issue on the 33rd European Workshop on Computational Geometry, Guest Editors' Foreword.

[BibT_eX]

[DOI]

Valentin Polishchuk

Comput. Geom., 2020

2019

Altitude terrain guarding and guarding uni-monotone polygons.

[BibT_eX]

[DOI]

Comput. Geom., 2019

2018

Folding Polyominoes into (Poly)Cubes.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2018

Altitude Terrain Guarding and Guarding Uni-Monotone Polygons.

[BibT_eX]

[DOI]

Valentin Polishchuk

CoRR, 2018

Combinatorics and complexity of guarding polygons with edge and point 2-transmitters.

[BibT_eX]

[DOI]

Comput. Geom., 2018

2017

Computing nonsimple polygons of minimum perimeter.

[BibT_eX]

[DOI]

Arne Schmidt

Julian Troegel

J. Comput. Geom., 2017

Algorithms for art gallery illumination.

[BibT_eX]

[DOI]

J. Glob. Optim., 2017

2016

Convex Hulls.

[BibT_eX]

[DOI]

Tobias Andersson Granberg

Encyclopedia of Algorithms, 2016

The continuous 1.5D terrain guarding problem: Discretization, optimal solutions, and PTAS.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

Single-Player and Two-Player Buttons & Scissors Games.

[BibT_eX]

[DOI]

CoRR, 2016

Automatic Design of Aircraft Arrival Routes with Limited Turning Angle.

[BibT_eX]

[DOI]

Tatiana Polishchuk

Valentin Polishchuk

Proceedings of the 16th Workshop on Algorithmic Approaches for Transportation Modelling, 2016

2015

The Continuous 1.5D Terrain Guarding Problem: Discretization, Optimal Solutions, and PTAS.

[BibT_eX]

[DOI]

CoRR, 2015

Facets for Art Gallery Problems.

[BibT_eX]

[DOI]

Algorithmica, 2015

Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Computational complexity of numberless Shakashaka.

[BibT_eX]

[DOI]

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

A PTAS for the Continuous 1.5D Terrain Guarding Problem.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

On the Chromatic Art Gallery Problem.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

A Novel Efficient Approach for Solving the Art Gallery Problem.

[BibT_eX]

[DOI]

Alexander Kröller

Mahdi Moeini

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Online Exploration and Triangulation in Orthogonal Polygonal Regions.

[BibT_eX]

[DOI]

Sophia Rex

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Point guards and point clouds: solving general art gallery problems.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Computational Geometry 2013, 2013

Triangulating unknown environments using robot swarms.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Computational Geometry 2013, 2013

2012

Exact solutions and bounds for general art gallery problems.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2012

Minimum covering with travel cost.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

2011

Algorithms for mobile agents with limited capabilities.

[BibT_eX]

[DOI]

PhD thesis, 2011

Exploring and Triangulating a Region by a Swarm of Robots.

[BibT_eX]

[DOI]

Tom Kamphans

Alexander Kröller

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010

Empowered by wireless communication: Distributed methods for self-organizing traffic collectives.

[BibT_eX]

[DOI]

ACM Trans. Auton. Adapt. Syst., 2010

Empowered by Wireless Communication: Self-Organizing Traffic Collectives

[BibT_eX]

[DOI]

CoRR, 2010

Polygon exploration with time-discrete vision.

[BibT_eX]

[DOI]

Comput. Geom., 2010

2009

Designing a Decentralized Traffic Information System - AutoNomos.

[BibT_eX]

[DOI]

Proceedings of the Kommunikation in Verteilten Systemen (KiVS), 2009

Distributed vision with smart pixels.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008

Emergent algorithms for centroid and orientation detection in high-performance embedded cameras.

[BibT_eX]

[DOI]

Proceedings of the 5th Conference on Computing Frontiers, 2008

2007

AutoCast: An Adaptive Data Dissemination Protocol for Traffic Information Systems.

[BibT_eX]

[DOI]

Proceedings of the 66th IEEE Vehicular Technology Conference, 2007

2006

Recognizing Traffic Jams with Hovering Data Clouds.

[BibT_eX]

[DOI]

Proceedings of the Leveraging Applications of Formal Methods, 2006

Polygon Exploration with Discrete Vision.

[BibT_eX]

[DOI]