| 2013 | ||
|---|---|---|
| c37 | Soroush Alamdari, Patrizio Angelini, Timothy M. Chan, Giuseppe Di Battista, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson: Morphing Planar Graph Drawings with a Polynomial Number of Steps. SODA 2013: 1656-1667 | |
| e2 | Walter Didimo, Maurizio Patrignani (Eds.): Graph Drawing - 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7704, Springer 2013, isbn 978-3-642-36762-5 | |
| 2012 | ||
| j22 | Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig: Drawing trees in a streaming model. Inf. Process. Lett. 112(11): 418-422 (2012) | |
| j21 | Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter: Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. J. Discrete Algorithms 14: 150-172 (2012) | |
| j20 | Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: Monotone Drawings of Graphs. J. Graph Algorithms Appl. 16(1): 5-35 (2012) | |
| j19 | Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: Nonconvex Representations of Plane Graphs. SIAM J. Discrete Math. 26(4): 1670-1681 (2012) | |
| c36 | Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani: Computational Complexity of Traffic Hijacking under BGP and S-BGP. ICALP (2) 2012: 476-487 | |
| i1 | Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani: Computational Complexity of Traffic Hijacking under BGP and S-BGP. CoRR abs/1205.4564 (2012) | |
| 2011 | ||
| j18 | Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani: Finding a Minimum-depth Embedding of a Planar Graph in O(n4) Time. Algorithmica 60(4): 890-937 (2011) | |
| j17 | Vladimir Batagelj, Franz-Josef Brandenburg, Walter Didimo, Giuseppe Liotta, Pietro Palladino, Maurizio Patrignani: Visual Analysis of Large Graphs Using (X, Y)-Clustering and Hybrid Visualizations. IEEE Trans. Vis. Comput. Graph. 17(11): 1587-1598 (2011) | |
| 2010 | ||
| j16 | Ioannis G. Tollis, Maurizio Patrignani: Guest Editor's Foreword. J. Graph Algorithms Appl. 14(1): 3-4 (2010) | |
| c35 | Vladimir Batagelj, Walter Didimo, Giuseppe Liotta, Pietro Palladino, Maurizio Patrignani: Visual analysis of large graphs using (X, Y)-clustering and hybrid visualizations. PacificVis 2010: 209-216 | |
| c34 | Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: Monotone Drawings of Graphs. Graph Drawing 2010: 13-24 | |
| c33 | Luca Cittadini, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani, Massimo Rimondini: Assigning AS relationships to satisfy the Gao-Rexford conditions. ICNP 2010: 113-123 | |
| c32 | Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter: Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree. IWOCA 2010: 212-225 | |
| c31 | Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter: Testing Planarity of Partially Embedded Graphs. SODA 2010: 202-221 | |
| 2009 | ||
| j15 | Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia: On embedding a cycle in a plane graph. Discrete Mathematics 309(7): 1856-1869 (2009) | |
| j14 | Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. Theory Comput. Syst. 44(2): 143-159 (2009) | |
| c30 | Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani: Splitting Clusters to Get C-Planarity. Graph Drawing 2009: 57-68 | |
| c29 | Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig: Drawing Trees in a Streaming Model. Graph Drawing 2009: 292-303 | |
| c28 | Mario Cola, Giorgio De Lucia, Daria Mazza, Maurizio Patrignani, Massimo Rimondini: Covert Channel for One-Way Delay Measurements. ICCCN 2009: 1-6 | |
| e1 | Ioannis G. Tollis, Maurizio Patrignani (Eds.): Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers. Lecture Notes in Computer Science 5417, Springer 2009, isbn 978-3-642-00218-2 | |
| 2008 | ||
| j13 | Maurizio Patrignani: Complexity results for three-dimensional orthogonal graph drawing. J. Discrete Algorithms 6(1): 140-161 (2008) | |
| j12 | Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Maurizio Pizzonia: C-Planarity of C-Connected Clustered Graphs. J. Graph Algorithms Appl. 12(2): 225-262 (2008) | |
| c27 | Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani: Topological Morphing of Planar Graphs. Graph Drawing 2008: 145-156 | |
| c26 | Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: Non-convex Representations of Graphs. Graph Drawing 2008: 390-395 | |
| 2007 | ||
| j11 | Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia, Massimo Rimondini: Investigating prefix propagation through active BGP probing. Microprocessors and Microsystems 31(7): 460-474 (2007) | |
| j10 | Giuseppe Di Battista, Thomas Erlebach, Alexander Hall, Maurizio Patrignani, Maurizio Pizzonia, Thomas Schank: Computing the types of the relationships between autonomous systems. IEEE/ACM Trans. Netw. 15(2): 267-280 (2007) | |
| c25 | Melanie Badent, Carla Binucci, Emilio Di Giacomo, Walter Didimo, Stefan Felsner, Francesco Giordano, Jan Kratochvíl, Pietro Palladino, Maurizio Patrignani, Francesco Trotta: Homothetic Triangle Contact Representations of Planar Graphs. CCCG 2007: 233-236 | |
| c24 | Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani: On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. FUN 2007: 1-13 | |
| c23 | Fabrizio Frati, Maurizio Patrignani: A Note on Minimum-Area Straight-Line Drawings of Planar Graphs. Graph Drawing 2007: 339-344 | |
| c22 | Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani: Computing a Minimum-Depth Planar Graph Embedding in O ( n 4) Time. WADS 2007: 287-299 | |
| 2006 | ||
| j9 | Maurizio Patrignani: On Extending a Partial Straight-line Drawing. Int. J. Found. Comput. Sci. 17(5): 1061-1070 (2006) | |
| j8 | Pier Francesco Cortese, Giuseppe Di Battista, Antonello Moneta, Maurizio Patrignani, Maurizio Pizzonia: Topographic Visualization of Prefix Propagation in the Internet. IEEE Trans. Vis. Comput. Graph. 12(5): 725-732 (2006) | |
| c21 | Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Katharina Anna Lehmann, Giuseppe Liotta, Maurizio Patrignani, Ioannis G. Tollis, Francesco Trotta: On the Topologies of Local Minimum Spanning Trees. CAAN 2006: 31-44 | |
| c20 | Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia, Massimo Rimondini: Investigating Prefix Propagation through Active BGP Probing. ISCC 2006: 497-504 | |
| 2005 | ||
| j7 | Lorenzo Colitti, Giuseppe Di Battista, Federico Mariani, Maurizio Patrignani, Maurizio Pizzonia: Visualizing Interdomain Routing with BGPlay. J. Graph Algorithms Appl. 9(1): 117-148 (2005) | |
| j6 | Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia: Clustering Cycles into Cycles of Clusters. J. Graph Algorithms Appl. 9(3): 391-413 (2005) | |
| c19 | Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia: On Embedding a Cycle in a Plane Graph. Graph Drawing 2005: 49-60 | |
| c18 | Maurizio Patrignani: Complexity Results for Three-Dimensional Orthogonal Graph Drawing. Graph Drawing 2005: 368-379 | |
| c17 | ||
| 2004 | ||
| j5 | Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani: A note on 3D orthogonal drawings with direction constrained edges. Inf. Process. Lett. 90(2): 97-101 (2004) | |
| j4 | Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani: IPv6-in-IPv4 Tunnel Discovery: Methods and Experimental Results. IEEE Transactions on Network and Service Management 1(1): 30-38 (2004) | |
| c16 | Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia: Clustering Cycles into Cycles of Clusters. Graph Drawing 2004: 100-110 | |
| c15 | Maurizio Patrignani: A Note on the Self-similarity of Some Orthogonal Drawings. Graph Drawing 2004: 389-394 | |
| c14 | Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani: Discovering IPv6-in-IPv4 tunnels in the Internet. NOMS (1) 2004: 613-626 | |
| 2003 | ||
| c13 | John M. 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. Graph Drawing 2003: 25-36 | |
| c12 | Giuseppe Di Battista, Federico Mariani, Maurizio Patrignani, Maurizio Pizzonia: BGPlay: A System for Visualizing the Interdomain Routing Evolution. Graph Drawing 2003: 295-306 | |
| c11 | Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia: Computing the Types of the Relationships between Autonomous Systems. INFOCOM 2003 | |
| 2002 | ||
| j3 | Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia: Drawing database schemas. Softw., Pract. Exper. 32(11): 1065-1098 (2002) | |
| c10 | Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani: Orthogonal 3D Shapes of Theta Graphs. Graph Drawing 2002: 142-149 | |
| 2001 | ||
| j2 | ||
| c9 | Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia: Drawing Database Schemas with DBdraw. Graph Drawing 2001: 451-452 | |
| c8 | Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia: Industrial Plant Drawer. Graph Drawing 2001: 475-476 | |
| c7 | Maurizio Patrignani, Maurizio Pizzonia: The Complexity of the Matching-Cut Problem. WG 2001: 284-295 | |
| 2000 | ||
| j1 | Giuseppe Di Battista, Maurizio Patrignani, Francesco Vargiu: A Split & Push Approach to 3D Orthogonal Drawing. J. Graph Algorithms Appl. 4(3): 105-133 (2000) | |
| c6 | Neal Lesh, Joe Marks, Maurizio Patrignani: Interactive Partitioning (System Demonstration, Short). Graph Drawing 2000: 31-36 | |
| 1999 | ||
| c5 | Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia: Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size. Graph Drawing 1999: 297-310 | |
| c4 | Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia: Infinite Trees and the Future. Graph Drawing 1999: 379-391 | |
| c3 | ||
| 1998 | ||
| c2 | Giuseppe Di Battista, Maurizio Patrignani, Francesco Vargiu: A Split&Push Approach to 3D Orthogonal Drawing. Graph Drawing 1998: 87-101 | |
| 1997 | ||
| c1 | Maurizio Patrignani, Francesco Vargiu: 3DCube: A Tool for Three Dimensional Graph Drawing. Graph Drawing 1997: 284-290 | |
Data released under the ODC-BY 1.0 license — See also our legal information page