The following pages link to Feodor F. Dragan (Q221665):
Displaying 50 items.
- Collective tree spanners for unit disk graphs with applications (Q2839219) (← links)
- Tree-Like Structures in Graphs: A Metric Point of View (Q2864284) (← links)
- Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences (Q2927646) (← links)
- On Strong Tree-Breadth (Q2958304) (← links)
- (Q3044328) (← links)
- Network flow spanners (Q3057178) (← links)
- New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs (Q3066459) (← links)
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs (Q3088092) (← links)
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs (Q3128208) (← links)
- Eccentricity Approximating Trees (Q3181054) (← links)
- How to Use Spanning Trees to Navigate in Graphs (Q3182932) (← links)
- Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs (Q3183486) (← links)
- Line-Distortion, Bandwidth and Path-Length of a Graph (Q3188891) (← links)
- Distance and routing labeling schemes for non-positively curved plane graphs (Q3414546) (← links)
- Distance Approximating Trees: Complexity and Algorithms (Q3434562) (← links)
- On the Minimum Eccentricity Shortest Path Problem (Q3449826) (← links)
- Spanners in Sparse Graphs (Q3521950) (← links)
- Network Flow Spanners (Q3525777) (← links)
- Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs (Q3588402) (← links)
- Navigating in a Graph by Aid of Its Spanning Tree (Q3597880) (← links)
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs (Q3599135) (← links)
- Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs (Q3602902) (← links)
- (Q4034774) (← links)
- Dually Chordal Graphs (Q4210216) (← links)
- (Q4219411) (← links)
- (Q4219434) (← links)
- Distance Approximating Trees for Chordal and Dually Chordal Graphs (Q4228290) (← links)
- Condorcet and median points of simple rectilinear polygons (Q4228746) (← links)
- (Q4232788) (← links)
- Lexbfs-orderings and powers of hhd-free graphs<sup>∗</sup> (Q4254590) (← links)
- Convexity and HHD-Free Graphs (Q4255812) (← links)
- Powers of hhd-free graphs<sup>∗</sup> (Q4256126) (← links)
- (Q4272121) (← links)
- (Q4318220) (← links)
- r-domination problems on homogeneously orderable graphs (Q4361182) (← links)
- (Q4373681) (← links)
- (Q4414485) (← links)
- (Q4425951) (← links)
- (Q4437500) (← links)
- On the power of BFS to determine a graph's diameter (Q4446912) (← links)
- (Q4448751) (← links)
- A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs (Q4540045) (← links)
- Core congestion is inherent in hyperbolic networks (Q4575897) (← links)
- (Q4635985) (← links)
- (Q4778566) (← links)
- (Q4828953) (← links)
- (Q4942657) (← links)
- (Q4944993) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- Dominating cliques in distance-hereditary graphs (Q5054776) (← links)
