research
∙
05/03/2023
Computing paths of large rank in planar frameworks deterministically
A framework consists of an undirected graph G and a matroid M whose elem...
share
research
∙
02/14/2023
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes
Disjoint-paths logic, denoted 𝖥𝖮+𝖣𝖯, extends first-order logic (𝖥𝖮) with...
research
∙
11/09/2022
Shortest Cycles With Monotone Submodular Costs
We introduce the following submodular generalization of the Shortest Cyc...
research
∙
11/03/2022
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
The disjoint paths logic, FOL+DP, is an extension of First-Order Logic (...
research
∙
10/05/2022
Faster parameterized algorithms for modification problems to minor-closed classes
Let G be a minor-closed graph class and let G be an n-vertex graph. We s...
research
∙
07/15/2022
Fixed-Parameter Tractability of Maximum Colored Path and Beyond
We introduce a general method for obtaining fixed-parameter algorithms f...
research
∙
11/04/2021
A Compound Logic for Modification Problems: Big Kingdoms Fall from Within
We introduce a novel model-theoretic framework inspired from graph modif...
research
∙
06/07/2021
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL
In general, a graph modification problem is defined by a graph modificat...
research
∙
03/02/2021
Block Elimination Distance
We introduce the block elimination distance as a measure of how close a ...
research
∙
03/01/2021
k-apices of minor-closed graph classes. I. Bounding the obstructions
Let G be a minor-closed graph class. We say that a graph G is a k-apex o...
research
∙
02/12/2021
A more accurate view of the Flat Wall Theorem
We introduce a supporting combinatorial framework for the Flat Wall Theo...
research
∙
04/27/2020
An FPT-algorithm for recognizing k-apices of minor-closed graph classes
Let G be a graph class. We say that a graph G is a k-apex of G if G cont...
research
∙
07/12/2019
Planar Disjoint Paths in Linear Time
The Disjoint Paths problem asks whether a fixed number of pairs of termi...
research
∙
07/05/2019
