We consider characterizations of level planar trees. Healy et al. [8] characterized the set of trees that are level planar in terms of two minimal level non-planar (MLNP) patterns....
Alejandro Estrella-Balderrama, J. Joseph Fowler, S...
Traditional network visualization tools inherently suffer from scalability problems, particularly when such tools are interactive and web-based. In this paper we introduce WiGis â...
Brynjar Gretarsson, Svetlin Bostandjiev, John O'Do...
Abstract. We present a new application for graph drawing in the context of graphical model-based system design, where manual placing of graphical items is still state-of-the-practi...
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Be...
Abstract. In this paper we propose three layout algorithms for semibipartite graphs—bipartite graphs with edges in one partition—that emerge from microarray experiment analysis...
Kai Xu 0003, Rohan Williams, Seok-Hee Hong, Qing L...