A few identities involving partitions with a fixed number of parts. - Jean-Lou De Carufel (Ars Comb., 2003)

Demonic Algebra with Domain. - Jean-Lou De Carufel; Jules Desharnais (RelMiCS, 2006)

Latest News about Demonic Algebra with Domain. - Jean-Lou De Carufel; Jules Desharnais (RelMiCS, 2008)

On the Structure of Demonic Refinement Algebras with Enabledness and Termination. - Jean-Lou De Carufel; Jules Desharnais (RelMiCS, 2008)

Minimum enclosing area triangle with a fixed angle. - Prosenjit Bose; Jean-Lou De Carufel (CCCG, 2010)

Abstract representation theorems for demonic refinement algebras. - Jean-Lou De Carufel; Jules Desharnais (J. Log. Algebraic Methods Program., 2010)

Isoperimetric Triangular Enclosure with a Fixed Angle. - Prosenjit Bose; Jean-Lou De Carufel (CCCG, 2011)

Point Location in Well-Shaped Meshes Using Jump-and-Walk. - Jean-Lou De Carufel; Craig Dillabaugh; Anil Maheshwari (CCCG, 2011)

Matching cylindrical panorama sequences using planar reprojections. - Jean-Lou De Carufel; Robert Laganière (ICCV Workshops, 2011)

On Farthest-Point Information in Networks. - Prosenjit Bose; Jean-Lou De Carufel; Carsten Grimm; Anil Maheshwari; Michiel H. M. Smid (CCCG, 2012)

Optimal Bounds on Theta-Graphs: More is not Always Better. - Prosenjit Bose; Jean-Lou De Carufel; Pat Morin; André van Renssen; Sander Verdonschot (CCCG, 2012)

Revisiting the Problem of Searching on a Line. - Prosenjit Bose; Jean-Lou De Carufel; Stephane Durocher (ESA, 2013)

On the Stretch Factor of the Theta-4 Graph. - Luis Barba; Prosenjit Bose; Jean-Lou De Carufel; André van Renssen; Sander Verdonschot (WADS, 2013)

Network Farthest-Point Diagrams. - Prosenjit Bose; Kai Dannies; Jean-Lou De Carufel; Christoph Doell; Carsten Grimm; Anil Maheshwari; Stefan Schirra; Michiel H. M. Smid (J. Comput. Geom., 2013)

Voronoi Games and Epsilon Nets. - Aritra Banik; Jean-Lou De Carufel; Anil Maheshwari; Michiel H. M. Smid (CCCG, 2014)

Continuous Yao Graphs. - Luis Barba; Prosenjit Bose; Jean-Lou De Carufel; Mirela Damian; Rolf Fagerberg; André van Renssen; Perouz Taslakian; Sander Verdonschot (CCCG, 2014)

Weight Balancing on Boundaries and Skeletons. - 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; et al. (SoCG, 2014)

Minimum-area enclosing triangle with a fixed angle. - Prosenjit Bose; Jean-Lou De Carufel (Comput. Geom., 2014)

A note on the unsolvability of the weighted region shortest path problem. - Jean-Lou De Carufel; Carsten Grimm; Anil Maheshwari; Megan Owen; Michiel H. M. Smid (Comput. Geom., 2014)

Similarity of polygonal curves in the presence of outliers. - Jean-Lou De Carufel; Amin Gheibi; Anil Maheshwari; Jörg-Rüdiger Sack; Christian Scheffer (Comput. Geom., 2014)

Towards a General Framework for Searching on a Line and Searching on $m$ Rays. - Prosenjit Bose; Jean-Lou De Carufel (CoRR, 2014)

Towards Tight Bounds on Theta-Graphs. - Prosenjit Bose; Jean-Lou De Carufel; Pat Morin; André van Renssen; Sander Verdonschot (CoRR, 2014)

Constrained Empty-Rectangle Delaunay Graphs. - Prosenjit Bose; Jean-Lou De Carufel; André van Renssen (CCCG, 2015)

The Shadows of a Cycle Cannot All Be Paths. - Giovanni Viglietta; Prosenjit Bose; Jean-Lou De Carufel; Michael Gene Dobbins; Heuna Kim (CCCG, 2015)

