| 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 | 40 | 2014 |
| On plane constrained bounded-degree spanners P Bose, R Fagerberg, A van Renssen, S Verdonschot Algorithmica 81, 1392-1415, 2019 | 37 | 2019 |
| 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 | 36 | 2016 |
| The θ5-graph is a spanner P Bose, P Morin, A van Renssen, S Verdonschot Computational Geometry 48 (2), 108-119, 2015 | 36 | 2015 |
| 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 | 31 | 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 | 31 | 2012 |
| 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 | 29 | 2017 |
| 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 | 29 | 2013 |
| Making triangulations 4-connected using flips P Bose, D Jansens, A Van Renssen, M Saumell, S Verdonschot Computational Geometry 47 (2), 187-197, 2014 | 28 | 2014 |
| Area-preserving subdivision schematization W Meulemans, A van Renssen, B Speckmann Geographic Information Science: 6th International Conference, GIScience 2010 …, 2010 | 28 | 2010 |
| 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 | 27 | 2015 |
| On the spanning ratio of theta-graphs P Bose, A van Renssen, S Verdonschot Algorithms and Data Structures: 13th International Symposium, WADS 2013 …, 2013 | 25 | 2013 |
| 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 | 24 | 2016 |
| 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, 1316-1351, 2021 | 23 | 2021 |
| 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, 482-504, 2017 | 20 | 2017 |
| 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 | 18 | 2012 |
| Dynamic graph coloring L Barba, J Cardinal, M Korman, S Langerman, A Van Renssen, ... Algorithmica 81, 1319-1341, 2019 | 15 | 2019 |
| 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 | 15 | 2018 |
| Theta-3 is connected O Aichholzer, SW Bae, L Barba, P Bose, M Korman, A Van Renssen, ... Computational geometry 47 (9), 910-917, 2014 | 15 | 2014 |
| Competitive local routing with constraints P Bose, R Fagerberg, A van Renssen, S Verdonschot Algorithms and Computation: 26th International Symposium, ISAAC 2015, Nagoya …, 2015 | 13 | 2015 |
Prosenjit BoseCarleton UniversityVerified email at scs.carleton.ca
