We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
Christian A. Duncan, David Eppstein, Stephen G. Ko...
We present a simple linear time algorithm for drawing level graphs with a given ordering of the vertices within each level. The algorithm draws in a radial fashion without changing...
Christian Bachmaier, Florian Fischer, Michael Fors...
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
We describe a prototype sketch-based system that allows users to draw and manipulate directed graphs using gestural input exclusively. The system incorporates the notion of fluid...
This paper describes a novel approach to representing experimental biological data in metabolic networks. The aim is to allow biologists to visualise and analyse the data in the c...