Area-Preserving Subdivision Schematization. - Wouter Meulemans; André van Renssen; Bettina Speckmann (GIScience, 2010)

The 2x2 Simple Packing Problem. - André van Renssen; Bettina Speckmann (CCCG, 2011)

Optimal Bounds on Theta-Graphs: More is not Always Better. - Prosenjit Bose; Jean-Lou De Carufel; Pat Morin; André van Renssen; Sander Verdonschot (CCCG, 2012)

Competitive Routing on a Bounded-Degree Plane Spanner. - Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot (CCCG, 2012)

Competitive routing in the half-θ6-graph. - Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot (SODA, 2012)

The theta-5-graph is a spanner - Prosenjit Bose; Pat Morin; André van Renssen; Sander Verdonschot (CoRR, 2012)

On the Stretch Factor of the Theta-4 Graph. - Luis Barba; Prosenjit Bose; Jean-Lou De Carufel; André van Renssen; Sander Verdonschot (WADS, 2013)

On the Spanning Ratio of Theta-Graphs. - Prosenjit Bose; André van Renssen; Sander Verdonschot (WADS, 2013)

The θ 5-Graph is a Spanner. - Prosenjit Bose; Pat Morin; André van Renssen; Sander Verdonschot (WG, 2013)

New and Improved Spanning Ratios for Yao Graphs. - Luis Barba; Prosenjit Bose; Mirela Damian; Rolf Fagerberg; Joseph O'Rourke; André van Renssen; Perouz Taslakian; Sander Verdonschot (CoRR, 2013)

Continuous Yao Graphs. - Luis Barba; Prosenjit Bose; Jean-Lou De Carufel; Mirela Damian; Rolf Fagerberg; André van Renssen; Perouz Taslakian; Sander Verdonschot (CCCG, 2014)

On the Spanning Ratio of Constrained Yao-Graphs. - André van Renssen (CCCG, 2014)

Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs. - Prosenjit Bose; André van Renssen (LATIN, 2014)

Theta-3 is connected. - Oswin Aichholzer; Sang Won Bae 001; Luis Barba; Prosenjit Bose; Matias Korman; André van Renssen; Perouz Taslakian; Sander Verdonschot (Comput. Geom., 2014)

Making triangulations 4-connected using flips. - Prosenjit Bose; Dana Jansens; André van Renssen; Maria Saumell; Sander Verdonschot (Comput. Geom., 2014)

Towards Tight Bounds on Theta-Graphs. - Prosenjit Bose; Jean-Lou De Carufel; Pat Morin; André van Renssen; Sander Verdonschot (CoRR, 2014)

Constrained Empty-Rectangle Delaunay Graphs. - Prosenjit Bose; Jean-Lou De Carufel; André van Renssen (CCCG, 2015)

Reprint of: Theta-3 is connected. - Oswin Aichholzer; Sang Won Bae 001; Luis Barba; Prosenjit Bose; Matias Korman; André van Renssen; Perouz Taslakian; Sander Verdonschot (Comput. Geom., 2015)

The θ5-graph is a spanner. - Prosenjit Bose; Pat Morin; André van Renssen; Sander Verdonschot (Comput. Geom., 2015)

Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations. - Nicolas Bonichon; Prosenjit Bose; Jean-Lou De Carufel; Ljubomir Perkovic; André van Renssen (CoRR, 2015)

On Kinetic Range Spaces and their Applications. - Jean-Lou De Carufel; Matya Katz; Matias Korman; André van Renssen; Marcel Roeloffzen; Shakhar Smorodinsky (CoRR, 2015)

New and improved spanning ratios for Yao graphs. - Luis Barba; Prosenjit Bose; Mirela Damian; Rolf Fagerberg; Wah Loon Keng; Joseph O'Rourke; André van Renssen; Perouz Taslakian; Sander Verdonschot; Ge Xia (J. Comput. Geom., 2015)

Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles. - Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot (SIAM J. Comput., 2015)

