Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDMaurizio Patrignani
Person information
- affiliation: Roma Tre University, Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j46]Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
How to Morph a Tree on a Small Grid. Discret. Comput. Geom. 67(3): 743-786 (2022)- 2021
- [j45]Mariano Scazzariello
, Lorenzo Ariemma, Giuseppe Di Battista, Maurizio Patrignani:
Megalos: A Scalable Architecture for the Virtualization of Large Network Scenarios. Future Internet 13(9): 227 (2021) - [j44]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais:
Schematic Representation of Large Biconnected Graphs. J. Graph Algorithms Appl. 25(1): 311-352 (2021) - [j43]Alessio Conte, Donatella Firmani, Maurizio Patrignani, Riccardo Torlone:
A meta-algorithm for finding large k-plexes. Knowl. Inf. Syst. 63(7): 1745-1769 (2021) - [j42]Barbara Covella, Fabrizio Frati, Maurizio Patrignani:
On the area requirements of planar straight-line orthogonal drawings of ternary trees. Theor. Comput. Sci. 852: 197-211 (2021) - [c80]Carlos Alegría, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths. Graph Drawing 2021: 166-183 - [c79]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees. SODA 2021: 2779-2798 - [i31]Carlos Alegría, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Planar Straight-line Realizations of 2-Trees with Prescribed Edge Lengths. CoRR abs/2108.12628 (2021) - 2020
- [j41]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Upward Planar Morphs. Algorithmica 82(10): 2985-3017 (2020) - [j40]Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs. J. Comput. Syst. Sci. 107: 28-53 (2020) - [j39]Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Graph Stories in Small Area. J. Graph Algorithms Appl. 24(3): 269-292 (2020) - [j38]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Beyond level planarity: Cyclic, torus, and simultaneous level planarity. Theor. Comput. Sci. 804: 161-170 (2020) - [j37]Tiziana Calamoneri, Valentino Di Donato, Diego Mariottini, Maurizio Patrignani:
Visualizing co-phylogenetic reconciliations. Theor. Comput. Sci. 815: 228-245 (2020) - [c78]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais:
Schematic Representation of Biconnected Graphs. Graph Drawing 2020: 160-172 - [c77]Emanuele Balloni, Giuseppe Di Battista, Maurizio Patrignani:
A Tipping Point for the Planarity of Small and Medium Sized Graphs. Graph Drawing 2020: 181-188 - [c76]Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter:
On Turn-Regular Orthogonal Representations. Graph Drawing 2020: 250-264 - [c75]Mariano Scazzariello, Lorenzo Ariemma, Giuseppe Di Battista, Maurizio Patrignani:
Megalos: A Scalable Architecture for the Virtualization of Network Scenarios. NOMS 2020: 1-7 - [c74]Walter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani:
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time. SODA 2020: 806-825 - [i30]Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter:
On Turn-Regular Orthogonal Representations. CoRR abs/2008.09002 (2020) - [i29]Emanuele Balloni, Giuseppe Di Battista, Maurizio Patrignani:
A Tipping Point for the Planarity of Small and Medium Sized Graphs. CoRR abs/2008.09405 (2020) - [i28]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais:
Schematic Representation of Large Biconnected Graphs. CoRR abs/2008.09414 (2020) - [i27]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees. CoRR abs/2011.02431 (2020)
2010 – 2019
- 2019
- [j36]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Ignaz Rutter, Alessandra Tappini:
NodeTrix Planarity Testing with Small Clusters. Algorithmica 81(9): 3464-3493 (2019) - [j35]Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
HV-planarity: Algorithms and complexity. J. Comput. Syst. Sci. 99: 72-90 (2019) - [c73]Alessio Conte, Donatella Firmani, Maurizio Patrignani, Riccardo Torlone:
Shared-Nothing Distributed Enumeration of 2-Plexes. CIKM 2019: 2469-2472 - [c72]Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani:
Upward Book Embeddings of st-Graphs. SoCG 2019: 13:1-13:22 - [c71]Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani:
The QuaSEFE Problem. Graph Drawing 2019: 268-275 - [c70]Manuel Borrazzo, Giordano Da Lozzo, Fabrizio Frati, Maurizio Patrignani:
Graph Stories in Small Area. Graph Drawing 2019: 545-558 - [c69]Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
How to Morph a Tree on a Small Grid. WADS 2019: 57-70 - [i26]Barbara Covella, Fabrizio Frati, Maurizio Patrignani:
On the Area Requirements of Planar Straight-Line Orthogonal Drawings of Ternary Trees. CoRR abs/1902.11044 (2019) - [i25]Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani:
Upward Book Embeddings of st-Graphs. CoRR abs/1903.07966 (2019) - [i24]Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani:
The QuaSEFE Problem. CoRR abs/1908.08708 (2019) - [i23]Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Graph Stories in Small Area. CoRR abs/1908.09318 (2019) - [i22]Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
How to Morph a Tree on a Small Grid. CoRR abs/1909.07093 (2019) - [i21]Walter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani:
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time. CoRR abs/1910.11782 (2019) - 2018
- [j34]Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis:
Algorithms and Bounds for L-Drawings of Directed Graphs. Int. J. Found. Comput. Sci. 29(4): 461-480 (2018) - [j33]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Computing NodeTrix Representations of Clustered Graphs. J. Graph Algorithms Appl. 22(2): 139-176 (2018) - [c68]Pier Francesco Cortese, Maurizio Patrignani:
Clustered Planarity = Flat Clustered Planarity. Graph Drawing 2018: 23-38 - [c67]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Upward Planar Morphs. Graph Drawing 2018: 92-105 - [c66]Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
Bend-Minimum Orthogonal Drawings in Quadratic Time. Graph Drawing 2018: 481-494 - [c65]Valentino Di Donato, Maurizio Patrignani, Claudio Squarcella:
Exploring Flow Metrics in Dense Geographical Networks. VISIGRAPP (3: IVAPP) 2018: 52-61 - [c64]Barbara Covella, Fabrizio Frati, Maurizio Patrignani:
On the Area Requirements of Straight-Line Orthogonal Drawings of Ternary Trees. IWOCA 2018: 128-140 - [c63]Alessio Conte, Donatella Firmani, Caterina Mordente, Maurizio Patrignani, Riccardo Torlone:
Cliques are Too Strict for Representing Communities: Finding Large k-plexes in Real Networks. SEBD 2018 - [i20]Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
Efficient Algorithms for Bend-minimum Orthogonal Drawings of Planar 3-Graphs. CoRR abs/1804.05813 (2018) - [i19]Pier Francesco Cortese, Maurizio Patrignani:
Clustered Planarity = Flat Clustered Planarity. CoRR abs/1808.07437 (2018) - [i18]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Upward Planar Morphs. CoRR abs/1808.10826 (2018) - 2017
- [j32]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. J. Graph Algorithms Appl. 21(4): 731-755 (2017) - [j31]Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
How to Morph Planar Graph Drawings. SIAM J. Comput. 46(2): 824-852 (2017) - [c62]Alessandro Baroni, Alessio Conte, Maurizio Patrignani, Salvatore Ruggieri:
Efficiently Clustering Very Large Attributed Graphs. ASONAM 2017: 369-376 - [c61]Tiziana Calamoneri, Valentino Di Donato, Diego Mariottini, Maurizio Patrignani:
Visualizing Co-phylogenetic Reconciliations. Graph Drawing 2017: 334-347 - [c60]Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff:
Planar L-Drawings of Directed Graphs. Graph Drawing 2017: 465-478 - [c59]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Alessandra Tappini:
NodeTrix Planarity Testing with Small Clusters. Graph Drawing 2017: 479-491 - [c58]Alessio Conte, Donatella Firmani, Caterina Mordente, Maurizio Patrignani, Riccardo Torlone:
Fast Enumeration of Large k-Plexes. KDD 2017: 115-124 - [c57]Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings of Outerplanar Graphs. SODA 2017: 1980-1999 - [i17]Alessandro Baroni, Alessio Conte, Maurizio Patrignani, Salvatore Ruggieri:
Efficiently Clustering Very Large Attributed Graphs. CoRR abs/1703.08590 (2017) - [i16]Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff:
Planar L-Drawings of Directed Graphs. CoRR abs/1708.09107 (2017) - [i15]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Alessandra Tappini:
NodeTrix Planarity Testing with Small Clusters. CoRR abs/1708.09281 (2017) - [i14]Tiziana Calamoneri, Valentino Di Donato, Diego Mariottini, Maurizio Patrignani:
Visualizing Co-Phylogenetic Reconciliations. CoRR abs/1708.09691 (2017) - 2016
- [c56]Valentino Di Donato, Maurizio Patrignani, Claudio Squarcella:
NetFork: Mapping Time to Space in Network Visualization. AVI 2016: 92-99 - [c55]Alessio Conte, Roberto De Virgilio, Antonio Maccioni, Maurizio Patrignani, Riccardo Torlone:
Finding All Maximal Cliques in Very Large Social Networks. EDBT 2016: 173-184 - [c54]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Computing NodeTrix Representations of Clustered Graphs. Graph Drawing 2016: 107-120 - [c53]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Beyond Level Planarity. Graph Drawing 2016: 482-495 - [c52]Davide Ceneda, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Maurizio Pizzonia, Massimo Rimondini:
RoutingWatch: Visual exploration and analysis of routing events. NOMS 2016: 591-597 - [c51]Alessio Conte, Roberto De Virgilio, Antonio Maccioni, Maurizio Patrignani, Riccardo Torlone:
Community Detection in Social Networks: Breaking the Taboos. SEBD 2016: 118-125 - [c50]Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis:
L-Drawings of Directed Graphs. SOFSEM 2016: 134-147 - [r2]Maurizio Patrignani:
Bend Minimization for Orthogonal Drawings of Plane Graphs. Encyclopedia of Algorithms 2016: 177-181 - [i13]Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
How to morph planar graph drawings. CoRR abs/1606.00425 (2016) - [i12]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Computing NodeTrix Representations of Clustered Graphs. CoRR abs/1608.08952 (2016) - [i11]Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings of Outerplanar Graphs. CoRR abs/1610.02841 (2016) - 2015
- [j30]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Relaxing the constraints of clustered planarity. Comput. Geom. 48(2): 42-75 (2015) - [j29]Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs. Comput. Geom. 50: 34-48 (2015) - [j28]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter:
Testing Planarity of Partially Embedded Graphs. ACM Trans. Algorithms 11(4): 32:1-32:42 (2015) - [j27]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Antonios Symvonis, Ioannis G. Tollis:
Fan-planarity: Properties and complexity. Theor. Comput. Sci. 589: 76-86 (2015) - [j26]Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani:
Computational complexity of traffic hijacking under BGP and S-BGP. Theor. Comput. Sci. 600: 143-154 (2015) - [c49]Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli:
Optimal Morphs of Convex Drawings. SoCG 2015: 126-140 - [c48]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. Graph Drawing 2015: 217-230 - [c47]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
On the Relationship Between Map Graphs and Clique Planar Graphs. Graph Drawing 2015: 548-550 - [c46]Giordano Da Lozzo, Marco Di Bartolomeo, Maurizio Patrignani, Giuseppe Di Battista, Davide Cannone, Sergio Tortora:
Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data. IVAPP 2015: 109-116 - [c45]Giuseppe Di Battista, Valentino Di Donato, Maurizio Patrignani, Maurizio Pizzonia, Vincenzo Roselli, Roberto Tamassia:
Bitconeview: visualization of flows in the bitcoin transaction graph. VizSEC 2015: 1-8 - [i10]Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli:
Optimal Morphs of Convex Drawings. CoRR abs/1503.09021 (2015) - [i9]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. CoRR abs/1508.07557 (2015) - [i8]Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis:
L-Drawings of Directed Graphs. CoRR abs/1509.00684 (2015) - [i7]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Testing Cyclic Level and Simultaneous Level Planarity. CoRR abs/1510.08274 (2015) - 2014
- [j25]Carla Binucci, Walter Didimo, Maurizio Patrignani:
Upward and quasi-upward planarity testing of embedded mixed graphs. Theor. Comput. Sci. 526: 75-89 (2014) - [c44]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Fan-Planar Graphs: Combinatorial Properties and Complexity Results. Graph Drawing 2014: 186-197 - [c43]Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
On the Complexity of HV-rectilinear Planarity Testing. Graph Drawing 2014: 343-354 - [c42]Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Giuseppe Di Battista, Seok-Hee Hong, Maurizio Patrignani, Vincenzo Roselli:
Anchored Drawings of Planar Graphs. Graph Drawing 2014: 404-415 - [c41]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graph Drawings Optimally. ICALP (1) 2014: 126-137 - [i6]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graph Drawings Optimally. CoRR abs/1402.4364 (2014) - [i5]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Properties and Complexity of Fan-Planarity. CoRR abs/1406.5299 (2014) - 2013
- [j24]Walter Didimo, Maurizio Patrignani:
Guest Editors' Foreword. J. Graph Algorithms Appl. 17(4): 363-365 (2013) - [j23]Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani:
Topological morphing of planar graphs. Theor. Comput. Sci. 514: 2-20 (2013) - [c40]Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graph Drawings Efficiently. Graph Drawing 2013: 49-60 - [c39]Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Drawing Non-Planar Graphs with Crossing-Free Subgraphs. Graph Drawing 2013: 292-303 - [c38]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:
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 [contents] - [r1]Maurizio Patrignani:
Planarity Testing and Embedding. Handbook of Graph Drawing and Visualization 2013: 1-42 - [i4]Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graphs Drawings Efficiently. CoRR abs/1308.4291 (2013) - [i3]Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Drawings of Non-planar Graphs with Crossing-free Subgraphs. CoRR abs/1308.6706 (2013) - 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. Discret. Math. 26(4): 1670-1681 (2012) - [c37]Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani:
Computational Complexity of Traffic Hijacking under BGP and S-BGP. ICALP (2) 2012: 476-487 - [i2]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) - [c36]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 - [c35]Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Monotone Drawings of Graphs. Graph Drawing 2010: 13-24 - [c34]Luca Cittadini, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani, Massimo Rimondini:
Assigning AS relationships to satisfy the Gao-Rexford conditions. ICNP 2010: 113-123 - [c33]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 - [c32]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
2000 – 2009
- 2009
- [j15]Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia:
On embedding a cycle in a plane graph. Discret. Math. 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) - [c31]Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani:
Splitting Clusters to Get C-Planarity. Graph Drawing 2009: 57-68 - [c30]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 - [c29]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:
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 [contents] - 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) - [c28]Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani:
Topological Morphing of Planar Graphs. Graph Drawing 2008: 145-156 - [c27]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Non-convex Representations of Graphs. Graph Drawing 2008: 390-395 - [i1]