Feodor F. Dragan

From MaRDI portal
Person:221665

Available identifiers

zbMath Open dragan.feodor-fMaRDI QIDQ221665

List of research outcomes

PublicationDate of PublicationType
Homogeneously orderable graphs and the Steiner tree problem2024-02-28Paper
Dually chordal graphs2024-01-05Paper
The algorithmic use of hypertree structure and maximum neighbourhood orderings2024-01-05Paper
A story of diameter, radius, and (almost) Helly property2023-12-11Paper
On condorcet and median points of simple rectilinear polygons2022-12-09Paper
r-Domination problems on homogeneously orderable graphs2022-12-09Paper
Dominating cliques in distance-hereditary graphs2022-12-09Paper
Fellow travelers phenomenon present in real-world networks2022-10-25Paper
Injective hulls of various graph classes2022-07-15Paper
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs2022-03-25Paper
Distance approximating trees for chordal and dually chordal graphs (extended abstract)2021-12-20Paper
Fast approximation and exact computation of negative curvature parameters of graphs2021-04-20Paper
Helly-gap of a graph and vertex eccentricities2021-04-15Paper
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs2020-08-18Paper
Eccentricity function in distance-hereditary graphs2020-08-03Paper
Eccentricity terrain of \(\delta\)-hyperbolic graphs2020-06-09Paper
An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time2019-11-28Paper
Fast approximation of centrality and distances in hyperbolic graphs2019-10-11Paper
Fast approximation of eccentricities and distances in hyperbolic graphs2019-07-12Paper
Slimness of graphs2019-05-23Paper
Parameterized approximation algorithms for some location problems in graphs2019-02-14Paper
Obstructions to a small hyperbolicity in Helly graphs2018-11-29Paper
Core congestion is inherent in hyperbolic networks2018-07-16Paper
https://portal.mardi4nfdi.de/entity/Q46359852018-04-23Paper
Parameterized approximation algorithms for some location problems in graphs2018-03-26Paper
Eccentricity approximating trees2017-10-17Paper
On the minimum eccentricity shortest path problem2017-09-12Paper
Line-distortion, bandwidth and path-length of a graph2017-04-12Paper
On Strong Tree-Breadth2017-02-01Paper
Eccentricity Approximating Trees2016-12-22Paper
Minimum Eccentricity Shortest Paths in Some Structured Graph Classes2016-10-21Paper
Minimum Eccentricity Shortest Paths in some Structured Graph Classes2016-05-20Paper
On the Minimum Eccentricity Shortest Path Problem2015-10-30Paper
An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs2014-11-19Paper
Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences2014-11-04Paper
Line-Distortion, Bandwidth and Path-Length of a Graph2014-09-02Paper
Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences2014-07-25Paper
Tree-Like Structures in Graphs: A Metric Point of View2013-12-06Paper
Collective Tree Spanners for Unit Disk Graphs with Applications2013-07-04Paper
Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs2013-06-28Paper
How to use spanning trees to navigate in graphs2013-06-25Paper
Collective additive tree spanners for circle graphs and polygonal graphs2012-08-14Paper
Compact and low delay routing labeling scheme for unit disk graphs2012-05-18Paper
Additive spanners and distance and routing labeling schemes for hyperbolic graphs2012-04-26Paper
Summarizing transactional databases with overlapped hyperrectangles2012-04-11Paper
Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs2012-03-02Paper
Spanners in sparse graphs2012-01-11Paper
Navigating in a Graph by Aid of Its Spanning Tree Metric2011-10-27Paper
An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs2011-08-17Paper
Approximation of minimum weight spanners for sparse graphs2011-02-21Paper
New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs2011-01-10Paper
Network flow spanners2010-11-24Paper
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs2010-09-10Paper
Collective tree spanners in graphs with bounded parameters2010-03-04Paper
Graph-Theoretic Concepts in Computer Science2010-01-12Paper
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs2009-10-20Paper
How to Use Spanning Trees to Navigate in Graphs2009-10-16Paper
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs2009-02-12Paper
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs2009-02-03Paper
Navigating in a Graph by Aid of Its Spanning Tree2009-01-29Paper
Additive Spanners for Circle Graphs and Polygonal Graphs2009-01-20Paper
Collective Tree Spanners and Routing in AT-free Related Graphs2009-01-19Paper
Network Flow Spanners2008-09-18Paper
Spanners in Sparse Graphs2008-08-28Paper
Collective Additive Tree Spanners of Homogeneously Orderable Graphs2008-04-15Paper
Spanners for bounded tree-length graphs2007-09-19Paper
Generalized Powers of Graphs and Their Algorithmic Use2007-09-07Paper
On compact and efficient routing in certain graph classes2007-07-19Paper
Distance Approximating Trees: Complexity and Algorithms2007-05-02Paper
Tree spanners for bipartite graphs and probe interval graphs2007-03-05Paper
Distance and routing labeling schemes for non-positively curved plane graphs2007-01-09Paper
Algorithms and Computation2006-11-14Paper
Graph-Theoretic Concepts in Computer Science2006-11-01Paper
Collective tree spanners of graphs2006-06-01Paper
New graph classes of bounded clique-width2006-02-08Paper
Additive sparse spanners for graphs with bounded length of largest induced cycle2005-12-29Paper
Algorithms and Computation2005-12-22Paper
Graph-Theoretic Concepts in Computer Science2005-12-08Paper
Estimating all pairs shortest paths in restricted graph families: a unified approach2005-11-16Paper
Algorithm Theory - SWAT 20042005-09-07Paper
https://portal.mardi4nfdi.de/entity/Q48289532004-11-29Paper
Tree spanners on chordal graphs: complexity and algorithms2004-10-27Paper
https://portal.mardi4nfdi.de/entity/Q30443282004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44487512004-02-18Paper
On the power of BFS to determine a graph's diameter2004-02-03Paper
https://portal.mardi4nfdi.de/entity/Q44375002003-12-02Paper
Finding a central vertex in an HHD-free graph2003-09-25Paper
https://portal.mardi4nfdi.de/entity/Q44259512003-09-14Paper
On linear and circular structure of (claw, net)-free graphs2003-09-09Paper
https://portal.mardi4nfdi.de/entity/Q44144852003-07-25Paper
https://portal.mardi4nfdi.de/entity/Q47785662002-11-18Paper
Diameter determination on restricted graph families2002-08-14Paper
A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs2002-07-21Paper
https://portal.mardi4nfdi.de/entity/Q27413282001-09-23Paper
On stable cutsets in graphs2001-06-13Paper
Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs2001-05-10Paper
A note on distance approximating trees in graphs2001-03-30Paper
Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs2001-03-19Paper
LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem2000-07-16Paper
https://portal.mardi4nfdi.de/entity/Q49449932000-06-07Paper
Lexbfs-orderings and powers of hhd-free graphs2000-04-10Paper
Almost diameter of a house-hole-free graph in linear time via LexBFS2000-03-22Paper
https://portal.mardi4nfdi.de/entity/Q49426572000-03-16Paper
https://portal.mardi4nfdi.de/entity/Q42194111999-11-08Paper
https://portal.mardi4nfdi.de/entity/Q42194341999-11-08Paper
Powers of hhd-free graphs1999-10-27Paper
Convexity and HHD-Free Graphs1999-06-27Paper
https://portal.mardi4nfdi.de/entity/Q42327881999-04-26Paper
Condorcet and median points of simple rectilinear polygons1999-03-01Paper
Distance Approximating Trees for Chordal and Dually Chordal Graphs1999-02-02Paper
Dually Chordal Graphs1998-09-21Paper
The algorithmic use of hypertree structure and maximum neighbourhood orderings1998-08-02Paper
Homogeneously orderable graphs1998-07-23Paper
r-domination problems on homogeneously orderable graphs1998-04-22Paper
https://portal.mardi4nfdi.de/entity/Q43736811998-01-21Paper
LexBFS-orderings and powers of chordal graphs1998-01-19Paper
\(r\)-dominating cliques in graphs with hypertree structure1997-07-07Paper
Incidence graphs of biacyclic hypergraphs1997-05-28Paper
Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs1997-05-20Paper
Perfect elimination orderings of chordal powers of graphs1996-11-07Paper
https://portal.mardi4nfdi.de/entity/Q43182201995-05-28Paper
Domination in quadrangle-free Helly graphs1995-05-17Paper
https://portal.mardi4nfdi.de/entity/Q42721211994-08-29Paper
Computing a median point of a simple rectilinear polygon1994-05-03Paper
https://portal.mardi4nfdi.de/entity/Q40347741993-05-18Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Feodor F. Dragan