ParAI

A Unifying Framework for Characterizing and Computing Width Measures

Algorithmic Applications of Tree-Cut Width

Robert Ganian, Eun Jung Kim, Stefan Szeider

An efficient algorithm for counting Markov equivalent DAGs

Detours in Directed Graphs

Fomin, Fedor V., Golovach, Petr A., Lochet, William, Sagunov, Danil, Simonov, Kirill, Saurabh, Saket

Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts

Christian Hatschka

Finding a Cluster in Incomplete Data

Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider

Fine-grained Complexity of Partial Minimum Satisfiability

Bliznets, Ivan, Sagunov, Danil, Simonov, Kirill

FPT Approximation for Fair Minimum-Load Clustering

Bandyapadhyay, Sayan, Fomin, Fedor V., Golovach, Petr A., Purohit, Nidhi, Simonov, Kirill

Longest Cycle above Erdős--Gallai Bound

Fomin, Fedor V., Golovach, Petr A., Sagunov, Danil, Simonov, Kirill

On Covering Segments with Unit Intervals