André van Renssen

153 papers A* 4A 7B 23C 2Misc 5Journal 99Unranked 13

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Oriented Spanners. Algorithmica Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong
2025	B	`conf`	A WSPD, Separator and Small Tree Cover for c-Packed Graphs. WADS Lindsey Deryckere, Joachim Gudmundsson, André van Renssen, Yuan Sha, Sampson Wong
2025	J	`jnl`	A WSPD, Separator and Small Tree Cover for c-packed Graphs. CoRR Lindsey Deryckere, Joachim Gudmundsson, André van Renssen, Yuan Sha, Sampson Wong
2025	B	`conf`	Local Routing on Ordered Θ-Graphs. ISAAC André van Renssen, Shuei Sakaguchi
2025	J	`jnl`	Local Routing on Ordered Θ-graphs. CoRR André van Renssen, Shuei Sakaguchi
2025	J	`jnl`	Pattern formation for fat robots with lights. Comput. Geom. Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
2025	J	`jnl`	Pattern formation for fat robots with memory. Comput. Geom. Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
2025	J	`jnl`	Shortest Paths of Mutually Visible Robots. Int. J. Comput. Geom. Appl. Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
2025	B	`conf`	Spanner for the 0/1/∞ Weighted Region Problem. WADS Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong
2025	J	`jnl`	The Tight Spanning Ratio of the Rectangle Delaunay Triangulation. Algorithmica André van Renssen, Yuan Sha, Yucheng Sun, Sampson Wong
2024	C	`conf`	Designing Problem Sessions for Algorithmic Subjects to Boost Student Confidence. ACE André van Renssen
2024	J	`jnl`	Generalized sweeping line spanners. Theor. Comput. Sci. Keenan Lee, André van Renssen
2024	J	`jnl`	Spanner for the 0/1/∞ weighted region problem. CoRR Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong
2023	B	`conf`	Computing a Subtrajectory Cluster from c-Packed Trajectories. ISAAC Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong
2023	J	`jnl`	Computing a Subtrajectory Cluster from c-packed Trajectories. CoRR Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong
2023	J	`jnl`	Designing Problem Sessions for Algorithmic Subjects to Boost Student Confidence. CoRR André van Renssen
2023	J	`jnl`	Graphs with large total angular resolution. Theor. Comput. Sci. Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber
2023	J	`jnl`	Kinetic Geodesic Voronoi Diagrams in a Simple Polygon. SIAM J. Discret. Math. Matias Korman, André van Renssen, Marcel Roeloffzen, Frank Staals
2023	A	`conf`	Oriented Spanners. ESA Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong
2023	J	`jnl`	Oriented Spanners. CoRR Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong
2023	J	`jnl`	Pattern Formation for Fat Robots with Lights. CoRR Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
2023	J	`jnl`	Pattern Formation for Fat Robots with Memory. CoRR Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
2023	J	`jnl`	Shortest Paths of Mutually Visible Robots. CoRR Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
2023	B	`conf`	The Mutual Visibility Problem for Fat Robots. WADS Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
2023	A	`conf`	The Tight Spanning Ratio of the Rectangle Delaunay Triangulation. ESA André van Renssen, Yuan Sha, Yucheng Sun, Sampson Wong
2022	J	`jnl`	Covering a set of line segments with a few squares. Theor. Comput. Sci. Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen, Frank Staals, Lionov Wiratma, Sampson Wong
2022	Misc	`conf`	Generalized Sweeping Line Spanners. COCOON Keenan Lee, André van Renssen
2022	J	`jnl`	Local Routing in Sparse and Lightweight Geometric Graphs. Algorithmica Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen
2022	J	`jnl`	Local routing in a tree metric 1-spanner. J. Comb. Optim. Milutin Brankovic, Joachim Gudmundsson, André van Renssen
2022	J	`jnl`	The Mutual Visibility Problem for Fat Robots. CoRR Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
2022	J	`jnl`	The Tight Spanning Ratio of the Rectangle Delaunay Triangulation. CoRR André van Renssen, Yuan Sha, Yucheng Sun, Sampson Wong
2021	J	`jnl`	Bounded-degree spanners in the presence of polygonal obstacle. Theor. Comput. Sci. André van Renssen, Gladys Wong
2021	J	`jnl`	Constrained routing between non-visible vertices. Theor. Comput. Sci. Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot
2021	C	`conf`	Covering a Set of Line Segments with a Few Squares. CIAC Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen, Frank Staals, Lionov Wiratma, Sampson Wong
2021	J	`jnl`	Covering a set of line segments with a few squares. CoRR Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen, Frank Staals, Lionov Wiratma, Sampson Wong
2021	J	`jnl`	Generalized Sweeping Line Spanners. CoRR Keenan Lee, André van Renssen
2021	J	`jnl`	Rectilinear link diameter and radius in a rectilinear polygonal domain. Comput. Geom. Elena Arseneva, Man-Kwun Chiu, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aurélien Ooms, André van Renssen, Marcel Roeloffzen
2021	J	`jnl`	Snipperclips: Cutting Tools into Desired Polygons using Themselves. CoRR 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
2021	J	`jnl`	Snipperclips: Cutting tools into desired polygons using themselves. Comput. Geom. 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
2021	J	`jnl`	Translation Invariant Fréchet Distance Queries. Algorithmica Joachim Gudmundsson, André van Renssen, Zeinab Saeidi, Sampson Wong
2021	J	`jnl`	Translation Invariant Fréchet Distance Queries. CoRR Joachim Gudmundsson, André van Renssen, Zeinab Saeidi, Sampson Wong
2021	J	`jnl`	Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. Algorithmica 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
2020	A*	`conf`	A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions. ICALP Milutin Brankovic, Nikola Grujic, André van Renssen, Martin P. Seybold
2020	J	`jnl`	Balanced line separators of unit disk graphs. Comput. Geom. Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky
2020	Misc	`conf`	Bounded-Degree Spanners in the Presence of Polygonal Obstacles. COCOON André van Renssen, Gladys Wong
2020	J	`jnl`	Bounded-Degree Spanners in the Presence of Polygonal Obstacles. CoRR André van Renssen, Gladys Wong
2020	A*	`conf`	Kinetic Geodesic Voronoi Diagrams in a Simple Polygon. ICALP Matias Korman, André van Renssen, Marcel Roeloffzen, Frank Staals
2020	J	`jnl`	Kinetic Geodesic Voronoi Diagrams in a Simple Polygon. CoRR Matias Korman, André van Renssen, Marcel Roeloffzen, Frank Staals
2020	Misc	`conf`	Local Routing in a Tree Metric 1-Spanner. COCOON Milutin Brankovic, Joachim Gudmundsson, André van Renssen
2020	J	`jnl`	Local Routing in a Tree Metric 1-Spanner. CoRR Milutin Brankovic, Joachim Gudmundsson, André van Renssen
2020	B	`conf`	Routing in Histograms. WALCOM Man-Kwun Chiu, Jonas Cleve, Katharina Klost, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Max Willert
2020	J	`jnl`	Routing in polygonal domains. Comput. Geom. Bahareh Banyassady, Man-Kwun Chiu, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, Max Willert
2020	J	`jnl`	Symmetric assembly puzzles are hard, beyond a few pieces. Comput. Geom. Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
2019	J	`jnl`	A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions. CoRR Milutin Brankovic, Nikola Grujic, André van Renssen, Martin P. Seybold
2019	J	`jnl`	Dynamic Graph Coloring. Algorithmica Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot
2019	J	`jnl`	Faster algorithms for growing prioritized disks and rectangles. Comput. Geom. Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron
2019	J	`jnl`	Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. Int. J. Comput. Geom. Appl. Mark de Berg, Tim Leijsen, Aleksandar Markovic, André van Renssen, Marcel Roeloffzen, Gerhard J. Woeginger
2019	J	`jnl`	Geometry and Generation of a New Graph Planarity Game. CoRR Rutger Kraaijer, Marc J. van Kreveld, Wouter Meulemans, André van Renssen
2019	J	`jnl`	Geometry and Generation of a New Graph Planarity Game. J. Graph Algorithms Appl. Rutger Kraaijer, Marc J. van Kreveld, Wouter Meulemans, André van Renssen
2019	A	`conf`	Graphs with Large Total Angular Resolution. GD Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber
2019	J	`jnl`	Graphs with large total angular resolution. CoRR Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber
2019	B	`conf`	Local Routing in Sparse and Lightweight Geometric Graphs. ISAAC Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen
2019	J	`jnl`	Local Routing in Sparse and Lightweight Geometric Graphs. CoRR Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen
2019	J	`jnl`	On Plane Constrained Bounded-Degree Spanners. Algorithmica Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2019	J	`jnl`	Packing plane spanning graphs with short edges in complete geometric graphs. Comput. Geom. Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, André van Renssen, Marcel Roeloffzen, Günter Rote, Birgit Vogtenhuber
2019	J	`jnl`	Routing in Histograms. CoRR Man-Kwun Chiu, Jonas Cleve, Katharina Klost, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Max Willert
2019	J	`jnl`	Spanning Properties of Yao and 휃-Graphs in the Presence of Constraints. Int. J. Comput. Geom. Appl. Prosenjit Bose, André van Renssen
2019	A	`conf`	Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. ESA 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
2019	J	`jnl`	Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. CoRR 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
2018	J	`jnl`	Constrained generalized Delaunay graphs are plane spanners. Comput. Geom. Prosenjit Bose, Jean-Lou De Carufel, André van Renssen
2018	J	`jnl`	Continuous Yao graphs. Comput. Geom. Davood Bakhshesh, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, Mohammad Farshi, André van Renssen, Perouz Taslakian, Sander Verdonschot
2018	—	`conf`	Geometry and Generation of a New Graph Planarity Game. CIG Rutger Kraaijer, Marc J. van Kreveld, Wouter Meulemans, André van Renssen
2018	J	`jnl`	Improved time-space trade-offs for computing Voronoi diagrams. J. Comput. Geom. Bahareh Banyassady, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein
2018	B	`conf`	Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain. ISAAC Elena Arseneva, Man-Kwun Chiu, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aurélien Ooms, André van Renssen, Marcel Roeloffzen
2018	J	`jnl`	Routing on the Visibility Graph. CoRR Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot
2018	J	`jnl`	Routing on the visibility graph. J. Comput. Geom. Prosenjit Bose, Matias Korman, Sander Verdonschot, André van Renssen
2018	J	`jnl`	Time-space trade-offs for triangulations and Voronoi diagrams. Comput. Geom. Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein
2017	B	`conf`	Balanced Line Separators of Unit Disk Graphs. WADS Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky
2017	J	`jnl`	Balanced Line Separators of Unit Disk Graphs. CoRR Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky
2017	J	`jnl`	Competitive local routing with constraints. J. Comput. Geom. Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2017	Misc	`conf`	Constrained Routing Between Non-Visible Vertices. COCOON Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot
2017	J	`jnl`	Constrained Routing Between Non-Visible Vertices. CoRR Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot
2017	B	`conf`	Dynamic Graph Coloring. WADS Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot
2017	J	`jnl`	Dynamic Graph Coloring. CoRR Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot
2017	J	`jnl`	Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. CoRR Mark de Berg, Tim Leijsen, André van Renssen, Marcel Roeloffzen, Aleksandar Markovic, Gerhard J. Woeginger
2017	B	`conf`	Faster Algorithms for Growing Prioritized Disks and Rectangles. ISAAC Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron
2017	J	`jnl`	Faster Algorithms for Growing Prioritized Disks and Rectangles. CoRR Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron
2017	B	`conf`	Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. ISAAC Mark de Berg, Tim Leijsen, Aleksandar Markovic, André van Renssen, Marcel Roeloffzen, Gerhard J. Woeginger
2017	J	`jnl`	Hanabi is NP-hard, even for cheaters who look at their cards. Theor. Comput. Sci. Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno
2017	A	`conf`	Improved Time-Space Trade-Offs for Computing Voronoi Diagrams. STACS Bahareh Banyassady, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein
2017	J	`jnl`	Improved Time-Space Trade-offs for Computing Voronoi Diagrams. CoRR Bahareh Banyassady, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein
2017	J	`jnl`	On Plane Constrained Bounded-Degree Spanners. CoRR Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2017	J	`jnl`	On interference among moving sensors and related problems. J. Comput. Geom. Jean-Lou De Carufel, Matthew J. Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky
2017	J	`jnl`	Packing Short Plane Spanning Graphs in Complete Geometric Graphs. CoRR Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Günter Rote, André van Renssen, Marcel Roeloffzen, Birgit Vogtenhuber
2017	J	`jnl`	Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain. CoRR Man-Kwun Chiu, Elena Khramtcova, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aurélien Ooms, André van Renssen, Marcel Roeloffzen
2017	B	`conf`	Routing in Polygonal Domains. ISAAC Bahareh Banyassady, Man-Kwun Chiu, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, Max Willert
2017	J	`jnl`	Routing in Polygons with Holes. CoRR Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, Max Willert
2017	B	`conf`	Routing on the Visibility Graph. ISAAC Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot
2017	—	`conf`	Snipperclips: Cutting Tools into Desired Polygons using Themselves. CCCG Erik D. Demaine, Matias Korman, André van Renssen, Marcel Roeloffzen
2017	J	`jnl`	Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces. CoRR Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
2017	J	`jnl`	Time-space trade-offs for triangulating a simple polygon. J. Comput. Geom. Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen
2017	J	`jnl`	Upper and Lower Bounds for Online Routing on Delaunay Triangulations. Discret. Comput. Geom. Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen
2016	J	`jnl`	Area-Preserving Simplification and Schematization of Polygonal Subdivisions. ACM Trans. Spatial Algorithms Syst. Kevin Buchin, Wouter Meulemans, André van Renssen, Bettina Speckmann
2016	J	`jnl`	Constrained Generalized Delaunay Graphs Are Plane Spanners. CoRR Prosenjit Bose, Jean-Lou De Carufel, André van Renssen
2016	Misc	`conf`	Hanabi is NP-complete, Even for Cheaters who Look at Their Cards. FUN Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno
2016	J	`jnl`	Hanabi is NP-complete, Even for Cheaters who Look at Their Cards. CoRR Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno
2016	A	`conf`	On Interference Among Moving Sensors and Related Problems. ESA Jean-Lou De Carufel, Matthew J. Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky
2016	B	`conf`	Packing Short Plane Spanning Trees in Complete Geometric Graphs. ISAAC Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Günter Rote, André van Renssen, Marcel Roeloffzen, Birgit Vogtenhuber
2016	J	`jnl`	The Price of Order. CoRR Prosenjit Bose, Pat Morin, André van Renssen
2016	J	`jnl`	The Price of Order. Int. J. Comput. Geom. Appl. Prosenjit Bose, Pat Morin, André van Renssen
2016	—	`conf`	Time-Space Trade-offs for Triangulating a Simple Polygon. SWAT Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen
2016	J	`jnl`	Towards tight bounds on theta-graphs: More is not always better. Theor. Comput. Sci. Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot
2015	B	`conf`	Competitive Local Routing with Constraints. ISAAC Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2015	—	`conf`	Constrained Empty-Rectangle Delaunay Graphs. CCCG Prosenjit Bose, Jean-Lou De Carufel, André van Renssen
2015	J	`jnl`	New and improved spanning ratios for Yao graphs. J. Comput. Geom. Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia
2015	J	`jnl`	On Kinetic Range Spaces and their Applications. CoRR Jean-Lou De Carufel, Matya Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky
2015	J	`jnl`	Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles. SIAM J. Comput. Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2015	J	`jnl`	Reprint of: Theta-3 is connected. Comput. Geom. Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot
2015	—	`conf`	Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces. JCDCGG Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
2015	J	`jnl`	The θ Comput. Geom. Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot
2015	J	`jnl`	Time-Space Trade-offs for Triangulating a Simple Polygon. CoRR Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen
2015	B	`conf`	Time-Space Trade-offs for Triangulations and Voronoi Diagrams. WADS Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein
2015	J	`jnl`	Time-Space Trade-offs for Triangulations and Voronoi Diagrams. CoRR Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein
2015	J	`jnl`	Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations. CoRR Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen
2015	A	`conf`	Upper and Lower Bounds for Online Routing on Delaunay Triangulations. ESA Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen
2014	J	`jnl`	Competitive Local Routing with Constraints. CoRR Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2014	—	`conf`	Continuous Yao Graphs. CCCG Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot
2014	J	`jnl`	Continuous Yao Graphs. CoRR Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot
2014	J	`jnl`	Making triangulations 4-connected using flips. Comput. Geom. Prosenjit Bose, Dana Jansens, André van Renssen, Maria Saumell, Sander Verdonschot
2014	A*	`conf`	New and Improved Spanning Ratios for Yao Graphs. SoCG Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia
2014	—	`conf`	On the Spanning Ratio of Constrained Yao-Graphs. CCCG André van Renssen
2014	J	`jnl`	Optimal local routing on Delaunay triangulations defined by empty equilateral triangles. CoRR Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2014	B	`conf`	The Price of Order. ISAAC Prosenjit Bose, Pat Morin, André van Renssen
2014	J	`jnl`	Theta-3 is connected. Comput. Geom. Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot
2014	J	`jnl`	Theta-3 is connected. CoRR Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot
2014	J	`jnl`	Towards Tight Bounds on Theta-Graphs. CoRR Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot
2014	B	`conf`	Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs. LATIN Prosenjit Bose, André van Renssen
2014	J	`jnl`	Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs. CoRR Prosenjit Bose, André van Renssen
2013	J	`jnl`	New and Improved Spanning Ratios for Yao Graphs. CoRR Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot
2013	B	`conf`	On the Spanning Ratio of Theta-Graphs. WADS Prosenjit Bose, André van Renssen, Sander Verdonschot
2013	B	`conf`	On the Stretch Factor of the Theta-4 Graph. WADS Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, André van Renssen, Sander Verdonschot
2013	J	`jnl`	On the stretch factor of the Theta-4 graph CoRR Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, André van Renssen, Sander Verdonschot
2013	B	`conf`	The θ 5-Graph is a Spanner. WG Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot
2013	—	`conf`	Theta-3 is connected. CCCG Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot
2012	—	`conf`	Competitive Routing on a Bounded-Degree Plane Spanner. CCCG Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2012	A*	`conf`	Competitive routing in the half-θ SODA Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2012	B	`conf`	On Plane Constrained Bounded-Degree Spanners. LATIN Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2012	—	`conf`	Optimal Bounds on Theta-Graphs: More is not Always Better. CCCG Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot
2012	J	`jnl`	The theta-5-graph is a spanner CoRR Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot
2011	J	`jnl`	Making triangulations 4-connected using flips CoRR Prosenjit Bose, Dana Jansens, André van Renssen, Maria Saumell, Sander Verdonschot
2011	—	`conf`	Making triangulations 4-connected using flips. CCCG Prosenjit Bose, Dana Jansens, André van Renssen, Maria Saumell, Sander Verdonschot
2011	—	`conf`	The 2x2 Simple Packing Problem. CCCG André van Renssen, Bettina Speckmann
2010	—	`conf`	Area-Preserving Subdivision Schematization. GIScience Wouter Meulemans, André van Renssen, Bettina Speckmann