default search action
Jean-Lou De Carufel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j39]Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer:
Pursuit-evasion in graphs: Zombies, lazy zombies and a survivor. Discret. Math. 348(1): 114220 (2025) - 2024
- [j38]Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, Michiel Smid:
On the Spanning and Routing Ratio of the Directed Theta-Four Graph. Discret. Comput. Geom. 71(3): 872-892 (2024) - [c42]Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr:
Noncrossing Longest Paths and Cycles. GD 2024: 36:1-36:17 - [i41]Jean-Lou De Carufel, Marie Rose Jerade:
So Long Sucker: Endgame Analysis. CoRR abs/2403.17302 (2024) - [i40]Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid:
Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults. CoRR abs/2405.18134 (2024) - [i39]Prosenjit Bose, Jean-Lou De Carufel, Guillermo Esteban, Anil Maheshwari:
Computing shortest paths amid non-overlapping weighted disks. CoRR abs/2409.08869 (2024) - [i38]Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Karthik Murali:
On 1-Planar Graphs with Bounded Cop-Number. CoRR abs/2409.16279 (2024) - 2023
- [j37]Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira:
Constant delay lattice train schedules. Discret. Appl. Math. 339: 1-10 (2023) - [j36]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel Smid:
Improved Routing on the Delaunay Triangulation. Discret. Comput. Geom. 70(3): 495-549 (2023) - [j35]Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid:
The Minimum Moving Spanning Tree Problem. J. Graph Algorithms Appl. 27(1): 1-18 (2023) - [c41]Jean-Lou De Carufel, Paola Flocchini, Nicola Santoro, Frédéric Simard:
Cops & Robber on Periodic Temporal Graphs: Characterization and Improved Bounds. SIROCCO 2023: 386-405 - [i37]Jean-Lou De Carufel, Paola Flocchini, Nicola Santoro, Frédéric Simard:
Copnumbers of periodic graphs. CoRR abs/2310.13616 (2023) - [i36]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky:
On Separating Path and Tree Systems in Graphs. CoRR abs/2312.14295 (2023) - [i35]Prosenjit Bose, Jean-Lou De Carufel, Sandrine Njoo:
The Exact Spanning Ratio of the Parallelogram Delaunay Graph. CoRR abs/2312.14305 (2023) - 2022
- [j34]Jean-Lou De Carufel, Zachary Friggstad:
Preface. Comput. Geom. 101: 101776 (2022) - [c40]Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer:
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor. ISAAC 2022: 56:1-56:13 - [c39]Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer:
On the Zombie Number of Various Graph Classes. LATIN 2022: 527-543 - [i34]Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer:
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor. CoRR abs/2204.11926 (2022) - 2021
- [j33]Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel Smid:
On the Minimum Consistent Subset Problem. Algorithmica 83(7): 2273-2302 (2021) - [j32]Jean-Lou De Carufel, Tanvir Kaykobad:
Transforming plane triangulations by simultaneous diagonal flips. Inf. Process. Lett. 170: 106120 (2021) - [j31]Jean-Lou De Carufel, Prosenjit Bose, Frédérik Paradis, Vida Dujmovic:
Local routing in WSPD-based spanners. J. Comput. Geom. 12(1): 1-34 (2021) - [c38]Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira:
Constant Delay Lattice Train Schedules. CCCG 2021: 107-113 - [c37]Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid:
The Minimum Moving Spanning Tree Problem. WADS 2021: 15-28 - [i33]Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira:
Constant Delay Lattice Train Schedules. CoRR abs/2107.04657 (2021) - 2020
- [j30]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Optimal Art Gallery Localization is NP-hard. Comput. Geom. 88: 101607 (2020) - [j29]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
Minimizing the continuous diameter when augmenting a geometric tree with a shortcut. Comput. Geom. 89: 101631 (2020) - [j28]Jean-Lou De Carufel, Paola Flocchini:
Fault-induced dynamics of oblivious robots on a line. Inf. Comput. 271: 104478 (2020) - [j27]Prosenjit Bose, Jean-Lou De Carufel, Olivier Devillers:
Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ Graphs. J. Comput. Geom. 11(1): 212-234 (2020) - [j26]Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex polygons in cartesian products. J. Comput. Geom. 11(2): 205-233 (2020)
2010 – 2019
- 2019
- [j25]Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid:
Maximum Plane Trees in Multipartite Geometric Graphs. Algorithmica 81(4): 1512-1534 (2019) - [c36]Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex Polygons in Cartesian Products. SoCG 2019: 22:1-22:17 - [c35]Elena Arseneva, Prosenjit Bose, Jean-Lou De Carufel, Sander Verdonschot:
Reconstructing a Convex Polygon from Its \omega ω -cloud. CSR 2019: 25-37 - [c34]Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, Michiel H. M. Smid:
On the Spanning and Routing Ratio of Theta-Four. SODA 2019: 2361-2370 - [c33]Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid:
On the Minimum Consistent Subset Problem. WADS 2019: 155-167 - [e1]Zachary Friggstad, Jean-Lou De Carufel:
Proceedings of the 31st Canadian Conference on Computational Geometry, CCCG 2019, August 8-10, 2019, University of Alberta, Edmonton, Alberta, Canada. 2019 [contents] - [i32]Prosenjit Bose, Jean-Lou De Carufel, Olivier Devillers:
Expected Complexity of Routing in $Θ$ 6 and Half-$Θ$ 6 Graphs. CoRR abs/1910.14289 (2019) - 2018
- [j24]Davood Bakhshesh, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, Mohammad Farshi, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Continuous Yao graphs. Comput. Geom. 67: 42-52 (2018) - [j23]Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn:
The geodesic 2-center problem in a simple polygon. Comput. Geom. 74: 21-37 (2018) - [j22]Prosenjit Bose, Jean-Lou De Carufel, André van Renssen:
Constrained generalized Delaunay graphs are plane spanners. Comput. Geom. 74: 50-65 (2018) - [c32]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel H. M. Smid:
Improved Routing on the Delaunay Triangulation. ESA 2018: 22:1-22:13 - [i31]Prosenjit Bose, Jean-Lou De Carufel, Elena Khramtcova, Sander Verdonschot:
Reconstructing a convex polygon from its ω-cloud. CoRR abs/1801.02162 (2018) - [i30]Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, Michiel H. M. Smid:
On the Spanning and Routing Ratio of Theta-Four. CoRR abs/1808.01298 (2018) - [i29]Ahmad Biniaz, Sergio Cabello, Anil Maheshwari, Paz Carmi, Saeed Mehrabi, Jean-Lou De Carufel, Michiel H. M. Smid:
On the Minimum Consistent Subset Problem. CoRR abs/1810.09232 (2018) - [i28]Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex Polygons in Cartesian Products. CoRR abs/1812.11332 (2018) - 2017
- [j21]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen:
Upper and Lower Bounds for Online Routing on Delaunay Triangulations. Discret. Comput. Geom. 58(2): 482-504 (2017) - [j20]Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher, Perouz Taslakian:
Competitive Online Routing on Delaunay Triangulations. Int. J. Comput. Geom. Appl. 27(4): 241-254 (2017) - [j19]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Essential Constraints of Edge-Constrained Proximity Graphs. J. Graph Algorithms Appl. 21(4): 389-415 (2017) - [j18]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards plane spanners of degree 3. J. Comput. Geom. 8(1): 11-31 (2017) - [j17]Jean-Lou De Carufel, Matthew J. Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky:
On interference among moving sensors and related problems. J. Comput. Geom. 8(1): 32-46 (2017) - [j16]Prosenjit Bose, Jean-Lou De Carufel:
A general framework for searching on a line. Theor. Comput. Sci. 703: 1-17 (2017) - [c31]Jean-Lou De Carufel, Paola Flocchini:
Fault-Induced Dynamics of Oblivious Robots on a Line. SSS 2017: 126-141 - [c30]Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid:
Maximum Plane Trees in Multipartite Geometric Graphs. WADS 2017: 193-204 - [c29]Prosenjit Bose, Jean-Lou De Carufel, Vida Dujmovic, Frédérik Paradis:
Local Routing in Spanners Based on WSPDs. WADS 2017: 205-216 - [c28]Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid:
Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut. WADS 2017: 301-312 - [i27]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Art Gallery Localization. CoRR abs/1706.06938 (2017) - [i26]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Optimal Art Gallery Localization is NP-hard. CoRR abs/1706.08016 (2017) - [i25]Jean-Lou De Carufel, Paola Flocchini:
Fault-Induced Dynamics of Oblivious Robots on a Line. CoRR abs/1707.03492 (2017) - [i24]Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn:
The Geodesic 2-center Problem in a Simple Polygon. CoRR abs/1710.09035 (2017) - 2016
- [j15]Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
Discrete Voronoi games and ϵ-nets, in two and three dimensions. Comput. Geom. 55: 41-58 (2016) - [j14]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Probing convex polygons with a wedge. Comput. Geom. 58: 34-59 (2016) - [j13]Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh:
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. Discret. Comput. Geom. 56(4): 836-859 (2016) - [j12]Michiel H. M. Smid, Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu:
On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere. J. Comput. Geom. 7(1): 444-472 (2016) - [j11]Ahmad Biniaz, Mahdi Amani, Anil Maheshwari, Michiel H. M. Smid, Prosenjit Bose, Jean-Lou De Carufel:
A plane 1.88-spanner for points in convex position. J. Comput. Geom. 7(1): 520-539 (2016) - [j10]Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot:
Towards tight bounds on theta-graphs: More is not always better. Theor. Comput. Sci. 616: 70-93 (2016) - [c27]Jean-Lou De Carufel, Matthew J. Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky:
On Interference Among Moving Sensors and Related Problems. ESA 2016: 34:1-34:11 - [c26]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards Plane Spanners of Degree 3. ISAAC 2016: 19:1-19:14 - [c25]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Essential Constraints of Edge-Constrained Proximity Graphs. IWOCA 2016: 55-67 - [c24]Mahdi Amani, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
A Plane 1.88-Spanner for Points in Convex Position. SWAT 2016: 25:1-25:14 - [c23]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts. SWAT 2016: 27:1-27:14 - [c22]Prosenjit Bose, Jean-Lou De Carufel:
A General Framework for Searching on a Line. WALCOM 2016: 143-153 - [i23]Prosenjit Bose, Jean-Lou De Carufel, André van Renssen:
Constrained Generalized Delaunay Graphs Are Plane Spanners. CoRR abs/1602.07365 (2016) - [i22]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards Plane Spanners of Degree 3. CoRR abs/1606.08824 (2016) - [i21]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Essential Constraints of Edge-Constrained Proximity Graphs. CoRR abs/1607.01294 (2016) - [i20]Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid:
Minimizing the Continuous Diameter when Augmenting a Tree with a Shortcut. CoRR abs/1612.01370 (2016) - 2015
- [j9]Greg Aloupis, Luis Barba, Jean-Lou De Carufel, Stefan Langerman, Diane L. Souvaine:
Isoperimetric Enclosures. Graphs Comb. 31(2): 361-392 (2015) - [j8]Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. J. Graph Algorithms Appl. 19(1): 11-41 (2015) - [j7]Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher:
Searching on a line: A complete characterization of the optimal solution. Theor. Comput. Sci. 569: 24-42 (2015) - [c21]Prosenjit Bose, Jean-Lou De Carufel, André van Renssen:
Constrained Empty-Rectangle Delaunay Graphs. CCCG 2015 - [c20]Giovanni Viglietta, Prosenjit Bose, Jean-Lou De Carufel, Michael Gene Dobbins, Heuna Kim:
The Shadows of a Cycle Cannot All Be Paths. CCCG 2015 - [c19]Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh:
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. SoCG 2015: 209-223 - [c18]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen:
Upper and Lower Bounds for Online Routing on Delaunay Triangulations. ESA 2015: 203-214 - [c17]Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn:
The 2-Center Problem in a Simple Polygon. ISAAC 2015: 307-317 - [i19]Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh:
A linear-time algorithm for the geodesic center of a simple polygon. CoRR abs/1501.00561 (2015) - [i18]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen:
Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations. CoRR abs/1501.01783 (2015) - [i17]Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
Discrete Voronoi Games and ε-Nets, in Two and Three Dimensions. CoRR abs/1501.04843 (2015) - [i16]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Probing Convex Polygons with a Wedge. CoRR abs/1506.02572 (2015) - [i15]Jean-Lou De Carufel, Matya Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky:
On Kinetic Range Spaces and their Applications. CoRR abs/1507.02130 (2015) - [i14]Prosenjit Bose, Jean-Lou De Carufel, Michael Gene Dobbins, Heuna Kim, Giovanni Viglietta:
The Shadows of a Cycle Cannot All Be Paths. CoRR abs/1507.02355 (2015) - [i13]Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu, Michiel H. M. Smid:
On the Stretch Factor of Convex Polyhedra whose Vertices are (Almost) on a Sphere. CoRR abs/1507.06856 (2015) - [i12]Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang:
Weight Balancing on Boundaries and Skeletons. CoRR abs/1511.04123 (2015) - [i11]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts. CoRR abs/1512.02257 (2015) - 2014
- [j6]Prosenjit Bose, Jean-Lou De Carufel:
Minimum-area enclosing triangle with a fixed angle. Comput. Geom. 47(1): 90-109 (2014) - [j5]Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Similarity of polygonal curves in the presence of outliers. Comput. Geom. 47(5): 625-641 (2014) - [j4]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid:
A note on the unsolvability of the weighted region shortest path problem. Comput. Geom. 47(7): 724-727 (2014) - [c16]Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
Voronoi Games and Epsilon Nets. CCCG 2014 - [c15]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Continuous Yao Graphs. CCCG 2014 - [c14]Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang:
Weight Balancing on Boundaries and Skeletons. SoCG 2014: 436 - [c13]Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher, Perouz Taslakian:
Competitive Online Routing on Delaunay Triangulations. SWAT 2014: 98-109 - [i10]Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot:
Towards Tight Bounds on Theta-Graphs. CoRR abs/1404.6233 (2014) - [i9]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Continuous Yao Graphs. CoRR abs/1408.4099 (2014) - [i8]Prosenjit Bose, Jean-Lou De Carufel:
Towards a General Framework for Searching on a Line and Searching on $m$ Rays. CoRR abs/1408.6812 (2014) - [i7]Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. CoRR abs/1411.1879 (2014) - 2013
- [j3]Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
Network Farthest-Point Diagrams. J. Comput. Geom. 4(1): 182-211 (2013) - [c12]Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. CCCG 2013 - [c11]Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher:
Revisiting the Problem of Searching on a Line. ESA 2013: 205-216 - [c10]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, André van Renssen, Sander Verdonschot:
On the Stretch Factor of the Theta-4 Graph. WADS 2013: 109-120 - [i6]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, André van Renssen, Sander Verdonschot:
On the stretch factor of the Theta-4 graph. CoRR abs/1303.5473 (2013) - [i5]Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
Network Farthest-Point Diagrams. CoRR abs/1304.1909 (2013) - [i4]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid:
A Note on the Unsolvability of the Weighted Region Shortest Path Problem. CoRR abs/1305.5209 (2013) - [i3]Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher:
Revisiting the Problem of Searching on a Line. CoRR abs/1310.1048 (2013) - 2012
- [c9]Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
On Farthest-Point Information in Networks. CCCG 2012: 199-204 - [c8]Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot:
Optimal Bounds on Theta-Graphs: More is not Always Better. CCCG 2012: 291-296 - [i2]Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Similarity of Polygonal Curves in the Presence of Outliers. CoRR abs/1212.1617 (2012) - 2011
- [c7]Prosenjit Bose, Jean-Lou De Carufel:
Isoperimetric Triangular Enclosure with a Fixed Angle. CCCG 2011 - [c6]Jean-Lou De Carufel, Craig Dillabaugh, Anil Maheshwari:
Point Location in Well-Shaped Meshes Using Jump-and-Walk. CCCG 2011 - [c5]Jean-Lou De Carufel, Robert Laganière:
Matching cylindrical panorama sequences using planar reprojections. ICCV Workshops 2011: 320-327 - 2010
- [j2]Jean-Lou De Carufel, Jules Desharnais:
Abstract representation theorems for demonic refinement algebras. J. Log. Algebraic Methods Program. 79(8): 740-767 (2010) - [c4]Prosenjit Bose, Jean-Lou De Carufel:
Minimum enclosing area triangle with a fixed angle. CCCG 2010: 171-174 - [i1]Prosenjit Bose, Jean-Lou De Carufel:
Minimum Enclosing Area Triangle with a Fixed Angle. CoRR abs/1009.3006 (2010)
2000 – 2009
- 2008
- [c3]Jean-Lou De Carufel, Jules Desharnais:
Latest News about Demonic Algebra with Domain. RelMiCS 2008: 54-68 - [c2]Jean-Lou De Carufel, Jules Desharnais:
On the Structure of Demonic Refinement Algebras with Enabledness and Termination. RelMiCS 2008: 69-83 - 2006
- [c1]Jean-Lou De Carufel, Jules Desharnais:
Demonic Algebra with Domain. RelMiCS 2006: 120-134 - 2003
- [j1]Jean-Lou De Carufel:
A few identities involving partitions with a fixed number of parts. Ars Comb. 68 (2003)
Coauthor Index
aka: Michiel Smid
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint