| Publication | Date of Publication | Type |
|---|
| Isometric path complexity of graphs | 2024-12-03 | Paper |
| ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and \(G^2\)-connected medians | 2024-11-06 | Paper |
| Sample compression schemes for balls in graphs | 2024-08-06 | Paper |
| Graphs with \(G^p\)-connected medians | 2024-02-21 | Paper |
| Optimizing the ecological connectivity of landscapes | 2023-12-18 | Paper |
| Sample Compression Schemes for Balls in Graphs | 2023-11-14 | Paper |
| Isometric path complexity of graphs | 2022-12-31 | Paper |
| ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G$^2$-connected medians | 2022-06-07 | Paper |
| Medians in median graphs and their cube complexes in linear time | 2022-03-29 | Paper |
| Fast approximation and exact computation of negative curvature parameters of graphs | 2021-04-20 | Paper |
| Fast approximation and exact computation of negative curvature parameters of graphs | 2020-08-18 | Paper |
| Fast approximation of centrality and distances in hyperbolic graphs | 2019-10-11 | Paper |
| Fast approximation of eccentricities and distances in hyperbolic graphs | 2019-07-12 | Paper |
| Core congestion is inherent in hyperbolic networks | 2018-07-16 | Paper |
| Bidirected minimum Manhattan network problem | 2018-06-13 | Paper |
| Maximum flow under proportional delay constraint | 2017-09-07 | Paper |
| The maximum labeled path problem | 2017-05-11 | Paper |
| Convergecast and broadcast by power-aware mobile agents | 2016-03-23 | Paper |
| The Maximum Labeled Path Problem | 2015-09-09 | Paper |
| Notes on diameters, centers, and approximating trees of \(\delta\)-hyperbolic geodesic spaces and graphs | 2013-06-28 | Paper |
| Retracts of products of chordal graphs | 2013-05-21 | Paper |
| Collecting information by power-aware mobile agents | 2013-03-13 | Paper |
| Additive spanners and distance and routing labeling schemes for hyperbolic graphs | 2012-04-26 | Paper |
| Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm | 2012-04-26 | Paper |
| A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives | 2012-04-26 | Paper |
| Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs | 2012-03-02 | Paper |
| Cop and robber games when the robber can hide and ride | 2011-10-27 | Paper |
| Embedding into the rectilinear plane in optimal \(O(n^{2})\) time | 2011-05-10 | Paper |
| Pareto envelopes in simple polygons | 2011-02-02 | Paper |
| Planar Hop Spanners for Unit Disk Graphs | 2010-11-16 | Paper |
| Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs | 2010-09-10 | Paper |
| Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs | 2009-02-12 | Paper |
| Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length | 2008-07-31 | Paper |
| A rounding algorithm for approximating minimum Manhattan networks | 2008-03-05 | Paper |
| A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives | 2007-11-15 | Paper |
| Mixed covering of trees and the augmentation problem with odd diameter constraints | 2007-05-29 | Paper |
| Covering planar graphs with a fixed number of balls | 2007-04-26 | Paper |
| Distance and routing labeling schemes for non-positively curved plane graphs | 2007-01-09 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Mixed covering of trees and the augmentation problem with odd diameter constraints | 2006-08-11 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Lowering eccentricity of a tree by node upgrading | 2005-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828953 | 2004-11-29 | Paper |
| Median problem in some plane triangulations and quadrangulations. | 2004-03-29 | Paper |
| On covering bridged plane triangulations with balls | 2003-11-10 | Paper |
| Upgrading trees under diameter and budget constraints | 2003-03-10 | Paper |
| Augmenting trees to meet biconnectivity and diameter constraints | 2002-06-17 | Paper |
| A primal partitioning approach for single and non-simultaneous multicommodity flow problems | 2000-07-09 | Paper |
| Multicommodity network flow with jump constraints | 1997-06-10 | Paper |
