9 citations · 13 across the 16 of their papers we have counts for
5 papers · 1 filter
Parameterized Complexity of Incomplete Connected Fair Division
Harmender Gahlawat, Meirav Zehavi
\textit{Fair division} of resources among competing agents is a fundamental problem in computational social choice and economic game theory. It has been intensively studied on vari…
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…
Further results on the Hunters and Rabbit game through monotonicity
Thomas Dissaux, Foivos Fioravantes, Harmender Gahlawat +1
Hunters and Rabbit game is played on a graph where the Hunter player shoots at vertices in every round while the Rabbit player occupies an unknown vertex and, if not shot,…
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…
Cops and robber on variants of retracts and subdivisions of oriented graphs
Harmender Gahlawat, Zin Mar Myint, Sagnik Sen
\textsc{Cops and Robber} is one of the most studied two-player pursuit-evasion games played on graphs, where multiple \textit{cops}, controlled by one player, pursue a single \text…