Følg
Sander Verdonschot
Sander Verdonschot
Shopify
Verifisert e-postadresse på cg.scs.carleton.ca - Startside
Tittel
Sitert av
Sitert av
År
Evolution strategies for optimizing rectangular cartograms
K Buchin, B Speckmann, S Verdonschot
Geographic Information Science: 7th International Conference, GIScience 2012 …, 2012
462012
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
402014
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
37*2011
The θ5-graph is a spanner
P Bose, P Morin, A van Renssen, S Verdonschot
Computational Geometry 48 (2), 108-119, 2015
362015
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
312012
Dynamic graph coloring
L Barba, J Cardinal, M Korman, S Langerman, A Van Renssen, ...
Algorithms and Data Structures: 15th International Symposium, WADS 2017, St …, 2017
292017
On the stretch factor of the Theta-4 graph
L Barba, P Bose, JL De Carufel, A van Renssen, S Verdonschot
Algorithms and Data Structures: 13th International Symposium, WADS 2013 …, 2013
292013
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
282012
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
272015
A history of flips in combinatorial triangulations
P Bose, S Verdonschot
Computational Geometry: XIV Spanish Meeting on Computational Geometry, EGC …, 2012
262012
On the spanning ratio of theta-graphs
P Bose, A van Renssen, S Verdonschot
Algorithms and Data Structures: 13th International Symposium, WADS 2013 …, 2013
252013
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
Flipping edge-labelled triangulations
P Bose, A Lubiw, V Pathak, S Verdonschot
Computational Geometry 68, 309-326, 2018
212018
Gabriel triangulations and angle-monotone graphs: Local routing and recognition
N Bonichon, P Bose, P Carmi, I Kostitsyna, A Lubiw, S Verdonschot
Graph Drawing and Network Visualization: 24th International Symposium, GD …, 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
182012
Dynamic graph coloring
L Barba, J Cardinal, M Korman, S Langerman, A Van Renssen, ...
Algorithmica 81, 1319-1341, 2019
152019
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 van Renssen, S Verdonschot
Algorithms and Computation: 26th International Symposium, ISAAC 2015, Nagoya …, 2015
132015
On the average number of edges in theta graphs
P Morin, S Verdonschot
2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and …, 2014
92014
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-443, 2014
82014
Systemet kan ikke utføre handlingen. Prøv på nytt senere.
Artikler 1–20