research
∙
07/04/2023
Sparse Graphs of Twin-width 2 Have Bounded Tree-width
Twin-width is a structural width parameter introduced by Bonnet, Kim, Th...
share
research
∙
07/03/2023
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
Dynamic programming on various graph decompositions is one of the most f...
research
∙
07/01/2023
Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves
For a given graph G, a depth-first search (DFS) tree T of G is an r-root...
research
∙
02/21/2023
New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth
We study the tractability of the maximum independent set problem from th...
research
∙
10/05/2022
Tight Lower Bounds for Problems Parameterized by Rank-width
We show that there is no 2^o(k^2) n^O(1) time algorithm for Independent ...
research
∙
02/27/2022
A logic-based algorithmic meta-theorem for mim-width
We introduce a logic called distance neighborhood logic with acyclicity ...
research
∙
05/26/2021
On Alternative Models for Leaf Powers
A fundamental problem in computational biology is the construction of ph...
research
∙
05/25/2021
On Dasgupta's hierarchical clustering objective and its relation to other graph parameters
The minimum height of vertex and edge partition trees are well-studied g...
research
∙
07/28/2020
Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth
The Cut Count technique and the rank-based approach have lead to sin...
research
∙
08/15/2018
Counting Minimal Transversals of β-Acyclic Hypergraphs
We prove that one can count in polynomial time the number of minimal tra...
research
∙
07/23/2018
On Minimum Connecting Transition Sets in Graphs
A forbidden transition graph is a graph defined together with a set of p...
research
∙
05/29/2018
Rank Based Approach on Graphs with Structured Neighborhood
In this paper, we combine the rank-based approach and the neighbor-equiv...
research
∙
07/12/2017