Kshitij Gajjar

Orcid: 0000-0003-0890-199X

According to our database1, Kshitij Gajjar authored at least 12 papers between 2017 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Finding geometric representations of apex graphs is NP-hard.
Theor. Comput. Sci., September, 2023

Monotone Classes Beyond VNP.
Electron. Colloquium Comput. Complex., 2023

Sum Labelling Graphs of Maximum Degree Two.
CoRR, 2023

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

Recognizing Geometric Intersection Graphs Stabbed by a Line.
CoRR, 2022

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

2021
The Space Complexity of Sum Labelling.
Electron. Colloquium Comput. Complex., 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

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

2018
Parametric Shortest Paths in Planar Graphs.
Electron. Colloquium Comput. Complex., 2018

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


  Loading...