Harmender Gahlawat
I am a Postdoctoral researcher in the Combinatorial Optimization group of G-SCOP at Grenoble-INP.
Before that I was a postodc in the group of Prof. Meirav Zehavi at Ben-Gurion University of the Negev from Jan 22-Dec 23.
I did my PhD from Indian Statistical Institute Kolkata.
Research Interests: Graph searching, Cops and Robber game, Parameterized Complexity, Path Covering and Packing problems, Approximation Algorithms, Theory of AI and ML.
Education:
Ph.D. (2015- 2021) - Indian Statistical Institute Kolkata, India.
Advisor- Prof. Sandip Das.
Thesis title- The Cops and Robber game on some graph classes.
M.Tech (2013-2015) - Indian Statistical Institute Kolkata, India.
Dissertation title- 1-local approximation algorithms for Channel Assignment Problem.
Publications:
Journal Publications:
Cops and Robber on Butterflies, Partial Grids, and AT-free graphs
with S.S. Akhtar and S. Das. in Discrete Applied Mathematics
Algorithms and Complexity for Geodetic Sets on Partial Grids
with D. Chakraborty and B. Roy. in Theoretical Computer Scince. DOI .
Cops and Robber game on some families of oriented graphs
with S. Das, U.K. Sahoo, and S. Sen, in Theoretical Computer Science. DOI
Variations of cops and robbers game on grids
with S. Das, in Discrete Applied Mathematics. DOI
Bumblebee Visitation Problem
with S. Das, in Discrete Applied Mathematics. DOI
Conference Publications:
Learning Small Decision Trees with few Outliers: A Parameterized Perspective
with M. Zehavi, in AAAI 2024 (To Appear).
Parameterized Complexity of Incomplete Connected Fair Division
with M. Zehavi, in FSTTCS 2023. Preprint version.
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs
with J. Chaudhary, M. Wlodarczyk, and M. Zehavi, in IPEC 2023. Preprint version.
Parameterized Analysis of Cops and Robber Game
with M. Zehavi, in MFCS 2023. Preprint version.
Monotonicity Helps a lot to Hunt a Rabbit
with T. Dissaux, F. Fioravantes, and N. Nisse, in MFCS 2023. Preprint version.
Cops and Robber on Variants of Retracts and Subdivisions of Oriented Graphs (Brief Announcement)
with Z. M. Myint and S. Sen, in LAGOS 2023. Preprint version.
Cops and Robber on Oriented Graphs with Respect to Push Operation
with S. Das, A. Ramgopal, U.K. Sahoo, and S. Sen, in CALDAM 2023.
Complexity and algorithms for Isometric Path Cover on chordal graphs and beyond
with D. Chakraborty, A. Dailly, S. Das, F. Foucaud, and S.K. Ghosh, in ISAAC 2022. Preprint version.
On the Cop number of String Graphs
with S. Das, in ISAAC 2022.
Cops and Robber on Butterflies and Solid Grids
with S.S Akhtar and S. Das, in CALDAM 2021.
Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs
with D. Chakraborty, S. Das, F. Foucaud, D. Lajou, and B. Roy, in ISAAC 2020.
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes
with D. Chakraborty, F. Foucaud, S.K. Ghosh, and B. Roy, in CALDAM 2020. Preprint version.
Cops and Robber game on some families of oriented graphs
with S. Das, U.K. Sahoo, and S. Sen, in IWOCA 2019.
Bumblebee Visitation Problem
with S. Das, in CALDAM 2019.
Variations of cops and robbers game on grids
with S. Das, in CALDAM 2018.
Submitted papers:
Complexity and algorithms for Isometric Path Cover on chordal graphs and beyond
with D. Chakraborty, A. Dailly, S. Das, F. Foucaud, and S.K. Ghosh. Preprint version.
Algorithms and Complexity for Geodetic Sets on Chordal Graphs
with D. Chakraborty, S. Das, F. Foucaud, and D. Lajou. Preprint version.