Research

My work mainly focuses on graph theory and distributed algorithms, with a particular interest in implicit representations, graphs on surfaces, and mobile agents.

DBLP profile

Publications

2026

With Stéphane Devismes and Yoann Dieudonné: Graph Exploration: The Impact of a Distance Constraint. Algorithmica 88(2): 24.
With Stéphane Devismes and Yoann Dieudonné: Can Like Attract Like? A Study of Homonymous Gathering in Networks. STOC 2026: 933-942.

2025

With Stéphane Devismes and Yoann Dieudonné: Graph Exploration: The Impact of a Distance Constraint. ICALP 2025: 68:1-68:18.

2023

With Sébastien Bouchard, Yoann Dieudonné and Andrzej Pelc: Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs. ACM Transactions on Algorithms 19(3): 22:1-22:32.

2022

With Victor Chepoi and Sébastien Ratel: Distance Labeling Schemes for K4-Free Bridged Graphs. Information and Computation 289: 104959.
With Sébastien Bouchard and Andrzej Pelc: Impact of Knowledge on the Cost of Treasure Hunt in Trees. Networks 80(1): 51-62.
With Arnaud Casteigts, Timothee Corsini and Herve Hocquard: Robustness of Distances and Diameter in a Fragile Network. SAND 2022: 9:1-9:16.

2021

With Victor Chepoi and Sébastien Ratel: Distance and Routing Labeling Schemes for Cube-Free Median Graphs. Algorithmica 83(1): 252-296.
With Jeremie Chalopin, Shantanu Das, Yann Disser and Matus Mihalak: Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents. Theoretical Computer Science 868: 87-96.
With Sébastien Bouchard, Yoann Dieudonné and Andrzej Pelc: Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. ICALP 2021: 36:1-36:20.

2020

With Victor Chepoi and Sébastien Ratel: On Density of Subgraphs of Cartesian Products. Journal of Graph Theory 93(1): 64-87.
With Andreas Bartschi, Jeremie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf and Matus Mihalak: Collaborative Delivery with Energy-Constrained Mobile Robots. Theoretical Computer Science 810: 2-14.
With Victor Chepoi and Sébastien Ratel: Distance Labeling Schemes for K4-Free Bridged Graphs. SIROCCO 2020: 310-327.

2019

With Victor Chepoi and Sébastien Ratel: On Density of Subgraphs of Halved Cubes. European Journal of Combinatorics 80: 57-70.
With Evangelos Bampas, Lelia Blin, Jurek Czyzowicz, David Ilcinkas, Maria Potop-Butucaru and Sébastien Tixeuil: On Asynchronous Rendezvous in General Graphs. Theoretical Computer Science 753: 80-90.
With Jurek Czyzowicz, Maxime Godon and Evangelos Kranakis: Group Search of the Plane with Faulty Robots. Theoretical Computer Science 792: 69-84.
With Victor Chepoi and Sébastien Ratel: Distance Labeling Schemes for Cube-Free Median Graphs. MFCS 2019: 15:1-15:14.
With Jeremie Chalopin, Shantanu Das, Yann Disser and Matus Mihalak: Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents. SIROCCO 2019: 139-153.

2018

With Jurek Czyzowicz, Maxime Godon, Evangelos Kranakis and Euripides Markou: Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots. SOFSEM 2018: 381-395.

2016

With Julian Anaya, Jeremie Chalopin, Jurek Czyzowicz, Andrzej Pelc and Yann Vaxes: Convergecast and Broadcast by Power-Aware Mobile Agents. Algorithmica 74(1): 117-155.
With Louis Esperet and Daniel Goncalves: Coloring Non-Crossing Strings. Electronic Journal of Combinatorics 23(4): P4.4.
With Jeremie Chalopin, Yoann Dieudonné and Andrzej Pelc: Rendezvous in Networks in Spite of Delay Faults. Distributed Computing 29(3): 187-205.
With Andreas Bartschi, Jeremie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf and Matus Mihalak: Collaborative Delivery with Energy-Constrained Mobile Robots. SIROCCO 2016: 258-274.

2015

With Jeremie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski and Przemyslaw Uznanski: Limit Behavior of the Multi-agent Rotor-Router System. DISC 2015: 123-139.

2014

With Jeremie Chalopin, Yoann Dieudonné and Andrzej Pelc: Fault-Tolerant Rendezvous in Networks. ICALP 2014: 411-422.

2013

