Feodor F. Dragan

Theor. Comput. Sci., 2020

Eccentricity terrain of δ-hyperbolic graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

Eccentricity terrain of δ-hyperbolic graphs.

[BibT_eX]

[DOI]

CoRR, 2020

Parallelizing pruned landmark labeling: dealing with dependencies in graph algorithms.

[BibT_eX]

[DOI]

Proceedings of the ICS '20: 2020 International Conference on Supercomputing, 2020

2019

Parameterized approximation algorithms for some location problems in graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Fast approximation of eccentricities and distances in hyperbolic graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

Slimness of graphs.

[BibT_eX]

[DOI]

Abdulhakeem Mohammed

Discret. Math. Theor. Comput. Sci., 2019

Obstructions to a small hyperbolicity in Helly graphs.

[BibT_eX]

[DOI]

Discret. Math., 2019

A story of diameter, radius and Helly property.

[BibT_eX]

[DOI]

Guillaume Ducoffe

CoRR, 2019

Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage!

[BibT_eX]

[DOI]

CoRR, 2019

2018

Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates.

[BibT_eX]

[DOI]

Michel Habib

Laurent Viennot

CoRR, 2018

Fast Approximation of Centrality and Distances in Hyperbolic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

On the minimum eccentricity shortest path problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Preface: Special graph classes and algorithms-in honor of Professor Andreas Brandstädt on the occasion of his 65th birthday.

[BibT_eX]

[DOI]

Dieter Kratsch

Van Bang Le

Discret. Appl. Math., 2017

Eccentricity approximating trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Line-Distortion, Bandwidth and Path-Length of a Graph.

[BibT_eX]

[DOI]

Algorithmica, 2017

Core congestion is inherent in hyperbolic networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Metric tree-like structures in real-world networks: an empirical study.

[BibT_eX]

[DOI]

Muad Abu-Ata

Networks, 2016

Minimum Eccentricity Shortest Paths in some Structured Graph Classes.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2016

Eccentricity Approximating Trees - Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

The Network of Genetic Admixture in Humans.

[BibT_eX]

[DOI]

Proceedings of the Complex Networks VII, 2016

On Strong Tree-Breadth.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Core-Periphery Models for Graphs Based on their δ-Hyperbolicity: An Example Using Biological Networks.

[BibT_eX]

[DOI]

Proceedings of the Complex Networks VI, 2015

2014

Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences.

[BibT_eX]

[DOI]

Muad Abu-Ata

Theor. Comput. Sci., 2014

Metric tree-like structures in real-life networks: an empirical study.

[BibT_eX]

[DOI]

Muad Abu-Ata

CoRR, 2014

An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2014

2013

How to Use Spanning Trees to Navigate in Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2013

Tree-Like Structures in Graphs: A Metric Point of View.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

2012

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

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2012

Collective additive tree spanners for circle graphs and polygonal graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Compact and low delay routing labeling scheme for Unit Disk Graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2012

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

[BibT_eX]

[DOI]

Algorithmica, 2012

2011

Approximation of minimum weight spanners for sparse graphs.

[BibT_eX]

[DOI]

Fedor V. Fomin

Petr A. Golovach

Theor. Comput. Sci., 2011

Navigating in a Graph by Aid of Its Spanning Tree Metric.

[BibT_eX]

[DOI]

Martín Matamala

SIAM J. Discret. Math., 2011

Spanners in sparse graphs.

[BibT_eX]

[DOI]

Fedor V. Fomin

Petr A. Golovach

J. Comput. Syst. Sci., 2011

Summarizing transactional databases with overlapped hyperrectangles.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2011

2010

Network flow spanners.

[BibT_eX]

[DOI]

Networks, 2010

Collective Tree Spanners in Graphs with Bounded Parameters.

[BibT_eX]

[DOI]

Algorithmica, 2010

New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs.

[BibT_eX]

[DOI]

Arthur H. Busch

R. Sritharan

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

Effective Monitor Placement in Internet Networks.

[BibT_eX]

[DOI]

Yuri Breitbart

Hassan Gobjuka

J. Networks, 2009

Collective Tree Spanners for Unit Disk Graphs with Applications.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

2008

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Additive Spanners for Circle Graphs and Polygonal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs.

[BibT_eX]

[DOI]

Fedor V. Fomin

Petr A. Golovach

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Collective Additive Tree Spanners of Homogeneously Orderable Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Succinct summarization of transactional databases: an overlapped hyperrectangle scheme.

[BibT_eX]

[DOI]

Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2008

Navigating in a Graph by Aid of Its Spanning Tree.

[BibT_eX]

[DOI]

Martín Matamala

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Overlapping Matrix Pattern Visualization: A Hypergraph Approach.

[BibT_eX]

