Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Tappini, Alessandra"'
Partial edge drawings (PED) of graphs avoid edge crossings by subdividing each edge into three parts and representing only its stubs, i.e., the parts incident to the end-nodes. The morphing edge drawing model (MED) extends the PED drawing style by an
Externí odkaz:
http://arxiv.org/abs/2309.00456
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
This paper studies a \emph{packing} problem in the so-called beyond-planar setting, that is when the host graph is ``almost-planar'' in some sense. Precisely, we consider the case that the host graph is $k$-planar, i.e., it admits an embedding with a
Externí odkaz:
http://arxiv.org/abs/2301.01226
Autor:
Di Battista, Giuseppe, Didimo, Walter, Grilli, Luca, Grosso, Fabrizio, Ortali, Giacomo, Patrignani, Maurizio, Tappini, Alessandra
In a graph story the vertices enter a graph one at a time and each vertex persists in the graph for a fixed amount of time $\omega$, called viewing window. At any time, the user can see only the drawing of the graph induced by the vertices in the vie
Externí odkaz:
http://arxiv.org/abs/2208.14126
Autor:
Angelini, Patrizio, Bekos, Michael A., Da Lozzo, Giordano, Gronemann, Martin, Montecchiani, Fabrizio, Tappini, Alessandra
A map graph is a graph admitting a representation in which vertices are nations on a spherical map and edges are shared curve segments or points between nations. We present an explicit fixed-parameter tractable algorithm for recognizing map graphs pa
Externí odkaz:
http://arxiv.org/abs/2206.14898
We study the parameterized complexity of the $s$-Club Cluster Edge Deletion problem: Given a graph $G$ and two integers $s \ge 2$ and $k \ge 1$, is it possible to remove at most $k$ edges from $G$ such that each connected component of the resulting g
Externí odkaz:
http://arxiv.org/abs/2205.10834
This paper studies the problem of computing quasi-upward planar drawings of bimodal plane digraphs with minimum curve complexity, i.e., drawings such that the maximum number of bends per edge is minimized. We prove that every bimodal plane digraph ad
Externí odkaz:
http://arxiv.org/abs/2108.10784
Hybrid visualizations mix different metaphors in a single layout of a network. In particular, the popular NodeTrix model, introduced by Henry, Fekete, and McGuffin in 2007, combines node-link diagrams and matrix-based representations to support the a
Externí odkaz:
http://arxiv.org/abs/2108.10270
Autor:
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Montecchiani, Fabrizio, Tappini, Alessandra
Storyline visualizations depict the temporal dynamics of social interactions, as they describe how groups of actors (individuals or organizations) change over time. A common constraint in storyline visualizations is that an actor cannot belong to two
Externí odkaz:
http://arxiv.org/abs/2008.04125
Autor:
Bekos, Michael A., Binucci, Carla, Kaufmann, Michael, Raftopoulou, Chrysanthi, Symvonis, Antonios, Tappini, Alessandra
In this work, we continue the study of vertex colorings of graphs, in which adjacent vertices are allowed to be of the same color as long as each monochromatic connected component is of relatively small cardinality. We focus on colorings with two and
Externí odkaz:
http://arxiv.org/abs/1911.10863