Pier Francesco Cortese

According to our database, Pier Francesco Cortese authored at least 9 papers between 2003 and 2018.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2018

Clustered Planarity = Flat Clustered Planarity.

Pier Francesco Cortese, Maurizio Patrignani

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2013

Topological morphing of planar graphs.

Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani

Theor. Comput. Sci., 2013

2009

On embedding a cycle in a plane graph.

Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia

Discret. Math., 2009

2008

C-Planarity of C-Connected Clustered Graphs.

Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Maurizio Pizzonia

J. Graph Algorithms Appl., 2008

2006

Topographic Visualization of Prefix Propagation in the Internet.

Pier Francesco Cortese, Giuseppe Di Battista, Antonello Moneta, Maurizio Patrignani, Maurizio Pizzonia

IEEE Trans. Vis. Comput. Graph., 2006

On the Topologies of Local Minimum Spanning Trees.

Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Katharina Anna Lehmann, Giuseppe Liotta, Maurizio Patrignani, Ioannis G. Tollis, Francesco Trotta

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

2005

Clustering Cycles into Cycles of Clusters.

Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia

J. Graph Algorithms Appl., 2005

Clustered planarity.

Pier Francesco Cortese, Giuseppe Di Battista

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2003

Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm.

John M. Boyer, Pier Francesco Cortese, Maurizio Patrignani, Giuseppe Di Battista

Proceedings of the Graph Drawing, 11th International Symposium, 2003