2 citations · 4 across the 11 of their papers we have counts for
7 papers · 1 filter
Shortest Paths with Linear Edge Weights
Suryajith Chillara, Kshitij Gajjar, Nithish Raja
We study shortest paths in directed graphs whose edge weights are of the form Here…
Permutation Match Puzzles: How Young Tanvi Learned About Computational Complexity
Kshitij Gajjar, Neeldhara Misra
We study a family of sorting match puzzles on grids, which we call permutation match puzzles. In this puzzle, each row and column of a grid is labeled with an ordering…
Reconfiguring Shortest Paths in Graphs
Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar +1
Reconfiguring two shortest paths in a graph means modifying one shortest path to the other by changing one vertex at a time so that all the intermediate paths are also shortest pat…
The Space Complexity of Sum Labelling
Henning Fernau, Kshitij Gajjar
A graph is called a sum graph if its vertices can be labelled by distinct positive integers such that there is an edge between two vertices if and only if the sum of their labels i…
Generalized Parametric Path Problems
Prerona Chatterjee, Kshitij Gajjar, Jaikumar Radhakrishnan +1
Parametric path problems arise independently in diverse domains, ranging from transportation to finance, where they are studied under various assumptions. We formulate a general pa…
Minimizing Branching Vertices in Distance-preserving Subgraphs
Kshitij Gajjar, Jaikumar Radhakrishnan
It is -hard to determine the minimum number of branching vertices needed in a single-source distance-preserving subgraph of an undirected graph. We show that this prob…
Distance-preserving Subgraphs of Interval Graphs
Kshitij Gajjar, Jaikumar Radhakrishnan
We consider the problem of finding small distance-preserving subgraphs of undirected, unweighted interval graphs with terminal vertices. To start with, we show that finding an…