In this research we introduce a notion of planarity for graphs that are presented in a streaming fashion. A streamed graph is a stream of edges $e_1,e_2,\dots,e_m$ on a vertex set $V$. A streamed graph is $\omega$-stream planar with respect to a …
In this work we investigate the complexity of some combinatorial problems related to the Simultaneous Embedding with Fixed Edges (SEFE) and the PARTITIONED T-COHERENT $k$-PAGE BOOK EMBEDDING (PTBE-$k$) problems, which are known to be equivalent under …
In this paper we study two problems related to the drawing of level graphs, that is, $T$-Level Planarity and Clustered-Level Planarity. We show that both problems are $\mathcal{NP}$-complete in the general case and that they become polynomial-time …
In this work we investigate the complexity of some combinatorial problems related to the Simultaneous Embedding with Fixed Edges (SEFE) and the PARTITIONED T-COHERENT $k$-PAGE BOOK EMBEDDING (PTBE-$k$) problems, which are known to be equivalent under …