research
∙
01/30/2023
The Leafed Induced Subtree in chordal and bounded treewidth graphs
In the Fully Leafed Induced Subtrees, one is given a graph G and two int...
share
research
∙
07/20/2022
Contraction Bidimensionality of Geometric Intersection Graphs
Given a graph G, we define bcg(G) as the minimum k for which G can be co...
research
∙
03/11/2021
Hitting minors on bounded treewidth graphs. III. Lower bounds
For a finite collection of graphs F, the F-M-DELETION problem consists i...
research
∙
03/11/2021
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
For a finite collection of graphs F, the F-M-DELETION (resp. F-TM-DELETI...
research
∙
01/27/2021
A Neighborhood-preserving Graph Summarization
We introduce in this paper a new summarization method for large graphs. ...
research
∙
07/08/2020
Non-monotone target sets for threshold values restricted to 0, 1, and the vertex degree
We consider a non-monotone activation process (X_t)_t∈{ 0,1,2,…} on a gr...
research
∙
11/12/2019
FPT Algorithms for Diverse Collections of Hitting Sets
In this work, we study the d-Hitting Set and Feedback Vertex Set problem...
research
∙
07/09/2019
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
For a fixed connected graph H, the {H}-M-DELETION problem asks, given a ...
research
∙
04/29/2019
Composing dynamic programming tree-decomposition-based algorithms
Given two integers â„“ and p as well as â„“ graph classes H_1,...,H_â„“, the p...
research
∙
03/18/2019
Diversity in Combinatorial Optimization
When modeling an application of practical relevance as an instance of a ...
research
∙
12/20/2018
Temporal Matching
A link stream is a sequence of pairs of the form (t,{u,v}), where t∈ N r...
research
∙
10/27/2018
