| Publication | Date of Publication | Type |
|---|
| Monotonic self-stabilization and its application to robust and adaptive pattern formation | 2022-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4610034 | 2018-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2971306 | 2017-04-04 | Paper |
| An alternative proof for the equivalence of searcher and 2-searcher | 2016-05-18 | Paper |
| Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings | 2016-04-07 | Paper |
| On convergence in the Orlicz space as a ranked space | 2016-02-23 | Paper |
| The searchlight problem for road networks | 2015-07-13 | Paper |
| Bridge decompositions with distances at least two | 2012-10-04 | Paper |
| Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs | 2011-12-16 | Paper |
| Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices | 2011-07-06 | Paper |
| Vision-Based Pursuit-Evasion in a Grid | 2011-06-17 | Paper |
| Weak sense of direction labelings and graph embeddings | 2011-03-10 | Paper |
| Characterizing geometric patterns formable by oblivious anonymous mobile robots | 2010-06-07 | Paper |
| Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight | 2010-04-27 | Paper |
| Hardness results on the man-exchange stable marriage problem with short preference lists | 2010-01-29 | Paper |
| Searching a polygonal region by a group of stationary \(k\)-searchers | 2009-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3602859 | 2009-02-12 | Paper |
| Vision-Based Pursuit-Evasion in a Grid | 2008-07-15 | Paper |
| Offline variants of the ``lion and man problem: some problems and techniques for measuring crowdedness and for safe path planning | 2008-06-24 | Paper |
| A unified approach to finding good stable matchings in the hospitals/residents setting | 2008-06-24 | Paper |
| Erratum: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns | 2007-03-27 | Paper |
| Bushiness and a tight worst-case upper bound on the search number of a simple polygon. | 2006-01-17 | Paper |
| SEARCHING A POLYGONAL REGION FROM THE BOUNDARY | 2005-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331288 | 2002-05-15 | Paper |
| Searching for mobile intruders in a polygonal region by a group of mobile searchers | 2002-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937176 | 2000-02-03 | Paper |
| Distributed Anonymous Mobile Robots: Formation of Geometric Patterns | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4348608 | 1997-11-09 | Paper |
| DESIGNING MULTI-LINK ROBOT ARMS IN A CONVEX POLYGON | 1997-03-23 | Paper |
| SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM | 1996-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4844860 | 1996-01-14 | Paper |
| Fair Petri nets and structural induction for rings of processes | 1995-04-06 | Paper |
| Searching for a Mobile Intruder in a Polygonal Region | 1992-12-06 | Paper |
| Clock synchronization and the power of broadcasting | 1992-06-25 | Paper |
| The Searchlight Scheduling Problem | 1990-01-01 | Paper |
| Optimal Algorithms for a Pursuit-Evasion Problem in Grids | 1989-01-01 | Paper |
| Proving properties of a ring of finite-state machines | 1988-01-01 | Paper |
| A method for stepwise refinement and abstraction of Petri nets | 1983-01-01 | Paper |
| Three measures for synchronic dependence in Petri nets | 1983-01-01 | Paper |
