Pier Francesco Cortese's Publications

Pier Francesco Cortese

Home

Research groups:
  Graph Drawing

Publications:
  By type
  By year
  By topic

Teaching:
  Courses (Italian)
  Theses & Labs

Pier Francesco Cortese's Publications

2013

  1. Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani. Topological Morphing of Planar Graphs. Theor. Computer Science. 514:2-20. 2013.

2010

  1. Pier Francesco Cortese, Francesco Gemmiti, Bernardo Palazzi, Maurizio Pizzonia, Massimo Rimondini. Efficient and Practical Authentication of PUF-based RFID Tags in Supply Chains. In Proc. IEEE International Conference on RFID-Technology and Applications (RFID-TA 2010), IEEE, pages 182-188, 2010. [see TR]

2009

  1. Pier Francesco Cortese, Francesco Gemmiti, Bernardo Palazzi, Maurizio Pizzonia, Massimo Rimondini. Efficient and Practical Authentication of PUF-based RFID Tags. Technical Report RT-DIA-150-2009, Dept. of Computer Science and Automation, Roma Tre University, 2009. [conference version]

  2. Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia. On Embedding a Cycle in a Plane Graph. Discrete Mathematics. 309(7):1856-1869. Apr 2009. [see TR] [conference version]

  3. Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani. Topological Morphing of Planar Graphs. In, Ioannis G. Tollis, Maurizio Patrignani, editors, 16th International Symposium on Graph Drawing (GD '08), Springer-Verlag, volume 5417 of Lecture Notes in Computer Science, pages 145-156, 2009. [see TR]

2008

  1. Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Maurizio Pizzonia. C-Planarity of C-Connected Clustered Graphs. Journal of Graph Algorithms and Applications. 12(2):225-262. Nov 2008. [ download pdf] [see TR1] [see TR2]

  2. Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani. Topological Morphing of Planar Graphs. Technical Report RT-DIA-134-2008, Dept. of Computer Science and Automation, Roma Tre University, 2008. [conference version]

2007

  1. Pier Francesco Cortese. C-Planarity of Clustered Graphs: Methodologies, Algorithms, and Applications, Doctoral Thesis, Universita' degli Studi ``Roma Tre'', Dottorato di Ricerca in Informatica e Automazione, XIX Ciclo, 2007. [ download pdf]

2006

  1. Pier Francesco Cortese, Giuseppe Di Battista, Antonello Moneta, Maurizio Patrignani, Maurizio Pizzonia. Topographic Visualization of Prefix Propagation in the Internet. IEEE Transactions on Visualization and Computer Graphics. 12(5):725-732. 2006. [see TR]

  2. Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Katharina Anna Lehmann, Giuseppe Liotta, Maurizio Patrignani, Ioannis Tollis, Francesco Trotta. On the Topologies of Local Minimum Spanning Trees. In, Thomas Erlebach, editor, 3rd Workshop on Combinatorial and Algorithmic Aspects of the Networks (CAAN '06), Springer-Verlag, volume 4235 of Lecture Notes in Computer Science, pages 31-44, 2006. [see TR]

  3. Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Katharina Anna Lehmann, Giuseppe Liotta, Maurizio Patrignani, Ioannis Tollis, Francesco Trotta. On the Topologies of Local Minimum Spanning Trees. Technical Report RT-001-06, Dip. Ingegneria Elettronica e dell'Informazione, Univ. Perugia, 2006. [conference version]

  4. Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Maurizio Pizzonia. C-Planarity of C-Connected Clustered Graphs: Part I - Characterization. Technical Report RT-DIA-109-2006, Dip. Informatica e Automazione, Univ. Roma Tre, 2006. [journal version]

  5. Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Maurizio Pizzonia. C-Planarity of C-Connected Clustered Graphs: Part II - Testing and Embedding Algorithm. Technical Report RT-DIA-110-2006, Dip. Informatica e Automazione, Univ. Roma Tre, 2006. [journal version]

2005

  1. Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia. Clustering Cycles into Cycles of Clusters. Journal of Graph Algorithms and Applications. 9(3):391-413. 2005. Special Issue on the 2004 Symposium on Graph Drawing, GD '04. [see TR] [conference version]

  2. Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia. On Embedding a Cycle in a Plane Graph. In, P. Healy, N.S. Nikolov, editors, 13th International Symposium on Graph Drawing (Proc. GD '05), Springer-Verlag, volume 3843 of Lecture Notes in Computer Science, pages 46-60, 2005. [see TR] [journal version]

  3. Pier Francesco Cortese, Giuseppe Di Battista. Clustered Planarity (Invited Lecture). In Twenty-first annual symposium on Computational Geometry (proc. SoCG 05), ACM, pages 30-32, 2005.

  4. Pier Francesco Cortese, Giuseppe Di Battista, Antonello Moneta, Maurizio Patrignani, Maurizio Pizzonia. Topographic Visualization of the Internet. Technical Report RT-DIA-104-2005, Dip. Informatica e Automazione, Univ. Roma Tre, 2005. [journal version]

  5. Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia. On Embedding a Cycle in a Plane Graph. Technical Report RT-DIA-100-2005, Dip. Informatica e Automazione, Univ. Roma Tre, 2005. [conference version] [journal version]

2004

  1. Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia. Clustering Cycles into Cycles of Clusters. In 12th International Symposium on Graph Drawing (Proc. GD '04), Springer-Verlag, volume 3383 of Lecture Notes in Computer Science, pages 100-110, 2004. [ preliminary version] [see TR] [journal version]

  2. John Michael Boyer, Pier Francesco Cortese, Maurizio Patrignani, Giuseppe Di Battista. Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-based Planarity Testing and Embedding Algorithm. In, Giuseppe Liotta, editor, Graph Drawing (Proc. GD '03), Springer-Verlag, volume 2912 of Lecture Notes in Computer Science, pages 25-36, 2004. [see TR]

  3. Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia. Clustering Cycles into Cycles of Clusters. Technical Report RT-DIA-91-2004, Dip. Informatica e Automazione, Univ. Roma Tre, 2004. [conference version] [journal version]

2003

  1. John Michael Boyer, Pier Francesco Cortese, Maurizio Patrignani, Giuseppe Di Battista. Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-based Planarity Testing and Embedding Algorithm. Technical Report RT-DIA-83-2003, Dip. Informatica e Automazione, Univ. Roma Tre, 2003. [conference version]