135 citations · 160 across the 16 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DM2022
Recognizing Geometric Intersection Graphs Stabbed by a Line
Dibyayan Chakraborty, Kshitij Gajjar, Irena Rusu
In this paper, we determine the computational complexity of recognizing two graph classes, \emph{grounded L}-graphs and \emph{stabbable grid intersection} graphs. An L-shape is mad…
cs.CC2022
On the complexity of recognizing Stick, BipHook and Max Point-Tolerance graphs
Irena Rusu
Stick graphs are defined as follows. Let A (respectively B) be a set of vertical (respectively horizontal) segments in the plane such that the bottom endpoints of the segments in A…