| Publication | Date of Publication | Type |
|---|
| Deterministic \(n\)-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies | 2024-08-01 | Paper |
| How vulnerable is an undirected planar graph with respect to max flow | 2024-03-15 | Paper |
| Non-crossing shortest paths lengths in planar graphs in linear time | 2024-02-14 | Paper |
| Non-crossing shortest paths lengths in planar graphs in linear time | 2023-10-04 | Paper |
| How vulnerable is an undirected planar graph with respect to max flow | 2023-10-04 | Paper |
| Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time | 2023-03-30 | Paper |
| Non-crossing shortest paths in undirected unweighted planar graphs in linear time | 2022-11-11 | Paper |
| Semi-dynamic shortest paths and breadth-first search in digraphs | 2022-11-09 | Paper |
| A tight relation between series-parallel graphs and bipartite distance hereditary graphs | 2022-11-04 | Paper |
| Enclosing many boxes by an optimal pair of boxes | 2022-08-18 | Paper |
| Network homophily via tail inequalities | 2022-08-03 | Paper |
| Evaluating homophily of human PPI with respect to chromosomes | 2022-07-29 | Dataset |
| Max flow vitality in general and st‐planar graphs | 2019-08-01 | Paper |
| A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs | 2018-11-26 | Paper |
| On computing the Galois lattice of bipartite distance hereditary graphs | 2017-06-14 | Paper |
| On resilient graph spanners | 2016-05-31 | Paper |
| The incremental maintenance of a depth-first-search tree in directed acyclic graphs | 2016-05-26 | Paper |
| On the Galois Lattice of Bipartite Distance Hereditary Graphs | 2015-09-15 | Paper |
| On the Galois lattice of bipartite distance hereditary graphs | 2015-07-06 | Paper |
| On resilient graph spanners | 2013-09-17 | Paper |
| COMPUTING GRAPH SPANNERS IN SMALL MEMORY: FAULT-TOLERANCE AND STREAMING | 2011-03-25 | Paper |
| Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming | 2010-07-20 | Paper |
| On the complexity of recognizing directed path families | 2010-04-28 | Paper |
| Graph spanners in the streaming model: An experimental study | 2009-08-27 | Paper |
| Small stretch \((\alpha ,\beta )\)-spanners in the streaming model | 2009-08-21 | Paper |
| Small Stretch Spanners on Dynamic Graphs | 2009-01-19 | Paper |
| Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments | 2008-09-25 | Paper |
| A characterization of partial directed line graphs | 2007-10-25 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Partially dynamic maintenance of minimum weight hyperpaths | 2005-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448373 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525264 | 2001-01-21 | Paper |
| Semi-dynamic breadth-first search in digraphs | 2000-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370204 | 1998-02-05 | Paper |
| On the Boolean dimension of spherical orders | 1997-07-13 | Paper |
| Enclosing a Set of Objects by Two Minimum Area Rectangles | 1997-06-22 | Paper |
| A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS | 1994-11-06 | Paper |
| SEPARATING SETS OF HYPERRECTANGLES | 1993-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035743 | 1993-05-18 | Paper |
| On the optimal binary plane partition for sets of isothetic rectangles | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359760 | 1990-01-01 | Paper |
