default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndré van Renssen
Person information
- affiliation: University of Sydney, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j43]Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
:
Pattern formation for fat robots with lights. Comput. Geom. 128: 102161 (2025)- [j42]Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen:
Pattern formation for fat robots with memory. Comput. Geom. 129: 102189 (2025) - 2024
- [j41]Keenan Lee, André van Renssen:
Generalized sweeping line spanners. Theor. Comput. Sci. 989: 114390 (2024) - [c51]André van Renssen:
Designing Problem Sessions for Algorithmic Subjects to Boost Student Confidence. ACE 2024: 164-171 - [i51]Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong:
Spanner for the 0/1/∞ weighted region problem. CoRR abs/2407.01951 (2024) - 2023
- [j40]Matias Korman, André van Renssen, Marcel Roeloffzen, Frank Staals:
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon. SIAM J. Discret. Math. 37(4): 2276-2311 (2023) - [j39]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: 73-88 (2023) - [c50]Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong:
Oriented Spanners. ESA 2023: 26:1-26:16 - [c49]André van Renssen, Yuan Sha, Yucheng Sun, Sampson Wong:
The Tight Spanning Ratio of the Rectangle Delaunay Triangulation. ESA 2023: 99:1-99:15 - [c48]Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong:
Computing a Subtrajectory Cluster from c-Packed Trajectories. ISAAC 2023: 34:1-34:15 - [c47]Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen:
The Mutual Visibility Problem for Fat Robots. WADS 2023: 15-28 - [i50]Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen:
Pattern Formation for Fat Robots with Lights. CoRR abs/2306.14440 (2023) - [i49]Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong:
Oriented Spanners. CoRR abs/2306.17097 (2023) - [i48]Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong:
Computing a Subtrajectory Cluster from c-packed Trajectories. CoRR abs/2307.10610 (2023) - [i47]Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen:
Pattern Formation for Fat Robots with Memory. CoRR abs/2309.14649 (2023) - [i46]Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen:
Shortest Paths of Mutually Visible Robots. CoRR abs/2309.16901 (2023) - [i45]André van Renssen:
Designing Problem Sessions for Algorithmic Subjects to Boost Student Confidence. CoRR abs/2311.12365 (2023) - 2022
- [j38]Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen:
Local Routing in Sparse and Lightweight Geometric Graphs. Algorithmica 84(5): 1316-1340 (2022) - [j37]Milutin Brankovic, Joachim Gudmundsson, André van Renssen:
Local routing in a tree metric 1-spanner. J. Comb. Optim. 44(4): 2642-2660 (2022) - [j36]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: 74-98 (2022) - [c46]Keenan Lee, André van Renssen:
Generalized Sweeping Line Spanners. COCOON 2022: 406-418 - [i44]Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen:
The Mutual Visibility Problem for Fat Robots. CoRR abs/2206.14423 (2022) - [i43]André van Renssen, Yuan Sha, Yucheng Sun, Sampson Wong:
The Tight Spanning Ratio of the Rectangle Delaunay Triangulation. CoRR abs/2211.11987 (2022) - 2021
- [j35]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): 1316-1351 (2021) - [j34]Joachim Gudmundsson, André van Renssen, Zeinab Saeidi, Sampson Wong:
Translation Invariant Fréchet Distance Queries. Algorithmica 83(11): 3514-3533 (2021) - [j33]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: 101685 (2021) - [j32]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: 101784 (2021) - [j31]André van Renssen, Gladys Wong:
Bounded-degree spanners in the presence of polygonal obstacle. Theor. Comput. Sci. 854: 159-173 (2021) - [j30]Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot:
Constrained routing between non-visible vertices. Theor. Comput. Sci. 861: 144-154 (2021) - [c45]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: 286-299 - [i42]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 abs/2101.09913 (2021) - [i41]Joachim Gudmundsson, André van Renssen, Zeinab Saeidi, Sampson Wong:
Translation Invariant Fréchet Distance Queries. CoRR abs/2102.05844 (2021) - [i40]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 abs/2105.08305 (2021) - [i39]Keenan Lee, André van Renssen:
Generalized Sweeping Line Spanners. CoRR abs/2109.05689 (2021) - 2020
- [j29]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) - [j28]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: 101593 (2020) - [j27]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: 101648 (2020) - [c44]André van Renssen, Gladys Wong:
Bounded-Degree Spanners in the Presence of Polygonal Obstacles. COCOON 2020: 40-51 - [c43]Milutin Brankovic, Joachim Gudmundsson, André van Renssen:
Local Routing in a Tree Metric 1-Spanner. COCOON 2020: 174-185 - [c42]Milutin Brankovic, Nikola Grujic, André van Renssen, Martin P. Seybold:
A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions. ICALP 2020: 18:1-18:18 - [c41]Matias Korman, André van Renssen, Marcel Roeloffzen, Frank Staals:
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon. ICALP 2020: 75:1-75:17 - [c40]Man-Kwun Chiu, Jonas Cleve, Katharina Klost, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Max Willert:
Routing in Histograms. WALCOM 2020: 43-54 - [i38]Matias Korman, André van Renssen, Marcel Roeloffzen, Frank Staals:
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon. CoRR abs/2002.05910 (2020) - [i37]André van Renssen, Gladys Wong:
Bounded-Degree Spanners in the Presence of Polygonal Obstacles. CoRR abs/2009.06879 (2020) - [i36]Milutin Brankovic, Joachim Gudmundsson, André van Renssen:
Local Routing in a Tree Metric 1-Spanner. CoRR abs/2012.00959 (2020)
2010 – 2019
- 2019
- [j26]Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot:
Dynamic Graph Coloring. Algorithmica 81(4): 1319-1341 (2019) - [j25]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
On Plane Constrained Bounded-Degree Spanners. Algorithmica 81(4): 1392-1415 (2019) - [j24]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: 23-39 (2019) - [j23]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: 1-15 (2019) - [j22]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): 49-72 (2019) - [j21]Prosenjit Bose, André van Renssen:
Spanning Properties of Yao and 휃-Graphs in the Presence of Constraints. Int. J. Comput. Geom. Appl. 29(2): 95-120 (2019) - [j20]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): 603-624 (2019) - [c39]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: 3:1-3:14 - [c38]Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber:
Graphs with Large Total Angular Resolution. GD 2019: 193-199 - [c37]Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen:
Local Routing in Sparse and Lightweight Geometric Graphs. ISAAC 2019: 30:1-30:13 - [i35]Man-Kwun Chiu, Jonas Cleve, Katharina Klost, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Max Willert:
Routing in Histograms. CoRR abs/1902.06599 (2019) - [i34]Rutger Kraaijer, Marc J. van Kreveld, Wouter Meulemans, André van Renssen:
Geometry and Generation of a New Graph Planarity Game. CoRR abs/1908.01426 (2019) - [i33]Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber:
Graphs with large total angular resolution. CoRR abs/1908.06504 (2019) - [i32]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 abs/1908.07880 (2019) - [i31]Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen:
Local Routing in Sparse and Lightweight Geometric Graphs. CoRR abs/1909.10215 (2019) - [i30]Milutin Brankovic, Nikola Grujic, André van Renssen, Martin P. Seybold:
A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions. CoRR abs/1912.03389 (2019) - 2018
- [j19]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: 42-52 (2018) - [j18]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: 35-45 (2018) - [j17]Prosenjit Bose, Jean-Lou De Carufel, André van Renssen:
Constrained generalized Delaunay graphs are plane spanners. Comput. Geom. 74: 50-65 (2018) - [j16]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): 191-212 (2018) - [j15]Prosenjit Bose, Matias Korman, Sander Verdonschot, André van Renssen:
Routing on the visibility graph. J. Comput. Geom. 9(1): 430-453 (2018) - [c36]Rutger Kraaijer, Marc J. van Kreveld, Wouter Meulemans, André van Renssen:
Geometry and Generation of a New Graph Planarity Game. CIG 2018: 1-8 - [c35]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: 58:1-58:13 - [i29]Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot:
Routing on the Visibility Graph. CoRR abs/1803.02979 (2018) - 2017
- [j14]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): 482-504 (2017) - [j13]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): 32-46 (2017) - [j12]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): 105-124 (2017) - [j11]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive local routing with constraints. J. Comput. Geom. 8(1): 125-152 (2017) - [j10]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: 43-55 (2017) - [c34]Erik D. Demaine, Matias Korman, André van Renssen, Marcel Roeloffzen:
Snipperclips: Cutting Tools into Desired Polygons using Themselves. CCCG 2017: 56-61 - [c33]Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot:
Constrained Routing Between Non-Visible Vertices. COCOON 2017: 62-74 - [c32]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: 3:1-3:13 - [c31]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: 10:1-10:13 - [c30]Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot:
Routing on the Visibility Graph. ISAAC 2017: 18:1-18:12 - [c29]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: 26:1-26:13 - [c28]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: 9:1-9:14 - [c27]Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot:
Dynamic Graph Coloring. WADS 2017: 97-108 - [c26]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: 241-252 - [i28]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 abs/1701.03388 (2017) - [i27]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 abs/1703.02671 (2017) - [i26]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 abs/1703.05863 (2017) - [i25]Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, Max Willert:
Routing in Polygons with Holes. CoRR abs/1703.09533 (2017) - [i24]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
On Plane Constrained Bounded-Degree Spanners. CoRR abs/1704.03596 (2017) - [i23]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 abs/1704.07580 (2017) - [i22]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 abs/1708.00814 (2017) - [i21]Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot:
Dynamic Graph Coloring. CoRR abs/1708.09080 (2017) - [i20]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 abs/1709.02579 (2017) - [i19]Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot:
Constrained Routing Between Non-Visible Vertices. CoRR abs/1710.08060 (2017) - [i18]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 abs/1712.05538 (2017) - 2016
- [j9]Prosenjit Bose, Pat Morin, André van Renssen:
The Price of Order. Int. J. Comput. Geom. Appl. 26(3-4): 135-150 (2016) - [j8]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: 70-93 (2016) - [j7]Kevin Buchin, Wouter Meulemans, André van Renssen, Bettina Speckmann:
Area-Preserving Simplification and Schematization of Polygonal Subdivisions. ACM Trans. Spatial Algorithms Syst. 2(1): 2:1-2:36 (2016) - [c25]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: 34:1-34:11 - [c24]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: 4:1-4:17 - [c23]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: 9:1-9:12 - [c22]Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen:
Time-Space Trade-offs for Triangulating a Simple Polygon. SWAT 2016: 30:1-30:12 - [i17]Prosenjit Bose, Pat Morin, André van Renssen:
The Price of Order. CoRR abs/1602.00399 (2016) - [i16]Prosenjit Bose, Jean-Lou De Carufel, André van Renssen:
Constrained Generalized Delaunay Graphs Are Plane Spanners. CoRR abs/1602.07365 (2016) - [i15]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 abs/1603.01911 (2016) - 2015
- [j6]Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot:
The θ5-graph is a spanner. Comput. Geom. 48(2): 108-119 (2015) - [j5]Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Reprint of: Theta-3 is connected. Comput. Geom. 48(5): 407-414 (2015) - [j4]Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia:
New and improved spanning ratios for Yao graphs. J. Comput. Geom. 6(2): 19-53 (2015) - [j3]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles. SIAM J. Comput. 44(6): 1626-1649 (2015) - [c21]Prosenjit Bose, Jean-Lou De Carufel, André van Renssen:
Constrained Empty-Rectangle Delaunay Graphs. CCCG 2015 - [c20]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen:
Upper and Lower Bounds for Online Routing on Delaunay Triangulations. ESA 2015: 203-214 - [c19]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive Local Routing with Constraints. ISAAC 2015: 23-34 - [c18]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. JCDCGG 2015: 180-192 - [c17]Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein:
Time-Space Trade-offs for Triangulations and Voronoi Diagrams. WADS 2015: 482-494 - [i14]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen:
Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations. CoRR abs/1501.01783 (2015) - [i13]Jean-Lou De Carufel, Matya Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky:
On Kinetic Range Spaces and their Applications. CoRR abs/1507.02130 (2015) - [i12]Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein:
Time-Space Trade-offs for Triangulations and Voronoi Diagrams. CoRR abs/1507.03403 (2015) - [i11]Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen:
Time-Space Trade-offs for Triangulating a Simple Polygon. CoRR abs/1509.07669 (2015) - 2014
- [j2]Prosenjit Bose, Dana Jansens, André van Renssen, Maria Saumell, Sander Verdonschot:
Making triangulations 4-connected using flips. Comput. Geom. 47(2): 187-197 (2014) - [j1]Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Theta-3 is connected. Comput. Geom. 47(9): 910-917 (2014) - [c16]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Continuous Yao Graphs. CCCG 2014 - [c15]André van Renssen:
On the Spanning Ratio of Constrained Yao-Graphs. CCCG 2014 - [c14]Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia:
New and Improved Spanning Ratios for Yao Graphs. SoCG 2014: 30 - [c13]Prosenjit Bose, Pat Morin, André van Renssen:
The Price of Order. ISAAC 2014: 313-325 - [c12]Prosenjit Bose, André van Renssen:
Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs. LATIN 2014: 108-119 - [i10]Prosenjit Bose, André van Renssen:
Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs. CoRR abs/1401.2127 (2014) - [i9]Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot:
Towards Tight Bounds on Theta-Graphs. CoRR abs/1404.6233 (2014) - [i8]Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Theta-3 is connected. CoRR abs/1404.7186 (2014) - [i7]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Continuous Yao Graphs. CoRR abs/1408.4099 (2014) - [i6]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Optimal local routing on Delaunay triangulations defined by empty equilateral triangles. CoRR abs/1409.6397 (2014) - [i5]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive Local Routing with Constraints. CoRR abs/1412.0760 (2014) - 2013
- [c11]Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Theta-3 is connected. CCCG 2013 - [c10]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, André van Renssen, Sander Verdonschot:
On the Stretch Factor of the Theta-4 Graph. WADS 2013: 109-120 - [c9]Prosenjit Bose, André van Renssen, Sander Verdonschot:
On the Spanning Ratio of Theta-Graphs. WADS 2013: 182-194 - [c8]Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot:
The θ 5-Graph is a Spanner. WG 2013: 100-114 - [i4]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, André van Renssen, Sander Verdonschot:
On the stretch factor of the Theta-4 graph. CoRR abs/1303.5473 (2013) - [i3]Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot:
New and Improved Spanning Ratios for Yao Graphs. CoRR abs/1307.5829 (2013) - 2012
- [c7]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive Routing on a Bounded-Degree Plane Spanner. CCCG 2012: 285-290 - [c6]Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot:
Optimal Bounds on Theta-Graphs: More is not Always Better. CCCG 2012: 291-296 - [c5]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
On Plane Constrained Bounded-Degree Spanners. LATIN 2012: 85-96 - [c4]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive routing in the half-θ6-graph. SODA 2012: 1319-1328 - [i2]Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot:
The theta-5-graph is a spanner. CoRR abs/1212.0570 (2012) - 2011
- [c3]Prosenjit Bose, Dana Jansens, André van Renssen, Maria Saumell, Sander Verdonschot:
Making triangulations 4-connected using flips. CCCG 2011 - [c2]André van Renssen, Bettina Speckmann:
The 2x2 Simple Packing Problem. CCCG 2011 - [i1]Prosenjit Bose, Dana Jansens, André van Renssen, Maria Saumell, Sander Verdonschot:
Making triangulations 4-connected using flips. CoRR abs/1110.6473 (2011) - 2010
- [c1]Wouter Meulemans, André van Renssen, Bettina Speckmann:
Area-Preserving Subdivision Schematization. GIScience 2010: 160-174
Coauthor Index
[j40] [j39] [j35] [j33] [j32] [j30] [i40] [j29] [j28] [j27] [c41] [c40] [i38] [j26] [j24] [j23] [c39] [c38] [i35] [i33] [i32] [j18] [j16] [j15] [c35] [i29] [j13] [j12] [j10] [c34] [c33] [c32] [c31] [c30] [c28] [c27] [c26] [i27] [i26] [i25] [i23] [i22] [i21] [i20] [i19] [i18] [c25] [c24] [c23] [c22] [i15] [j5] [c18] [c17] [i13] [i12] [i11] [j1] [i8] [c11]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-03 00:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
