I am a senior researcher in Computer Science at LIS (previously LIF) in Marseille. I am a member of the DALGO research group.

Research Interests: distributed algorithms, mobile agent systems, metric graph theory

-- Publications --

• Boundary rigidity of finite CAT(0) cube complexes
  with Victor Chepoi,
  Journal of Combinatorial Theory, Series B, 169:352-366, 2024.
  

• ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G²-connected medians
  with Laurine Bénéteau, Victor Chepoi, and Yann Vaxès,
  Discrete Applied Mathematics, 359:55-74, 2024.
  

• First-order logic axiomatization of metric graph theory
  with Manoj Changat, Victor Chepoi, and Jeny Jacob
  Theoretical Computer Science, 993:114460, 2024.

• Sample compression schemes for balls in graphs
  with Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, and Yann Vaxès
  SIAM Journal on Discrete Mathematics, 37(4):2585-2616, 2023.

• Helly groups
  with Victor Chepoi, Anthony Genevois, Hiroshi Hirai, and Damian Osajda
  Geometry & Topology, 2023.

• Graphs with G^p-connected medians
  with Laurine Bénéteau, Victor Chepoi, and Yann Vaxès
  Mathematical Programming, 37(4):2585-2616, 2023.

• Graphs with convex balls
  with Victor Chepoi and Ugo Giocanti
  Geometriae Dedicata, 217(4):67, 2023.

• Unlabeled sample compression schemes and corner peelings for ample and maximum classes
  with Victor Chepoi, Shay Moran, and Manfred K. Warmuth
  Journal of Computer and System Sciences, 127:1-28, 2022.

• Medians in median graphs and their cube complexes in linear time
  with Laurine Bénéteau, Victor Chepoi, and Yann Vaxès
  Journal of Computer and System Sciences, 126:80-105, 2022.

• Fast approximation and exact computation of negative curvature parameters of graphs
  with Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, and Yann Vaxès
  Discrete and Computational Geometry, 65(3):856-892, 2021.

• Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents
  with Shantanu Das, Yann Disser, Arnaud Labourel, and Matús Mihalák
  Theoretical Computer Science 868:87--96, 2021.

• Near-Gathering of Energy-Constrained Mobile Agents
  with Andreas Bärtschi, Evangelos Bampas, Shantanu Das, Christina Karousatou, and Matús Mihalák
  Theoretical Computer Science, 849:35-46, 2021.

• A counterexample to Thiagarajan's conjecture on regular event structures
  with Victor Chepoi
  Journal of Computer and System Sciences, 113:76-100, 2020.

• Weakly modular graphs and nonpositive curvature
  with Victor Chepoi, Hiroshi Hirai, and Damian Osajda
  Memoirs of the American Mathematical Society, 268(1309), 2020.

• Collaborative Delivery with Energy-Constrained Mobile Robots
  with Andreas Bärtschi, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, and Matús Mihalák
  Theoretical Computer Science, 810:2-14, 2020.

• 1-Safe Petri nets and special cube complexes: equivalence and applications
  with Victor Chepoi
  ACM Transactions on Computational Logic, 20(3):17:1-17:49, 2019.

• Restricted frame graphs and a conjecture of Scott
  with Louis Esperet, Zhentao Li, and Patrice Ossona de Mendez
  The Electronic Journal of Combinatorics, 23(1):P1.30, 2016.

• Rendezvous in Networks in Spite of Delay Faults
  with Yoann Dieudonné, Arnaud Labourel, and Andrzej Pelc
  Distributed Computing, 29(3):187-205, 2016.

• Convergecast and Broadcast by Power-Aware Mobile Agents
  with Julian Anaya, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, and Yann Vaxès
  Algorithmica, 74(1):117-155, 2016.

• On two conjectures of Maurer concerning basis graphs of matroids
  with Victor Chepoi and Damian Osajda
  Journal of Combinatorial Theory, Series B, 114:1-32, 2015.

• Isometric Embedding of Busemann Surfaces into L1
  with Victor Chepoi and Guyslain Naves
  Discrete and Computational Geometry, 53(1):16-37, 2015.

• Mapping Simple Polygons: The Power of telling Convex from Reflex
  with Shantanu Das, Yann Disser, Matús Mihalák, and Peter Widmayer
  ACM Transactions on Algorithms, 11(4):33, 2015.

