11 citations · 35 across the 50 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2025
Tournament Robustness via Redundancy
Klim Efremenko, Hendrik Molter, Meirav Zehavi
A knockout tournament is one of the most simple and popular forms of competition. Here, we are given a binary tournament tree where all leaves are labeled with seed position names.…
cs.DM2023
-matchings Parameterized by Treewidth
Juhi Chaudhary, Meirav Zehavi
A \emph{matching} is a subset of edges in a graph that do not share an endpoint. A matching is a \emph{-matching} if the subgraph of induced by the endpoin…
cs.DM2023★ 1 cited
Parameterized Analysis of the Cops and Robber Problem
Harmender Gahlawat, Meirav Zehavi
\textit{Pursuit-evasion games} have been intensively studied for several decades due to their numerous applications in artificial intelligence, robot motion planning, database theo…