135 citations · 160 across the 16 of their papers we have counts for
21 papers
Small-scale operations on graphic sequences
Irena Rusu
A sequence D=(d1, d2, ..., dn) of positive integers is graphic if it is the degree sequence of a simple graph, called in this case a {\em realization} of D. In this paper, we intro…
Cluster Vertex Deletion Problems on Cubic Graphs
Irena Rusu
The problems Cluster Vertex Deletion (or Cluster-VD) and its generalization s-Club Cluster Vertex Deletion (or s-Club-VD, for any integer s>= 1), have been introduced with the aim…
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…
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…
Raney numbers, threshold sequences and Motzkin-like paths
Irena Rusu
We provide new interpretations for a subset of Raney numbers, involving threshold sequences and Motzkin-like paths with long up and down steps. Given three integers n, k, l such th…
Forced pairs in A-Stick graphs
Irena Rusu
A Stick graph G=(A\cup B, E) is the intersection graph of a set A of horizontal segments and a set B of vertical segments in the plane, whose left and respectively bottom endpoints…