research
∙
02/22/2023
Pattern detection in ordered graphs
A popular way to define or characterize graph classes is via forbidden s...
share
research
∙
02/15/2023
Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor
In this paper, we study temporal graphs arising from mobility models whe...
research
∙
12/01/2021
Classifying grounded intersection graphs via ordered forbidden patterns
It was noted already in the 90s that many classic graph classes, such as...
research
∙
10/06/2021
Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
On sparse graphs, Roditty and Williams [2013] proved that no O(n^2-ε)-ti...
research
∙
05/25/2021
Diameter, radius and all eccentricities in linear time for constant-dimension median graphs
Median graphs form the class of graphs which is the most studied in metr...
research
∙
01/21/2021
(α, β)-Modules in Graphs
Modular Decomposition focuses on repeatedly identifying a module M (a co...
research
∙
10/08/2019
Fast Diameter Computation within Split Graphs
When can we compute the diameter of a graph in quasi linear time? We add...
research
∙
07/09/2019
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension
We propose to study unweighted graphs of constant distance VC-dimension ...
research
∙
12/14/2018
Graph classes and forbidden patterns on three vertices
This paper deals with graph classes characterization and recognition. A ...
research
∙
05/17/2018
Fast approximation of centrality and distances in hyperbolic graphs
We show that the eccentricities (and thus the centrality indices) of all...
research
∙
03/13/2018