The 2-Center Problem in a Simple Polygon. - Eunjin Oh 001; Jean-Lou De Carufel; Hee-Kap Ahn (ISAAC, 2015)

Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations. - Nicolas Bonichon; Prosenjit Bose; Jean-Lou De Carufel; Ljubomir Perkovic; André van Renssen (CoRR, 2015)

On Kinetic Range Spaces and their Applications. - Jean-Lou De Carufel; Matya Katz; Matias Korman; André van Renssen; Marcel Roeloffzen; Shakhar Smorodinsky (CoRR, 2015)

Isoperimetric Enclosures. - Greg Aloupis; Luis Barba; Jean-Lou De Carufel; Stefan Langerman; Diane L. Souvaine (Graphs Comb., 2015)

Optimal Data Structures for Farthest-Point Queries in Cactus Networks. - Prosenjit Bose; Jean-Lou De Carufel; Carsten Grimm; Anil Maheshwari; Michiel H. M. Smid (J. Graph Algorithms Appl., 2015)

Searching on a line: A complete characterization of the optimal solution. - Prosenjit Bose; Jean-Lou De Carufel; Stephane Durocher (Theor. Comput. Sci., 2015)

Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts. - Jean-Lou De Carufel; Carsten Grimm; Anil Maheshwari; Michiel H. M. Smid (SWAT, 2016)

Discrete Voronoi games and ϵ-nets, in two and three dimensions. - Aritra Banik; Jean-Lou De Carufel; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2016)

Probing convex polygons with a wedge. - Prosenjit Bose; Jean-Lou De Carufel; Alina Shaikhet; Michiel H. M. Smid (Comput. Geom., 2016)

A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. - Hee-Kap Ahn; Luis Barba; Prosenjit Bose; Jean-Lou De Carufel; Matias Korman; Eunjin Oh 001 (Discret. Comput. Geom., 2016)

A plane 1.88-spanner for points in convex position. - Ahmad Biniaz; Mahdi Amani; Anil Maheshwari; Michiel H. M. Smid; Prosenjit Bose; Jean-Lou De Carufel (J. Comput. Geom., 2016)

On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere. - Michiel H. M. Smid; Prosenjit Bose; Paz Carmi; Mirela Damian; Jean-Lou De Carufel; Darryl Hill; Anil Maheshwari; Yuyang Liu (J. Comput. Geom., 2016)

Towards tight bounds on theta-graphs: More is not always better. - Prosenjit Bose; Jean-Lou De Carufel; Pat Morin; André van Renssen; Sander Verdonschot (Theor. Comput. Sci., 2016)

Local Routing in Spanners Based on WSPDs. - Prosenjit Bose; Jean-Lou De Carufel; Vida Dujmovic; Frédérik Paradis (WADS, 2017)

Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut. - Jean-Lou De Carufel; Carsten Grimm; Stefan Schirra; Michiel H. M. Smid (WADS, 2017)

Art Gallery Localization. - Prosenjit Bose; Jean-Lou De Carufel; Alina Shaikhet; Michiel H. M. Smid (CoRR, 2017)

Upper and Lower Bounds for Online Routing on Delaunay Triangulations. - Nicolas Bonichon; Prosenjit Bose; Jean-Lou De Carufel; Ljubomir Perkovic; André van Renssen (Discret. Comput. Geom., 2017)

Competitive Online Routing on Delaunay Triangulations. - Prosenjit Bose; Jean-Lou De Carufel; Stephane Durocher; Perouz Taslakian (Int. J. Comput. Geom. Appl., 2017)

Essential Constraints of Edge-Constrained Proximity Graphs. - Prosenjit Bose; Jean-Lou De Carufel; Alina Shaikhet; Michiel H. M. Smid (J. Graph Algorithms Appl., 2017)

Towards plane spanners of degree 3. - Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Cyril Gavoille; Anil Maheshwari; Michiel H. M. Smid (J. Comput. Geom., 2017)

On interference among moving sensors and related problems. - Jean-Lou De Carufel; Matthew J. Katz; Matias Korman; André van Renssen; Marcel Roeloffzen; Shakhar Smorodinsky (J. Comput. Geom., 2017)

A general framework for searching on a line. - Prosenjit Bose; Jean-Lou De Carufel (Theor. Comput. Sci., 2017)

