research
∙
01/05/2023
Sum Labelling Graphs of Maximum Degree Two
The concept of sum labelling was introduced in 1990 by Harary. A graph i...
share
research
∙
09/05/2022
Recognizing Geometric Intersection Graphs Stabbed by a Line
In this paper, we determine the computational complexity of recognizing ...
research
∙
02/26/2022
Transparency Beyond VNP in the Monotone Setting
Recently Hrubes and Yehudayoff (2021) showed a connection between the mo...
research
∙
12/14/2021
Reconfiguring Shortest Paths in Graphs
Reconfiguring two shortest paths in a graph means modifying one shortest...
research
∙
07/27/2021
The Space Complexity of Sum Labelling
A graph is called a sum graph if its vertices can be labelled by distinc...
research
∙
04/20/2021
Finding Geometric Representations of Apex Graphs is NP-Hard
Planar graphs can be represented as intersection graphs of different typ...
research
∙
02/25/2021
Generalized Parametric Path Problems
Parametric path problems arise independently in diverse domains, ranging...
research
∙
11/13/2018
Parametric Shortest Paths in Planar Graphs
We construct a family of planar graphs (G_n: n≥ 1), where G_n has n vert...
research
∙
10/27/2018
