If a graph has bounded clique number and sufficiently large chromatic number, what can we
say about its induced subgraphs? András Gyárfás made a number of challenging …

In a recent breakthrough work, Gartland and Lokshtanov [FOCS 2020] showed a quasi-
polynomial-time algorithm for Maximum Weight Independent Set in Pt-free graphs, that is …

We continue the study of (tw, ω)-bounded graph classes, that is, hereditary graph classes in
which the treewidth can only be large due to the presence of a large clique, with the goal of …

A hole in a graph is an induced cycle of length at least 4. A hole is long if its length is at least
5. By, we denote a path on vertices. In this paper, we give polynomial-time algorithms for the …

For graphs G and H, we say that G is H-free if it does not contain H as an induced subgraph.
Already in the early 1980s Alekseev observed that if H is connected, then the Max Weight …

In 2020, we initiated a systematic study of graph classes in which the treewidth can only be
large due to the presence of a large clique, which we call (tw, ω)-bounded. The family of (tw …

In the Maximum Independent Set problem we are asked to find a set of pairwise
nonadjacent vertices in a given graph with the maximum possible cardinality. In general …

The three-in-a-tree problem is to determine if a simple undirected graph contains an induced
subgraph which is a tree connecting three given vertices. Based on a beautiful …

We present a novel model-based algorithm, Cooperative Prioritized Sweeping, for sample-
efficient learning in large multi-agent Markov decision processes. Our approach leverages …

Minimizing the weight of an edge set satisfying parity constraints is a challenging branch of
combinatorial optimization as witnessed by the binary hypergraph chapter of Alexander …