The following pages link to Feodor F. Dragan (Q221665):
Displaying 29 items.
- On condorcet and median points of simple rectilinear polygons (Q5055889) (← links)
- r-Domination problems on homogeneously orderable graphs (Q5055891) (← links)
- Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs (Q5115790) (← links)
- Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs (Q5301013) (← links)
- Collective Tree Spanners and Routing in AT-free Related Graphs (Q5301383) (← links)
- Additive Spanners for Circle Graphs and Polygonal Graphs (Q5302048) (← links)
- Algorithm Theory - SWAT 2004 (Q5315403) (← links)
- Slimness of graphs (Q5377232) (← links)
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs (Q5458559) (← links)
- Collective tree spanners of graphs (Q5470830) (← links)
- Estimating all pairs shortest paths in restricted graph families: a unified approach (Q5704853) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710823) (← links)
- Algorithms and Computation (Q5712130) (← links)
- Generalized Powers of Graphs and Their Algorithmic Use (Q5757881) (← links)
- Navigating in a Graph by Aid of Its Spanning Tree Metric (Q5894322) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897552) (← links)
- Algorithms and Computation (Q5897891) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902514) (← links)
- Parameterized approximation algorithms for some location problems in graphs (Q5915898) (← links)
- Diameter determination on restricted graph families (Q5951960) (← links)
- A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q6184359) (← links)
- $\alpha_i$-Metric Graphs: Hyperbolicity (Q6531708) (← links)
- LexBFS-orderings and powers of graphs (Q6550543) (← links)
- Core-periphery models for graphs based on their \( \delta \)-hyperbolicity: an example using biological networks (Q6551953) (← links)
- \( \alpha_i\)-metric graphs: radius, diameter and all eccentricities (Q6582369) (← links)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q6671670) (← links)
- Bow Metrics and Hyperbolicity (Q6755023) (← links)
- On the Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs (Q6763847) (← links)
