On G^p-unimodality of radius functions in graphs: structure and algorithms.

Graphs with G^p-connected medians.

ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G2-connected medians.

Additive approximation algorithm for geodesic centers in δ-hyperbolic graphs.

Sample Compression Schemes for Balls in Graphs.

Optimizing the ecological connectivity of landscapes.

Medians in median graphs and their cube complexes in linear time.

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G²-connected medians.

Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs.

Optimizing the ecological connectivity of landscapes with generalized flow models and preprocessing.

Fast approximation of eccentricities and distances in hyperbolic graphs.

Medians in median graphs in linear time.

Maximum flow under proportional delay constraint.

Bidirected minimum Manhattan network problem.

The Maximum Labeled Path Problem.

Convergecast and Broadcast by Power-Aware Mobile Agents.

Retracts of Products of Chordal Graphs.

Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs.

A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives.

Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs.

Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm.

Embedding into the rectilinear plane in optimal O(n²) time.

Cop and Robber Games When the Robber Can Hide and Ride.

Pareto Envelopes in Simple Polygons.

Embedding into the rectilinear plane in optimal O*(n^2)

A rounding algorithm for approximating minimum Manhattan networks.

Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length.

Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs.

Covering Planar Graphs with a Fixed Number of Balls.

Addressing, distances and routing in triangular systems with applications in cellular networks.

Distance and routing labeling schemes for non-positively curved plane graphs.

Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints.

Lowering eccentricity of a tree by node upgrading.

Median problem in some plane triangulations and quadrangulations.

Upgrading trees under diameter and budget constraints.

On covering bridged plane triangulations with balls.

Augmenting Trees to Meet Biconnectivity and Diameter Constraints.

A primal partitioning approach for single and non-simultaneous multicommodity flow problems.

Multicommodity network flow with jump constraints.