| A linear-time algorithm for the geodesic center of a simple polygon HK Ahn, L Barba, P Bose, JL De Carufel, M Korman, E Oh Discrete & Computational Geometry 56 (4), 836-859, 2016 | 26 | 2016 |
| Revisiting the problem of searching on a line P Bose, JL De Carufel, S Durocher European Symposium on Algorithms, 205-216, 2013 | 23 | 2013 |
| A note on the unsolvability of the weighted region shortest path problem JL De Carufel, C Grimm, A Maheshwari, M Owen, M Smid Computational Geometry 47 (7), 724-727, 2014 | 21 | 2014 |
| 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 | 21 | 2013 |
| Demonic algebra with domain JL De Carufel, J Desharnais International Conference on Relational Methods in Computer Science, 120-134, 2006 | 19 | 2006 |
| Competitive online routing on Delaunay triangulations P Bose, JL De Carufel, S Durocher, P Taslakian Scandinavian Workshop on Algorithm Theory, 98-109, 2014 | 17 | 2014 |
| 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 | 17 | 2012 |
| Minimizing the continuous diameter when augmenting paths and cycles with shortcuts JL De Carufel, C Grimm, A Maheshwari, M Smid arXiv preprint arXiv:1512.02257, 2015 | 16 | 2015 |
| Searching on a line: A complete characterization of the optimal solution P Bose, JL De Carufel, S Durocher Theoretical Computer Science 569, 24-42, 2015 | 16 | 2015 |
| A linear-time algorithm for the geodesic center of a simple polygon HK Ahn, L Barba, P Bose, JL De Carufel, M Korman, E Oh Discrete & Computational Geometry 56 (4), 836-859, 2016 | 15 | 2016 |
| Similarity of polygonal curves in the presence of outliers JL De Carufel, A Gheibi, A Maheshwari, JR Sack, C Scheffer Computational Geometry 47 (5), 625-641, 2014 | 15 | 2014 |
| 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 (2), 482-504, 2017 | 14 | 2017 |
| 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 | 12 | 2016 |
| Matching cylindrical panorama sequences using planar reprojections JL De Carufel, R Laganiere 2011 IEEE International Conference on Computer Vision Workshops (ICCV …, 2011 | 12 | 2011 |
| A general framework for searching on a line P Bose, JL De Carufel Theoretical Computer Science 703, 1-17, 2017 | 11 | 2017 |
| Minimizing the continuous diameter when augmenting a tree with a shortcut JL De Carufel, C Grimm, S Schirra, M Smid Workshop on Algorithms and Data Structures, 301-312, 2017 | 11 | 2017 |
| Discrete Voronoi games and ϵ-nets, in two and three dimensions A Banik, JL De Carufel, A Maheshwari, M Smid Computational Geometry 55, 41-58, 2016 | 10 | 2016 |
| Discrete Voronoi games and ϵ-nets, in two and three dimensions A Banik, JL De Carufel, A Maheshwari, M Smid Computational Geometry 55, 41-58, 2016 | 10 | 2016 |
| Unsolvability of the weighted region shortest path problem JL De Carufel, C Grimm, A Maheshwari, M Owen, M Smid European Workshop on Computational Geometry (EuroCG), 65-68, 2012 | 10 | 2012 |
| Network farthest-point diagrams P Bose, K Dannies, JL De Carufel, C Doell, C Grimm, A Maheshwari, ... arXiv preprint arXiv:1304.1909, 2013 | 9 | 2013 |
