We study the problem of drawing a dynamic graph, where each vertex appears in the graph at a certain time and remains in the graph for a fixed amount of time, called the window size. This defines a graph story, i.e., a sequence of subgraphs, each …

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 …

The volume and the complexity of structured relational information created and handled by modern information systems has drastically increased. More and more often, data are generated so quickly that they cannon even be completely displayed or …

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 …

We initiate the study of the following problem$:$ Given a non-planar graph $G$ and a planar subgraph $S$ of $G$, does there exist a straight-line drawing $\Gamma$ of $G$ in the plane such that the edges of $S$ are not crossed in $\Gamma$? We give …

We initiate the study of the following problem$:$ Given a non-planar graph $G$ and a planar subgraph $S$ of $G$, does there exist a straight-line drawing $\Gamma$ of $G$ in the plane such that the edges of $S$ are not crossed in $\Gamma$? We give …

All opinions expressed here are my own and do not necessarily represent those of any other agencies or groups. © 2021 Giordano Da Lozzo · Powered by the Academic theme for Hugo.