Harmender Gahlawat

Orcid: 0000-0001-7663-6265

According to our database1, Harmender Gahlawat authored at least 22 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Cops and Robber on butterflies, grids, and AT-free graphs.
Discret. Appl. Math., March, 2024

The Closed Geodetic Game: algorithms and strategies.
CoRR, 2024

Romeo and Juliet Is EXPTIME-Complete.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Learning Small Decision Trees with Few Outliers: A Parameterized Perspective.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Algorithms and complexity for geodetic sets on partial grids.
Theor. Comput. Sci., November, 2023

Further results on the Hunters and Rabbit game through monotonicity.
CoRR, 2023

Parameterized Analysis of the Cops and Robber Problem.
CoRR, 2023

Cops and robber on variants of retracts and subdivisions of oriented graphs.
CoRR, 2023

Parameterized Analysis of the Cops and Robber Game.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Recontamination Helps a Lot to Hunt a Rabbit.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Cops and robber on variants of retracts and subdivisions of oriented graphs (Brief Announcement).
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Parameterized Complexity of Incomplete Connected Fair Division.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

Cops and Robber on Oriented Graphs with Respect to Push Operation.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022
Bumblebee visitation problem.
Discret. Appl. Math., 2022

Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

On the Cop Number of String Graphs.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021
Cops and Robber on some families of oriented graphs.
Theor. Comput. Sci., 2021

Variations of cops and robbers game on grids.
Discret. Appl. Math., 2021

Cops and Robber on Butterflies and Solid Grids.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020
Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020


  Loading...