2 citations · 4 across the 7 of their papers we have counts for
8 papers
A characterization of interval nest digraphs
Ayelén Alcantar, Flavia Bonomo, Guillermo Durán +1
A digraph consisting of a set of vertices and a set of arcs is called an interval digraph if there exists a family of closed intervals such that $uv…
Trees with proper thinness 2
Flavia Bonomo-Braberman, Ignacio Maqueda, Nina Pardal
The proper thinness of a graph is an invariant that generalizes the concept of a proper interval graph. Every graph has a numerical value of proper thinness and the graphs with pro…
Exploring subgraph complementation to bounded degree graphs
Ivo Koch, Nina Pardal, Vinicius F. dos Santos
Graph modification problems are computational tasks where the goal is to change an input graph using operations from a fixed set, in order to make the resulting graph satisfy a…
Edge deletion to tree-like graph classes
Ivo Koch, Nina Pardal, Vinicius Fernandes dos Santos
For a fixed property (graph class) , given a graph G and an integer k, the -deletion problem consists in deciding if we can turn into a graph with the property by del…
On the proper interval completion problem within some chordal subclasses
François Dross, Claire Hilaire, Ivo Koch +4
Given a property (graph class) , a graph , and an integer , the \emph{-completion} problem consists in deciding whether we can turn into a graph with the property $…
2-nested matrices: towards understanding the structure of circle graphs
Guillermo Durán, Nina Pardal, Martín D. Safe
A -matrix has the consecutive-ones property (C1P) if its columns can be permuted to make the 's in each row appear consecutively. This property was characterised in terms…
Forbidden induced subgraph characterization of circle graphs within split graphs
Flavia Bonomo-Braberman, Guillermo A. Durán, Nina Pardal +1
A graph is circle if its vertices are in correspondence with a family of chords in a circle in such a way that every two distinct vertices are adjacent if and only if the correspon…
On nested and 2-nested graphs: two subclasses of graphs between threshold and split graphs
Nina Pardal, Guillermo A. Durán, Luciano N. Grippo +1
A -matrix has the Consecutive Ones Property (C1P) for the rows if there is a permutation of its columns such that the ones in each row appear consecutively. We say a $(0, 1)…