André van Renssen

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 115

Top Venues

Publications

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

André van Renssen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

André van Renssen