Skip to main content

4 Result(s)

within Kshitij Gajjar Remove this filter

and

  1. Article

    Open Access

    The Space Complexity of Sum Labelling

    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 is the label of another vertex of...

    Henning Fernau, Kshitij Gajjar in Theory of Computing Systems (2023)

    Download PDF (457 KB) View Article

  2. No Access

    Chapter and Conference Paper

    Finding Geometric Representations of Apex Graphs is NP-Hard

    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, SODA 2009), L-shapes (Gonçalves et a...

    Dibyayan Chakraborty, Kshitij Gajjar in WALCOM: Algorithms and Computation (2022)

  3. No Access

    Chapter and Conference Paper

    The Space Complexity of Sum Labelling

    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 is the label of another vertex of...

    Henning Fernau, Kshitij Gajjar in Fundamentals of Computation Theory (2021)

  4. No Access

    Chapter and Conference Paper

    Minimizing Branching Vertices in Distance-Preserving Subgraphs

    It is \(\textsf {NP}\) NP ...

    Kshitij Gajjar, Jaikumar Radhakrishnan in Computer Science – Theory and Applications (2019)