| Publication | Date of Publication | Type |
|---|
| Zero-memory graph exploration with unknown inports | 2024-01-11 | Paper |
| Fully Online Matching with Advice on General Bipartite Graphs and Paths | 2023-06-30 | Paper |
| Optimal algorithms for broadcast and gossip in the edge-disjoint path modes | 2022-12-09 | Paper |
| Effective systolic algorithms for gossiping in cycles and two-dimensional grids | 2022-12-09 | Paper |
| Exploring sparse graphs with advice | 2022-12-08 | Paper |
| The complexity of colouring circle graphs | 2022-08-18 | Paper |
| Online Matching in Regular Bipartite Graphs | 2022-07-04 | Paper |
| On the advice complexity of the online dominating set problem | 2021-03-09 | Paper |
| The k-Observer Problem on d-regular Graphs | 2020-01-14 | Paper |
| Exploring sparse graphs with advice (extended abstract) | 2019-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4583882 | 2018-09-03 | Paper |
| Online Graph Coloring Against a Randomized Adversary | 2018-07-24 | Paper |
| Approximation algorithms for the TSP with sharpened triangle inequality | 2016-06-16 | Paper |
| Online Graph Coloring with Advice and Randomized Adversary | 2016-03-10 | Paper |
| Advice Complexity of the Online Coloring Problem | 2013-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3104272 | 2011-12-19 | Paper |
| Preemptive scheduling of equal-length jobs in polynomial time | 2011-02-19 | Paper |
| An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs | 2011-02-19 | Paper |
| Hardness results for approximating the bandwidth | 2011-01-18 | Paper |
| On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks | 2010-08-27 | Paper |
| Topology Control and Routing in Ad Hoc Networks | 2010-02-09 | Paper |
| The Minimal Manhattan Network Problem in Three Dimensions | 2009-02-24 | Paper |
| On \(k\)-connectivity problems with sharpened triangle inequality | 2009-02-23 | Paper |
| On-line load balancing made simple: greedy strikes back | 2008-05-16 | Paper |
| On the Complexity of the Traffic Grooming Problem in Optical Networks | 2007-11-15 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance. | 2005-04-27 | Paper |
| On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043710 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449245 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501548 | 2004-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437508 | 2003-12-02 | Paper |
| Elastic image matching is NP-complete | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415244 | 2003-07-28 | Paper |
| Scheduling time-constrained communication in linear networks | 2003-05-04 | Paper |
| Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. | 2002-08-05 | Paper |
| The hardness of placing street names in a Manhattan type map | 2002-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728893 | 2001-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503938 | 2001-05-28 | Paper |
| Embedding ladders and caterpillars into the hypercube | 1999-02-14 | Paper |
| Optimal embedding of complete binary trees into lines and grids | 1998-08-20 | Paper |
| Optimal algorithms for broadcast and gossip in the edge-disjoint modes | 1998-01-04 | Paper |
| The complexity of systolic dissemination of information in interconnection networks | 1997-12-17 | Paper |
| Automorphisms of broadcasting schemes with respect to start rounds | 1994-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694714 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4002519 | 1992-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787505 | 1988-01-01 | Paper |
