| Publication | Date of Publication | Type |
|---|
| Edge and pair queries-random graphs and complexity | 2023-06-15 | Paper |
| The complexity of bicriteria tree-depth | 2023-02-01 | Paper |
| Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots | 2022-12-09 | Paper |
| The complexity of bicriteria tree-depth | 2022-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075773 | 2022-05-11 | Paper |
| An efficient noisy binary search in graphs via Median approximation | 2022-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002857 | 2021-07-28 | Paper |
| On the Characteristic Graph of a Discrete Symmetric Channel | 2021-07-23 | Paper |
| Gossiping by energy-constrained mobile agents in tree networks | 2021-03-09 | Paper |
| Building a nest by an automaton | 2021-02-01 | Paper |
| Searching by heterogeneous agents | 2020-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111415 | 2020-05-27 | Paper |
| Searching by heterogeneous agents | 2020-02-06 | Paper |
| Shared processor scheduling of multiprocessor jobs | 2020-01-08 | Paper |
| On-line search in two-dimensional environment | 2019-12-19 | Paper |
| Cops, a fast robber and defensive domination on interval graphs | 2019-10-16 | Paper |
| Finding small-width connected path decompositions in polynomial time | 2019-10-16 | Paper |
| Shared processor scheduling | 2019-08-08 | Paper |
| On tradeoffs between width- and fill-like graph parameters | 2019-06-27 | Paper |
| Clearing directed subgraphs by mobile agents. Variations on covering with paths | 2019-05-03 | Paper |
| Collaborative exploration of trees by energy-constrained mobile robots | 2018-07-23 | Paper |
| On-line search in two-dimensional environment | 2018-06-22 | Paper |
| Shared multi-processor scheduling | 2018-05-29 | Paper |
| Normal-form preemption sequences for an open problem in scheduling theory | 2018-02-28 | Paper |
| The snow team problem (clearing directed subgraphs by mobile agents) | 2017-11-22 | Paper |
| Collision-free network exploration | 2017-05-26 | Paper |
| Bounds on the Cover Time of Parallel Rotor Walks | 2017-03-03 | Paper |
| Distributed Evacuation in Graphs with Multiple Exits | 2016-12-01 | Paper |
| Brushing with additional cleaning restrictions | 2016-06-27 | Paper |
| Optimal edge-coloring with edge rate constraints | 2016-06-10 | Paper |
| Bounds on the cover time of parallel rotor walks | 2016-04-18 | Paper |
| Topology recognition and leader election in colored networks | 2016-02-26 | Paper |
| Collaborative Exploration by Energy-Constrained Mobile Robots | 2016-01-08 | Paper |
| Rendezvous of heterogeneous mobile agents in edge-weighted networks | 2015-12-11 | Paper |
| The complexity of zero-visibility cops and robber | 2015-12-08 | Paper |
| The complexity of minimum-length path decompositions | 2015-08-31 | Paper |
| Distributed graph searching with a sense of direction | 2015-07-22 | Paper |
| The searchlight problem for road networks | 2015-07-13 | Paper |
| Fast collaborative graph exploration | 2015-06-09 | Paper |
| Zero-visibility cops and robber and the pathwidth of a graph | 2015-05-11 | Paper |
| Distinguishing views in symmetric networks: a tight lower bound | 2015-04-29 | Paper |
| The Complexity of Zero-Visibility Cops and Robber | 2014-09-02 | Paper |
| Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs | 2014-08-07 | Paper |
| Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks | 2014-08-07 | Paper |
| Leader election for anonymous asynchronous agents in arbitrary networks | 2014-07-11 | Paper |
| Three-fast-searchable graphs | 2014-04-22 | Paper |
| Zero-Visibility Cops and Robber Game on a Graph | 2014-04-03 | Paper |
| Collision-Free Network Exploration | 2014-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5747397 | 2014-02-14 | Paper |
| Routing equal-size messages on a slotted ring | 2014-02-05 | Paper |
| On minimum cost edge searching | 2014-01-10 | Paper |
| Fast Collaborative Graph Exploration | 2013-08-07 | Paper |
| From Pathwidth to Connected Pathwidth | 2013-04-09 | Paper |
| Approximate search strategies for weighted trees | 2013-01-07 | Paper |
| Drawing maps with advice | 2012-07-13 | Paper |
| Phutball is PSPACE-hard | 2012-04-03 | Paper |
| An efficient algorithm for finding ideal schedules | 2012-03-23 | Paper |
| From Pathwidth to Connected Pathwidth | 2012-01-23 | Paper |
| Connected searching of weighted trees | 2011-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3070239 | 2011-02-02 | Paper |
| The complexity of node blocking for dags | 2011-01-07 | Paper |
| Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines | 2010-11-03 | Paper |
| Drawing Maps with Advice | 2010-09-10 | Paper |
| Connected Searching of Weighted Trees | 2010-09-03 | Paper |
| Maximum vertex occupation time and inert fugitive: Recontamination does help | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575439 | 2010-07-27 | Paper |
| Minimum vertex ranking spanning tree problem for chordal and proper interval graphs | 2010-05-14 | Paper |
| Vertex rankings of chordal graphs and weighted trees | 2010-01-18 | Paper |
| Edge ranking and searching in partial orders | 2008-11-19 | Paper |
| Easy and hard instances of arc ranking in directed graphs | 2007-11-30 | Paper |
| Parallel Processing and Applied Mathematics | 2007-09-25 | Paper |
| Parallel Processing and Applied Mathematics | 2007-05-02 | Paper |
| Edge ranking of weighted trees | 2006-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5472917 | 2006-06-19 | Paper |
