Jérémie Chalopin

J. Comb. Theory B, 2024

ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G2-connected medians.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory.

[BibT_eX]

[DOI]

Maria Kokkou

Proceedings of the 38th International Symposium on Distributed Computing, 2024

Deterministic Leader Election for Stationary Programmable Matter with Common Direction.

[BibT_eX]

[DOI]

Maria Kokkou

Proceedings of the Structural Information and Communication Complexity, 2024

Non-Clashing Teaching Maps for Balls in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023

Sample Compression Schemes for Balls in Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2023

Boundary rigidity of finite CAT(0) cube complexes.

[BibT_eX]

[DOI]

CoRR, 2023

Isometric Path Complexity of Graphs.

[BibT_eX]

[DOI]

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

Unlabeled sample compression schemes and corner peelings for ample and maximum classes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

Medians in median graphs and their cube complexes in linear time.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G2-connected medians.

[BibT_eX]

[DOI]

CoRR, 2022

Graphs with convex balls.

[BibT_eX]

[DOI]

Ugo Giocanti

CoRR, 2022

2021

Collaborative delivery on a fixed path with homogeneous energy-constrained agents.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Near-gathering of energy-constrained mobile agents.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2021

2020

Collaborative delivery with energy-constrained mobile robots.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

A counterexample to Thiagarajan's conjecture on regular event structures.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

2019

1-Safe Petri Nets and Special Cube Complexes: Equivalence and Applications.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2019

Medians in median graphs in linear time.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Maximal Exploration of Trees with Energy-Constrained Agents.

[BibT_eX]

[DOI]

CoRR, 2018

Sequence Hypergraphs: Paths, Flows, and Cuts.

[BibT_eX]

[DOI]

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017

Energy-Efficient Delivery by Heterogeneous Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

2016

Rendezvous in networks in spite of delay faults.

[BibT_eX]

[DOI]

Distributed Comput., 2016

Using Binoculars for Fast Exploration and Map Construction in Chordal Graphs and Extensions.

[BibT_eX]

[DOI]

Antoine Naudin

CoRR, 2016

A counterexample to Thiagarajan's conjecture.

[BibT_eX]

[DOI]

CoRR, 2016

Restricted Frame Graphs and a Conjecture of Scott.

[BibT_eX]

[DOI]

Louis Esperet

Zhentao Li

Patrice Ossona de Mendez

Electron. J. Comb., 2016

Convergecast and Broadcast by Power-Aware Mobile Agents.

[BibT_eX]

[DOI]

Algorithmica, 2016

Sequence Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

2015

Mapping Simple Polygons: The Power of Telling Convex from Reflex.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2015

On two conjectures of Maurer concerning basis graphs of matroids.

[BibT_eX]

[DOI]

Damian Osajda

J. Comb. Theory B, 2015

Isometric Embedding of Busemann Surfaces into L1.

[BibT_eX]

[DOI]

Guyslain Naves

Discret. Comput. Geom., 2015

Anonymous Graph Exploration with Binoculars.

[BibT_eX]

[DOI]

Antoine Naudin

Proceedings of the Distributed Computing - 29th International Symposium, 2015

Limit Behavior of the Multi-agent Rotor-Router System.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 29th International Symposium, 2015

2014

Cop and Robber Game and Hyperbolicity.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Packing bipartite graphs with covers of complete bipartite graphs.

[BibT_eX]

[DOI]

Daniël Paulusma

Discret. Appl. Math., 2014

Lock-in Problem for Parallel Rotor-router Walks.

[BibT_eX]

[DOI]

CoRR, 2014

What Do We Need to Know to Elect in Networks with Unknown Participants?

[BibT_eX]

[DOI]

Antoine Naudin

Proceedings of the Structural Information and Communication Complexity, 2014

Data Delivery by Energy-Constrained Mobile Agents on a Line.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Fault-Tolerant Rendezvous in Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Tight bounds for black hole search with scattered agents in synchronous rings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Retracts of Products of Chordal Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

Population Protocols that Correspond to Symmetric Games.

[BibT_eX]

[DOI]

Int. J. Unconv. Comput., 2013

Simple agents learn to find their way: An introduction on mapping polygons.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Mapping Simple Polygons: How Robots Benefit from Looking Back.

[BibT_eX]

[DOI]

Algorithmica, 2013

