| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6128602 | 2024-04-15 | Paper |
| Balanced allocation on dynamic hypergraphs | 2023-10-31 | Paper |
| Balanced allocation on hypergraphs | 2023-08-21 | Paper |
| Functional graphs of families of quadratic polynomials | 2023-05-26 | Paper |
| Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks | 2021-03-15 | Paper |
| Interval routing schemes allow broadcasting with linear message-complexity | 2020-12-03 | Paper |
| On Functional Graphs of Quadratic Polynomials | 2019-08-13 | Paper |
| Optimal elections in faulty loop networks and applications | 2018-07-09 | Paper |
| Information Propagation Speed in Mobile and Delay Tolerant Networks | 2017-07-27 | Paper |
| Highway Vehicular Delay Tolerant Networks: Information Propagation Speed Properties | 2017-07-12 | Paper |
| Measuring Temporal Lags in Delay-Tolerant Networks | 2017-06-20 | Paper |
| On the Throughput-Delay Tradeoff in Georouting Networks | 2017-04-28 | Paper |
| Incremental problems in the parameterized complexity setting | 2017-03-31 | Paper |
| On the impact of sense of direction on message complexity | 2016-05-26 | Paper |
| Functional graphs of polynomials over finite fields | 2015-12-11 | Paper |
| Shortest, Fastest, and Foremost Broadcast in Dynamic Networks | 2015-09-29 | Paper |
| Interval routing schemes allow broadcasting with linear message-complexity (extended abstract) | 2015-03-03 | Paper |
| Random walks, bisections and gossiping in circulant graphs | 2015-01-19 | Paper |
| On the treewidth of dynamic graphs | 2014-10-06 | Paper |
| On the treewidth of dynamic graphs | 2013-06-11 | Paper |
| On the exploration of time-varying networks | 2013-02-19 | Paper |
| Random walks and bisections in random circulant graphs | 2012-06-29 | Paper |
| Network exploration by silent and oblivious robots | 2010-11-16 | Paper |
| Deterministic computations in time-varying graphs: broadcasting under unstructured mobility | 2010-10-27 | Paper |
| Exploration of periodically varying graphs | 2009-12-17 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Tree Decontamination with Temporary Immunity | 2009-01-29 | Paper |
| Distributed Disaster Disclosure | 2008-07-15 | Paper |
| A note on the Ádám conjecture for double loops. | 2006-01-17 | Paper |
| AN ALGORITHMIC MODEL FOR HETEROGENEOUS HYPER-CLUSTERS: RATIONALE AND EXPERIENCE | 2005-09-12 | Paper |
| Efficient trigger-broadcasting in heterogeneous clusters | 2005-06-01 | Paper |
| Sense of direction in distributed computing | 2003-05-14 | Paper |
| On the spectral Ádám property for circulant graphs | 2002-08-29 | Paper |
| Sense of direction: Definitions, properties, and classes | 2002-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753924 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4764007 | 2000-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218427 | 1999-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3838397 | 1998-11-26 | Paper |
| Optimal distributed algorithms in unlabeled tori and chordal rings | 1998-10-01 | Paper |
| Portable distributed priority queues with MPI | 1998-09-07 | Paper |
| A parallel depth first search branch and bound algorithm for the quadratic assignment problem | 1998-08-16 | Paper |
| Performances of parallel branch and bound algorithms with best-first search | 1996-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4764005 | 1995-05-30 | Paper |
| Optimal coteries and voting schemes | 1994-08-03 | Paper |
