Zobrazeno 1 - 10
of 135
pro vyhledávání: '"Symvonis, Antonios"'
Autor:
Di Giacomo, Emilio, Förster, Henry, Kokhovich, Daria, Mchedlidze, Tamara, Montecchiani, Fabrizio, Symvonis, Antonios, Villedieu, Anaïs
We study the upward point-set embeddability of digraphs on one-sided convex point sets with at most 1 bend per edge. We provide an algorithm to compute a 1-bend upward point-set embedding of outerplanar $st$-digraphs on arbitrary one-sided convex poi
Externí odkaz:
http://arxiv.org/abs/2401.03226
Autor:
Ahmed, Reyan, Angelini, Patrizio, Bekos, Michael A., Di Battista, Giuseppe, Kaufmann, Michael, Kindermann, Philipp, Kobourov, Stephen, Nöllenburg, Martin, Symvonis, Antonios, Villedieu, Anaïs, Wallinger, Markus
Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two sets of entities (vertices) are placed on two parallel lines (layers),
Externí odkaz:
http://arxiv.org/abs/2301.10872
Autor:
Binucci, Carla, Di Giacomo, Emilio, Lenhart, William J., Liotta, Giuseppe, Montecchiani, Fabrizio, Nöllenburg, Martin, Symvonis, Antonios
Motivated by dynamic graph visualization, we study the problem of representing a graph $G$ in the form of a \emph{storyplan}, that is, a sequence of frames with the following properties. Each frame is a planar drawing of the subgraph of $G$ induced b
Externí odkaz:
http://arxiv.org/abs/2209.00453
Strictly-convex straight-line drawings of $3$-connected planar graphs in small area form a classical research topic in Graph Drawing. Currently, the best-known area bound for such drawings is $O(n^2) \times O(n^2)$, as shown by B\'{a}r\'{a}ny and Rot
Externí odkaz:
http://arxiv.org/abs/2208.13388
We continue the study of the area requirement of convex straight-line grid drawings of 3-connected plane graphs, which has been intensively investigated in the last decades. Motivated by applications, such as graph editors, we additionally require th
Externí odkaz:
http://arxiv.org/abs/2204.14040
We consider the problem of drawing an outerplanar graph with $n$ vertices with at most one bend per edge if the outer face is already drawn as a simple polygon. We prove that it can be decided in $O(nm)$ time if such a drawing exists, where $m\le n-3
Externí odkaz:
http://arxiv.org/abs/2108.12321
Autor:
Binucci, Carla, Di Giacomo, Emilio, Lenhart, William J., Liotta, Giuseppe, Montecchiani, Fabrizio, Nöllenburg, Martin, Symvonis, Antonios
Publikováno v:
In Journal of Computer and System Sciences February 2024 139
Publikováno v:
In Theoretical Computer Science 8 January 2024 982
Autor:
Bekos, Michael A., Gronemann, Martin, Montecchiani, Fabrizio, Pálvölgyi, Dömötör, Symvonis, Antonios, Theocharous, Leonidas
We study the algorithmic problem of computing drawings of graphs in which $(i)$ each vertex is a disk with fixed radius $\rho$, $(ii)$ each edge is a straight-line segment connecting the centers of the two disks representing its end-vertices, $(iii)$
Externí odkaz:
http://arxiv.org/abs/2005.02082
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