Publication | Date of Publication | Type |
---|
Homogeneously orderable graphs and the Steiner tree problem | 2024-02-28 | Paper |
Dually chordal graphs | 2024-01-05 | Paper |
The algorithmic use of hypertree structure and maximum neighbourhood orderings | 2024-01-05 | Paper |
A story of diameter, radius, and (almost) Helly property | 2023-12-11 | Paper |
On condorcet and median points of simple rectilinear polygons | 2022-12-09 | Paper |
r-Domination problems on homogeneously orderable graphs | 2022-12-09 | Paper |
Dominating cliques in distance-hereditary graphs | 2022-12-09 | Paper |
Fellow travelers phenomenon present in real-world networks | 2022-10-25 | Paper |
Injective hulls of various graph classes | 2022-07-15 | Paper |
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs | 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 | 2021-04-20 | Paper |
Helly-gap of a graph and vertex eccentricities | 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 | 2020-08-03 | Paper |
Eccentricity terrain of \(\delta\)-hyperbolic graphs | 2020-06-09 | Paper |
An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time | 2019-11-28 | 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 |
Slimness of graphs | 2019-05-23 | Paper |
Parameterized approximation algorithms for some location problems in graphs | 2019-02-14 | Paper |
Obstructions to a small hyperbolicity in Helly graphs | 2018-11-29 | Paper |
Core congestion is inherent in hyperbolic networks | 2018-07-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4635985 | 2018-04-23 | Paper |
Parameterized approximation algorithms for some location problems in graphs | 2018-03-26 | Paper |
Eccentricity approximating trees | 2017-10-17 | Paper |
On the minimum eccentricity shortest path problem | 2017-09-12 | Paper |
Line-distortion, bandwidth and path-length of a graph | 2017-04-12 | Paper |
On Strong Tree-Breadth | 2017-02-01 | Paper |
Eccentricity Approximating Trees | 2016-12-22 | Paper |
Minimum Eccentricity Shortest Paths in Some Structured Graph Classes | 2016-10-21 | Paper |
Minimum Eccentricity Shortest Paths in some Structured Graph Classes | 2016-05-20 | Paper |
On the Minimum Eccentricity Shortest Path Problem | 2015-10-30 | Paper |
An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs | 2014-11-19 | Paper |
Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences | 2014-11-04 | Paper |
Line-Distortion, Bandwidth and Path-Length of a Graph | 2014-09-02 | Paper |
Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences | 2014-07-25 | Paper |
Tree-Like Structures in Graphs: A Metric Point of View | 2013-12-06 | Paper |
Collective Tree Spanners for Unit Disk Graphs with Applications | 2013-07-04 | Paper |
Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs | 2013-06-28 | Paper |
How to use spanning trees to navigate in graphs | 2013-06-25 | Paper |
Collective additive tree spanners for circle graphs and polygonal graphs | 2012-08-14 | Paper |
Compact and low delay routing labeling scheme for unit disk graphs | 2012-05-18 | Paper |
Additive spanners and distance and routing labeling schemes for hyperbolic graphs | 2012-04-26 | Paper |
Summarizing transactional databases with overlapped hyperrectangles | 2012-04-11 | Paper |
Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs | 2012-03-02 | Paper |
Spanners in sparse graphs | 2012-01-11 | Paper |
Navigating in a Graph by Aid of Its Spanning Tree Metric | 2011-10-27 | Paper |
An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs | 2011-08-17 | Paper |
Approximation of minimum weight spanners for sparse graphs | 2011-02-21 | Paper |
New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs | 2011-01-10 | Paper |
Network flow spanners | 2010-11-24 | Paper |
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs | 2010-09-10 | Paper |
Collective tree spanners in graphs with bounded parameters | 2010-03-04 | Paper |
Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs | 2009-10-20 | Paper |
How to Use Spanning Trees to Navigate in Graphs | 2009-10-16 | Paper |
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs | 2009-02-12 | Paper |
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs | 2009-02-03 | Paper |
Navigating in a Graph by Aid of Its Spanning Tree | 2009-01-29 | Paper |
Additive Spanners for Circle Graphs and Polygonal Graphs | 2009-01-20 | Paper |
Collective Tree Spanners and Routing in AT-free Related Graphs | 2009-01-19 | Paper |
Network Flow Spanners | 2008-09-18 | Paper |
Spanners in Sparse Graphs | 2008-08-28 | Paper |
Collective Additive Tree Spanners of Homogeneously Orderable Graphs | 2008-04-15 | Paper |
Spanners for bounded tree-length graphs | 2007-09-19 | Paper |
Generalized Powers of Graphs and Their Algorithmic Use | 2007-09-07 | Paper |
On compact and efficient routing in certain graph classes | 2007-07-19 | Paper |
Distance Approximating Trees: Complexity and Algorithms | 2007-05-02 | Paper |
Tree spanners for bipartite graphs and probe interval graphs | 2007-03-05 | Paper |
Distance and routing labeling schemes for non-positively curved plane graphs | 2007-01-09 | Paper |
Algorithms and Computation | 2006-11-14 | Paper |
Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
Collective tree spanners of graphs | 2006-06-01 | Paper |
New graph classes of bounded clique-width | 2006-02-08 | Paper |
Additive sparse spanners for graphs with bounded length of largest induced cycle | 2005-12-29 | Paper |
Algorithms and Computation | 2005-12-22 | Paper |
Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
Estimating all pairs shortest paths in restricted graph families: a unified approach | 2005-11-16 | Paper |
Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q4828953 | 2004-11-29 | Paper |
Tree spanners on chordal graphs: complexity and algorithms | 2004-10-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q3044328 | 2004-08-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4448751 | 2004-02-18 | Paper |
On the power of BFS to determine a graph's diameter | 2004-02-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q4437500 | 2003-12-02 | Paper |
Finding a central vertex in an HHD-free graph | 2003-09-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4425951 | 2003-09-14 | Paper |
On linear and circular structure of (claw, net)-free graphs | 2003-09-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q4414485 | 2003-07-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4778566 | 2002-11-18 | Paper |
Diameter determination on restricted graph families | 2002-08-14 | Paper |
A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs | 2002-07-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q2741328 | 2001-09-23 | Paper |
On stable cutsets in graphs | 2001-06-13 | Paper |
Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs | 2001-05-10 | Paper |
A note on distance approximating trees in graphs | 2001-03-30 | Paper |
Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs | 2001-03-19 | Paper |
LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem | 2000-07-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4944993 | 2000-06-07 | Paper |
Lexbfs-orderings and powers of hhd-free graphs∗ | 2000-04-10 | Paper |
Almost diameter of a house-hole-free graph in linear time via LexBFS | 2000-03-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4942657 | 2000-03-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4219411 | 1999-11-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q4219434 | 1999-11-08 | Paper |
Powers of hhd-free graphs∗ | 1999-10-27 | Paper |
Convexity and HHD-Free Graphs | 1999-06-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q4232788 | 1999-04-26 | Paper |
Condorcet and median points of simple rectilinear polygons | 1999-03-01 | Paper |
Distance Approximating Trees for Chordal and Dually Chordal Graphs | 1999-02-02 | Paper |
Dually Chordal Graphs | 1998-09-21 | Paper |
The algorithmic use of hypertree structure and maximum neighbourhood orderings | 1998-08-02 | Paper |
Homogeneously orderable graphs | 1998-07-23 | Paper |
r-domination problems on homogeneously orderable graphs | 1998-04-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4373681 | 1998-01-21 | Paper |
LexBFS-orderings and powers of chordal graphs | 1998-01-19 | Paper |
\(r\)-dominating cliques in graphs with hypertree structure | 1997-07-07 | Paper |
Incidence graphs of biacyclic hypergraphs | 1997-05-28 | Paper |
Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs | 1997-05-20 | Paper |
Perfect elimination orderings of chordal powers of graphs | 1996-11-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q4318220 | 1995-05-28 | Paper |
Domination in quadrangle-free Helly graphs | 1995-05-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4272121 | 1994-08-29 | Paper |
Computing a median point of a simple rectilinear polygon | 1994-05-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q4034774 | 1993-05-18 | Paper |