2 citations · 4 across the 11 of their papers we have counts for
4 papers · 1 filter
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…
Finding Geometric Representations of Apex Graphs is NP-Hard
Dibyayan Chakraborty, Kshitij Gajjar
Planar graphs can be represented as intersection graphs of different types of geometric objects in the plane, e.g., circles (Koebe, 1936), line segments (Chalopin \& Gon{ç}alves, 2…
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…