4 citations · 6 across the 11 of their papers we have counts for
11 papers
Adaptive Manipulation for Coalitions in Knockout Tournaments
Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
Knockout tournaments, also known as single-elimination or cup tournaments, are a popular form of sports competitions. In the standard probabilistic setting, for each pairing of pla…
Parameterized Analysis of Bribery in Challenge the Champ Tournaments
Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
Challenge the champ tournaments are one of the simplest forms of competition, where a (initially selected) champ is repeatedly challenged by other players. If a player beats the ch…
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs
Juhi Chaudhary, Harmender Gahlawat, Michal Włodarczyk +1
Given an undirected graph and a multiset of terminal pairs , the Vertex-Disjoint Paths (\VDP) and Edge-Disjoint Paths (\EDP) problems ask whether has p…
Meta-theorems for Parameterized Streaming Algorithms
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan +3
The streaming model was introduced to parameterized complexity independently by Fafianie and Kratsch [MFCS14] and by Chitnis, Cormode, Hajiaghayi and Monemizadeh [SODA15]. Subseque…
-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…
Planar Disjoint Paths, Treewidth, and Kernels
Michał Włodarczyk, Meirav Zehavi
In the Planar Disjoint Paths problem, one is given an undirected planar graph with a set of vertex pairs and the task is to find pairwise vertex-disjoint paths…