| Publication | Date of Publication | Type |
|---|
| On devising Boolean Routing schemes | 2024-02-28 | Paper |
| Multi-dimensional Interval Routing Schemes | 2023-12-01 | Paper |
| Interval routing schemes | 2017-12-04 | Paper |
| On-line scheduling with setup costs | 2016-06-16 | Paper |
| The incremental maintenance of a depth-first-search tree in directed acyclic graphs | 2016-05-26 | Paper |
| Min-max communities in graphs: complexity and computational properties | 2015-12-28 | Paper |
| Distributed community detection in dynamic graphs | 2015-05-22 | Paper |
| Distributed Community Detection in Dynamic Graphs | 2013-12-17 | Paper |
| On-line load balancing made simple: greedy strikes back | 2008-05-16 | Paper |
| On-line algorithms for the channel assignment problem in cellular networks. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449245 | 2004-02-08 | Paper |
| Optimal centralized algorithms for store-and-forward deadlock avoidance | 2003-10-16 | Paper |
| Characterization results of all shortest paths interval routing schemes | 2003-06-26 | Paper |
| On the design of efficient ATM routing schemes | 2002-03-03 | Paper |
| Algorithms for the Relaxed Online Bin-Packing Model | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258216 | 1999-09-01 | Paper |
| Multidimensional interval routing schemes | 1999-01-12 | Paper |
| On devising Boolean Routing Schemes | 1998-06-30 | Paper |
| Preserving approximation in the min-weighted set cover problem | 1997-06-30 | Paper |
| Interval routing schemes | 1997-01-29 | Paper |
| The Set Union Problem with Unlimited Backtracking | 1994-12-21 | Paper |
| A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS | 1994-11-06 | Paper |
| Graph theoretical issues in computer networks | 1994-04-12 | Paper |
| An efficient implicit data structure for relation testing and searching in partially ordered sets | 1993-08-30 | Paper |
| Optimization aspects of deadlock prevention in packet-switching networks | 1993-01-16 | Paper |
| A pointer-free data structure for merging heaps and min-max heaps | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4712660 | 1992-06-25 | Paper |
| The set union problem with dynamic weighted backtracking | 1991-01-01 | Paper |
| On locally presented posets | 1990-01-01 | Paper |
| A partially persistent data structure for the set-union problem | 1990-01-01 | Paper |
| Worst-case analysis of the set-union problem with extended backtracking | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3355223 | 1989-01-01 | Paper |
| An application of $m$-ary trees to the design of data structures for geometric searching problems | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787478 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3767386 | 1987-01-01 | Paper |
| Time-Stamp Approach to Store-and-Forward Deadlock Prevention | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783593 | 1987-01-01 | Paper |
| Deadlock-Resistant Flow Control Procedures for Store-and-Forward Networks | 1984-01-01 | Paper |