Hanabi is NP-complete, Even for Cheaters who Look at Their Cards. - Jean-François Baffier; Man-Kwun Chiu; Yago Diez; Matias Korman; Valia Mitsou; André van Renssen; Marcel Roeloffzen; Yushi Uno (FUN, 2016)

Packing Short Plane Spanning Trees in Complete Geometric Graphs. - Oswin Aichholzer; Thomas Hackl; Matias Korman; Alexander Pilz; Günter Rote; André van Renssen; Marcel Roeloffzen; Birgit Vogtenhuber (ISAAC, 2016)

The Price of Order. - Prosenjit Bose; Pat Morin; André van Renssen (Int. J. Comput. Geom. Appl., 2016)

Towards tight bounds on theta-graphs: More is not always better. - Prosenjit Bose; Jean-Lou De Carufel; Pat Morin; André van Renssen; Sander Verdonschot (Theor. Comput. Sci., 2016)

Area-Preserving Simplification and Schematization of Polygonal Subdivisions. - Kevin Buchin; Wouter Meulemans; André van Renssen; Bettina Speckmann (ACM Trans. Spatial Algorithms Syst., 2016)

Snipperclips: Cutting Tools into Desired Polygons using Themselves. - Erik D. Demaine; Matias Korman; André van Renssen; Marcel Roeloffzen (CCCG, 2017)

Packing Short Plane Spanning Graphs in Complete Geometric Graphs. - Oswin Aichholzer; Thomas Hackl; Matias Korman; Alexander Pilz; Günter Rote; André van Renssen; Marcel Roeloffzen; Birgit Vogtenhuber (CoRR, 2017)

Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. - Mark de Berg; Tim Leijsen; André van Renssen; Marcel Roeloffzen; Aleksandar Markovic 001; Gerhard J. Woeginger (CoRR, 2017)

Routing in Polygons with Holes. - Matias Korman; Wolfgang Mulzer; André van Renssen; Marcel Roeloffzen; Paul Seiferth; Yannik Stein; Birgit Vogtenhuber; Max Willert (CoRR, 2017)

Upper and Lower Bounds for Online Routing on Delaunay Triangulations. - Nicolas Bonichon; Prosenjit Bose; Jean-Lou De Carufel; Ljubomir Perkovic; André van Renssen (Discret. Comput. Geom., 2017)

Time-space trade-offs for triangulating a simple polygon. - Boris Aronov; Matias Korman; Simon Pratt; André van Renssen; Marcel Roeloffzen (J. Comput. Geom., 2017)

Competitive local routing with constraints. - Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot (J. Comput. Geom., 2017)

On interference among moving sensors and related problems. - Jean-Lou De Carufel; Matthew J. Katz; Matias Korman; André van Renssen; Marcel Roeloffzen; Shakhar Smorodinsky (J. Comput. Geom., 2017)

Hanabi is NP-hard, even for cheaters who look at their cards. - Jean-François Baffier; Man-Kwun Chiu; Yago Diez; Matias Korman; Valia Mitsou; André van Renssen; Marcel Roeloffzen; Yushi Uno (Theor. Comput. Sci., 2017)

Continuous Yao graphs. - Davood Bakhshesh; Luis Barba; Prosenjit Bose; Jean-Lou De Carufel; Mirela Damian; Rolf Fagerberg; Mohammad Farshi; André van Renssen; Perouz Taslakian; Sander Verdonschot (Comput. Geom., 2018)

Constrained generalized Delaunay graphs are plane spanners. - Prosenjit Bose; Jean-Lou De Carufel; André van Renssen (Comput. Geom., 2018)

Time-space trade-offs for triangulations and Voronoi diagrams. - Matias Korman; Wolfgang Mulzer; André van Renssen; Marcel Roeloffzen; Paul Seiferth; Yannik Stein (Comput. Geom., 2018)

