| Publication | Date of Publication | Type |
|---|
| Helly groups | 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 | 2024-11-06 | Paper |
| Boundary rigidity of CAT(0) cube complexes | 2024-10-08 | Paper |
| Sample compression schemes for balls in graphs | 2024-08-06 | Paper |
| First-order logic axiomatization of metric graph theory | 2024-03-15 | Paper |
| Graphs with \(G^p\)-connected medians | 2024-02-21 | Paper |
| Sample Compression Schemes for Balls in Graphs | 2023-11-14 | Paper |
| Non-Clashing Teaching Maps for Balls in Graphs | 2023-09-06 | Paper |
| Sequence Hypergraphs: Paths, Flows, and Cuts | 2023-06-30 | Paper |
| Graphs with convex balls | 2023-06-09 | Paper |
| Isometric path complexity of graphs | 2022-12-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091184 | 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 | 2022-04-04 | Paper |
| Medians in median graphs and their cube complexes in linear time | 2022-03-29 | Paper |
| Weakly Modular Graphs and Nonpositive Curvature | 2021-09-29 | Paper |
| Collaborative delivery on a fixed path with homogeneous energy-constrained agents | 2021-05-10 | Paper |
| Fast approximation and exact computation of negative curvature parameters of graphs | 2021-04-20 | Paper |
| Playing with population protocols | 2021-01-20 | Paper |
| Near-gathering of energy-constrained mobile agents | 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 | 2020-06-09 | Paper |
| A counterexample to Thiagarajan's conjecture on regular event structures | 2020-05-27 | Paper |
| Collaborative delivery on a fixed path with homogeneous energy-constrained agents | 2020-03-03 | Paper |
| Near-gathering of energy-constrained mobile agents | 2020-03-03 | Paper |
| Helly groups | 2020-02-17 | Paper |
| Collaborative delivery with energy-constrained mobile robots | 2020-02-06 | Paper |
| 1-safe Petri nets and special cube complexes. Equivalence and applications | 2019-11-22 | Paper |
| Mapping Simple Polygons | 2018-10-30 | Paper |
| Data delivery by energy-constrained mobile agents | 2018-10-17 | Paper |
| Anonymous graph exploration with binoculars | 2018-08-24 | Paper |
| Limit behavior of the multi-agent rotor-router system | 2018-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636607 | 2018-04-19 | Paper |
| Deterministic symmetric rendezvous in arbitrary graphs: overcoming anonymity, failures and uncertainty | 2017-02-20 | Paper |
| Sequence hypergraphs | 2016-12-22 | Paper |
| Collaborative delivery with energy-constrained mobile robots | 2016-12-01 | Paper |
| Rendezvous in networks in spite of delay faults | 2016-07-05 | Paper |
| Convergecast and broadcast by power-aware mobile agents | 2016-03-23 | Paper |
| Restricted frame graphs and a conjecture of Scott | 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 | 2015-06-22 | Paper |
| Cop and robber game and hyperbolicity | 2015-04-17 | Paper |
| Isometric embedding of Busemann surfaces into \(L_1\) | 2015-02-19 | Paper |
| Every planar graph is the intersection graph of segments in the plane (extended abstract) | 2015-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934644 | 2014-12-18 | Paper |
| What do we need to know to elect in networks with unknown participants? | 2014-08-07 | Paper |
| Data delivery by energy-constrained mobile agents on a line | 2014-07-01 | Paper |
| Fault-tolerant rendezvous in networks | 2014-07-01 | Paper |
| Simple agents learn to find their way: an introduction on mapping polygons | 2014-04-16 | Paper |
| Packing bipartite graphs with covers of complete bipartite graphs | 2014-04-02 | Paper |
| Bucolic complexes | 2014-01-15 | Paper |
| Tight bounds for black hole search with scattered agents in synchronous rings | 2014-01-13 | Paper |
| Retracts of products of chordal graphs | 2013-05-21 | Paper |
| Collecting information by power-aware mobile agents | 2013-03-13 | Paper |
| Mapping simple polygons: how robots benefit from looking back | 2013-03-05 | Paper |
| Election in partially anonymous networks with arbitrary knowledge in message passing systems | 2013-02-04 | Paper |
| Enumeration and leader election in partially anonymous and multi-hop broadcast networks | 2012-10-31 | Paper |
| On the power of synchronization between two adjacent processes | 2012-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113680 | 2012-01-23 | Paper |
| Graph labelings derived from models in distributed computing: A complete complexity classification | 2011-11-21 | Paper |
| Black hole search with finite automata scattered in a synchronous torus | 2011-10-28 | Paper |
| Cop and robber games when the robber can hide and ride | 2011-10-27 | Paper |
| Network exploration by silent and oblivious robots | 2010-11-16 | Paper |
| Rendezvous of mobile agents in directed graphs | 2010-09-10 | Paper |
| Rendezvous of mobile agents without agreement on local orientation | 2010-09-07 | Paper |
| How simple robots benefit from looking back | 2010-05-28 | Paper |
| Packing bipartite graphs with covers of complete bipartite graphs | 2010-05-28 | Paper |
| Planar graphs have 1-string representations | 2010-04-12 | Paper |
| Election in the Qualitative World | 2009-03-12 | Paper |
| Labelled (Hyper)Graphs, Negotiations and the Naming Problem | 2008-11-20 | Paper |
| Local Terminations and Distributed Computability in Anonymous Networks | 2008-11-20 | Paper |
| Dejean's conjecture and letter frequency | 2008-09-25 | Paper |
| Groupings and Pairings in Anonymous Networks | 2008-09-09 | Paper |
| Graph Labelings Derived from Models in Distributed Computing | 2008-09-04 | Paper |
| Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links | 2008-09-02 | Paper |
| Election and rendezvous with incomparable labels | 2008-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3504346 | 2008-06-11 | Paper |
| About the Termination Detection in the Asynchronous Message Passing Model | 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 | 2007-09-28 | Paper |
| Graph Transformations | 2007-06-21 | Paper |
| Dejean's conjecture and letter frequency | 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 | 2006-10-20 | Paper |
| SOFSEM 2005: Theory and Practice of Computer Science | 2005-12-07 | Paper |
| On factorization forests of finite height | 2004-10-27 | Paper |
