Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes. - Dibyayan Chakraborty; Florent Foucaud; Harmender Gahlawat; Subir Kumar Ghosh; Bodhayan Roy (CALDAM, 2020)

Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. - Dibyayan Chakraborty; Sandip Das 001; Florent Foucaud; Harmender Gahlawat; Dimitri Lajou; Bodhayan Roy (ISAAC, 2020)

Cops and Robber on Butterflies and Solid Grids. - Sheikh Shakil Akhtar; Sandip Das 001; Harmender Gahlawat (CALDAM, 2021)

Variations of cops and robbers game on grids. - Sandip Das 001; Harmender Gahlawat (Discret. Appl. Math., 2021)

Cops and Robber on some families of oriented graphs. - Sandip Das 001; Harmender Gahlawat; Uma Kant Sahoo; Sagnik Sen 001 (Theor. Comput. Sci., 2021)

On the Cop Number of String Graphs. - Sandip Das 001; Harmender Gahlawat (ISAAC, 2022)

Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. - Dibyayan Chakraborty; Antoine Dailly; Sandip Das 001; Florent Foucaud; Harmender Gahlawat; Subir Kumar Ghosh (ISAAC, 2022)

Bumblebee visitation problem. - Sandip Das 001; Harmender Gahlawat (Discret. Appl. Math., 2022)

Cops and Robber on Oriented Graphs with Respect to Push Operation. - Sandip Das 001; Harmender Gahlawat; Ashwin Ramgopal; Uma Kant Sahoo; Sagnik Sen 001 (CALDAM, 2023)

Parameterized Complexity of Incomplete Connected Fair Division. - Harmender Gahlawat; Meirav Zehavi (FSTTCS, 2023)

Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. - Juhi Chaudhary; Harmender Gahlawat; Michal Wlodarczyk 001; Meirav Zehavi (IPEC, 2023)

Cops and robber on variants of retracts and subdivisions of oriented graphs (Brief Announcement). - Harmender Gahlawat; Zin Mar Myint; Sagnik Sen 001 (LAGOS, 2023)

Recontamination Helps a Lot to Hunt a Rabbit. - Thomas Dissaux; Foivos Fioravantes; Harmender Gahlawat; Nicolas Nisse (MFCS, 2023)

Parameterized Analysis of the Cops and Robber Game. - Harmender Gahlawat; Meirav Zehavi (MFCS, 2023)

Cops and robber on variants of retracts and subdivisions of oriented graphs. - Harmender Gahlawat; Zin Mar Myint; Sagnik Sen 001 (CoRR, 2023)

Parameterized Analysis of the Cops and Robber Problem. - Harmender Gahlawat; Meirav Zehavi (CoRR, 2023)

Algorithms and complexity for geodetic sets on partial grids. - Dibyayan Chakraborty; Harmender Gahlawat; Bodhayan Roy (Theor. Comput. Sci., 2023)

Learning Small Decision Trees with Few Outliers: A Parameterized Perspective. - Harmender Gahlawat; Meirav Zehavi (AAAI, 2024)

Romeo and Juliet Is EXPTIME-Complete. - Harmender Gahlawat; Jan Matyás Kristan; Tomás Valla (MFCS, 2024)

Cops and Robber on butterflies, grids, and AT-free graphs. - Sheikh Shakil Akhtar; Sandip Das 001; Harmender Gahlawat (Discret. Appl. Math., 2024)

Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size. - Foivos Fioravantes; Harmender Gahlawat; Nikolaos Melissinos (AAAI, 2025)

Hunting a Rabbit Is Hard. - Walid Ben-Ameur; Harmender Gahlawat; Alessandro Maddaloni (COCOON (1), 2025)

(Almost-)Optimal FPT Algorithm and Kernel for T-Cycle on Planar Graphs. - Harmender Gahlawat; Abhishek Rathod; Meirav Zehavi (ICALP, 2025)

The Closed Geodetic Game: Algorithms and Strategies. - Antoine Dailly; Harmender Gahlawat; Zin Mar Myint (IWOCA, 2025)

Further results on the Hunters and Rabbit game through monotonicity. - Thomas Dissaux; Foivos Fioravantes; Harmender Gahlawat; Nicolas Nisse (Inf. Comput., 2025)

(Almost-)Optimal FPT Algorithm and Kernel for T-Cycle on Planar Graphs. - Harmender Gahlawat; Abhishek Rathod; Meirav Zehavi (CoRR, 2025)

Pushing Cops and Robber on Graphs of Maximum Degree 4. - Harmender Gahlawat (CoRR, 2025)