• Cop and Robber Game and Hyperbolicity
  with Victor Chepoi, Panos Papasoglu, and Timothée Pecatte
  SIAM Journal on Discrete Mathematics, 28(4):1987-2007, 2014.

• Packing Bipartite Graphs with Covers of Complete Bipartite Graphs
  with Daniël Paulusma
  Discrete Applied Mathematics, 168:40-50, 2014.

• Bucolic Complexes
  with Boštjan Brešar, Victor Chepoi, Tanja Gologranc, and Damian Osajda
  Advances in Mathematics, 243:127-167, 2013.

• Tight Bounds for Black Hole Search with Scattered Agents in Synchronous Rings
  with Shantanu Das, Arnaud Labourel, and Euripides Markou
  Theoretical Computer Science, 509:70-85, 2013.

• Simple agents learn to find their way: An introduction on mapping polygons
  with Shantanu Das, Yann Disser, Matús Mihalák, and Peter Widmayer
  Discrete Applied Mathematics, 161(10-11):1287-1307, 2013.

• Population Protocols that Correspond to Symmetric Games
  with Olivier Bournez, Johanne Cohen, Xavier Koegler, and Mikaël Rabie
  International Journal of Unconventionnal Computing, 9(1-2):5-36, 2013.

• Retracts of Products of Chordal Graphs
  with Boštjan Brešar, Victor Chepoi, Matjaž Kovše, Arnaud Labourel, and Yann Vaxès
  Journal of Graph Theory , 73(2):161-180, 2013.

• Mapping Simple Polygons: How Robots Benefit from Looking Back
  with Shantanu Das, Yann Disser, Matús Mihalák, and Peter Widmayer
  Algorithmica, 65(1):43-59, 2013.

• Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks
  with Yves Métivier and Thomas Morsellino
  Fundamenta Informaticae , 120(1):1-27, 2012.

• Election in Partially Anonymous Networks with Arbitrary Knowledge in Message Passing Systems
  with Emmanuel Godard and Yves Métivier
  Distributed Computing , 25(4):297-311, 2012.

• Cop and robber games when the robber can hide and ride
  with Victor Chepoi, Nicolas Nisse and Yann Vaxès
  SIAM Journal of Discrete Mathematics, 25(1):333-359, 2011.

• Graph labelings derived from models in distributed computing: a complete complexity classification
  with Daniël Paulusma
  Networks, 58(3):207-231, 2011.

• On the power of synchronization between two adjacent processes
  with Yves Métivier
  Distributed Computing 23(3):177-196, 2010.

• Planar graphs have 1-string representations
  with Daniel Gonçalves and Pascal Ochem
  Discrete and Computational Geometry 43(3):626-647, 2010.

• Dejean's conjecture and letter frequency
  with Pascal Ochem
  RAIRO-ITA 42(3):477-480, 2008.

• Election and rendezvous with incomparable labels
  Theoretical Computer Science 399(1-2):54-70, 2008.

• An efficient message passing election algorithm based on Mazurkiewicz's algorithm
  with Yves Métivier
  Fundamenta Informaticae 80(1-3):221-246 ,2007.

• Local computations in graphs: the case of cellular edge local computations
  with Yves Métivier and Wiesław Zielonka
  Fundamenta Informaticae 74(1):85-114, 2006.

• On factorization forests of finite height
  with Hing Leung
  Theoretical Computer Science 310(1-3):489-499, 2004.

• Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory
  with Shantanu Das and Maria Kokkou,
  DISC 2024, LIPIcs 319, 13:1-11:17.

• Non-Clashing Teaching Maps for Balls in Graphs
  with Victor Chepoi, Fionn Mc Inerney, and Sébastien Ratel,
  COLT 2024, PMLR 247, 840-875.

• Deterministic Leader Election for Stationary Programmable Matter with Common Direction
  with Shantanu Das and Maria Kokkou,
  SIROCCO 2024, LNCS 14662, 174-191.

• Isometric Path Complexity of Graphs
  with Dibyayan Chakraborty, Florent Foucaud, and Yann Vaxès
  MFCS 2023, LIPIcs 272, 32:1-32:14.

• Sample compression schemes for balls in graphs
  with Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, and Yann Vaxès
  MFCS 2022, LIPIcs 241, 31:1-31:14.

• Medians in median graphs and their cube complexes in linear time
  with Laurine Bénéteau, Victor Chepoi, and Yann Vaxès
  ICALP 2020, LIPIcs 168, 10:1-10:17.

