1 citations · 1 across the 6 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.CC2025
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…
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.DS2025
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,…