Improved time-space trade-offs for computing Voronoi diagrams. - Bahareh Banyassady; Matias Korman; Wolfgang Mulzer; André van Renssen; Marcel Roeloffzen; Paul Seiferth; Yannik Stein (J. Comput. Geom., 2018)

Routing on the visibility graph. - Prosenjit Bose; Matias Korman; Sander Verdonschot; André van Renssen (J. Comput. Geom., 2018)

Dynamic Graph Coloring. - Luis Barba; Jean Cardinal; Matias Korman; Stefan Langerman; André van Renssen; Marcel Roeloffzen; Sander Verdonschot (Algorithmica, 2019)

On Plane Constrained Bounded-Degree Spanners. - Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot (Algorithmica, 2019)

Faster algorithms for growing prioritized disks and rectangles. - Hee-Kap Ahn; Sang Won Bae 001; Jong Min Choi; Matias Korman; Wolfgang Mulzer; Eunjin Oh 001; Ji-won Park; André van Renssen; Antoine Vigneron (Comput. Geom., 2019)

Packing plane spanning graphs with short edges in complete geometric graphs. - Oswin Aichholzer; Thomas Hackl; Matias Korman; Alexander Pilz; André van Renssen; Marcel Roeloffzen; Günter Rote; Birgit Vogtenhuber (Comput. Geom., 2019)

Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. - Mark de Berg; Tim Leijsen; Aleksandar Markovic 001; André van Renssen; Marcel Roeloffzen; Gerhard J. Woeginger (Int. J. Comput. Geom. Appl., 2019)

Spanning Properties of Yao and 휃-Graphs in the Presence of Constraints. - Prosenjit Bose; André van Renssen (Int. J. Comput. Geom. Appl., 2019)

Geometry and Generation of a New Graph Planarity Game. - Rutger Kraaijer; Marc J. van Kreveld; Wouter Meulemans; André van Renssen (J. Graph Algorithms Appl., 2019)

Bounded-Degree Spanners in the Presence of Polygonal Obstacles. - André van Renssen; Gladys Wong (COCOON, 2020)

A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions. - Milutin Brankovic; Nikola Grujic; André van Renssen; Martin P. Seybold (ICALP, 2020)

Routing in Histograms. - Man-Kwun Chiu; Jonas Cleve; Katharina Klost; Matias Korman; Wolfgang Mulzer; André van Renssen; Marcel Roeloffzen; Max Willert (WALCOM, 2020)

Routing in polygonal domains. - Bahareh Banyassady; Man-Kwun Chiu; Matias Korman; Wolfgang Mulzer; André van Renssen; Marcel Roeloffzen; Paul Seiferth; Yannik Stein; Birgit Vogtenhuber; Max Willert (Comput. Geom., 2020)

Balanced line separators of unit disk graphs. - Paz Carmi; Man-Kwun Chiu; Matthew J. Katz; Matias Korman; Yoshio Okamoto; André van Renssen; Marcel Roeloffzen; Taichi Shiitada; Shakhar Smorodinsky (Comput. Geom., 2020)

Symmetric assembly puzzles are hard, beyond a few pieces. - Erik D. Demaine; Matias Korman; Jason S. Ku; Joseph S. B. Mitchell; Yota Otachi; André van Renssen; Marcel Roeloffzen; Ryuhei Uehara; Yushi Uno (Comput. Geom., 2020)

Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. - Hugo A. Akitaya; Esther M. Arkin; Mirela Damian; Erik D. Demaine; Vida Dujmovic; Robin Y. Flatland; Matias Korman; Belén Palop; Irene Parada; André van Renssen; Vera Sacristán (Algorithmica, 2021)

Translation Invariant Fréchet Distance Queries. - Joachim Gudmundsson; André van Renssen; Zeinab Saeidi; Sampson Wong (Algorithmica, 2021)