With Jurek Czyzowicz, David Ilcinkas and Andrzej Pelc: Worst-case Optimal Exploration of Terrains with Obstacles. Information and Computation 225: 16-28.
With Bostjan Bresar, Jeremie Chalopin, Victor Chepoi, Matjaz Kovse and Yann Vaxes: Retracts of Products of Chordal Graphs. Journal of Graph Theory 73(2): 161-180.
With Jeremie Chalopin, Shantanu Das and Euripides Markou: Tight bounds for black hole search with scattered agents in synchronous rings. Theoretical Computer Science 509: 70-85.

2012

With Jurek Czyzowicz and Andrzej Pelc: How to Meet Asynchronously (Almost) Everywhere. ACM Transactions on Algorithms 8(4): 37:1-37:14.
With Julian Anaya, Jeremie Chalopin, Jurek Czyzowicz, Andrzej Pelc and Yann Vaxes: Collecting Information by Power-Aware Mobile Agents. DISC 2012: 46-60.

2011

With Jurek Czyzowicz, David Ilcinkas and Andrzej Pelc: Asynchronous Deterministic Rendezvous in Bounded Terrains. Theoretical Computer Science 412(50): 6926-6937.
With Jurek Czyzowicz and Andrzej Pelc: Optimality and Competitiveness of Exploring Polygons by Mobile Robots. Information and Computation 209(1): 74-88.
With Jeremie Chalopin, Shantanu Das and Euripides Markou: Tight Bounds for Scattered Black Hole Search in a Ring. SIROCCO 2011: 186-197.
With Jeremie Chalopin, Shantanu Das and Euripides Markou: Black Hole Search with Finite Automata Scattered in a Synchronous Torus. DISC 2011: 432-446.

2010

With Andrew Collins, Jurek Czyzowicz and Leszek Gasieniec: Tell Me Where I Am So I Can Meet You Sooner. ICALP (2) 2010: 502-514.
With Jurek Czyzowicz, David Ilcinkas and Andrzej Pelc: Asynchronous Deterministic Rendezvous in Bounded Terrains. SIROCCO 2010: 72-85.
With Jurek Czyzowicz, Arnaud Labourel and Andrzej Pelc: How to Meet Asynchronously (Almost) Everywhere. SODA 2010: 22-30.
With Jurek Czyzowicz, David Ilcinkas and Andrzej Pelc: Optimal Exploration of Terrains with Obstacles. SWAT 2010: 1-12.
With Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas and Arnaud Labourel: Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. DISC 2010: 297-311.

2009

With Louis Esperet and Daniel Goncalves: Coloring a Set of Touching Strings. Electronic Notes in Discrete Mathematics 34: 213-217.
With Jurek Czyzowicz and Andrzej Pelc: Optimality and Competitiveness of Exploring Polygons by Mobile Robots. ESA 2009: 263-274.

2008

On Universal Graphs of Minor Closed Families. Electronic Notes in Discrete Mathematics 31: 85-89.
With Louis Esperet and Pascal Ochem: On Induced-Universal Graphs for the Class of Bounded-Degree Graphs. Information Processing Letters 108(5): 255-260.

2007

With Cyril Gavoille: Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs. ESA 2007: 582-593.
With Nicolas Bonichon and Cyril Gavoille: Short Labels by Traversal and Jumping. Electronic Notes in Discrete Mathematics 28: 153-160.
With Cyril Gavoille: Distributed Relationship Schemes for Trees. ISAAC 2007: 728-738.
With Cyril Gavoille: On local representation of distances in trees. PODC 2007: 352-353.

2006

With Nicolas Bonichon and Cyril Gavoille: Short Labels by Traversal and Jumping. SIROCCO 2006: 143-156.

2005

With Nicolas Bonichon and Cyril Gavoille: Edge Partition of Toroidal Graphs into Forests in Linear Time. Electronic Notes in Discrete Mathematics 22: 421-425.

Conferences

STOC 2026, Salt Lake City, United States.
ICALP 2014, Copenhagen, Denmark.
DISC 2012, Salvador, Brazil.
DISC 2011, Rome, Italy.
SIROCCO 2010, Sirince, Turkey.
SODA 2010, Austin, USA.
ESA 2009, Copenhagen, Denmark.
TGGT 2008, Paris, France.
ESA 2007, Eilat, Israel.
PODC 2007, Portland, USA.
SIROCCO 2006, Chester, United Kingdom.
ICGT 2005, Hyères, France.

Seminars

Distributed Algorithms working group at LaBRI, Bordeaux, June 2010.
Fifth ANR ALADDIN project meeting, Aussois, April 2010.
MoVe team seminar at LIF, Marseille, March 2010.
LIAFA seminar, Paris, February 2010.
LIFO seminar, Orléans, December 2009.
Graphs and algorithms workshop, Montpellier, November 2009.
ANR GéoCOMP meeting at LIX, Paris, May 2006.
Graphes & Applications working group at LaBRI, Bordeaux, November 2004.