GD 2003 : graph drawing (Perugia, 21-24 September 2003)Liotta, Giuseppe.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-20831-3, XV, 542 p, isbn 3-540-20831-3Conference Proceedings

GraphEx: An improved graph translation serviceBRIDGEMAN, Stina.Lecture notes in computer science. 2003, pp 307-313, issn 0302-9743, isbn 3-540-20831-3, 7 p.Conference Paper

An energy model for visual graph clusteringNOACK, Andreas.Lecture notes in computer science. 2003, pp 425-436, issn 0302-9743, isbn 3-540-20831-3, 12 p.Conference Paper

Layout of directed hypergraphs with orthogonal hyperedges (extended abstract)SANDER, Georg.Lecture notes in computer science. 2003, pp 381-386, issn 0302-9743, isbn 3-540-20831-3, 6 p.Conference Paper

Advances in graph drawing; The 11th International Symposium on Graph DrawingLIOTTA, Giuseppe; MEIJER, Henk.Discrete applied mathematics. 2007, Vol 155, Num 9, issn 0166-218X, 100 p.Conference Proceedings

An improved approximation to the one-sided bilayer drawingNAGAMOCHI, Hiroshi.Lecture notes in computer science. 2003, pp 406-418, issn 0302-9743, isbn 3-540-20831-3, 13 p.Conference Paper

Laying out iterated line digraphs using queuesHASUNUMA, Toru.Lecture notes in computer science. 2003, pp 202-213, issn 0302-9743, isbn 3-540-20831-3, 12 p.Conference Paper

Drawing series-parallel graphs on restricted integer 3D gridsDI GIACOMO, Emilio.Lecture notes in computer science. 2003, pp 238-246, issn 0302-9743, isbn 3-540-20831-3, 9 p.Conference Paper

Barycentric drawings of periodic graphsDELGADO-FRIEDRICHS, Olaf.Lecture notes in computer science. 2003, pp 178-189, issn 0302-9743, isbn 3-540-20831-3, 12 p.Conference Paper

3D visibility representations of complete graphsSTOLA, Jan.Lecture notes in computer science. 2003, pp 226-237, issn 0302-9743, isbn 3-540-20831-3, 12 p.Conference Paper

Drawing graphs with right angle crossingsDIDIMO, Walter; EADES, Peter; LIOTTA, Giuseppe et al.Theoretical computer science. 2011, Vol 412, Num 39, pp 5156-5166, issn 0304-3975, 11 p.Article

Drawing c-planar biconnected clustered graphsNAGAMOCHI, Hiroshi; KUROYA, Katsutoshi.Discrete applied mathematics. 2007, Vol 155, Num 9, pp 1155-1174, issn 0166-218X, 20 p.Conference Paper

Queue layouts of iterated line directed graphsHASUNUMA, Toru.Discrete applied mathematics. 2007, Vol 155, Num 9, pp 1141-1154, issn 0166-218X, 14 p.Conference Paper

A note on 3D orthogonal drawings with direction constrained edgesDI GIACOMO, Emilio; LIOTTA, Giuseppe; PATRIGNANI, Maurizio et al.Information processing letters. 2004, Vol 90, Num 2, pp 97-101, issn 0020-0190, 5 p.Article

A characterization of complete bipartite RAC graphsDIDIMO, Walter; EADES, Peter; LIOTTA, Giuseppe et al.Information processing letters. 2010, Vol 110, Num 16, pp 687-691, issn 0020-0190, 5 p.Article

Characterizing families of cuts that can be represented by axis-parallel rectanglesBRANDES, Ulrik; CORNELSEN, Sabine; WAGNER, Dorothea et al.Lecture notes in computer science. 2003, pp 357-368, issn 0302-9743, isbn 3-540-20831-3, 12 p.Conference Paper

HexGraph: Applying graph drawing algorithms to the game of HexMURRAY, Colin; FRIEDRICH, Carsten; EADES, Peter et al.Lecture notes in computer science. 2003, pp 494-495, issn 0302-9743, isbn 3-540-20831-3, 2 p.Conference Paper

How many ways can one draw a graph?PACH, Janos; TOTH, Géza.Lecture notes in computer science. 2003, pp 47-58, issn 0302-9743, isbn 3-540-20831-3, 12 p.Conference Paper

Track drawings of graphs with constant queue numberDI GIACOMO, Emilio; MEIJER, Henk.Lecture notes in computer science. 2003, pp 214-225, issn 0302-9743, isbn 3-540-20831-3, 12 p.Conference Paper

A more practical algorithm for drawing binary trees in linear area with arbitrary aspect ratioGARG, Ashim; RUSU, Adrian.Lecture notes in computer science. 2003, pp 159-165, issn 0302-9743, isbn 3-540-20831-3, 7 p.Conference Paper

A constrained, force-directed layout algorithm for biological pathwaysGENC, Burkay; DOGRUSOZ, Ugur.Lecture notes in computer science. 2003, pp 314-319, issn 0302-9743, isbn 3-540-20831-3, 6 p.Conference Paper

Axis-by-axis stress minimizationKOREN, Yehuda; HAREL, David.Lecture notes in computer science. 2003, pp 450-459, issn 0302-9743, isbn 3-540-20831-3, 10 p.Conference Paper

Stretching of Jordan arc contact systemsDE FRAYSSEIX, Hubert; DE MENDEZ, Patrice Ossona.Lecture notes in computer science. 2003, pp 71-85, issn 0302-9743, isbn 3-540-20831-3, 15 p.Conference Paper

UPWARD TOPOLOGICAL BOOK EMBEDDINGS OF DAGSDI GIACOMO, Emilio; GIORDANO, Francesco; LIOTTA, Giuseppe et al.SIAM journal on discrete mathematics (Print). 2011, Vol 25, Num 1-2, pp 479-489, issn 0895-4801, 11 p.Article

UPWARD SPIRALITY AND UPWARD PLANARITY TESTINGDIDIMO, Walter; GIORDANO, Francesco; LIOTTA, Giuseppe et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 4, pp 1842-1899, issn 0895-4801, 58 p.Article