research
∙
02/22/2023
Cutting Barnette graphs perfectly is hard
A perfect matching cut is a perfect matching that is also a cutset, or e...
share
research
∙
12/31/2022
Isometric path complexity of graphs
We introduce and study a new graph parameter, called the isometric path ...
research
∙
12/08/2022
Triangle-free projective-planar graphs with diameter two: domination and characterization
In 1975, Plesník characterized all triangle-free planar graphs as having...
research
∙
10/14/2022
s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs
In this paper, we study the computational complexity of s-Club Cluster V...
research
∙
09/05/2022
Recognizing Geometric Intersection Graphs Stabbed by a Line
In this paper, we determine the computational complexity of recognizing ...
research
∙
04/01/2022
Twin-width VIII: delineation and win-wins
We introduce the notion of delineation. A graph class 𝒞 is said delineat...
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
∙
06/30/2020
Algorithms and complexity for geodetic sets on planar and chordal graphs
We study the complexity of finding the geodetic number on subclasses of ...
research
∙
09/19/2019
Hardness and approximation for the geodetic set problem in some graph classes
In this paper, we study the computational complexity of finding the geod...
research
∙
09/26/2018
Approximating Minimum Dominating Set on String Graphs
In this paper, we give approximation algorithms for the Minimum Dominati...
research
∙
04/18/2018
On bounds on bend number of split and cocomparability graphs
A path is a simple, piecewise linear curve made up of alternating horizo...
research
∙
04/18/2018
On bounds on bend number of classes of split and cocomparability graphs
A k-bend path is a rectilinear curve made up of k + 1 line segments. A B...
research
∙
04/18/2018