11 citations · 35 across the 50 of their papers we have counts for
6 papers · 1 filter
The complexity of high-dimensional cuts
Ulrich Bauer, Abhishek Rathod, Meirav Zehavi
Cut problems form one of the most fundamental classes of problems in algorithmic graph theory. For instance, the minimum cut, the minimum - cut, the minimum multiway cut, and…
Grid Recognition: Classical and Parameterized Computational Perspectives
Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
Grid graphs, and, more generally, grid graphs, form one of the most basic classes of geometric graphs. Over the past few decades, a large body of works studied the (in)…
Verification of Multi-Layered Assignment Problems
Barak Steindl, Meirav Zehavi
The class of assignment problems is a fundamental and well-studied class in the intersection of Social Choice, Computational Economics and Discrete Allocation. In a general assignm…
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent
Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov +4
For a graph class , the graph parameters elimination distance to (denoted by ) [Bulian and Dawar, Algorithmica, 2016], and -treewi…
An Exponential Time Parameterized Algorithm for Planar Disjoint Paths
Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk +2
In the Disjoint Paths problem, the input is an undirected graph on vertices and a set of vertex pairs, , and the task is to find pairwise verte…
Multivariate Analysis of Scheduling Fair Competitions
Siddharth Gupta, Meirav Zehavi
A \emph{fair competition}, based on the concept of envy-freeness, is a non-eliminating competition where each contestant (team or individual player) may not play against all other…