| Publication | Date of Publication | Type |
|---|
| Medians in median graphs and their cube complexes in linear time | 2026-03-18 | Paper |
Deterministic self-stabilising leader election for programmable matter with constant memory
Distributed Computing | 2026-01-20 | Paper |
Isometric path complexity of graphs
Discrete Mathematics | 2025-12-15 | Paper |
Helly groups
Geometry & Topology | 2025-01-03 | Paper |
| Isometric path complexity of graphs | 2024-12-03 | Paper |
ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and \(G^2\)-connected medians
Discrete Applied Mathematics | 2024-11-06 | Paper |
Boundary rigidity of CAT(0) cube complexes
Journal of Combinatorial Theory. Series B | 2024-10-08 | Paper |
| Sample compression schemes for balls in graphs | 2024-08-06 | Paper |
First-order logic axiomatization of metric graph theory
Theoretical Computer Science | 2024-03-15 | Paper |
Graphs with \(G^p\)-connected medians
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
Sample Compression Schemes for Balls in Graphs
SIAM Journal on Discrete Mathematics | 2023-11-14 | Paper |
| Non-Clashing Teaching Maps for Balls in Graphs | 2023-09-06 | Paper |
Sequence Hypergraphs: Paths, Flows, and Cuts
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
Graphs with convex balls
Geometriae Dedicata | 2023-06-09 | Paper |
| Isometric path complexity of graphs | 2022-12-31 | Paper |
| scientific article; zbMATH DE number 7561527 (Why is no real title available?) | 2022-07-21 | Paper |
| ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G^2-connected medians | 2022-06-07 | Paper |
Unlabeled sample compression schemes and corner peelings for ample and maximum classes
Journal of Computer and System Sciences | 2022-04-04 | Paper |
Unlabeled sample compression schemes and corner peelings for ample and maximum classes
Journal of Computer and System Sciences | 2022-04-04 | Paper |
Medians in median graphs and their cube complexes in linear time
Journal of Computer and System Sciences | 2022-03-29 | Paper |
Weakly Modular Graphs and Nonpositive Curvature
Memoirs of the American Mathematical Society | 2021-09-29 | Paper |
Collaborative delivery on a fixed path with homogeneous energy-constrained agents
Theoretical Computer Science | 2021-05-10 | Paper |
Fast approximation and exact computation of negative curvature parameters of graphs
Discrete & Computational Geometry | 2021-04-20 | Paper |
Fast approximation and exact computation of negative curvature parameters of graphs
Discrete & Computational Geometry | 2021-04-20 | Paper |
| Playing with population protocols | 2021-01-20 | Paper |
Playing with population protocols
(available as arXiv preprint) | 2021-01-20 | Paper |
Near-gathering of energy-constrained mobile agents
Theoretical Computer Science | 2020-12-15 | Paper |
| Fast approximation and exact computation of negative curvature parameters of graphs | 2020-08-18 | Paper |
A counterexample to Thiagarajan's conjecture on regular event structures
Journal of Computer and System Sciences | 2020-06-09 | Paper |
A counterexample to Thiagarajan's conjecture on regular event structures
(available as arXiv preprint) | 2020-05-27 | Paper |
Collaborative delivery on a fixed path with homogeneous energy-constrained agents
Structural Information and Communication Complexity | 2020-03-03 | Paper |
Near-gathering of energy-constrained mobile agents
Structural Information and Communication Complexity | 2020-03-03 | Paper |
| Helly groups | 2020-02-17 | Paper |
Collaborative delivery with energy-constrained mobile robots
Theoretical Computer Science | 2020-02-06 | Paper |
1-safe Petri nets and special cube complexes. Equivalence and applications
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
Mapping Simple Polygons
ACM Transactions on Algorithms | 2018-10-30 | Paper |
| Data delivery by energy-constrained mobile agents | 2018-10-17 | Paper |
Anonymous graph exploration with binoculars
(available as arXiv preprint) | 2018-08-24 | Paper |
| Limit behavior of the multi-agent rotor-router system | 2018-08-24 | Paper |
scientific article; zbMATH DE number 6862102 (Why is no real title available?)
(available as arXiv preprint) | 2018-04-19 | Paper |
Deterministic symmetric rendezvous in arbitrary graphs: overcoming anonymity, failures and uncertainty
Search Theory | 2017-02-20 | Paper |
Sequence hypergraphs
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Collaborative delivery with energy-constrained mobile robots
Lecture Notes in Computer Science | 2016-12-01 | Paper |
Rendezvous in networks in spite of delay faults
Distributed Computing | 2016-07-05 | Paper |
Convergecast and broadcast by power-aware mobile agents
Algorithmica | 2016-03-23 | Paper |
Restricted frame graphs and a conjecture of Scott
The Electronic Journal of Combinatorics | 2016-03-04 | Paper |
Restricted frame graphs and a conjecture of Scott
The Electronic Journal of Combinatorics | 2016-03-04 | Paper |
| Gromov hyperbolicity and cop and robber game | 2016-01-27 | Paper |
On two conjectures of maurer concerning basis graphs of matroids
Journal of Combinatorial Theory. Series B | 2015-06-22 | Paper |
Cop and robber game and hyperbolicity
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
Isometric embedding of Busemann surfaces into L₁
Discrete & Computational Geometry | 2015-02-19 | Paper |
Every planar graph is the intersection graph of segments in the plane (extended abstract)
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
| scientific article; zbMATH DE number 6381690 (Why is no real title available?) | 2014-12-18 | Paper |
What do we need to know to elect in networks with unknown participants?
Structural Information and Communication Complexity | 2014-08-07 | Paper |
Data delivery by energy-constrained mobile agents on a line
Automata, Languages, and Programming | 2014-07-01 | Paper |
Fault-tolerant rendezvous in networks
Automata, Languages, and Programming | 2014-07-01 | Paper |
Simple agents learn to find their way: an introduction on mapping polygons
Discrete Applied Mathematics | 2014-04-16 | Paper |
Packing bipartite graphs with covers of complete bipartite graphs
Discrete Applied Mathematics | 2014-04-02 | Paper |
Bucolic complexes
Advances in Mathematics | 2014-01-15 | Paper |
Tight bounds for black hole search with scattered agents in synchronous rings
Theoretical Computer Science | 2014-01-13 | Paper |
Retracts of products of chordal graphs
Journal of Graph Theory | 2013-05-21 | Paper |
Collecting information by power-aware mobile agents
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Mapping simple polygons: how robots benefit from looking back
Algorithmica | 2013-03-05 | Paper |
Election in partially anonymous networks with arbitrary knowledge in message passing systems
Distributed Computing | 2013-02-04 | Paper |
Enumeration and leader election in partially anonymous and multi-hop broadcast networks
Fundamenta Informaticae | 2012-10-31 | Paper |
On the power of synchronization between two adjacent processes
Distributed Computing | 2012-02-06 | Paper |
| scientific article; zbMATH DE number 5999543 (Why is no real title available?) | 2012-01-23 | Paper |
Graph labelings derived from models in distributed computing: A complete complexity classification
Networks | 2011-11-21 | Paper |
Black hole search with finite automata scattered in a synchronous torus
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Cop and robber games when the robber can hide and ride
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Network exploration by silent and oblivious robots
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Rendezvous of mobile agents in directed graphs
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Rendezvous of mobile agents without agreement on local orientation
Automata, Languages and Programming | 2010-09-07 | Paper |
How simple robots benefit from looking back
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Packing bipartite graphs with covers of complete bipartite graphs
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Planar graphs have 1-string representations
Discrete & Computational Geometry | 2010-04-12 | Paper |
Election in the Qualitative World
Structural Information and Communication Complexity | 2009-03-12 | Paper |
Labelled (Hyper)Graphs, Negotiations and the Naming Problem
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Local Terminations and Distributed Computability in Anonymous Networks
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Dejean's conjecture and letter frequency
RAIRO - Theoretical Informatics and Applications | 2008-09-25 | Paper |
Groupings and Pairings in Anonymous Networks
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Graph Labelings Derived from Models in Distributed Computing
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Election and rendezvous with incomparable labels
Theoretical Computer Science | 2008-06-24 | Paper |
| scientific article; zbMATH DE number 5286867 (Why is no real title available?) | 2008-06-11 | Paper |
About the Termination Detection in the Asynchronous Message Passing Model
Lecture Notes in Computer Science | 2008-03-07 | Paper |
| An efficient message passing election algorithm based on Mazurkiewicz's algorithm | 2008-01-02 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Graph Transformations
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Dejean's conjecture and letter frequency
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
| Local computations in graphs: the case of cellular edge local computations | 2007-01-19 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
SOFSEM 2005: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2005-12-07 | Paper |
On factorization forests of finite height
Theoretical Computer Science | 2004-10-27 | Paper |
