Zobrazeno 1 - 10
of 150
pro vyhledávání: '"Rusu, Irena"'
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 made by joining the bottom end-point of a vertical ($\vert$) segment to t
Externí odkaz:
http://arxiv.org/abs/2209.01851
Autor:
Rusu, Irena
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 and the left endpoints of the segments in B lie on the same ground st
Externí odkaz:
http://arxiv.org/abs/2205.09076
Autor:
Rusu, Irena
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 that n >= 1, k >= 2 and 0 <= l <= k-2, a (k,l)-threshold sequence of len
Externí odkaz:
http://arxiv.org/abs/2109.05291
Publikováno v:
In Theoretical Computer Science 12 May 2024 995
Autor:
Rusu, Irena
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 lie on the same ground line with slope -1. These endpoints are respec
Externí odkaz:
http://arxiv.org/abs/2106.12249
Autor:
Rusu, Irena
Grid intersection graphs are the intersection graphs of vertical and horizontal segments in the plane. When the bottom and respectively left endpoints of the vertical and horizontals segments belong to a line with negative slope, the graph is called
Externí odkaz:
http://arxiv.org/abs/2007.10773
Autor:
Rusu, Irena
We give a positive answer to a question raised by Davis et al. ({\em Discrete Mathematics} 341, 2018), concerning permutations with the same pinnacle set. Given $\pi\in S_n$, a {\em pinnacle} of $\pi$ is an element $\pi_i$ ($i\neq 1,n$) such that $\p
Externí odkaz:
http://arxiv.org/abs/2001.08417
Autor:
Rusu, Irena, Tenner, Bridget Eileen
A pinnacle of a permutation is a value that is larger than its immediate neighbors when written in one-line notation. In this paper, we build on previous work that characterized admissible pinnacle sets of permutations. For these sets, there can be s
Externí odkaz:
http://arxiv.org/abs/2001.08185
Autor:
Rusu, Irena
In directed graphs, we investigate the problems of finding: 1) a minimum feedback vertex set (also called the Feedback Vertex Set problem, or MFVS), 2) a feedback vertex set inducing an acyclic graph (also called the Vertex 2-Coloring without Monochr
Externí odkaz:
http://arxiv.org/abs/1809.01998