Follow
André van Renssen
Title
Cited by
Cited by
Year
New and improved spanning ratios for Yao graphs
L Barba, P Bose, M Damian, R Fagerberg, WL Keng, J O'Rourke, ...
Proceedings of the thirtieth annual symposium on Computational geometry, 30-39, 2014
372014
On plane constrained bounded-degree spanners
P Bose, R Fagerberg, A Van Renssen, S Verdonschot
Algorithmica 81 (4), 1392-1415, 2019
332019
The θ5-graph is a spanner
P Bose, P Morin, A Van Renssen, S Verdonschot
Computational Geometry 48 (2), 108-119, 2015
32*2015
Area-preserving simplification and schematization of polygonal subdivisions
K Buchin, W Meulemans, AV Renssen, B Speckmann
ACM Transactions on Spatial Algorithms and Systems (TSAS) 2 (1), 1-36, 2016
302016
Hanabi is np-hard, even for cheaters who look at their cards
JF Baffier, MK Chiu, Y Diez, M Korman, V Mitsou, A Van Renssen, ...
arXiv preprint arXiv:1603.01911, 2016
292016
Competitive Routing in the Half-θ6-Graph
P Bose, R Fagerberg, A Van Renssen, S Verdonschot
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
292012
Dynamic graph coloring
L Barba, J Cardinal, M Korman, S Langerman, A Renssen, M Roeloffzen, ...
Workshop on Algorithms and Data Structures, 97-108, 2017
272017
On the stretch factor of the Theta-4 graph
L Barba, P Bose, JLD Carufel, A Renssen, S Verdonschot
Workshop on Algorithms and Data Structures, 109-120, 2013
272013
Area-preserving subdivision schematization
W Meulemans, A Renssen, B Speckmann
International Conference on Geographic Information Science, 160-174, 2010
272010
Making triangulations 4-connected using flips
P Bose, D Jansens, A Van Renssen, M Saumell, S Verdonschot
Computational Geometry 47 (2), 187-197, 2014
262014
Towards tight bounds on theta-graphs: More is not always better
P Bose, JL De Carufel, P Morin, A Van Renssen, S Verdonschot
Theoretical Computer Science 616, 70-93, 2016
242016
Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
P Bose, R Fagerberg, A Van Renssen, S Verdonschot
SIAM Journal on Computing 44 (6), 1626-1649, 2015
242015
On the spanning ratio of theta-graphs
P Bose, A Renssen, S Verdonschot
Workshop on Algorithms and Data Structures, 182-194, 2013
242013
Universal reconfiguration of facet-connected modular robots by pivots: the O (1) musketeers
HA Akitaya, EM Arkin, M Damian, ED Demaine, V Dujmović, R Flatland, ...
Algorithmica 83 (5), 1316-1351, 2021
192021
Upper and lower bounds for online routing on delaunay triangulations
N Bonichon, P Bose, JL De Carufel, L Perković, A Van Renssen
Discrete & Computational Geometry 58 (2), 482-504, 2017
172017
Optimal Bounds on Theta-Graphs: More is not Always Better.
P Bose, JL De Carufel, P Morin, A Van Renssen, S Verdonschot
CCCG, 291-296, 2012
172012
Time–space trade-offs for triangulations and Voronoi diagrams
M Korman, W Mulzer, A Van Renssen, M Roeloffzen, P Seiferth, Y Stein
Computational Geometry 73, 35-45, 2018
152018
Theta-3 is connected
O Aichholzer, SW Bae, L Barba, P Bose, M Korman, A Van Renssen, ...
Computational geometry 47 (9), 910-917, 2014
152014
Competitive local routing with constraints
P Bose, R Fagerberg, A Renssen, S Verdonschot
International Symposium on Algorithms and Computation, 23-34, 2015
142015
Improved time-space trade-offs for computing Voronoi diagrams
B Banyassady, M Korman, W Mulzer, A Van Renssen, M Roeloffzen, ...
arXiv preprint arXiv:1708.00814, 2017
122017
The system can't perform the operation now. Try again later.
Articles 1–20