I am a researcher in Computer Science at LIF in Marseille since October 2007. I belong to the MoVe research group.

Before, I did a PhD in LaBRI under the supervision of Yves Métivier. The manuscript can be found here (in french).

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.

I have also worked on graph theory, semigroup theory and combinatorics on words.

-- Publications --

• Packing Bipartite Graphs with Covers of Complete Bipartite Graphs
  with Daniël Paulusma
  Discrete Applied Mathematics, to appear.

• 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 , to appear.

• 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.

• Mapping Simple Polygons: How Robots Benefit from Looking Back
  with Shantanu Das, Yann Disser, Matus Mihalak and Peter Widmayer
  Algorithmica, to appear.

• 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.

• 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, Matus Mihalak and Peter Widmayer
  STACS 2011, 153-164.

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

• Rendezvous of Mobile Agents in Directed Graphs
  with Shantanu Das et 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, Matus Mihalak 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, 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.

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)