Zobrazeno 1 - 10
of 1 010
pro vyhledávání: '"LIOTTA, Giuseppe"'
Autor:
Förster, Henry, Klesen, Felix, Dwyer, Tim, Eades, Peter, Hong, Seok-Hee, Kobourov, Stephen G., Liotta, Giuseppe, Misue, Kazuo, Montecchiani, Fabrizio, Pastukhov, Alexander, Schreiber, Falk
Graph and network visualization supports exploration, analysis and communication of relational data arising in many domains: from biological and social networks, to transportation and powergrid systems. With the arrival of AI-based question-answering
Externí odkaz:
http://arxiv.org/abs/2409.02907
Autor:
Bekos, Michael, Da Lozzo, Giordano, Frati, Fabrizio, Gupta, Siddharth, Kindermann, Philipp, Liotta, Giuseppe, Rutter, Ignaz, Tollis, Ioannis G.
This paper studies planar drawings of graphs in which each vertex is represented as a point along a sequence of horizontal lines, called levels, and each edge is either a horizontal segment or a strictly $y$-monotone curve. A graph is $s$-span weakly
Externí odkaz:
http://arxiv.org/abs/2409.01889
Autor:
Angelini, Patrizio, Biedl, Therese, Chimani, Markus, Cornelsen, Sabine, Da Lozzo, Giordano, Hong, Seok-Hee, Liotta, Giuseppe, Patrignani, Maurizio, Pupyrev, Sergey, Rutter, Ignaz, Wolff, Alexander
Not every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of DAGs in which
Externí odkaz:
http://arxiv.org/abs/2409.01475
Autor:
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk, Montecchiani, Fabrizio, Wismath, Stephen
The \emph{local edge-length ratio} of a planar straight-line drawing $\Gamma$ is the largest ratio between the lengths of any pair of edges of $\Gamma$ that share a common vertex. The \emph{global edge-length ratio} of $\Gamma$ is the largest ratio b
Externí odkaz:
http://arxiv.org/abs/2311.14634
We study the problem of gradually representing a complex graph as a sequence of drawings of small subgraphs whose union is the complex graph. The sequence of drawings is called \emph{storyplan}, and each drawing in the sequence is called a \emph{fram
Externí odkaz:
http://arxiv.org/abs/2311.13523
Autor:
Khazaliya, Liana, Kindermann, Philipp, Liotta, Giuseppe, Montecchiani, Fabrizio, Simonov, Kirill
The problem of deciding whether a biconnected planar digraph $G=(V,E)$ can be augmented to become an $st$-planar graph by adding a set of oriented edges $E' \subseteq V \times V$ is known to be NP-complete. We show that the problem is fixed-parameter
Externí odkaz:
http://arxiv.org/abs/2309.15454
A pair $\langle G_0, G_1 \rangle$ of graphs admits a mutual witness proximity drawing $\langle \Gamma_0, \Gamma_1 \rangle$ when: (i) $\Gamma_i$ represents $G_i$, and (ii) there is an edge $(u,v)$ in $\Gamma_i$ if and only if there is no vertex $w$ in
Externí odkaz:
http://arxiv.org/abs/2309.01463
Autor:
Jansen, Bart M. P., Khazaliya, Liana, Kindermann, Philipp, Liotta, Giuseppe, Montecchiani, Fabrizio, Simonov, Kirill
Upward planarity testing and Rectilinear planarity testing are central problems in graph drawing. It is known that they are both NP-complete, but XP when parameterized by treewidth. In this paper we show that these two problems are W[1]-hard paramete
Externí odkaz:
http://arxiv.org/abs/2309.01264
Autor:
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Montecchiani, Fabrizio, Ortali, Giacomo
Computing planar orthogonal drawings with the minimum number of bends is one of the most relevant topics in Graph Drawing. The problem is known to be NP-hard, even when we want to test the existence of a rectilinear planar drawing, i.e., an orthogona
Externí odkaz:
http://arxiv.org/abs/2308.13665
Autor:
Binucci, Carla, Büngener, Aaron, Di Battista, Giuseppe, Didimo, Walter, Dujmović, Vida, Hong, Seok-Hee, Kaufmann, Michael, Liotta, Giuseppe, Morin, Pat, Tappini, Alessandra
The study of nonplanar drawings of graphs with restricted crossing configurations is a well-established topic in graph drawing, often referred to as beyond-planar graph drawing. One of the most studied types of drawings in this area are the $k$-plana
Externí odkaz:
http://arxiv.org/abs/2308.13401