Data Delivery by Energy-Constrained Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2013

2012

Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks.

[BibT_eX]

[DOI]

Thomas Morsellino

Fundam. Informaticae, 2012

Election in partially anonymous networks with arbitrary knowledge in message passing systems.

[BibT_eX]

[DOI]

Distributed Comput., 2012

Proof of two Maurer's conjectures on basis graphs of matroids

[BibT_eX]

[DOI]

Damian Osajda

CoRR, 2012

Collecting Information by Power-Aware Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract).

[BibT_eX]

[DOI]

Thomas Morsellino

Proceedings of the Structural Information and Communication Complexity, 2012

2011

Cop and Robber Games When the Robber Can Hide and Ride.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Graph labelings derived from models in distributed computing: A complete complexity classification.

[BibT_eX]

[DOI]

Daniël Paulusma

Networks, 2011

Asymetric Pavlovian Populations

[BibT_eX]

[DOI]

CoRR, 2011

Black Hole Search with Finite Automata Scattered in a Synchronous Torus.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 25th International Symposium, 2011

Telling convex from reflex allows to map a polygon.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Tight Bounds for Scattered Black Hole Search in a Ring.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2011

Computing with Pavlovian Populations.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

2010

Planar Graphs Have 1-string Representations.

[BibT_eX]

[DOI]

Daniel Gonçalves

Pascal Ochem

Discret. Comput. Geom., 2010

On the power of synchronization between two adjacent processes.

[BibT_eX]

[DOI]

Distributed Comput., 2010

Network Exploration by Silent and Oblivious Robots.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Rendezvous of Mobile Agents in Directed Graphs.

[BibT_eX]

[DOI]

Peter Widmayer

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Constructing a Map of an Anonymous Graph: Applications of Universal Sequences.

[BibT_eX]

[DOI]

Adrian Kosowski

Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Rendezvous of Mobile Agents without Agreement on Local Orientation.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

How Simple Robots Benefit from Looking Back.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009

Population Protocols that Correspond to Symmetric Games

[BibT_eX]

[DOI]

CoRR, 2009

Every planar graph is the intersection graph of segments in the plane: extended abstract.

[BibT_eX]

[DOI]

Daniel Gonçalves

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008

Election and rendezvous with incomparable labels.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Playing With Population Protocols

[BibT_eX]

[DOI]

Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

Local Terminations and Distributed Computability in Anonymous Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Labelled (Hyper)Graphs, Negotiations and the Naming Problem.

[BibT_eX]

[DOI]

Antoni W. Mazurkiewicz

Proceedings of the Graph Transformations, 4th International Conference, 2008

2007

An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

Dejean's conjecture and letter frequency.

[BibT_eX]

[DOI]

Pascal Ochem

Electron. Notes Discret. Math., 2007

Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links.

[BibT_eX]

[DOI]

Nicola Santoro

Proceedings of the Distributed Computing, 21st International Symposium, 2007

About the Termination Detection in the Asynchronous Message Passing Model.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Planar graphs are in 1-STRING.

[BibT_eX]

[DOI]

Daniel Gonçalves

Pascal Ochem

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

Local Computations in Graphs: The Case of Cellular Edge Local Computations.

[BibT_eX]

[DOI]

Wieslaw Zielonka

Fundam. Informaticae, 2006

Graph Labelings Derived from Models in Distributed Computing.

[BibT_eX]

[DOI]

Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Groupings and Pairings in Anonymous Networks.

[BibT_eX]

[DOI]

Nicola Santoro

Proceedings of the Distributed Computing, 20th International Symposium, 2006

Election in the Qualitative World.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2006

Mobile Agent Algorithms Versus Message Passing Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

2005

Local Computation in Graphs: The Case of Cellular Edge Local Computations.

[BibT_eX]

Wieslaw Zielonka

Bull. EATCS, 2005

Local Computations on Closed Unlabelled Edges: The Election Problem and the Naming Problem.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004

On factorization forests of finite height.

[BibT_eX]

[DOI]

Hing Leung

Theor. Comput. Sci., 2004

Election, Naming and Cellular Edge Local Computations.

[BibT_eX]

[DOI]

Wieslaw Zielonka

Proceedings of the Graph Transformations, Second International Conference, 2004

Election and Local Computations on Edges.

[BibT_eX]

[DOI]