André van Renssen

Proceedings of the 26th Australasian Computing Education Conference, 2024

2023

Kinetic Geodesic Voronoi Diagrams in a Simple Polygon.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2023

Graphs with large total angular resolution.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Shortest Paths of Mutually Visible Robots.

[BibT_eX]

[DOI]

CoRR, 2023

Pattern Formation for Fat Robots with Memory.

[BibT_eX]

[DOI]

CoRR, 2023

Pattern Formation for Fat Robots with Lights.

[BibT_eX]

[DOI]

CoRR, 2023

The Mutual Visibility Problem for Fat Robots.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Computing a Subtrajectory Cluster from c-Packed Trajectories.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

The Tight Spanning Ratio of the Rectangle Delaunay Triangulation.

[BibT_eX]

[DOI]

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

Oriented Spanners.

[BibT_eX]

[DOI]

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

2022

Covering a set of line segments with a few squares.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Local routing in a tree metric 1-spanner.

[BibT_eX]

[DOI]

Milutin Brankovic

J. Comb. Optim., 2022

Local Routing in Sparse and Lightweight Geometric Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2022

Generalized Sweeping Line Spanners.

[BibT_eX]

[DOI]

Keenan Lee

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021

Bounded-degree spanners in the presence of polygonal obstacle.

[BibT_eX]

[DOI]

Gladys Wong

Theor. Comput. Sci., 2021

Constrained routing between non-visible vertices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Rectilinear link diameter and radius in a rectilinear polygonal domain.

[BibT_eX]

[DOI]

Comput. Geom., 2021

Snipperclips: Cutting tools into desired polygons using themselves.

[BibT_eX]

[DOI]

Comput. Geom., 2021

Translation Invariant Fréchet Distance Queries.

[BibT_eX]

[DOI]

Algorithmica, 2021

Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers.

[BibT_eX]

[DOI]

Algorithmica, 2021

2020

Symmetric assembly puzzles are hard, beyond a few pieces.

[BibT_eX]

[DOI]

Erik D. Demaine

Matias Korman

Jason S. Ku

Joseph S. B. Mitchell

Comput. Geom., 2020

Balanced line separators of unit disk graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Routing in polygonal domains.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Routing in Histograms.

[BibT_eX]

[DOI]

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

A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Bounded-Degree Spanners in the Presence of Polygonal Obstacles.

[BibT_eX]

[DOI]

Gladys Wong

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Geometry and Generation of a New Graph Planarity Game.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

Spanning Properties of Yao and 휃-Graphs in the Presence of Constraints.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2019

Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2019

Packing plane spanning graphs with short edges in complete geometric graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2019

Faster algorithms for growing prioritized disks and rectangles.

[BibT_eX]

[DOI]

Comput. Geom., 2019

On Plane Constrained Bounded-Degree Spanners.

[BibT_eX]

[DOI]

Algorithmica, 2019

Dynamic Graph Coloring.

[BibT_eX]

[DOI]

Algorithmica, 2019

2018

Routing on the visibility graph.

[BibT_eX]

[DOI]

J. Comput. Geom., 2018

Improved time-space trade-offs for computing Voronoi diagrams.

[BibT_eX]

[DOI]

J. Comput. Geom., 2018

Time-space trade-offs for triangulations and Voronoi diagrams.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Constrained generalized Delaunay graphs are plane spanners.

[BibT_eX]

[DOI]

Jean-Lou De Carufel

Comput. Geom., 2018

Continuous Yao graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2018

2017

Hanabi is NP-hard, even for cheaters who look at their cards.

[BibT_eX]

[DOI]

Jean-François Baffier

Theor. Comput. Sci., 2017

On interference among moving sensors and related problems.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

Competitive local routing with constraints.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

Time-space trade-offs for triangulating a simple polygon.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

Upper and Lower Bounds for Online Routing on Delaunay Triangulations.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

Routing in Polygons with Holes.

[BibT_eX]

[DOI]

CoRR, 2017

Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points.

[BibT_eX]

[DOI]

CoRR, 2017

Packing Short Plane Spanning Graphs in Complete Geometric Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Snipperclips: Cutting Tools into Desired Polygons using Themselves.

[BibT_eX]

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016

Area-Preserving Simplification and Schematization of Polygonal Subdivisions.

[BibT_eX]

[DOI]

ACM Trans. Spatial Algorithms Syst., 2016

Towards tight bounds on theta-graphs: More is not always better.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

The Price of Order.

[BibT_eX]

[DOI]

Pat Morin

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

Packing Short Plane Spanning Trees in Complete Geometric Graphs.

[BibT_eX]

[DOI]

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

Hanabi is NP-complete, Even for Cheaters who Look at Their Cards.

[BibT_eX]

[DOI]

Jean-François Baffier

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015

Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

New and improved spanning ratios for Yao graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2015

On Kinetic Range Spaces and their Applications.

[BibT_eX]

[DOI]

CoRR, 2015

Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations.

[BibT_eX]

[DOI]

CoRR, 2015

The θ<sub>5</sub>-graph is a spanner.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Reprint of: Theta-3 is connected.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Constrained Empty-Rectangle Delaunay Graphs.

[BibT_eX]

[DOI]

Jean-Lou De Carufel

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

2014

Towards Tight Bounds on Theta-Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Making triangulations 4-connected using flips.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Theta-3 is connected.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

On the Spanning Ratio of Constrained Yao-Graphs.

[BibT_eX]

[DOI]

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

Continuous Yao Graphs.

[BibT_eX]

[DOI]

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

2013

New and Improved Spanning Ratios for Yao Graphs.

[BibT_eX]

[DOI]

CoRR, 2013

The θ 5-Graph is a Spanner.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

On the Spanning Ratio of Theta-Graphs.

[BibT_eX]

[DOI]

Sander Verdonschot

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

On the Stretch Factor of the Theta-4 Graph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

2012

The theta-5-graph is a spanner

[BibT_eX]

[DOI]

CoRR, 2012

Competitive routing in the half-θ<sub>6</sub>-graph.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Competitive Routing on a Bounded-Degree Plane Spanner.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

Optimal Bounds on Theta-Graphs: More is not Always Better.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

The 2x2 Simple Packing Problem.

[BibT_eX]

[DOI]

Bettina Speckmann

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Area-Preserving Subdivision Schematization.

[BibT_eX]

[DOI]

Wouter Meulemans