Peter Gartland

activity

20182024

most citedFinding large induced sparse subgraphs in

C_{> t}

-free graphs in quasipolynomial time

6 citations · 16 across the 5 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

math.CO2023

On Induced Versions of Menger's Theorem on Sparse Graphs

Peter Gartland, Tuukka Korhonen, Daniel Lokshtanov

Let $A$ and $B$ be sets of vertices in a graph $G$ . Menger's theorem states that for every positive integer $k$ , either there exists a collection of $k$ vertex-disjoint paths betwe…

cs.DS2023★ 5 cited

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time

Peter Gartland, Daniel Lokshtanov, Tomáš Masařík +3

We show that the Maximum Weight Independent Set problem (MWIS) can be solved in quasi-polynomial time on $H$ -free graphs (graphs excluding a fixed graph $H$ as an induced subgraph)…