
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
A graph is Helly if every family of pairwise intersecting balls has a no...
read it

Beyond Helly graphs: the diameter problem on absolute retracts
Characterizing the graph classes such that, on nvertex medge graphs in...
read it

Optimal diameter computation within bounded cliquewidth graphs
Coudert et al. (SODA'18) proved that under the Strong ExponentialTime H...
read it

Distance problems within Helly graphs and kHelly graphs
The ball hypergraph of a graph G is the family of balls of all possible ...
read it

Around the diameter of ATfree graphs
A graph algorithm is truly subquadratic if it runs in O(m^b) time on con...
read it

Isometric embeddings in trees and their use in the diameter problem
We prove that given a discrete space with n points which is either embed...
read it

Eccentricity queries and beyond using Hub Labels
Hub labeling schemes are popular methods for computing distances on road...
read it

A story of diameter, radius and Helly property
A graph is Helly if every family of pairwise intersecting balls has a no...
read it

Fast Diameter Computation within Split Graphs
When can we compute the diameter of a graph in quasi linear time? We add...
read it

Diameter computation on Hminor free graphs and graphs of bounded (distance) VCdimension
We propose to study unweighted graphs of constant distance VCdimension ...
read it

Faster approximation algorithms for computing shortest cycles on weighted graphs
Given an nvertex medge graph G with non negative edgeweights, the gir...
read it

Polynomialtime Recognition of 4Steiner Powers
The kthpower of a given graph G=(V,E) is obtained from G by adding an e...
read it

Equivalence between pathbreadth and strong pathbreadth
We say that a given graph G = (V, E) has pathbreadth at most ρ, denoted ...
read it

The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes
We address the following general question: given a graph class C on whic...
read it

A quasi lineartime bMatching algorithm on distancehereditary graphs and bounded splitwidth graphs
We present a quasi lineartime algorithm for Maximum Matching on distanc...
read it

Fast approximation and exact computation of negative curvature parameters of graphs
In this paper, we study Gromov hyperbolicity and related parameters, tha...
read it

Fully polynomial FPT algorithms for some classes of bounded cliquewidth graphs
Parameterized complexity theory has enabled a refined classification of ...
read it
Guillaume Ducoffe
is this you? claim profile