Publications related with Proximity Drawings

Proximity Drawings

Topic home

Graph Drawing
 Topics
 Tools

Publications:
 By type
 By year

Publications related with Proximity Drawings

2017

  1. Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati. On Planar Greedy Drawings of 3-Connected Planar Graphs. In, Boris Aronov, Matthew Katz, editors, Proc. 33rd Symposium on Computational Geometry (SoCG '17), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, LIPIcs, 2017.

2016

  1. Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati. On Planar Greedy Drawings of 3-Connected Planar Graphs. Technical Report arXiv:1612.09277, Cornell University, 2016.

2015

  1. Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson. Increasing-Chord Graphs On Point Sets. Journal of Graph Algorithms and Applications. 19(2):761-778. 2015.

2014

  1. Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson. Increasing-Chord Graphs On Point Sets. In, Christian Duncan, Antonios Symvonis, editors, Proc. 22nd International Symposium on Graph Drawing (GD '14), Springer-Verlag, volume 8871 of Lecture Notes in Computer Science, pages 464-475, 2014.

  2. Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson.. Increasing-Chord Graphs On Point Sets. Technical Report arXiv:1408.2592, Cornell University, 2014.

  3. Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella. On the Area Requirements of Euclidean Minimum Spanning Trees. Computational Geometry: Theory and Applications. 47(2):200-213. 2014. Special Issue on Selected Papers from WADS '11.

2012

  1. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati. Succinct Greedy Drawings Do Not Always Exist. Networks. 59(3):267-274. 2012.

2011

  1. Fabrizio Frati, Michael Kaufmann. Polynomial Area Bounds for MST Embeddings of Trees. Computational Geometry: Theory and Applications. 44:529-543. 2011.

  2. Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella. On the Area Requirements of Euclidean Minimum Spanning Trees. In, F. K. H. A. Dehne, J. Iacono, J.-R. Sack, editors, 12th Algorithms and Data Structures Symposium (WADS '11), Springer, volume 6844 of Lecture Notes in Computer Science, pages 25-36, 2011.

  3. Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella. On the Area Requirements of Euclidean Minimum Spanning Trees. Technical Report RT-DIA-183-2011, Dept. of Computer Science and Automation, Roma Tre University, 2011.

2010

  1. Patrizio Angelini, Fabrizio Frati, Luca Grilli. An Algorithm to Construct Greedy Drawings of Triangulations. Journal of Graph Algorithms and Applications. 14(1):19-51. 2010. Special Issue on Selected Papers from GD '08. [ download pdf]

  2. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati. Succinct Greedy Drawings Do Not Always Exist. In, David Eppstein, Emden R. Gansner, editors, 17th International Symposium on Graph Drawing (GD '09), Springer-Verlag, volume 5849 of Lecture Notes in Computer Science, pages 171-182, 2010.

2009

  1. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati. Succinct Greedy Drawings May Be Unfeasible. Technical Report RT-DIA-148-2009, Dept. of Computer Science and Automation, University of Roma Tre, 2009.

  2. Fabrizio Frati. Small Screens and Large Graphs: Area-Efficient Drawings of Planar Combinatorial Structures, Doctoral Thesis, Universita' degli Studi di Roma ``Roma Tre'', Dottorato di Ricerca in Ingegneria Informatica, XXI Ciclo, 2009. [ download pdf]

  3. Patrizio Angelini, Fabrizio Frati, Luca Grilli. An Algorithm to Construct Greedy Drawings of Triangulations. Technical Report RT-DIA-140-2009, Dept. of Computer Science and Automation, Roma Tre University, 2009.

  4. Patrizio Angelini, Fabrizio Frati, Luca Grilli. An Algorithm to Construct Greedy Drawings of Triangulations. In, I. G. Tollis, M. Patrignani, editors, 16th International Symposium on Graph Drawing (GD '08), Springer-Verlag, volume 5417 of Lecture Notes in Computer Science, pages 26-37, 2009.

2008

  1. Fabrizio Frati, Michael Kaufmann. Polynomial Area Bounds for MST Embeddings of Trees. Technical Report RT-DIA-122-2008, Dept. of Computer Science and Automation, Roma Tre University, 2008.

2006

  1. Giuseppe Di Battista, Giuseppe Liotta, Sue H. Whitesides. The strength of weak proximity. Journal of Discrete Algorithms. 4(3):384-400. Sep 2006.

1996

  1. G. Di Battista, G. Liotta, S. H. Whitesides. The Strength of Weak Proximity. In, F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), Springer-Verlag, volume 1027 of Lecture Notes in Computer Science, pages 178-189, 1996.

  2. P. Bose, G. Di Battista, W. Lenhart, G. Liotta. Proximity Constraints and Representable Trees. Technical Report RT-INF-9-96, Dip. Discipline Scientifiche, Sez. Informatica, Univ. Roma III, 1996.

  3. G. Di Battista, G. Liotta, S.H. Whitesides. The Strength of Weak Proximity. Technical Report RT-INF-8-96, Dip. Discipline Scientifiche, Sez. Informatica, Univ. Roma III, 1996.

1995

  1. P. Bose, G. Di Battista, W. Lenhart, G. Liotta. Proximity Constraints and Representable Trees. In, R. Tamassia, I. G. Tollis, editors, Graph Drawing (Proc. GD '94), Springer-Verlag, volume 894 of Lecture Notes in Computer Science, pages 340-351, 1995.

  2. Giuseppe Liotta, Giuseppe Di Battista. Computing Proximity Drawings of Trees in the 3-Dimensional Space. In Proc. 4th Workshop Algorithms Data Struct., Springer-Verlag, volume 955 of Lecture Notes in Computer Science, pages 239-250, 1995.

  3. G. Di Battista, W. Lenhart, G. Liotta. Proximity Drawability: a Survey. In, R. Tamassia, I. G. Tollis, editors, Graph Drawing (Proc. GD '94), Springer-Verlag, volume 894 of Lecture Notes in Computer Science, pages 328-339, 1995.