In this paper, we advance the research on linear layouts of DAGs providing both combinatorial and algorithmic results.
Aug 27, 2021 · In this paper, we show that the conjecture holds for subfamilies of upward outerplanar graphs, namely those whose underlying graph is an ...
Dec 23, 2021 · In this section, we investigate the parameterized complexity of the problem with respect to the domination number and the vertex cover number, ...
(PDF) On the Upward Book Thickness Problem: Combinatorial and ...
www.researchgate.net › Home › Books
Sep 7, 2024 · In this paper, we show that the conjecture holds for subfamilies of upward outerplanar graphs, namely those whose underlying graph is an ...
Oct 22, 2024 · In this paper, we show that the conjecture holds for subfamilies of upward outerplanar graphs, namely those whose underlying graph is an ...
In this paper, we show that the conjecture holds for subfamilies of upward outerplanar graphs, namely those whose underlying graph is an internally- ...
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg: On the Upward Book Thickness Problem: Combinatorial and Complexity Results.
In this paper, we show that the conjecture holds for subfamilies of upward outerplanar graphs, namely those whose underlying graph is an internally-triangulated ...
In this paper we study the computational complexity of the Upward Planarity Extension problem, which takes as input an upward planar drawing of a subgraph H of ...
[PDF] Upward Book Embeddings of st-Graphs - Semantic Scholar
www.semanticscholar.org › paper › Upw...
On the Upward Book Thickness Problem: Combinatorial and Complexity Results · S ... This paper addresses a long-standing open problem regarding the exact book ...