research
∙
09/18/2023
How to Make Knockout Tournaments More Popular?
Given a mapping from a set of players to the leaves of a complete binary...
share
research
∙
08/11/2023
Finding Long Directed Cycles Is Hard Even When DFVS Is Small Or Girth Is Large
We study the parameterized complexity of two classic problems on directe...
research
∙
01/25/2023
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?
A temporal graph has an edge set that may change over discrete time step...
research
∙
03/31/2021
An Exponential Time Parameterized Algorithm for Planar Disjoint Paths
In the Disjoint Paths problem, the input is an undirected graph G on n v...
research
∙
04/05/2019
