research
∙
09/15/2023
On Induced Versions of Menger's Theorem on Sparse Graphs
Let A and B be sets of vertices in a graph G. Menger's theorem states th...
share
research
∙
05/25/2023
Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time
We show that the Maximum Weight Independent Set problem (MWIS) can be so...
research
∙
07/21/2020
Independent Set on C_≥ k-Free Graphs in Quasi-Polynomial Time
We give an algorithm that takes as input a graph G with weights on the v...
research
∙
07/17/2020
Dominated Minimal Separators are Tame (Nearly All Others are Feral)
A class F of graphs is called tame if there exists a constant k so that ...
research
∙
05/02/2020