• Unlabeled sample compression schemes and corner peelings for ample and maximum classes
  with Victor Chepoi, Shay Moran, and Manfred K. Warmuth
  ICALP 2019, LIPIcs 132, 34:1-34:15.

• Near-Gathering of Energy-Constrained Mobile Agents
  with Andreas Bärtschi, Evangelos Bampas, Shantanu Das, Christina Karousatou, and Matús Mihalák
  SIROCCO 2019, LNCS 11639, 52-65.

• Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents
  with Shantanu Das, Yann Disser, Arnaud Labourel, and Matús Mihalák
  SIROCCO 2019, LNCS 11639, 139-153.

• Fast approximation and exact computation of negative curvature parameters of graphs
  with Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, and Yann Vaxès
  SoCG 2018, LIPIcs 99, 22:1-22:15.

• A counterexample to Thiagarajan's conjecture on regular event structures
  with Victor Chepoi
  ICALP 2017, LIPIcs 80, 101:1-101:14.

• Energy-Efficient Delivery by Heterogeneous Mobile Agents (long version)
  with Andreas Bärtschi, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, and Paolo Penna
  STACS 2017, LIPIcs 66, 10:1-10:14.

• Collaborative Delivery with Energy-Constrained Mobile Robots
  with Andreas Bärtschi, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, and Matús Mihalák
  SIROCCO 2016, LNCS 9988, 258-274.

• Sequence Hypergraphs
  with Katerina Böhmová, Matús Mihalák, Guido Proietti, and Peter Widmayer
  WG 2016, LNCS 9941, 282-294.

• Anonymous Graph Exploration with Binoculars
  with Emmanuel Godard and Antoine Naudin
  DISC 2015, LNCS 9363, 107-122.

• Limit Behavior of the Multi-agent Rotor-Router System
  with Shantanu Das, Paweł Gawrychowski, Adrian Kosowski, Arnaud Labourel, and Przemysław Uznański
  DISC 2015, LNCS 9363, 123-139.

• Data Delivery by Energy-Constrained Mobile Agents on a Line
  with Riko Jacob, Matús Mihalák, and Peter Widmayer
  ICALP 2014, LNCS 8573, 423-434.

• Fault-Tolerant Rendezvous in Networks
  with Yoann Dieudonné, Arnaud Labourel, and Andrzej Pelc
  ICALP 2014, LNCS 8573, 411-422.

• What Do We Need to Know to Elect in Networks with Unknown Participants?
  with Emmanuel Godard and Antoine Naudin
  SIROCCO 2014, LNCS 8576, 279-294.

• Data Delivery by Energy-Constrained Mobile Agents
  with Shantanu Das, Matús Mihalák, Paolo Penna, and Peter Widmayer
  ALGOSENSORS 2013, LNCS 8243, 111-122.

• Collecting information by power-aware mobile agents
  with Julian Anaya, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, and Yann Vaxès
  DISC 2012, LNCS 7611, 48-62.

• On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems
  with Yves Métivier and Thomas Morsellino
  SIROCCO 2012, LNCS 7355, 207-218 .

• Computing with Pavlovian Populations
  with Olivier Bournez, Johanne Cohen, Xavier Koegler, and Mikaël Rabie
  OPODIS 2011, LNCS 7109, 411-420.

• Black Hole Search with Finite Automata Scattered in a Synchronous Torus
  with Shantanu Das, Arnaud Labourel, and Euripides Markou
  DISC 2011, LNCS 6950, 432-446.

• Tight bounds for black hole search with scattered agents in rings
  with Shantanu Das, Arnaud Labourel, and Euripides Markou
  SIROCCO 2011, LNCS 6796, 186-197.

• Telling convex from reflex allows to map a polygon
  with Shantanu Das, Yann Disser, Matús Mihalák, and Peter Widmayer
  STACS 2011, LIPIcs 9, 153-164.

• Constructing a Map of an Anonymous Graph: Applications of Universal Sequences
  with Shantanu Das, and Adrian Kosowski
  OPODIS 2010, LNCS 6490, 119-134.

• Rendezvous of Mobile Agents in Directed Graphs
  with Shantanu Das, and Peter Widmayer
  DISC 2010, LNCS 6343, 282-296.

• Network Exploration by Silent and Oblivious Robots
  with Paola Flocchini, Bernard Mans, and Nicola Santoro
  WG 2010, LNCS 6410, 208-219.

