default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarmender Gahlawat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j5]Sheikh Shakil Akhtar
, Sandip Das, Harmender Gahlawat:
Cops and Robber on butterflies, grids, and AT-free graphs. Discret. Appl. Math. 345: 231-245 (2024)- 2023
- [j4]Dibyayan Chakraborty, Harmender Gahlawat, Bodhayan Roy:
Algorithms and complexity for geodetic sets on partial grids. Theor. Comput. Sci. 979: 114217 (2023) - 2022
- [j3]Sandip Das, Harmender Gahlawat:
Bumblebee visitation problem. Discret. Appl. Math. 319: 27-41 (2022) - 2021
- [j2]Sandip Das, Harmender Gahlawat:
Variations of cops and robbers game on grids. Discret. Appl. Math. 305: 340-349 (2021) - [j1]Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen:
Cops and Robber on some families of oriented graphs. Theor. Comput. Sci. 888: 31-40 (2021)
Conference and Workshop Papers
- 2024
- [c16]Harmender Gahlawat, Meirav Zehavi:
Learning Small Decision Trees with Few Outliers: A Parameterized Perspective. AAAI 2024: 12100-12108 - [c15]Harmender Gahlawat, Jan Matyás Kristan, Tomás Valla:
Romeo and Juliet Is EXPTIME-Complete. MFCS 2024: 54:1-54:16 - 2023
- [c14]Sandip Das, Harmender Gahlawat, Ashwin Ramgopal, Uma Kant Sahoo, Sagnik Sen:
Cops and Robber on Oriented Graphs with Respect to Push Operation. CALDAM 2023: 309-320 - [c13]Harmender Gahlawat, Meirav Zehavi:
Parameterized Complexity of Incomplete Connected Fair Division. FSTTCS 2023: 14:1-14:18 - [c12]Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi:
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. IPEC 2023: 10:1-10:22 - [c11]Harmender Gahlawat, Zin Mar Myint, Sagnik Sen:
Cops and robber on variants of retracts and subdivisions of oriented graphs (Brief Announcement). LAGOS 2023: 379-381 - [c10]Thomas Dissaux, Foivos Fioravantes, Harmender Gahlawat, Nicolas Nisse:
Recontamination Helps a Lot to Hunt a Rabbit. MFCS 2023: 42:1-42:14 - [c9]Harmender Gahlawat, Meirav Zehavi:
Parameterized Analysis of the Cops and Robber Game. MFCS 2023: 49:1-49:17 - 2022
- [c8]Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh:
Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. ISAAC 2022: 12:1-12:17 - [c7]Sandip Das, Harmender Gahlawat:
On the Cop Number of String Graphs. ISAAC 2022: 45:1-45:18 - 2021
- [c6]Sheikh Shakil Akhtar, Sandip Das, Harmender Gahlawat:
Cops and Robber on Butterflies and Solid Grids. CALDAM 2021: 272-281 - 2020
- [c5]Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy:
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes. CALDAM 2020: 102-115 - [c4]Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy:
Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. ISAAC 2020: 7:1-7:15 - 2019
- [c3]Sandip Das, Harmender Gahlawat:
Bumblebee Visitation Problem. CALDAM 2019: 254-262 - [c2]Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen:
Cops and Robber on Some Families of Oriented Graphs. IWOCA 2019: 188-200 - 2018
- [c1]Sandip Das, Harmender Gahlawat:
Variations of Cops and Robbers Game on Grids. CALDAM 2018: 249-259
Informal and Other Publications
- 2024
- [i9]Sandip Das, Harmender Gahlawat:
On the Cop Number of String Graphs. CoRR abs/2408.11002 (2024) - [i8]Antoine Dailly, Harmender Gahlawat, Zin Mar Myint:
The Closed Geodetic Game: algorithms and strategies. CoRR abs/2409.20505 (2024) - 2023
- [i7]Harmender Gahlawat, Zin Mar Myint, Sagnik Sen:
Cops and robber on variants of retracts and subdivisions of oriented graphs. CoRR abs/2307.00584 (2023) - [i6]Harmender Gahlawat, Meirav Zehavi:
Parameterized Analysis of the Cops and Robber Problem. CoRR abs/2307.04594 (2023) - [i5]Thomas Dissaux, Foivos Fioravantes, Harmender Gahlawat, Nicolas Nisse:
Further results on the Hunters and Rabbit game through monotonicity. CoRR abs/2309.16533 (2023) - [i4]Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi:
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. CoRR abs/2309.16892 (2023) - [i3]Harmender Gahlawat, Meirav Zehavi:
Parameterized Complexity of Incomplete Connected Fair Division. CoRR abs/2310.01310 (2023) - 2020
- [i2]Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy:
Algorithms and complexity for geodetic sets on planar and chordal graphs. CoRR abs/2006.16511 (2020) - 2019
- [i1]Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy:
Hardness and approximation for the geodetic set problem in some graph classes. CoRR abs/1909.08795 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
