Search Results - "Wismath, Stephen"

Ortho-polygon Visibility Representations of Embedded Graphs by Di Giacomo, Emilio, Didimo, Walter, Evans, William S., Liotta, Giuseppe, Meijer, Henk, Montecchiani, Fabrizio, Wismath, Stephen K.

“…An ortho-polygon visibility representation of an n -vertex embedded graph G (OPVR of G ) is an embedding-preserving drawing of G that maps every vertex to a…”
Get full text

Planar and Quasi-Planar Simultaneous Geometric Embedding by Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk, Wismath, Stephen K.

“…A simultaneous geometric embedding (SGE) of two planar graphs G... and G... with the same vertex set is a pair of straight-line planar drawings ... of G... and…”
Get full text

Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d by Bremner, David, Devillers, Olivier, Glisse, Marc, Lazard, Sylvain, Liotta, Giuseppe, Mchedlidze, Tamara, Moroz, Guillaume, Whitesides, Sue, Wismath, Stephen

“…We study the following problem: Given $k$ paths that share the same vertex set, is there a simultaneous geometric embedding of these paths such that each…”
Get full text

Book embeddability of series-parallel digraphs by DI GIACOMO, Emilio, DIDIMO, Walter, LIOTTA, Giuseppe, WISMATH, Stephen K

Get full text

Volume requirements of 3D upward drawings by Di Giacomo, Emilio, Liotta, Giuseppe, Meijer, Henk, Wismath, Stephen K.

“…This paper studies the problem of drawing directed acyclic graphs in three dimensions in the straight-line grid model so that all directed edges are oriented…”
Get full text

Introducing fairness in network visualization by Eades, Peter, Hong, Seokhee, Liotta, Giuseppe, Montecchiani, Fabrizio, Nöllenburg, Martin, Piselli, Tommaso, Wismath, Stephen

“…Motivated by the need for decision-making systems that avoid bias and discrimination, the concept of fairness recently gained traction in the broad field of…”
Get full text

Point-Set Embedding in Three Dimensions by Meijer, Henk, Wismath, Stephen

“…Given a graph $G$ with $n$ vertices and $m$ edges, and a set $P$ of $n$ points on a three-dimensional integer grid, the 3D Point-Set Embeddability problem is…”
Get full text

On the Planar Split Thickness of Graphs by Eppstein, David, Kindermann, Philipp, Kobourov, Stephen, Liotta, Giuseppe, Lubiw, Anna, Maignan, Aude, Mondal, Debajyoti, Vosoughpour, Hamideh, Whitesides, Sue, Wismath, Stephen

“…Motivated by applications in graph drawing and information visualization, we examine the planar split thickness of a graph, that is, the smallest k such that…”
Get full text

Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs by Evans, William, Kaufmann, Michael, Lenhart, William, Mchedlidze, Tamara, Wismath, Stephen

Get full text

Monotone Drawings of Graphs with Fixed Embedding by Angelini, Patrizio, Didimo, Walter, Kobourov, Stephen, Mchedlidze, Tamara, Roselli, Vincenzo, Symvonis, Antonios, Wismath, Stephen

“…A drawing of a graph is a monotone drawing if for every pair of vertices u and v there is a path drawn from u to v that is monotone in some direction. In this…”
Get full text

Packing Trees into 1-planar Graphs by De Luca, Felice, Di Giacomo, Emilio, Hong, Seok-Hee, Kobourov, Stephen, Lenhart, William, Liotta, Giuseppe, Meijer, Henk, Tappini, Alessandra, Wismath, Stephen

“…We introduce and study the 1-planar packing problem: Given $k$ graphs with $n$ vertices $G_1, \dots, G_k$, find a 1-planar graph that contains the given graphs…”
Get full text

Guest Editors' Foreword by Wismath, Stephen K., Wolff, Alexander

Get full text

Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices by Everett, Hazel, Lazard, Sylvain, Liotta, Giuseppe, Wismath, Stephen

“…This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An…”
Get full text

Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions by Felsner, Stefan, Liotta, Giuseppe, Wismath, Stephen

Get full text

Monotone Simultaneous Paths Embeddings in RdRd by Bremner, David, Devillers, Olivier, Glisse, Marc, Lazard, Sylvain, Liotta, Giuseppe, Mchedlidze, Tamara, Moroz, Guillaume, Whitesides, Sue, Wismath, Stephen

“…We study the following problem: Given kk paths that share the same vertex set, is there a simultaneous geometric embedding of these paths such that each…”
Get full text

Point-set embeddings of trees with given partial drawings by Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk, Wismath, Stephen K.

“…Given a graph G with n vertices and a set S of n points in the plane, a point-set embedding of G on S is a planar drawing such that each vertex of G is mapped…”
Get full text

k-colored Point-set Embeddability of Outerplanar Graphs by Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk, Trotta, Francesco, Wismath, Stephen K.

Get full text

New Bounds on the Local and Global Edge-length Ratio of Planar Graphs by 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…”
Get full text

Editorial by Everett, Hazel, Wismath, Stephen

Get full text

Matched drawability of graph pairs and of graph triples by Grilli, Luca, Hong, Seok-Hee, Liotta, Giuseppe, Meijer, Henk, Wismath, Stephen K.

“…The contribution of this paper is twofold. It presents a new approach to the matched drawability problem of pairs of planar graphs and it provides four…”
Get full text