| Publication | Date of Publication | Type |
|---|
| Medians in median graphs and their cube complexes in linear time | 2026-03-18 | Paper |
Isometric path complexity of graphs
Discrete Mathematics | 2025-12-15 | Paper |
Additive approximation algorithm for geodesic centers in -hyperbolic graphs
Theoretical Computer Science | 2025-07-21 | Paper |
| 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
Discrete Applied Mathematics | 2024-11-06 | Paper |
| Sample compression schemes for balls in graphs | 2024-08-06 | Paper |
Graphs with \(G^p\)-connected medians
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
Optimizing the ecological connectivity of landscapes
Networks | 2023-12-18 | Paper |
Sample Compression Schemes for Balls in Graphs
SIAM Journal on Discrete Mathematics | 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
Journal of Computer and System Sciences | 2022-03-29 | Paper |
Fast approximation and exact computation of negative curvature parameters of graphs
Discrete & Computational Geometry | 2021-04-20 | Paper |
Fast approximation and exact computation of negative curvature parameters of graphs
Discrete & Computational Geometry | 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
(available as arXiv preprint) | 2019-10-11 | Paper |
Fast approximation of eccentricities and distances in hyperbolic graphs
Journal of Graph Algorithms and Applications | 2019-07-12 | Paper |
Core congestion is inherent in hyperbolic networks
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Bidirected minimum Manhattan network problem
Networks | 2018-06-13 | Paper |
Maximum flow under proportional delay constraint
Theoretical Computer Science | 2017-09-07 | Paper |
The maximum labeled path problem
Algorithmica | 2017-05-11 | Paper |
Convergecast and broadcast by power-aware mobile agents
Algorithmica | 2016-03-23 | Paper |
The Maximum Labeled Path Problem
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Notes on diameters, centers, and approximating trees of \(\delta\)-hyperbolic geodesic spaces and graphs
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
Retracts of products of chordal graphs
Journal of Graph Theory | 2013-05-21 | Paper |
Collecting information by power-aware mobile agents
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Additive spanners and distance and routing labeling schemes for hyperbolic graphs
Algorithmica | 2012-04-26 | Paper |
Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm
Algorithmica | 2012-04-26 | Paper |
A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
Algorithmica | 2012-04-26 | Paper |
Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
Discrete & Computational Geometry | 2012-03-02 | Paper |
Cop and robber games when the robber can hide and ride
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Embedding into the rectilinear plane in optimal \(O(n^{2})\) time
Theoretical Computer Science | 2011-05-10 | Paper |
Pareto envelopes in simple polygons
International Journal of Computational Geometry & Applications | 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
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
Theoretical Computer Science | 2008-07-31 | Paper |
A rounding algorithm for approximating minimum Manhattan networks
Theoretical Computer Science | 2008-03-05 | Paper |
A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives
Structural Information and Communication Complexity | 2007-11-15 | Paper |
Mixed covering of trees and the augmentation problem with odd diameter constraints
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Covering planar graphs with a fixed number of balls
Discrete & Computational Geometry | 2007-04-26 | Paper |
Distance and routing labeling schemes for non-positively curved plane graphs
Journal of Algorithms | 2007-01-09 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Mixed covering of trees and the augmentation problem with odd diameter constraints
Algorithmica | 2006-08-11 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2006-07-07 | Paper |
Lowering eccentricity of a tree by node upgrading
Networks | 2005-08-05 | Paper |
| scientific article; zbMATH DE number 2119682 (Why is no real title available?) | 2004-11-29 | Paper |
Median problem in some plane triangulations and quadrangulations.
Computational Geometry | 2004-03-29 | Paper |
On covering bridged plane triangulations with balls
Journal of Graph Theory | 2003-11-10 | Paper |
Upgrading trees under diameter and budget constraints
Networks | 2003-03-10 | Paper |
Augmenting trees to meet biconnectivity and diameter constraints
Algorithmica | 2002-06-17 | Paper |
A primal partitioning approach for single and non-simultaneous multicommodity flow problems
European Journal of Operational Research | 2000-07-09 | Paper |
Multicommodity network flow with jump constraints
Discrete Mathematics | 1997-06-10 | Paper |
