3 citations · 3 across the 6 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
(Almost-)Optimal FPT Algorithm and Kernel for -Cycle on Planar Graphs
Harmender Gahlawat, Abhishek Rathod, Meirav Zehavi
Research of cycles through specific vertices is a central topic in graph theory. In this context, we focus on a well-studied computational problem, \textsc{-Cycle}: given an und…
cs.DS2021
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…