| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6187825 | 2024-01-15 | Paper |
| Search on a Line by Byzantine Robots | 2023-08-15 | Paper |
| Optimal rendezvous on a line by location-aware robots in the presence of spies* | 2022-12-19 | Paper |
| Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults | 2022-12-09 | Paper |
| Searching for a Non-adversarial, Uncooperative Agent on a Cycle | 2022-12-09 | Paper |
| Separating translates in the plane: Combinatorial bounds and an algorithm | 2022-12-09 | Paper |
| On convergence and threshold properties of discrete Lotka-Volterra population protocols | 2022-08-26 | Paper |
| Linear rendezvous with asymmetric clocks | 2022-07-21 | Paper |
| Energy Consumption of Group Search on a Line | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075773 | 2022-05-11 | Paper |
| Graph exploration by energy-sharing mobile agents | 2022-03-22 | Paper |
| The bike sharing problem | 2021-10-04 | Paper |
| Gossiping by energy-constrained mobile agents in tree networks | 2021-03-09 | Paper |
| Building a nest by an automaton | 2021-02-01 | Paper |
| Time-energy tradeoffs for evacuation by two robots in the wireless model | 2021-01-25 | Paper |
| Symmetry Breaking in the Plane | 2021-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3386625 | 2021-01-05 | Paper |
| Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits | 2020-10-21 | Paper |
| Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots | 2020-10-21 | Paper |
| Gathering in the plane of location-aware robots in the presence of spies | 2020-08-25 | Paper |
| God save the queen | 2020-08-11 | Paper |
| Time-energy tradeoffs for evacuation by two robots in the wireless model | 2020-03-03 | Paper |
| Beachcombing on strips and islands | 2020-01-16 | Paper |
| Searching for a non-adversarial, uncooperative agent on a cycle | 2020-01-16 | Paper |
| Priority evacuation from a disk: the case of \(n = 1,2,3\) | 2020-01-16 | Paper |
| Search on a line with faulty robots | 2019-11-27 | Paper |
| Energy-optimal broadcast and exploration in a tree using mobile agents | 2019-10-18 | Paper |
| Group search of the plane with faulty robots | 2019-10-07 | Paper |
| Temporal flows in temporal networks | 2019-06-25 | Paper |
| Gathering in the plane of location-aware robots in the presence of spies | 2019-01-30 | Paper |
| Broadcast with energy-exchanging mobile agents distributed on a tree | 2019-01-30 | Paper |
| Priority evacuation from a disk using mobile robots (extended abstract) | 2019-01-30 | Paper |
| Linear search by a pair of distinct-speed robots | 2019-01-11 | Paper |
| Patrolling trees with mobile robots | 2018-12-07 | Paper |
| On asynchronous rendezvous in general graphs | 2018-11-29 | Paper |
| Search on a Line by Byzantine Robots | 2018-04-19 | Paper |
| Evacuation from a disc in the presence of a faulty robot | 2018-04-12 | Paper |
| Evacuating two robots from multiple unknown exits in a circle | 2017-12-20 | Paper |
| When patrolmen become corrupted: monitoring a graph using faulty mobile robots | 2017-11-09 | Paper |
| Search on a Line with Faulty Robots | 2017-09-29 | Paper |
| Linear Search with Terrain-Dependent Speeds | 2017-07-21 | Paper |
| Temporal flows in temporal networks | 2017-07-21 | Paper |
| Collision-free network exploration | 2017-05-26 | Paper |
| Distributed Patrolling with Two-Speed Robots (and an Application to Transportation) | 2017-04-28 | Paper |
| Linear Search by a Pair of Distinct-Speed Robots | 2016-12-01 | Paper |
| Communication Problems for Mobile Agents Exchanging Energy | 2016-12-01 | Paper |
| Survivability of bouncing robots | 2016-09-16 | Paper |
| Convergecast and broadcast by power-aware mobile agents | 2016-03-23 | Paper |
| When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots | 2016-01-11 | Paper |
| Information Spreading by Mobile Particles on a Line | 2016-01-08 | Paper |
| The beachcombers' problem: walking and searching with mobile robots | 2015-12-11 | Paper |
| On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols | 2015-10-27 | Paper |
| Localization for a system of colliding robots | 2015-09-29 | Paper |
| Position discovery for a system of bouncing robots | 2015-09-28 | Paper |
| How to meet when you forget | 2015-03-02 | Paper |
| Evacuating Robots via Unknown Exit in a Disk | 2015-02-10 | Paper |
| How to meet asynchronously (almost) everywhere | 2014-09-09 | Paper |
| The Beachcombers’ Problem: Walking and Searching with Mobile Robots | 2014-08-07 | Paper |
| Patrolling by Robots Equipped with Visibility | 2014-08-07 | Paper |
| Time versus space trade-offs for rendezvous in trees | 2014-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417602 | 2014-05-22 | Paper |
| Collision-Free Network Exploration | 2014-03-31 | Paper |
| Survivability of Swarms of Bouncing Robots | 2014-03-31 | Paper |
| Worst-case optimal exploration of terrains with obstacles | 2013-11-29 | Paper |
| Localization for a System of Colliding Robots | 2013-08-07 | Paper |
| Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains | 2013-04-15 | Paper |
| Collecting Information by Power-Aware Mobile Agents | 2013-03-13 | Paper |
| Position Discovery for a System of Bouncing Robots | 2013-03-13 | Paper |
| How to meet when you forget: log-space rendezvous in arbitrary graphs | 2013-02-04 | Paper |
| More efficient periodic traversal in anonymous undirected graphs | 2012-08-10 | Paper |
| Choosing the best among peers | 2012-08-08 | Paper |
| APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN | 2012-03-13 | Paper |
| Asynchronous deterministic rendezvous in bounded terrains | 2011-12-07 | Paper |
| Synchronous Rendezvous for Location-Aware Agents | 2011-10-28 | Paper |
| Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds | 2011-09-16 | Paper |
| Optimality and competitiveness of exploring polygons by mobile robots | 2011-01-13 | Paper |
| Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids | 2010-09-10 | Paper |
| Efficient Information Exchange in the Random Phone-Call Model | 2010-09-07 | Paper |
| Tell Me Where I Am So I Can Meet You Sooner | 2010-09-07 | Paper |
| Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains | 2010-09-03 | Paper |
| Simultaneous diagonal flips in plane triangulations | 2010-08-16 | Paper |
| Optimal Exploration of Terrains with Obstacles | 2010-06-22 | Paper |
| Asynchronous Deterministic Rendezvous in Bounded Terrains | 2010-06-17 | Paper |
| More Efficient Periodic Traversal in Anonymous Undirected Graphs | 2010-02-24 | Paper |
| Black Hole Search in Directed Graphs | 2010-02-24 | Paper |
| Consensus and Mutual Exclusion in a Multiple Access Channel | 2009-11-19 | Paper |
| Optimality and Competitiveness of Exploring Polygons by Mobile Robots | 2009-10-29 | Paper |
| Approximation Algorithms for Buy-at-Bulk Geometric Network Design | 2009-10-20 | Paper |
| Equivalence of Functions Represented by Simple Context-Free Grammars with Output | 2009-03-26 | Paper |
| Gathering few fat mobile robots in the plane | 2009-03-02 | Paper |
| Computing the throughput of concatenation state machines | 2008-11-18 | Paper |
| Efficient Computation of Throughput Values of Context-Free Languages | 2008-06-10 | Paper |
| REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE | 2008-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5453900 | 2008-04-03 | Paper |
| The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring | 2008-03-07 | Paper |
| Searching for a Black Hole in Synchronous Tree Networks | 2008-01-18 | Paper |
| Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs | 2007-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5310248 | 2007-09-21 | Paper |
| Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice | 2007-09-06 | Paper |
| Simultaneous diagonal flips in plane triangulations | 2007-05-11 | Paper |
| Equivalence of simple functions | 2007-05-11 | Paper |
| Prime normal form and equivalence of simple grammars | 2007-01-09 | Paper |
| Implementation and Application of Automata | 2006-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5480656 | 2006-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3370007 | 2006-02-06 | Paper |
| Principles of Distributed Systems | 2005-12-15 | Paper |
| LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES | 2005-10-19 | Paper |
| COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS | 2005-06-10 | Paper |
| The Maximum Number of Edges in a Three-Dimensional Grid-Drawing | 2005-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817649 | 2004-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817650 | 2004-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808650 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472476 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418601 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2752520 | 2003-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2752519 | 2002-09-18 | Paper |
| Circular separability of polygons | 2002-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525052 | 2001-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728847 | 2001-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728846 | 2001-11-01 | Paper |
| IMMOBILIZING A SHAPE | 2000-11-07 | Paper |
| Convex tours of bounded curvature | 2000-01-17 | Paper |
| A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments | 1998-08-13 | Paper |
| Separating Translates in the Plane: Combinatorial Bounds and an Algorithm | 1998-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886057 | 1996-08-22 | Paper |
| Illuminating high-dimensional convex sets | 1995-10-17 | Paper |
| Protecting convex sets | 1995-02-01 | Paper |
| Guarding rectangular art galleries | 1994-08-21 | Paper |
| Separation of convex sets | 1994-07-31 | Paper |
| Searching with local constraints on error patterns | 1994-07-19 | Paper |
| COMPUTING SHORTEST TRANSVERSALS OF SETS | 1993-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138983 | 1993-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694723 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037421 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028896 | 1993-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4018725 | 1993-01-16 | Paper |
| Illuminating rectangles and triangles on the plane | 1993-01-01 | Paper |
| Separating convex sets in the plane | 1992-06-28 | Paper |
| Crooked diagrams with few slopes | 1992-06-25 | Paper |
| Searching with a forbidden lie pattern in responses | 1991-01-01 | Paper |
| Lattice diagrams with few slopes | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3351380 | 1991-01-01 | Paper |
| Drawing orders with few slopes | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3494327 | 1990-01-01 | Paper |
| Ulam's searching game with lies | 1989-01-01 | Paper |
| Solution of Ulam's problem on binary search with two lies | 1988-01-01 | Paper |
