Sander Verdonschot
Sander Verdonschot
Shopify
Dirección de correo verificada de cg.scs.carleton.ca - Página principal
TítuloCitado porAño
Evolution strategies for optimizing rectangular cartograms
K Buchin, B Speckmann, S Verdonschot
International Conference on Geographic Information Science, 29-42, 2012
342012
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, 2014
302014
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
282012
The θ5-graph is a spanner
P Bose, P Morin, A Van Renssen, S Verdonschot
Computational Geometry 48 (2), 108-119, 2015
252015
On the spanning ratio of theta-graphs
P Bose, A Van Renssen, S Verdonschot
Workshop on Algorithms and Data Structures, 182-194, 2013
242013
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
23*2011
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
212015
On the stretch factor of the Theta-4 graph
L Barba, P Bose, JL De Carufel, A Van Renssen, S Verdonschot
Workshop on Algorithms and Data Structures, 109-120, 2013
212013
Dynamic graph coloring
L Barba, J Cardinal, M Korman, S Langerman, A Van Renssen, ...
Workshop on Algorithms and Data Structures, 97-108, 2017
172017
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
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
172012
A history of flips in combinatorial triangulations
P Bose, S Verdonschot
Spanish Meeting on Computational Geometry, 29-44, 2011
152011
Flipping edge-labelled triangulations
P Bose, A Lubiw, V Pathak, S Verdonschot
Computational Geometry 68, 309-326, 2018
122018
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
122016
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
102016
Competitive local routing with constraints
P Bose, R Fagerberg, A Van Renssen, S Verdonschot
International Symposium on Algorithms and Computation, 23-34, 2015
102015
Theta-3 is connected
O Aichholzer, SW Bae, L Barba, P Bose, M Korman, A Van Renssen, ...
Computational geometry 47 (9), 910-917, 2014
82014
Optimizing regular edge labelings
K Buchin, B Speckmann, S Verdonschot
International Symposium on Graph Drawing, 117-128, 2010
82010
Weight balancing on boundaries and skeletons
L Barba, O Cheong, JL De Carufel, MG Dobbins, R Fleischer, ...
Proceedings of the thirtieth annual symposium on Computational geometry, 436, 2014
72014
On the average number of edges in theta graphs
P Morin, S Verdonschot
Proceedings of the Meeting on Analytic Algorithmics and Combinatorics, 121-132, 2014
72014
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20