Continuous Yao graphs. - Davood Bakhshesh; Luis Barba; Prosenjit Bose; Jean-Lou De Carufel; Mirela Damian; Rolf Fagerberg; Mohammad Farshi; André van Renssen; Perouz Taslakian; Sander Verdonschot (Comput. Geom., 2018)

Constrained generalized Delaunay graphs are plane spanners. - Prosenjit Bose; Jean-Lou De Carufel; André van Renssen (Comput. Geom., 2018)

The geodesic 2-center problem in a simple polygon. - Eunjin Oh 001; Jean-Lou De Carufel; Hee-Kap Ahn (Comput. Geom., 2018)

Reconstructing a convex polygon from its ω-cloud. - Prosenjit Bose; Jean-Lou De Carufel; Elena Khramtcova; Sander Verdonschot (CoRR, 2018)

Reconstructing a Convex Polygon from Its omega ω -cloud. - Elena Arseneva; Prosenjit Bose; Jean-Lou De Carufel; Sander Verdonschot (CSR, 2019)

On the Spanning and Routing Ratio of Theta-Four. - Prosenjit Bose; Jean-Lou De Carufel; Darryl Hill; Michiel H. M. Smid (SODA, 2019)

Maximum Plane Trees in Multipartite Geometric Graphs. - Ahmad Biniaz; Prosenjit Bose; Kimberly Crosbie; Jean-Lou De Carufel; David Eppstein; Anil Maheshwari; Michiel H. M. Smid (Algorithmica, 2019)

Expected Complexity of Routing in $Θ$ 6 and Half-$Θ$ 6 Graphs. - Prosenjit Bose; Jean-Lou De Carufel; Olivier Devillers (CoRR, 2019)

Optimal Art Gallery Localization is NP-hard. - Prosenjit Bose; Jean-Lou De Carufel; Alina Shaikhet; Michiel H. M. Smid (Comput. Geom., 2020)

Minimizing the continuous diameter when augmenting a geometric tree with a shortcut. - Jean-Lou De Carufel; Carsten Grimm; Anil Maheshwari; Stefan Schirra; Michiel H. M. Smid (Comput. Geom., 2020)

Fault-induced dynamics of oblivious robots on a line. - Jean-Lou De Carufel; Paola Flocchini (Inf. Comput., 2020)

Expected Complexity of Routing in $ Theta_6$ and Half-$ Theta_6$ Graphs. - Prosenjit Bose; Jean-Lou De Carufel; Olivier Devillers (J. Comput. Geom., 2020)

Convex polygons in cartesian products. - Jean-Lou De Carufel; Adrian Dumitrescu; Wouter Meulemans; Tim Ophelders; Claire Pennarun; Csaba D. Tóth; Sander Verdonschot (J. Comput. Geom., 2020)

On the Minimum Consistent Subset Problem. - Ahmad Biniaz; Sergio Cabello; Paz Carmi; Jean-Lou De Carufel; Anil Maheshwari; Saeed Mehrabi 001; Michiel Smid (Algorithmica, 2021)

Transforming plane triangulations by simultaneous diagonal flips. - Jean-Lou De Carufel; Tanvir Kaykobad (Inf. Process. Lett., 2021)

Local routing in WSPD-based spanners. - Jean-Lou De Carufel; Prosenjit Bose; Frédérik Paradis; Vida Dujmovic (J. Comput. Geom., 2021)

On the Zombie Number of Various Graph Classes. - Prosenjit Bose; Jean-Lou De Carufel; Thomas C. Shermer (LATIN, 2022)

Preface. - Jean-Lou De Carufel; Zachary Friggstad (Comput. Geom., 2022)

Cops & Robber on Periodic Temporal Graphs: Characterization and Improved Bounds. - Jean-Lou De Carufel; Paola Flocchini; Nicola Santoro; Frédéric Simard (SIROCCO, 2023)

Copnumbers of periodic graphs. - Jean-Lou De Carufel; Paola Flocchini; Nicola Santoro; Frédéric Simard (CoRR, 2023)

The Minimum Moving Spanning Tree Problem. - Hugo A. Akitaya; Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Anil Maheshwari; Luís Fernando Schultz Xavier da Silveira; Michiel Smid (J. Graph Algorithms Appl., 2023)

