default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKshitij Gajjar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar
, Abhiruk Lahiri:
Reconfiguring Shortest Paths in Graphs. Algorithmica 86(10): 3309-3338 (2024)- [j4]Dibyayan Chakraborty, Kshitij Gajjar, Irena Rusu:
Recognizing geometric intersection graphs stabbed by a line. Theor. Comput. Sci. 995: 114488 (2024) - [j3]Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse:
Monotone classes beyond VNP. Theor. Comput. Sci. 1009: 114689 (2024) - [c10]Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri, Amer E. Mouawad:
Parameterized Shortest Path Reconfiguration. IPEC 2024: 23:1-23:14 - [i15]Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri, Amer E. Mouawad:
Parameterized Shortest Path Reconfiguration. CoRR abs/2406.12717 (2024) - 2023
- [j2]Henning Fernau, Kshitij Gajjar:
The Space Complexity of Sum Labelling. Theory Comput. Syst. 67(5): 1026-1049 (2023) - [j1]Dibyayan Chakraborty, Kshitij Gajjar:
Finding geometric representations of apex graphs is NP-hard. Theor. Comput. Sci. 971: 114064 (2023) - [c9]Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse:
Monotone Classes Beyond VNP. FSTTCS 2023: 11:1-11:23 - [i14]Henning Fernau, Kshitij Gajjar:
Sum Labelling Graphs of Maximum Degree Two. CoRR abs/2301.02178 (2023) - [i13]Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse:
Monotone Classes Beyond VNP. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c8]Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar, Abhiruk Lahiri:
Reconfiguring Shortest Paths in Graphs. AAAI 2022: 9758-9766 - [c7]Dibyayan Chakraborty, Kshitij Gajjar:
Finding Geometric Representations of Apex Graphs is NP-Hard. WALCOM 2022: 161-174 - [i12]Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse:
Transparency Beyond VNP in the Monotone Setting. CoRR abs/2202.13103 (2022) - [i11]Dibyayan Chakraborty, Kshitij Gajjar, Irena Rusu:
Recognizing Geometric Intersection Graphs Stabbed by a Line. CoRR abs/2209.01851 (2022) - [i10]Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse:
Transparency Beyond VNP in the Monotone Setting. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c6]Henning Fernau, Kshitij Gajjar:
The Space Complexity of Sum Labelling. FCT 2021: 230-244 - [c5]Diptarka Chakraborty, Kshitij Gajjar, Agastya Vibhuti Jha:
Approximating the Center Ranking Under Ulam. FSTTCS 2021: 12:1-12:21 - [c4]Kshitij Gajjar, Girish Varma, Prerona Chatterjee, Jaikumar Radhakrishnan:
Generalized parametric path problems. UAI 2021: 536-546 - [i9]Prerona Chatterjee, Kshitij Gajjar, Jaikumar Radhakrishnan, Girish Varma:
Generalized Parametric Path Problems. CoRR abs/2102.12886 (2021) - [i8]Dibyayan Chakraborty, Kshitij Gajjar:
Finding Geometric Representations of Apex Graphs is NP-Hard. CoRR abs/2104.09976 (2021) - [i7]Henning Fernau, Kshitij Gajjar:
The Space Complexity of Sum Labelling. CoRR abs/2107.12973 (2021) - [i6]Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar, Abhiruk Lahiri:
Reconfiguring Shortest Paths in Graphs. CoRR abs/2112.07499 (2021) - [i5]Henning Fernau, Kshitij Gajjar:
The Space Complexity of Sum Labelling. Electron. Colloquium Comput. Complex. TR21 (2021)
2010 – 2019
- 2019
- [c3]Kshitij Gajjar, Jaikumar Radhakrishnan:
Minimizing Branching Vertices in Distance-Preserving Subgraphs. CSR 2019: 131-142 - [c2]Kshitij Gajjar, Jaikumar Radhakrishnan:
Parametric Shortest Paths in Planar Graphs. FOCS 2019: 876-895 - 2018
- [i4]Kshitij Gajjar, Jaikumar Radhakrishnan:
Minimizing Branching Vertices in Distance-preserving Subgraphs. CoRR abs/1810.11656 (2018) - [i3]Kshitij Gajjar, Jaikumar Radhakrishnan:
Parametric Shortest Paths in Planar Graphs. CoRR abs/1811.05115 (2018) - [i2]Kshitij Gajjar, Jaikumar Radhakrishnan:
Parametric Shortest Paths in Planar Graphs. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c1]Kshitij Gajjar, Jaikumar Radhakrishnan:
Distance-Preserving Subgraphs of Interval Graphs. ESA 2017: 39:1-39:13 - [i1]Kshitij Gajjar, Jaikumar Radhakrishnan:
Distance-preserving Subgraphs of Interval Graphs. CoRR abs/1708.03081 (2017)
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-12-10 20:50 CET 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:
