Kshitij Gajjar

Orcid: 0000-0003-0890-199X

According to our database1, Kshitij Gajjar authored at least 13 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Recognizing geometric intersection graphs stabbed by a line.
Theor. Comput. Sci., 2024

Parameterized Shortest Path Reconfiguration.
Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

2023
Sum Labelling Graphs of Maximum Degree Two.
CoRR, 2023

Monotone Classes Beyond VNP.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022
Transparency Beyond VNP in the Monotone Setting.
Electron. Colloquium Comput. Complex., 2022

Finding Geometric Representations of Apex Graphs is NP-Hard.
Proceedings of the WALCOM: Algorithms and Computation, 2022

Reconfiguring Shortest Paths in Graphs.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Generalized parametric path problems.
Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

Approximating the Center Ranking Under Ulam.
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

The Space Complexity of Sum Labelling.
Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2019
Parametric Shortest Paths in Planar Graphs.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Minimizing Branching Vertices in Distance-Preserving Subgraphs.
Proceedings of the Computer Science - Theory and Applications, 2019

2017
Distance-Preserving Subgraphs of Interval Graphs.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017


  Loading...