Improved Routing on the Delaunay Triangulation. - Nicolas Bonichon; Prosenjit Bose; Jean-Lou De Carufel; Vincent Despré; Darryl Hill; Michiel Smid (Discret. Comput. Geom., 2023)

Constant delay lattice train schedules. - Jean-Lou De Carufel; Darryl Hill; Anil Maheshwari; Sasanka Roy; Luís Fernando Schultz Xavier da Silveira (Discret. Appl. Math., 2023)

Computing shortest paths amid non-overlapping weighted disks. - Prosenjit Bose; Jean-Lou De Carufel; Guillermo Esteban; Anil Maheshwari (CCCG, 2024)

The Exact Routing and Spanning Ratio of arbitrary triangle Delaunay graphs. - John Stuart; Jean-Lou De Carufel; Prosenjit Bose (CCCG, 2024)

Noncrossing Longest Paths and Cycles. - Greg Aloupis; Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; David Eppstein; Anil Maheshwari; Saeed Odak; Michiel Smid; Csaba D. Tóth; Pavel Valtr 001 (GD, 2024)

Routing from Pentagon to Octagon Delaunay Graphs. - Prosenjit Bose; Jean-Lou De Carufel; John Stuart (ISAAC, 2024)

So Long Sucker: Endgame Analysis. - Jean-Lou De Carufel; Marie Rose Jerade (CoRR, 2024)

Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults. - Ahmad Biniaz; Jean-Lou De Carufel; Anil Maheshwari; Michiel Smid (CoRR, 2024)

Cops & Robber on Periodic Temporal Graphs. - Jean-Lou De Carufel; Paola Flocchini; Nicola Santoro; Frédéric Simard (CoRR, 2024)

On the Spanning and Routing Ratio of the Directed Theta-Four Graph. - Prosenjit Bose; Jean-Lou De Carufel; Darryl Hill; Michiel Smid (Discret. Comput. Geom., 2024)

Polychromatic Coloring of Tuples in Hypergraphs. - Ahmad Biniaz; Jean-Lou De Carufel; Anil Maheshwari; Michiel Smid; Shakhar Smorodinsky; Milos Stojakovic (SoCG, 2025)

Tight Bounds on the Number of Closest Pairs in Vertical Slabs. - Ahmad Biniaz; Prosenjit Bose; Chaeyoon Chung; Jean-Lou De Carufel; John Iacono; Anil Maheshwari; Saeed Odak; Michiel Smid; Csaba D. Tóth (WADS, 2025)

Online Routing in Directed Yao₄^∞ Graphs. - Prosenjit Bose; Jean-Lou De Carufel; John Stuart (WADS, 2025)

Pursuit-evasion in graphs: Zombies, lazy zombies and a survivor. - Prosenjit Bose; Jean-Lou De Carufel; Thomas C. Shermer (Discret. Math., 2025)

On Separating Path and Tree Systems in Graphs. - Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Anil Maheshwari; Babak Miraftab; Saeed Odak; Michiel Smid; Shakhar Smorodinsky; Yelena Yuditsky (Discret. Math. Theor. Comput. Sci., 2025)

On 1-planar graphs with bounded cop-number. - Prosenjit Bose; Jean-Lou De Carufel; Anil Maheshwari; Karthik Murali 001 (Theor. Comput. Sci., 2025)

The exact spanning ratio of the parallelogram Delaunay graph. - Prosenjit Bose; Jean-Lou De Carufel; Sandrine Njoo (Theor. Comput. Sci., 2025)

Deciding if a DAG is Interesting is Hard. - Jean-Lou De Carufel; Anil Maheshwari; Saeed Odak; Bodhayan Roy; Michiel Smid; Marc Vicuna (CoRR, 2025)

Tight Routing and Spanning Ratios of Arbitrary Triangle Delaunay Graphs. - Prosenjit Bose; Jean-Lou De Carufel; John Stuart (CoRR, 2025)

An Improved Bound for Plane Covering Paths. - Hugo A. Akitaya; Greg Aloupis; Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Cyril Gavoille; John Iacono; Linda Kleist; Michiel Smid; Diane L. Souvaine; Leonidas Theocharous (CoRR, 2025)