Follow
Jean-Lou De Carufel
Jean-Lou De Carufel
Assistant Professor of Computer Science, University of Ottawa
Verified email at uottawa.ca - Homepage
Title
Cited by
Cited by
Year
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, 836-859, 2016
432016
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
342014
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, 836-859, 2016
322016
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
322016
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
Revisiting the problem of searching on a line
P Bose, JL De Carufel, S Durocher
Algorithms–ESA 2013: 21st Annual European Symposium, Sophia Antipolis …, 2013
272013
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
252015
Demonic algebra with domain
JL De Carufel, J Desharnais
International Conference on Relational Methods in Computer Science, 120-134, 2006
252006
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
232017
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
232015
Digital Library
W Arms
The MIT Press, 2000
232000
Competitive online routing on Delaunay triangulations
P Bose, JL De Carufel, S Durocher, P Taslakian
Algorithm Theory–SWAT 2014: 14th Scandinavian Symposium and Workshops …, 2014
202014
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
192014
A general framework for searching on a line
P Bose, JL De Carufel
Theoretical Computer Science 703, 1-17, 2017
172017
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
172012
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
16*2017
Towards plane spanners of degree 3
A Biniaz, P Bose, JL De Carufel, C Gavoille, A Maheshwari, M Smid
arXiv preprint arXiv:1606.08824, 2016
162016
On the spanning and routing ratio of Theta-four
P Bose, JL De Carufel, D Hill, M Smid
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
152019
A plane 1.88-spanner for points in convex position
A Biniaz, M Amani, A Maheshwari, M Smid, P Bose, JL De Carufel
Journal of Computational Geometry 7 (1), 520–539-520–539, 2016
142016
On the minimum consistent subset problem
A Biniaz, S Cabello, P Carmi, JL De Carufel, A Maheshwari, S Mehrabi, ...
Algorithmica 83, 2273-2302, 2021
132021
The system can't perform the operation now. Try again later.
Articles 1–20