1 citations · 1 across the 6 of their papers we have counts for
8 papers
Collision-free Movement on Grids and Beyond
Hendrik Molter, Meirav Zehavi
We study collision-free movement problems on graphs, where the task is to coordinate a set of robots so that they reach a target formation satisfying a desired property while minim…
Minimum Temporal Spanners in Happy Graphs
Arnaud Casteigts, Hendrik Molter, Michelle Döring +1
Temporal graphs are graphs whose edge set changes over discrete time steps. These graphs can model scenarios related to transportation, scheduling, social networks, and networking…
On Kernelization with Access to NP-Oracles
Hendrik Molter, Meirav Zehavi
Kernelization is the standard framework to analyze preprocessing routines mathematically. Here, in terms of efficiency, we demand the preprocessing routine to run in time polynomia…
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.…
Treewidth Parameterized by Feedback Vertex Number
Hendrik Molter, Meirav Zehavi, Amit Zivan
We provide the first algorithm for computing an optimal tree decomposition for a given graph that runs in single exponential time in the feedback vertex number of , that is,…
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…
How to Make Knockout Tournaments More Popular?
Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
Given a mapping from a set of players to the leaves of a complete binary tree (called a seeding), a knockout tournament is conducted as follows: every round, every two players with…