| Publication | Date of Publication | Type |
|---|
| Framing algorithms for approximate multicriteria shortest paths | 2024-08-13 | Paper |
| Optimized silent self-stabilizing scheme for tree-based constructions | 2022-02-01 | Paper |
| Exploration of dynamic cactuses with sub-logarithmic overhead | 2021-06-24 | Paper |
| Exploration of carrier-based time-varying networks: the power of waiting | 2020-09-17 | Paper |
| Deciding and verifying network properties locally with few output bits | 2020-04-23 | Paper |
| Beachcombing on strips and islands | 2020-01-16 | Paper |
| Linear search by a pair of distinct-speed robots | 2019-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4560215 | 2018-12-10 | Paper |
| On asynchronous rendezvous in general graphs | 2018-11-29 | Paper |
| Label-guided graph exploration by a finite automaton | 2018-11-05 | Paper |
| Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring | 2018-07-23 | Paper |
| Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps | 2018-07-18 | Paper |
| On mobile agent verifiable problems | 2018-05-30 | Paper |
| Robustness of the rotor-router mechanism | 2017-10-09 | Paper |
| Linear Search by a Pair of Distinct-Speed Robots | 2016-12-01 | Paper |
| On Mobile Agent Verifiable Problems | 2016-05-03 | Paper |
| The impact of dynamic events on the number of errors in networks | 2016-04-01 | Paper |
| Distributedly Testing Cycle-Freeness | 2015-09-09 | Paper |
| Oracle size | 2015-03-10 | Paper |
| Locating a target with an agent guided by unreliable local advice | 2015-03-02 | Paper |
| Exploration of Constantly Connected Dynamic Graphs Based on Cactuses | 2014-08-07 | Paper |
| Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring | 2013-12-17 | Paper |
| Worst-case optimal exploration of terrains with obstacles | 2013-11-29 | Paper |
| Computing without communicating: ring exploration by asynchronous oblivious robots | 2013-08-05 | Paper |
| Distributed computing with advice: information sensitivity of graph coloring | 2013-06-28 | Paper |
| The cost of monotonicity in distributed graph searching | 2013-06-28 | Paper |
| How many oblivious robots can explore a line | 2013-04-04 | Paper |
| More efficient periodic traversal in anonymous undirected graphs | 2012-08-10 | Paper |
| Ping pong in dangerous graphs: optimal black hole search with pebbles | 2012-04-26 | Paper |
| Derandomizing random walks in undirected graphs using locally fair exploration strategies | 2012-02-06 | Paper |
| Asynchronous deterministic rendezvous in bounded terrains | 2011-12-07 | Paper |
| Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces | 2010-11-16 | Paper |
| Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids | 2010-09-10 | Paper |
| Optimal Exploration of Terrains with Obstacles | 2010-06-22 | Paper |
| Asynchronous Deterministic Rendezvous in Bounded Terrains | 2010-06-17 | Paper |
| Communication algorithms with advice | 2010-05-25 | Paper |
| Fast radio broadcasting with advice | 2010-04-06 | Paper |
| Remembering without memory: tree exploration by asynchronous oblivious robots | 2010-04-06 | Paper |
| More Efficient Periodic Traversal in Anonymous Undirected Graphs | 2010-02-24 | Paper |
| Euler Tour Lock-In Problem in the Rotor-Router Model | 2009-11-19 | Paper |
| Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies | 2009-07-14 | Paper |
| Labeling schemes for tree representation | 2009-05-13 | Paper |
| Setting Port Numbers for Fast Graph Exploration | 2009-03-12 | Paper |
| Tree exploration with advice | 2008-12-03 | Paper |
| Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens | 2008-11-20 | Paper |
| Impact of memory size on graph exploration capability | 2008-09-29 | Paper |
| Setting port numbers for fast graph exploration | 2008-07-31 | Paper |
| Fast Radio Broadcasting with Advice | 2008-07-10 | Paper |
| Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots | 2008-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5450114 | 2008-03-19 | Paper |
| Distributed Computing with Advice: Information Sensitivity of Graph Coloring | 2007-11-28 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Tree Exploration with an Oracle | 2007-09-05 | Paper |
| Distributed Computing – IWDC 2005 | 2006-10-10 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Graph exploration by a finite automaton | 2005-12-06 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
