| Publication | Date of Publication | Type |
|---|
Correction to: ``Certificates in P and subquadratic-time computation of radius, diameter, and all eccentricities in graphs''
Algorithmica | 2026-05-08 | Paper |
Certificates in P and subquadratic-time computation of radius, diameter, and all eccentricities in graphs
Algorithmica | 2025-12-16 | Paper |
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
Journal of Computer and System Sciences | 2025-01-27 | Paper |
_i-metric graphs: radius, diameter and all eccentricities
Algorithmica | 2024-08-02 | Paper |
Core-periphery models for graphs based on their \( \delta \)-hyperbolicity: an example using biological networks
Journal of Algorithms & Computational Technology | 2024-06-07 | Paper |
| LexBFS-orderings and powers of graphs | 2024-06-05 | Paper |
| $$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities | 2024-05-03 | Paper |
Homogeneously orderable graphs and the Steiner tree problem
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Dually chordal graphs
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
The algorithmic use of hypertree structure and maximum neighbourhood orderings
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
A story of diameter, radius, and (almost) Helly property
Networks | 2023-12-11 | Paper |
Dominating cliques in distance-hereditary graphs
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
On condorcet and median points of simple rectilinear polygons
Fundamentals of Computation Theory | 2022-12-09 | Paper |
r-Domination problems on homogeneously orderable graphs
Fundamentals of Computation Theory | 2022-12-09 | Paper |
| Fellow travelers phenomenon present in real-world networks | 2022-10-25 | Paper |
Injective hulls of various graph classes
Graphs and Combinatorics | 2022-07-15 | Paper |
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
(available as arXiv preprint) | 2022-03-25 | Paper |
| Distance approximating trees for chordal and dually chordal graphs (extended abstract) | 2021-12-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
Discrete & Computational Geometry | 2021-04-20 | Paper |
Helly-gap of a graph and vertex eccentricities
Theoretical Computer Science | 2021-04-15 | Paper |
| Fast approximation and exact computation of negative curvature parameters of graphs | 2020-08-18 | Paper |
Eccentricity function in distance-hereditary graphs
Theoretical Computer Science | 2020-08-03 | Paper |
Eccentricity terrain of \(\delta\)-hyperbolic graphs
Journal of Computer and System Sciences | 2020-06-09 | Paper |
An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time
Information Processing Letters | 2019-11-28 | 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 |
Slimness of graphs
(available as arXiv preprint) | 2019-05-23 | Paper |
| Slimness of graphs | 2019-05-23 | Paper |
Parameterized approximation algorithms for some location problems in graphs
Theoretical Computer Science | 2019-02-14 | Paper |
Obstructions to a small hyperbolicity in Helly graphs
Discrete Mathematics | 2018-11-29 | Paper |
Core congestion is inherent in hyperbolic networks
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Tree-structured graphs | 2018-04-23 | Paper |
Parameterized approximation algorithms for some location problems in graphs
Lecture Notes in Computer Science | 2018-03-26 | Paper |
Eccentricity approximating trees
Discrete Applied Mathematics | 2017-10-17 | Paper |
On the minimum eccentricity shortest path problem
Theoretical Computer Science | 2017-09-12 | Paper |
Line-distortion, bandwidth and path-length of a graph
Algorithmica | 2017-04-12 | Paper |
On strong tree-breadth
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Eccentricity approximating trees (extended abstract)
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Minimum eccentricity shortest paths in some structured graph classes
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Minimum eccentricity shortest paths in some structured graph classes
Journal of Graph Algorithms and Applications | 2016-05-20 | Paper |
On the minimum eccentricity shortest path problem
Lecture Notes in Computer Science | 2015-10-30 | Paper |
An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
Algorithmica | 2014-11-19 | Paper |
Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences
Lecture Notes in Computer Science | 2014-11-04 | Paper |
Line-distortion, bandwidth and path-length of a graph
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
Theoretical Computer Science | 2014-07-25 | Paper |
Tree-Like Structures in Graphs: A Metric Point of View
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Collective tree spanners for unit disk graphs with applications
Electronic Notes in Discrete Mathematics | 2013-07-04 | Paper |
Notes on diameters, centers, and approximating trees of -hyperbolic geodesic spaces and graphs
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
How to use spanning trees to navigate in graphs
Algorithmica | 2013-06-25 | Paper |
Collective additive tree spanners for circle graphs and polygonal graphs
Discrete Applied Mathematics | 2012-08-14 | Paper |
Compact and low delay routing labeling scheme for unit disk graphs
Computational Geometry | 2012-05-18 | Paper |
Additive spanners and distance and routing labeling schemes for hyperbolic graphs
Algorithmica | 2012-04-26 | Paper |
Summarizing transactional databases with overlapped hyperrectangles
Data Mining and Knowledge Discovery | 2012-04-11 | Paper |
Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
Discrete & Computational Geometry | 2012-03-02 | Paper |
Spanners in sparse graphs
Journal of Computer and System Sciences | 2012-01-11 | Paper |
Navigating in a graph by aid of its spanning tree metric
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Approximation of minimum weight spanners for sparse graphs
Theoretical Computer Science | 2011-02-21 | Paper |
New min-max theorems for weakly chordal and dually chordal graphs
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Network flow spanners
Networks | 2010-11-24 | 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 |
Collective tree spanners in graphs with bounded parameters
Algorithmica | 2010-03-04 | Paper |
Tree spanners for bipartite graphs and probe interval graphs.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
Lecture Notes in Computer Science | 2009-10-20 | Paper |
How to Use Spanning Trees to Navigate in Graphs
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | 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 |
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Navigating in a Graph by Aid of Its Spanning Tree
Algorithms and Computation | 2009-01-29 | Paper |
Additive Spanners for Circle Graphs and Polygonal Graphs
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Collective Tree Spanners and Routing in AT-free Related Graphs
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Collective Tree Spanners and Routing in AT-free Related Graphs
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Network Flow Spanners
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Spanners in Sparse Graphs
Automata, Languages and Programming | 2008-08-28 | Paper |
Collective Additive Tree Spanners of Homogeneously Orderable Graphs
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Spanners for bounded tree-length graphs
Theoretical Computer Science | 2007-09-19 | Paper |
Generalized Powers of Graphs and Their Algorithmic Use
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
On compact and efficient routing in certain graph classes
Discrete Applied Mathematics | 2007-07-19 | Paper |
Distance Approximating Trees: Complexity and Algorithms
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Tree spanners for bipartite graphs and probe interval graphs
Algorithmica | 2007-03-05 | Paper |
Distance and routing labeling schemes for non-positively curved plane graphs
Journal of Algorithms | 2007-01-09 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Collective tree spanners of graphs
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
New graph classes of bounded clique-width
Theory of Computing Systems | 2006-02-08 | Paper |
Additive sparse spanners for graphs with bounded length of largest induced cycle
Theoretical Computer Science | 2005-12-29 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms | 2005-11-16 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
| scientific article; zbMATH DE number 2119682 (Why is no real title available?) | 2004-11-29 | Paper |
Tree spanners on chordal graphs: complexity and algorithms
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2086230 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2044927 (Why is no real title available?) | 2004-02-18 | Paper |
On the power of BFS to determine a graph's diameter
Networks | 2004-02-03 | Paper |
| scientific article; zbMATH DE number 2011848 (Why is no real title available?) | 2003-12-02 | Paper |
Finding a central vertex in an HHD-free graph
Discrete Applied Mathematics | 2003-09-25 | Paper |
| scientific article; zbMATH DE number 1979496 (Why is no real title available?) | 2003-09-14 | Paper |
On linear and circular structure of (claw, net)-free graphs
Discrete Applied Mathematics | 2003-09-09 | Paper |
| scientific article; zbMATH DE number 1953082 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1830745 (Why is no real title available?) | 2002-11-18 | Paper |
Diameter determination on restricted graph families
Discrete Applied Mathematics | 2002-08-14 | Paper |
| A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs | 2002-07-21 | Paper |
| Distance approximating trees in graphs | 2001-09-23 | Paper |
On stable cutsets in graphs
Discrete Applied Mathematics | 2001-06-13 | Paper |
Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
Discrete Applied Mathematics | 2001-05-10 | Paper |
A note on distance approximating trees in graphs
European Journal of Combinatorics | 2001-03-30 | Paper |
Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs
SIAM Journal on Computing | 2001-03-19 | Paper |
LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
Discrete Applied Mathematics | 2000-07-16 | Paper |
| scientific article; zbMATH DE number 1420921 (Why is no real title available?) | 2000-06-07 | Paper |
Lexbfs-orderings and powers of hhd-free graphs<sup>∗</sup>
International Journal of Computer Mathematics | 2000-04-10 | Paper |
Almost diameter of a house-hole-free graph in linear time via LexBFS
Discrete Applied Mathematics | 2000-03-22 | Paper |
| scientific article; zbMATH DE number 1414320 (Why is no real title available?) | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1220312 (Why is no real title available?) | 1999-11-08 | Paper |
| scientific article; zbMATH DE number 1220291 (Why is no real title available?) | 1999-11-08 | Paper |
Powers of hhd-free graphs<sup>∗</sup>
International Journal of Computer Mathematics | 1999-10-27 | Paper |
Convexity and HHD-Free Graphs
SIAM Journal on Discrete Mathematics | 1999-06-27 | Paper |
| scientific article; zbMATH DE number 1262798 (Why is no real title available?) | 1999-04-26 | Paper |
Condorcet and median points of simple rectilinear polygons
Location Science | 1999-03-01 | Paper |
Distance Approximating Trees for Chordal and Dually Chordal Graphs
Journal of Algorithms | 1999-02-02 | Paper |
Dually Chordal Graphs
SIAM Journal on Discrete Mathematics | 1998-09-21 | Paper |
The algorithmic use of hypertree structure and maximum neighbourhood orderings
Discrete Applied Mathematics | 1998-08-02 | Paper |
Homogeneously orderable graphs
Theoretical Computer Science | 1998-07-23 | Paper |
| r-domination problems on homogeneously orderable graphs | 1998-04-22 | Paper |
| scientific article; zbMATH DE number 1107732 (Why is no real title available?) | 1998-01-21 | Paper |
LexBFS-orderings and powers of chordal graphs
Discrete Mathematics | 1998-01-19 | Paper |
\(r\)-dominating cliques in graphs with hypertree structure
Discrete Mathematics | 1997-07-07 | Paper |
Incidence graphs of biacyclic hypergraphs
Discrete Applied Mathematics | 1997-05-28 | Paper |
Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
SIAM Journal on Discrete Mathematics | 1997-05-20 | Paper |
Perfect elimination orderings of chordal powers of graphs
Discrete Mathematics | 1996-11-07 | Paper |
| scientific article; zbMATH DE number 706830 (Why is no real title available?) | 1995-05-28 | Paper |
Domination in quadrangle-free Helly graphs
Cybernetics and Systems Analysis | 1995-05-17 | Paper |
| scientific article; zbMATH DE number 468643 (Why is no real title available?) | 1994-08-29 | Paper |
Computing a median point of a simple rectilinear polygon
Information Processing Letters | 1994-05-03 | Paper |
| scientific article; zbMATH DE number 175723 (Why is no real title available?) | 1993-05-18 | Paper |
\alpha_i-Metric Graphs: Hyperbolicity
(available as arXiv preprint) | N/A | Paper |
