3 papers
cs.DS2026
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 …
cs.DS2026
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…
cs.CC2024
Parameterized Shortest Path Reconfiguration
Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri +1
An st-shortest path, or st-path for short, in a graph G is a shortest (induced) path from s to t in G. Two st-paths are said to be adjacent if they differ on exactly one vertex. A…