Kshitij Gajjar

31 papers A* 2A 2B 3Misc 1Journal 21Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Permutation Match Puzzles: How Young Tanvi Learned About Computational Complexity.
CoRR
Kshitij Gajjar, Neeldhara Misra
2024 J jnl
Monotone classes beyond VNP.
Theor. Comput. Sci.
Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse
2024 B conf
Parameterized Shortest Path Reconfiguration.
IPEC
Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri, Amer E. Mouawad
2024 J jnl
Parameterized Shortest Path Reconfiguration.
CoRR
Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri, Amer E. Mouawad
2024 J jnl
Recognizing geometric intersection graphs stabbed by a line.
Theor. Comput. Sci.
Dibyayan Chakraborty, Kshitij Gajjar, Irena Rusu
2024 J jnl
Reconfiguring Shortest Paths in Graphs.
Algorithmica
Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar, Abhiruk Lahiri
2023 J jnl
Finding geometric representations of apex graphs is NP-hard.
Theor. Comput. Sci.
Dibyayan Chakraborty, Kshitij Gajjar
2023 — conf
Monotone Classes Beyond VNP.
FSTTCS
Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse
2023 J jnl
Monotone Classes Beyond VNP.
Electron. Colloquium Comput. Complex.
Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse
2023 J jnl
Sum Labelling Graphs of Maximum Degree Two.
CoRR
Henning Fernau, Kshitij Gajjar
2023 J jnl
The Space Complexity of Sum Labelling.
Theory Comput. Syst.
Henning Fernau, Kshitij Gajjar
2022 B conf
Finding Geometric Representations of Apex Graphs is NP-Hard.
WALCOM
Dibyayan Chakraborty, Kshitij Gajjar
2022 J jnl
Recognizing Geometric Intersection Graphs Stabbed by a Line.
CoRR
Dibyayan Chakraborty, Kshitij Gajjar, Irena Rusu
2022 A* conf
Reconfiguring Shortest Paths in Graphs.
AAAI
Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar, Abhiruk Lahiri
2022 J jnl
Transparency Beyond VNP in the Monotone Setting.
CoRR
Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse
2022 J jnl
Transparency Beyond VNP in the Monotone Setting.
Electron. Colloquium Comput. Complex.
Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse
2021 — conf
Approximating the Center Ranking Under Ulam.
FSTTCS
Diptarka Chakraborty, Kshitij Gajjar, Agastya Vibhuti Jha
2021 J jnl
Finding Geometric Representations of Apex Graphs is NP-Hard.
CoRR
Dibyayan Chakraborty, Kshitij Gajjar
2021 J jnl
Generalized Parametric Path Problems.
CoRR
Prerona Chatterjee, Kshitij Gajjar, Jaikumar Radhakrishnan, Girish Varma
2021 A conf
Generalized parametric path problems.
UAI
Kshitij Gajjar, Girish Varma, Prerona Chatterjee, Jaikumar Radhakrishnan
2021 J jnl
Reconfiguring Shortest Paths in Graphs.
CoRR
Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar, Abhiruk Lahiri
2021 B conf
The Space Complexity of Sum Labelling.
FCT
Henning Fernau, Kshitij Gajjar
2021 J jnl
The Space Complexity of Sum Labelling.
CoRR
Henning Fernau, Kshitij Gajjar
2021 J jnl
The Space Complexity of Sum Labelling.
Electron. Colloquium Comput. Complex.
Henning Fernau, Kshitij Gajjar
2019 Misc conf
Minimizing Branching Vertices in Distance-Preserving Subgraphs.
CSR
Kshitij Gajjar, Jaikumar Radhakrishnan
2019 A* conf
Parametric Shortest Paths in Planar Graphs.
FOCS
Kshitij Gajjar, Jaikumar Radhakrishnan
2018 J jnl
Minimizing Branching Vertices in Distance-preserving Subgraphs.
CoRR
Kshitij Gajjar, Jaikumar Radhakrishnan
2018 J jnl
Parametric Shortest Paths in Planar Graphs.
CoRR
Kshitij Gajjar, Jaikumar Radhakrishnan
2018 J jnl
Parametric Shortest Paths in Planar Graphs.
Electron. Colloquium Comput. Complex.
Kshitij Gajjar, Jaikumar Radhakrishnan
2017 A conf
Distance-Preserving Subgraphs of Interval Graphs.
ESA
Kshitij Gajjar, Jaikumar Radhakrishnan
2017 J jnl
Distance-preserving Subgraphs of Interval Graphs.
CoRR
Kshitij Gajjar, Jaikumar Radhakrishnan