| Evolution strategies for optimizing rectangular cartograms K Buchin, B Speckmann, S Verdonschot Geographic Information Science: 7th International Conference, GIScience 2012 …, 2012 | 59 | 2012 |
| 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 | 49 | 2014 |
| The θ5-graph is a spanner P Bose, P Morin, A van Renssen, S Verdonschot Computational Geometry 48 (2), 108-119, 2015 | 40 | 2015 |
| 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 | 36* | 2011 |
| 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 | 35 | 2016 |
| 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 | 33 | 2012 |
| Dynamic graph coloring L Barba, J Cardinal, M Korman, S Langerman, A Van Renssen, ... Workshop on algorithms and data structures, 97-108, 2017 | 32 | 2017 |
| 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 | 31 | 2015 |
| 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 | 31 | 2013 |
| 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 | 28 | 2012 |
| A history of flips in combinatorial triangulations P Bose, S Verdonschot Computational Geometry: XIV Spanish Meeting on Computational Geometry, EGC …, 2012 | 25 | 2012 |
| On the spanning ratio of theta-graphs P Bose, A van Renssen, S Verdonschot Algorithms and Data Structures: 13th International Symposium, WADS 2013 …, 2013 | 24 | 2013 |
| Flipping edge-labelled triangulations P Bose, A Lubiw, V Pathak, S Verdonschot Computational Geometry 68, 309-326, 2018 | 23 | 2018 |
| Dynamic graph coloring L Barba, J Cardinal, M Korman, S Langerman, A Van Renssen, ... Algorithmica 81, 1319-1341, 2019 | 22 | 2019 |
| 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 | 21 | 2016 |
| Theta-3 is connected O Aichholzer, SW Bae, L Barba, P Bose, M Korman, A Van Renssen, ... Computational geometry 47 (9), 910-917, 2014 | 19 | 2014 |
| 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 | 18 | 2012 |
| Competitive local routing with constraints P Bose, R Fagerberg, A van Renssen, S Verdonschot International Symposium on Algorithms and Computation, 23-34, 2015 | 13 | 2015 |
| The Formula Not Shown-graph is a spanner P Bose, P Morin, A Van Renssen, S Verdonschot COMPUTATIONAL GEOMETRY 48 (2), 108-119, 2015 | 9 | 2015 |
| On the average number of edges in theta graphs P Morin, S Verdonschot 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and …, 2014 | 9 | 2014 |
Prosenjit BoseCarleton UniversityVerified email at scs.carleton.ca