[DOI]

Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

Spanners for bounded tree-length graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

On compact and efficient routing in certain graph classes.

[BibT_eX]

[DOI]

Irina Lomonosov

Discret. Appl. Math., 2007

Tree Spanners for Bipartite Graphs and Probe Interval Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2007

2006

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

[BibT_eX]

[DOI]

Wirel. Networks, 2006

Collective tree spanners of graphs.

[BibT_eX]

[DOI]

Irina Lomonosov

SIAM J. Discret. Math., 2006

Collective Tree Spanners and Routing in AT-free Related Graphs.

[BibT_eX]

[DOI]

Derek G. Corneil

J. Graph Algorithms Appl., 2006

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

[BibT_eX]

[DOI]

J. Algorithms, 2006

Generalized Powers of Graphs and Their Algorithmic Use.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2006

Distance Approximating Trees: Complexity and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005

Additive sparse spanners for graphs with bounded length of largest induced cycle.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

New Graph Classes of Bounded Clique-Width.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2005

Estimating all pairs shortest paths in restricted graph families: a unified approach.

[BibT_eX]

[DOI]

J. Algorithms, 2005

Collective Tree 1-Spanners for Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Distance-Based Location Update and Routing in Irregular Cellular Networks.

[BibT_eX]

[DOI]

Proceedings of the 6th ACIS International Conference on Software Engineering, 2005

Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

Tree spanners on chordal graphs: complexity and algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

Effective Network Monitoring.

[BibT_eX]

[DOI]

Yuri Breitbart

Hassan Gobjuka

Proceedings of the International Conference On Computer Communications and Networks (ICCCN 2004), 2004

2003

On the power of BFS to determine a graph's diameter.

[BibT_eX]

[DOI]

Derek G. Corneil

Networks, 2003

Finding a central vertex in an HHD-free graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

On linear and circular structure of (claw, net)-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Additive Spanners for k-Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

Provably good global buffering by generalized multiterminalmulticommodity flow approximation.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2002

Center and diameter problems in plane triangulations and quadrangulations.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

New Routing Schemes for Interval, Circular-Arc, and Permutation Graphs.

[BibT_eX]

Irina Lomonosov

Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

On the Power of BFS to Determine a Graphs Diameter.

[BibT_eX]

[DOI]

Derek G. Corneil

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001

Diameter determination on restricted graph families.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

Practical Approximation Algorithms for Separable Packing Linear Programs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Provably good global buffering by multi-terminal multicommodity flow approximation.

[BibT_eX]

[DOI]

Proceedings of ASP-DAC 2001, 2001

2000

Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

LexBFS-orderings of Distance-hereditary Graphs with Application to the Diametral Pair Problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

Strongly Orderable Graphs a Common Generalization of Strongly Chordal and Chordal Bipartite Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

On stable cutsets in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

Provably Good Global Buffering Using an Available Buffer Block Plan.

[BibT_eX]

[DOI]

Proceedings of the 2000 IEEE/ACM International Conference on Computer-Aided Design, 2000

1999

Convexity and HHD-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1999

Distance Approximating Trees for Chordal and Dually Chordal Graphs.

[BibT_eX]

[DOI]

J. Algorithms, 1999

Lexbfs-orderings and powers of hhd-free graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1999

A note on distance approximating trees in graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 1999

Almost Diameter of a House-hole-free Graph in Linear Time Via LexBFS.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

1998

Dually Chordal Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1998

A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs.

[BibT_eX]

[DOI]

Networks, 1998

Powers of hhd-free graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1998

The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

Diameter Determination on Restricted Graph Faminlies.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

1997

Homogeneously Orderable Graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1997

r-domination problems on homogeneously orderable graphs.

[BibT_eX]

[DOI]

Networks, 1997

LexBFS-orderings and powers of chordal graphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

1996

r-Dominating cliques in graphs with hypertree structure.

[BibT_eX]

[DOI]

Discret. Math., 1996

Perfect elimination orderings of chordal powers of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

Incidence Graphs of Biacyclic Hypergraphs.

[BibT_eX]

[DOI]

Vitaly I. Voloshin

Discret. Appl. Math., 1996

LexBFS-Orderings and Power of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

1995

Homogeneously Orderable Graphs and the Steiner Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

r-Domination Problems on Homogeneously Ordered Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994

Computing a Median Point of a Simple Rectilinear Polygon.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

Dominating Cliques in Distance-Hereditary Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1994

Dominating Cliques in Graphs with Hypertree Structures.

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1994

1993

HT-graphs: centers, connected r-domination and Steiner trees.

[BibT_eX]

[DOI]

Comput. Sci. J. Moldova, 1993

On link diameter of a simple rectilinear polygon.

[BibT_eX]

[DOI]