3 citations · 3 across the 2 of their papers we have counts for
13 papers
Algorithms and complexity for geodetic sets on interval and chordal graphs
Dibyayan Chakraborty, Sandip Das, Florent Foucaud +2
We study the computational complexity of finding the geodetic number of a graph on chordal graphs and interval graphs. A set of vertices of a graph is a \textit{geodetic se…
Algorithms and complexity for geodetic sets on planar and chordal graphs
Dibyayan Chakraborty, Harmender Gahlawat, Bodhayan Roy
A set of vertices of a graph is a \emph{geodetic set} if every vertex of lies in a shortest path between some pair of vertices of . The \textsc{Minimum Geodetic Set…
Hardness and Approximation for Coloring Digraphs
Parinya Chalermsook, Harmender Gahlawat, Felix Klingelhoefer +2
The dichromatic number of a digraph is the minimum number such that can be partitioned into subsets, each inducing an acyclic digraph. The acyclic number…
Individual Rationality in Constrained Hedonic Games: Additively Separable and Fractional Preferences
Foivos Fioravantes, Harmender Gahlawat, Nikolaos Melissinos +1
Hedonic games are an archetypal problem in coalition formation, where a set of selfish agents want to partition themselves into stable coalitions. In this work, we focus on two nat…
Pushing Cops and Robber on Graphs of Maximum Degree 4
Harmender Gahlawat
\textsc{Cops and Robber} is a game played on graphs where a set of \textit{cops} aim to \textit{capture} the position of a single \textit{robber}. The main parameter of interest in…
Hunting a rabbit: complexity, approximability and some characterizations
Walid Ben-Ameur, Harmender Gahlawat, Alessandro Maddaloni
In the Hunters and Rabbit game, hunters attempt to shoot an invisible rabbit on a given graph . In each round, the hunters select vertices to shoot at, while the rabbit…