• Rendezvous of Mobile Agents without Agreement on Local Orientation
  with Shantanu Das
  ICALP 2010, LNCS 6199, 515-526.

• How simple robots benefit from looking back
  with Shantanu Das, Yann Disser, Matús Mihalák, and Peter Widmayer
  CIAC 2010, LNCS 6078, 229-239.

• Packing Bipartite Graphs with Covers of Complete Bipartite Graphs
  with Daniël Paulusma
  CIAC 2010, LNCS 6078, 276-287.

• Every Planar Graph is the Intersection Graph of Segments in the Plane (long version)
  with Daniel Gonçalves
  STOC 2009, 631-638.

• Playing with population protocols
  with Olivier Bournez, Johanne Cohen, and Xavier Koegler
  CSP 2008, EPTCS 1, 3-15.

• Local Terminations and Distributed Computability in Anonymous Networks
  with Emmanuel Godard and Yves Métivier
  DISC 2008, LNCS 5218, 47-62.

• Labelled (Hyper)Graphs, Negotiations and the Naming Problem
  with Antoni Mazurkiewicz and Yves Métivier
  ICGT 2008, LNCS 5214, 54-68.

• Rendezvous of mobile agents in unknown graphs with faulty links
  with Shantanu Das and Nicola Santoro
  DISC 2007, LNCS 4731, 108-122.

• About the termination detection in the asynchronous message passing model
  with Emmanuel Godard, Yves Métivier, and Gerard Tel
  SOFSEM 2007, LNCS 4362, 200-211.

• Planar graphs are in 1-STRING
  with Daniel Gonçalves and Pascal Ochem
  SODA 2007, 609-617.

• Mobile agent algorithms versus message passing algorithms
  with Emmanuel Godard, Yves Métivier, and Rodrigue Ossamy
  OPODIS 2006, LNCS 4305, 187-201.

• Groupings and pairings in anonymous networks
  with Shantanu Das and Nicola Santoro
  DISC 2006, LNCS 4167, 105-119.

• Dejean's conjecture and letter frequency
  with Pascal Ochem
  Journées Montoises d'Informatique Théorique 2006, 121-124.

• Election in the qualitative world
  SIROCCO 2006, LNCS 4056, 85-99.

• Graph labelings derived from models in distributed computing
  with Daniël Paulusma
  WG 2006, LNCS 4271, 301-312.

• A bridge between the asynchronous message passing model and local computations in graphs
  with Yves Métivier
  MFCS 2005, LNCS 3618, 212-223.

• Local computations on closed unlabelled edges: the election problem and the naming problem
  SOFSEM 2005, LNCS 3381, 81-90.

• Election, naming and cellular edge local computations
  with Yves Métivier and Wiesław Zielonka
  ICGT 2004, LNCS 3256, 242-256.

• Election and local computations on edges
  with Yves Métivier
  FOSSACS 2004, LNCS 2987, 90-104.

• Sequence hypergraphs: Paths, flows, and cuts
  with Katerina Böhmová, Matús Mihalák, Guido Proietti, and Peter Widmayer
  Adventures Between Lower Bounds and Higher Altitudes: Essays Dedicated to Juraj Hromkovic on the Occasion of His 60th Birthday, Hans-Joachim Böckenhauer, Dennis Komm, and Walter Unger (eds), LNCS 11011, Springer, 191-215, 2018

• Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty
  with Shantanu Das and Peter Widmayer
  Search Theory: A Game Theoretic Perspective, S. Alpern et al. (eds), Springer, 175-195, 2013

I defended my habilitation thesis, named «Local-to-Global Aspects in Metric Graph Theory and Distributed Computing», on October 2nd, 2020 at Aix-Marseille Université.
manuscript --- slides

I did my PhD in LaBRI under the supervision of Yves Métivier.
In my PhD thesis, I considered different models of distributed computing. I am particularly interested in characterizing what can be computed in a distributed way when processes do not have unique identifiers.
manuscript (in french)

I did my master thesis in LaBRI with Yves Métivier.
We studied the computational power of local computations on edges through the study of naming and election problems.
report (in french)  ---   slides (in french)

I did my Maitrîse training period in the Computer Science Department of the New Mexico State University with Hing Leung.
We worked on ramseyan factorizations of finite words.
report  ---   slides (in french)

I did my License training period in the LSV with Alain Finkel.
We worked on the representations of semi-linear sets.
report (in french)  ---  slides (in french)