The following pages link to Feodor F. Dragan (Q221665):
Displaying 50 items.
- Summarizing transactional databases with overlapped hyperrectangles (Q408648) (← links)
- Compact and low delay routing labeling scheme for unit disk graphs (Q419502) (← links)
- Collective additive tree spanners for circle graphs and polygonal graphs (Q444436) (← links)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs (Q664543) (← links)
- Eccentricity function in distance-hereditary graphs (Q784475) (← links)
- New graph classes of bounded clique-width (Q814931) (← links)
- Distance approximating trees for chordal and dually chordal graphs (extended abstract) (Q826072) (← links)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q832869) (← links)
- Collective tree spanners in graphs with bounded parameters (Q848633) (← links)
- Tree spanners for bipartite graphs and probe interval graphs (Q868437) (← links)
- On compact and efficient routing in certain graph classes (Q997073) (← links)
- Almost diameter of a house-hole-free graph in linear time via LexBFS (Q1302159) (← links)
- Computing a median point of a simple rectilinear polygon (Q1321814) (← links)
- \(r\)-dominating cliques in graphs with hypertree structure (Q1356657) (← links)
- LexBFS-orderings and powers of chordal graphs (Q1363684) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
- Homogeneously orderable graphs (Q1392023) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- Finding a central vertex in an HHD-free graph (Q1408816) (← links)
- On stable cutsets in graphs (Q1582067) (← links)
- A note on distance approximating trees in graphs (Q1582482) (← links)
- Obstructions to a small hyperbolicity in Helly graphs (Q1625787) (← links)
- Perfect elimination orderings of chordal powers of graphs (Q1815326) (← links)
- Domination in quadrangle-free Helly graphs (Q1842416) (← links)
- Tree spanners on chordal graphs: complexity and algorithms (Q1884978) (← links)
- Incidence graphs of biacyclic hypergraphs (Q1923616) (← links)
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs (Q1962062) (← links)
- LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem (Q1962066) (← links)
- An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time (Q2011037) (← links)
- Fellow travelers phenomenon present in real-world networks (Q2086588) (← links)
- Injective hulls of various graph classes (Q2155861) (← links)
- Eccentricity terrain of \(\delta\)-hyperbolic graphs (Q2186812) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- Fast approximation of centrality and distances in hyperbolic graphs (Q2327101) (← links)
- How to use spanning trees to navigate in graphs (Q2375948) (← links)
- Spanners for bounded tree-length graphs (Q2383601) (← links)
- On the minimum eccentricity shortest path problem (Q2404081) (← links)
- Eccentricity approximating trees (Q2410233) (← links)
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs (Q2428695) (← links)
- Additive sparse spanners for graphs with bounded length of largest induced cycle (Q2576868) (← links)
- Helly-gap of a graph and vertex eccentricities (Q2663046) (← links)
- Fast approximation and exact computation of negative curvature parameters of graphs (Q2664113) (← links)
- Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs (Q2706129) (← links)
- (Q2741328) (← links)
- Minimum Eccentricity Shortest Paths in some Structured Graph Classes (Q2807326) (← links)
- Minimum Eccentricity Shortest Paths in Some Structured Graph Classes (Q2827811) (← links)
