| Publication | Date of Publication | Type |
|---|
| Searching for a Non-adversarial, Uncooperative Agent on a Cycle | 2022-12-09 | Paper |
| Improved Lower Bounds for Shoreline Search | 2022-09-01 | Paper |
| Exploration of Time-Varying Connected Graphs with Silent Agents | 2022-09-01 | Paper |
| Exploration of High-Dimensional Grids by Finite Automata | 2022-07-21 | Paper |
| Graph exploration by energy-sharing mobile agents | 2022-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3300812 | 2020-07-30 | Paper |
| Distributed exploration of dynamic rings | 2020-04-21 | Paper |
| Weak coverage of a rectangular barrier | 2020-02-28 | Paper |
| Searching for a non-adversarial, uncooperative agent on a cycle | 2020-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4584901 | 2018-09-04 | Paper |
| Evacuating two robots from multiple unknown exits in a circle | 2017-12-20 | Paper |
| Improved analysis of the online set cover problem with advice | 2017-09-07 | Paper |
| Weak coverage of a rectangular barrier | 2017-07-21 | Paper |
| Survivability of bouncing robots | 2016-09-16 | Paper |
| Evolutionary graph colouring | 2016-06-16 | Paper |
| The Complexity of Paging Against a Probabilistic Adversary | 2016-03-10 | Paper |
| Exploring an unknown dangerous graph with a constant number of tokens | 2015-12-10 | Paper |
| Complexity of barrier coverage with relocatable sensors in the plane | 2015-05-18 | Paper |
| Advice complexity of maximum independent set in sparse and bipartite graphs | 2015-05-12 | Paper |
| Optimal sensor networks for area monitoring using rotating and beam sensors | 2015-01-21 | Paper |
| Searching for a black hole in arbitrary networks | 2014-07-25 | Paper |
| Antibandwidth and cyclic antibandwidth of Hamming graphs | 2014-04-16 | Paper |
| Survivability of Swarms of Bouncing Robots | 2014-03-31 | Paper |
| Efficient routing in carrier-based mobile networks | 2014-01-13 | Paper |
| Antibandwidth and Cyclic Antibandwidth of Hamming Graphs | 2013-10-10 | Paper |
| Independent Set with Advice: The Impact of Graph Knowledge | 2013-09-13 | Paper |
| Searching for a black hole in arbitrary networks: optimal mobile agents protocols | 2013-06-20 | Paper |
| Complexity of Barrier Coverage with Relocatable Sensors in the Plane | 2013-06-07 | Paper |
| Exploring an unknown dangerous graph using tokens | 2013-03-04 | Paper |
| On the page number of RNA secondary structures with pseudoknots | 2012-12-13 | Paper |
| STRONG CONNECTIVITY IN SENSOR NETWORKS WITH GIVEN NUMBER OF DIRECTIONAL ANTENNAE OF BOUNDED ANGLE | 2012-10-15 | Paper |
| Online Graph Exploration with Advice | 2012-09-26 | Paper |
| Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs | 2012-09-10 | Paper |
| More efficient periodic traversal in anonymous undirected graphs | 2012-08-10 | Paper |
| Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points | 2012-06-29 | Paper |
| Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle | 2011-01-10 | Paper |
| More Efficient Periodic Traversal in Anonymous Undirected Graphs | 2010-02-24 | Paper |
| Black Hole Search in Directed Graphs | 2010-02-24 | Paper |
| Measuring the problem-relevant information in input | 2009-07-15 | Paper |
| On Fractional Dynamic Faults with Threshold | 2009-03-12 | Paper |
| USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS | 2009-02-26 | Paper |
| Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges | 2008-09-18 | Paper |
| On fractional dynamic faults with thresholds | 2008-06-24 | Paper |
| The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring | 2008-03-07 | Paper |
| How Much Information about the Future Is Needed? | 2008-03-07 | Paper |
| Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs | 2007-11-15 | Paper |
| Mobile search for a black hole in an anonymous ring | 2007-07-19 | Paper |
| Computing input multiplicity in anonymous synchronous networks with dynamic faults | 2007-04-26 | Paper |
| Broadcasting in unlabeled hypercubes with a linear number of messages. | 2006-01-17 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Principles of Distributed Systems | 2005-08-24 | Paper |
| Communication-efficient broadcasting in complete networks with dynamic faults | 2005-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4825703 | 2004-11-05 | Paper |
| Dynamic faults have small effect on broadcasting in hypercubes. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436049 | 2003-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536367 | 2002-11-04 | Paper |
| Optimal broadcasting in hypercubes with dynamic faults | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766677 | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944977 | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232777 | 1999-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4209361 | 1999-01-11 | Paper |
