4 citations · 4 across the 2 of their papers we have counts for
8 papers
-Metric Graphs: Hyperbolicity
Feodor F. Dragan, Guillaume Ducoffe
A graph is called -metric () if it satisfies the following -metric property for every vertices and : if a shortest path between and …
Complexity Gaps between Point and Interval Temporal Graphs for some Reachability Problems
Guillaume Aubian, Filippo Brunelli, Feodor F Dragan +4
Temporal graphs arise when modeling interactions that evolve over time. They usually come in several flavors, depending on the number of parameters used to describe the temporal as…
Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
Feodor F. Dragan, Guillaume Ducoffe, Michel Habib +1
In the context of fine-grained complexity, we investigate the notion of certificate enabling faster polynomial-time algorithms. We specifically target radius (minimum eccentricity)…
Lower bounds on collective additive spanners
Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler +1
In this paper we present various lower bound results on collective tree spanners and on spanners of bounded treewidth. A graph is said to admit a system of collective addi…
Graph parameters that are coarsely equivalent to path-length
Feodor F. Dragan, Ekkehard Köhler
Two graph parameters are said to be coarsely equivalent if they are within constant factors from each other for every graph . Recently, several graph parameters were shown to be…
On -unimodality of radius functions in graphs: structure and algorithms
Jérémie Chalopin, Victor Chepoi, Feodor Dragan +2
For every weight assignment to the vertices in a graph , the radius function maps every vertex of to its largest weighted distance to the other vertices. The cen…