Follow
Sander Verdonschot
Sander Verdonschot
Shopify
Verified email at cg.scs.carleton.ca - Homepage
Title
Cited by
Cited by
Year
Evolution strategies for optimizing rectangular cartograms
K Buchin, B Speckmann, S Verdonschot
International Conference on Geographic Information Science, 29-42, 2012
452012
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
10th Latin American Symposium on Theoretical Informatics (LATIN 2012), 117-128, 2011
33*2011
The θ5-graph is a spanner
P Bose, P Morin, A Van Renssen, S Verdonschot
Computational Geometry 48 (2), 108-119, 2015
322015
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
Making triangulations 4-connected using flips
P Bose, D Jansens, A van Renssen, M Saumell, S Verdonschot
Computational Geometry: Theory and Applications special issue for CCCG 2011, 2012
262012
A history of flips in combinatorial triangulations
P Bose, S Verdonschot
Spanish Meeting on Computational Geometry, 29-44, 2011
252011
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
Flipping edge-labelled triangulations
P Bose, A Lubiw, V Pathak, S Verdonschot
Computational Geometry 68, 309-326, 2018
202018
Gabriel triangulations and angle-monotone graphs: Local routing and recognition
N Bonichon, P Bose, P Carmi, I Kostitsyna, A Lubiw, S Verdonschot
International Symposium on Graph Drawing and Network Visualization, 519-531, 2016
182016
Optimal bounds on theta-graphs: More is not always better
P Bose, JL De Carufel, P Morin, A van Renssen, S Verdonschot
24th Canadian Conference on Computational Geometry, 305–310, 2012
172012
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
Add Content
JJ Clark, P Van Oorschot, M Atia, JJ Georgy, AA Noureldin, T Guo, FF Liu, ...
Optics Express 21 (16), 19097-19102, 0
14
Dynamic graph coloring
L Barba, J Cardinal, M Korman, S Langerman, A Van Renssen, ...
Algorithmica 81 (4), 1319-1341, 2019
92019
Routing on the visibility graph
P Bose, M Korman, A van Renssen, S Verdonschot
arXiv preprint arXiv:1803.02979, 2018
82018
The system can't perform the operation now. Try again later.
Articles 1–20