Snipperclips: Cutting tools into desired polygons using themselves. - Zachary Abel; Hugo A. Akitaya; Man-Kwun Chiu; Erik D. Demaine; Martin L. Demaine; Adam Hesterberg; Matias Korman; Jayson Lynch; André van Renssen; Marcel Roeloffzen (Comput. Geom., 2021)

Rectilinear link diameter and radius in a rectilinear polygonal domain. - Elena Arseneva; Man-Kwun Chiu; Matias Korman; Aleksandar Markovic 001; Yoshio Okamoto; Aurélien Ooms; André van Renssen; Marcel Roeloffzen (Comput. Geom., 2021)

Constrained routing between non-visible vertices. - Prosenjit Bose; Matias Korman; André van Renssen; Sander Verdonschot (Theor. Comput. Sci., 2021)

Bounded-degree spanners in the presence of polygonal obstacle. - André van Renssen; Gladys Wong (Theor. Comput. Sci., 2021)

Local Routing in Sparse and Lightweight Geometric Graphs. - Vikrant Ashvinkumar; Joachim Gudmundsson; Christos Levcopoulos; Bengt J. Nilsson; André van Renssen (Algorithmica, 2022)

Local routing in a tree metric 1-spanner. - Milutin Brankovic; Joachim Gudmundsson; André van Renssen (J. Comb. Optim., 2022)

Covering a set of line segments with a few squares. - Joachim Gudmundsson; Mees van de Kerkhof; André van Renssen; Frank Staals; Lionov Wiratma; Sampson Wong (Theor. Comput. Sci., 2022)

Oriented Spanners. - Kevin Buchin; Joachim Gudmundsson; Antonia Kalb; Aleksandr Popov 001; Carolin Rehs; André van Renssen; Sampson Wong (ESA, 2023)

The Tight Spanning Ratio of the Rectangle Delaunay Triangulation. - André van Renssen; Yuan Sha; Yucheng Sun; Sampson Wong (ESA, 2023)

Computing a Subtrajectory Cluster from c-Packed Trajectories. - Joachim Gudmundsson; Zijin Huang; André van Renssen; Sampson Wong (ISAAC, 2023)

The Mutual Visibility Problem for Fat Robots. - Rusul J. Alsaedi; Joachim Gudmundsson; André van Renssen (WADS, 2023)

Shortest Paths of Mutually Visible Robots. - Rusul J. Alsaedi; Joachim Gudmundsson; André van Renssen (CoRR, 2023)

Graphs with large total angular resolution. - Oswin Aichholzer; Matias Korman; Yoshio Okamoto; Irene Parada; Daniel Perz; André van Renssen; Birgit Vogtenhuber (Theor. Comput. Sci., 2023)

Kinetic Geodesic Voronoi Diagrams in a Simple Polygon. - Matias Korman; André van Renssen; Marcel Roeloffzen; Frank Staals (SIAM J. Discret. Math., 2023)

Designing Problem Sessions for Algorithmic Subjects to Boost Student Confidence. - André van Renssen (ACE, 2024)

Generalized sweeping line spanners. - Keenan Lee; André van Renssen (Theor. Comput. Sci., 2024)

A WSPD, Separator and Small Tree Cover for c-Packed Graphs. - Lindsey Deryckere; Joachim Gudmundsson; André van Renssen; Yuan Sha; Sampson Wong (WADS, 2025)

Spanner for the 0/1/∞ Weighted Region Problem. - Joachim Gudmundsson; Zijin Huang; André van Renssen; Sampson Wong (WADS, 2025)

Pattern formation for fat robots with lights. - Rusul J. Alsaedi; Joachim Gudmundsson; André van Renssen (Comput. Geom., 2025)

Pattern formation for fat robots with memory. - Rusul J. Alsaedi; Joachim Gudmundsson; André van Renssen (Comput. Geom., 2025)

Local Routing on Ordered Θ-graphs. - André van Renssen; Shuei Sakaguchi (CoRR, 2025)