Zobrazeno 1 - 10
of 25 637
pro vyhledávání: '"Rutter, A"'
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
We consider three simple quadratic time algorithms for the problem Level Planarity and give a level-planar instance that they either falsely report as negative or for which they output a drawing that is not level planar.
Comment: Poster presente
Comment: Poster presente
Externí odkaz:
http://arxiv.org/abs/2409.01727
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
We introduce the $k$-Plane Insertion into Plane drawing ($k$-PIP) problem: given a plane drawing of a planar graph $G$ and a set $F$ of edges, insert the edges in $F$ into the drawing such that the resulting drawing is $k$-plane. In this paper, we sh
Externí odkaz:
http://arxiv.org/abs/2402.14552
We consider variants of the clustered planarity problem for level-planar drawings. So far, only convex clusters have been studied in this setting. We introduce two new variants that both insist on a level-planar drawing of the input graph but relax t
Externí odkaz:
http://arxiv.org/abs/2402.13153
Autor:
Fink, Simon D., Rutter, Ignaz
In the constrained planarity setting, we ask whether a graph admits a planar drawing that additionally satisfies a given set of constraints. These constraints are often derived from very natural problems; prominent examples are Level Planarity, where
Externí odkaz:
http://arxiv.org/abs/2310.20632
Given a graph $G$ with a fixed vertex order $\prec$, one obtains a circle graph $H$ whose vertices are the edges of $G$ and where two such edges are adjacent if and only if their endpoints are pairwise distinct and alternate in $\prec$. Therefore, th
Externí odkaz:
http://arxiv.org/abs/2309.02258
Given $k$ input graphs $G_1, \dots ,G_k$, where each pair $G_i$, $G_j$ with $i \neq j$ shares the same graph $G$, the problem Simultaneous Embedding With Fixed Edges (SEFE) asks whether there exists a planar drawing for each input graph such that all
Externí odkaz:
http://arxiv.org/abs/2308.11401
Autor:
M. Sandells, N. Rutter, K. Wivell, R. Essery, S. Fox, C. Harlow, G. Picard, A. Roy, A. Royer, P. Toose
Publikováno v:
The Cryosphere, Vol 18, Pp 3971-3990 (2024)
Accurate simulations of snow emission in surface-sensitive microwave channels are needed to separate snow from atmospheric information essential for numerical weather prediction. Measurements from a field campaign in Trail Valley Creek, Inuvik, Canad
Externí odkaz:
https://doaj.org/article/b5a3c8412fd04cf8bf035296d40747c7
Autor:
Lindsay A. Rutter, Matthew J. MacKay, Henry Cope, Nathaniel J. Szewczyk, JangKeun Kim, Eliah Overbey, Braden T. Tierney, Masafumi Muratani, Ben Lamm, Daniela Bezdan, Amber M. Paul, Michael A. Schmidt, George M. Church, Stefania Giacomello, Christopher E. Mason
Publikováno v:
Nature Communications, Vol 15, Iss 1, Pp 1-13 (2024)
Abstract Common and rare alleles are now being annotated across millions of human genomes, and omics technologies are increasingly being used to develop health and treatment recommendations. However, these alleles have not yet been systematically cha
Externí odkaz:
https://doaj.org/article/432fef0373e34d608e1135e3084c96bc