Rectilinear-upward planarity testing of digraphs.

Maurizio Patrignani Roma Tre University, Rome, Italy http://www.dia.uniroma3.it/~patrigna/ https://scholar.google.com/citations?user=m__6yMwAAAAJ https://orcid.org/0000-0001-9806-7411 https://www.wikidata.org/entity/Q62053750 https://mathgenealogy.org/id.php?id=219657

Walter Didimo Michael Kaufmann 0001 Giuseppe Liotta Giacomo Ortali Maurizio Patrignani Rectilinear-upward planarity testing of digraphs. 2026 103775 158 J. Comput. Syst. Sci. https://doi.org/10.1016/j.jcss.2026.103775 db/journals/jcss/jcss158.html#DidimoKLOP26 streams/journals/jcss

Marco D'Elia Irene Finocchi Maurizio Patrignani Engineering Algorithms for ℓ-Isolated Maximal Clique Enumeration. WALCOM 2026 545-559 conf/walcom/2026 https://doi.org/10.1007/978-981-95-7127-7_36 db/conf/walcom/walcom2026.html#DEliaFP26 streams/conf/walcom

Marco D'Elia Irene Finocchi Maurizio Patrignani High-Modularity Graph Partitioning Through NLP Techniques and Maximal Clique Enumeration. 2026 February abs/2602.23948 CoRR https://doi.org/10.48550/arXiv.2602.23948 db/journals/corr/corr2602.html#abs-2602-23948 streams/journals/corr

Carlos Alegría-Galicia Susanna Caroppo Giordano Da Lozzo Marco D'Elia Giuseppe Di Battista Fabrizio Frati Fabrizio Grosso Maurizio Patrignani Upward Pointset Embeddings of Planar st-Graphs. 930-960 2025 June 87 Algorithmica 6 https://doi.org/10.1007/s00453-025-01302-2 db/journals/algorithmica/algorithmica87.html#AlegriaGaliciaCLDBFGP25 streams/journals/algorithmica

Maurizio Patrignani Giordano Dionisi Blerina Sinaimeri Tiziana Calamoneri VIRI: a visualization tool for tree reconciliations. 241 2025 December 26 BMC Bioinform. 1 https://doi.org/10.1186/s12859-025-06258-2 db/journals/bmcbi/bmcbi26.html#PatrignaniDSC25 streams/journals/bmcbi

Marco D'Elia Irene Finocchi Maurizio Patrignani Maximal cliques summarization: Principles, problem classification, and algorithmic approaches. 100784 2025 58 Comput. Sci. Rev. https://doi.org/10.1016/j.cosrev.2025.100784 db/journals/csr/csr58.html#DEliaFP25 streams/journals/csr

Patrizio Angelini Therese Biedl Markus Chimani Sabine Cornelsen Giordano Da Lozzo Seok-Hee Hong 0001 Giuseppe Liotta Maurizio Patrignani Sergey Pupyrev Ignaz Rutter The Price of Upwardness. 2025 27 Discret. Math. Theor. Comput. Sci. 3 https://doi.org/10.46298/dmtcs.15222 db/journals/dmtcs/dmtcs27.html#AngeliniBCCLHLPPR25 streams/journals/dmtcs

Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Fabrizio Grosso Maurizio Patrignani Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs. 49-102 2025 29 J. Graph Algorithms Appl. 2 https://doi.org/10.7155/jgaa.v29i2.3040 db/journals/jgaa/jgaa29.html#LozzoBFGP25 streams/journals/jgaa

Annika Bonerath Claus-Christian Carbon Silvia Miksch Maurizio Patrignani Alessandra Tappini Time-Dependent Route Planning on Maps: A User Study. 1-12 2025 8 J. Percept. Imaging 0 https://doi.org/10.2352/j.percept.imaging.2025.8.000401 db/journals/jpi/jpi8.html#BonerathCMPT25 streams/journals/jpi

Giuseppe Di Battista Giuseppe Liotta Maurizio Patrignani Antonios Symvonis Ioannis G. Tollis Tangling and Untangling Trees on Point-Sets. 8:1-8:18 2025 GD https://doi.org/10.4230/LIPIcs.GD.2025.8 conf/gd/2025 db/conf/gd/gd2025.html#BattistaLPST25 Carla Binucci Sabine Cornelsen Walter Didimo Seok-Hee Hong 0001 Eleni Katsanou Maurizio Patrignani Antonios Symvonis Samuel Wolf Planar Stories of Graph Drawings: Algorithms and Experiments. 32:1-32:19 2025 GD https://doi.org/10.4230/LIPIcs.GD.2025.32 conf/gd/2025 db/conf/gd/gd2025.html#BinucciCD0KPSW25 Giordano Andreola Susanna Caroppo Giuseppe Di Battista Fabrizio Grosso Maurizio Patrignani Allegra Strippoli A Walk on the Wild Side: A Shape-First Methodology for Orthogonal Drawings. 35:1-35:20 2025 GD https://doi.org/10.4230/LIPIcs.GD.2025.35 conf/gd/2025 db/conf/gd/gd2025.html#AndreolaCBGPS25 Giuseppe Di Battista Fabrizio Grosso Giulia Maragno Maurizio Patrignani Ranking and Unranking of the Planar Embeddings of a Planar Graph. 143-159 2025 WALCOM https://doi.org/10.1007/978-981-96-2845-2_10 conf/walcom/2025 db/conf/walcom/walcom2025.html#BattistaGMP25 streams/conf/walcom

Walter Didimo Giuseppe Liotta Giacomo Ortali Maurizio Patrignani Optimal Orthogonal Drawings in Linear Time. 2025 February abs/2502.03309 CoRR https://doi.org/10.48550/arXiv.2502.03309 db/journals/corr/corr2502.html#abs-2502-03309 streams/journals/corr

Carla Binucci Sabine Cornelsen Walter Didimo Seok-Hee Hong 0001 Eleni Katsanou Maurizio Patrignani Antonios Symvonis Samuel Wolf Planar Stories of Graph Drawings: Algorithms and Experiments. 2025 August abs/2508.17532 CoRR https://doi.org/10.48550/arXiv.2508.17532 db/journals/corr/corr2508.html#abs-2508-17532 streams/journals/corr

Giuseppe Di Battista Giuseppe Liotta Maurizio Patrignani Antonios Symvonis Ioannis G. Tollis Tangling and Untangling Trees on Point-sets. 2025 August abs/2508.18535 CoRR https://doi.org/10.48550/arXiv.2508.18535 db/journals/corr/corr2508.html#abs-2508-18535 streams/journals/corr

Giordano Andreola Susanna Caroppo Giuseppe Di Battista Fabrizio Grosso Maurizio Patrignani Allegra Strippoli A Walk on the Wild Side: a Shape-First Methodology for Orthogonal Drawings. 2025 August abs/2508.19416 CoRR https://doi.org/10.48550/arXiv.2508.19416 db/journals/corr/corr2508.html#abs-2508-19416 streams/journals/corr

Marco D'Elia Irene Finocchi Maurizio Patrignani Engineering Algorithms for ℓ-Isolated Maximal Clique Enumeration. 2025 November abs/2511.03525 CoRR https://doi.org/10.48550/arXiv.2511.03525 db/journals/corr/corr2511.html#abs-2511-03525 streams/journals/corr

Carlos Alegría Manuel Borrazzo Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Testing the planar straight-line realizability of 2-trees with prescribed edge lengths. 103806 2024 119 Eur. J. Comb. https://doi.org/10.1016/j.ejc.2023.103806 db/journals/ejc/ejc119.html#AlegriaBLBFP24 streams/journals/ejc

Carlos Alegría Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Fabrizio Grosso Maurizio Patrignani Unit-length Rectangular Drawings of Graphs. 403-437 2024 28 J. Graph Algorithms Appl. 1 https://doi.org/10.7155/jgaa.v28i1.2996 db/journals/jgaa/jgaa28.html#AlegriaLBFGP24 streams/journals/jgaa

Patrizio Angelini Therese Biedl Markus Chimani Sabine Cornelsen Giordano Da Lozzo Seok-Hee Hong 0001 Giuseppe Liotta Maurizio Patrignani Sergey Pupyrev Ignaz Rutter Alexander Wolff 0001 The Price of Upwardness. 13:1-13:20 2024 GD https://doi.org/10.4230/LIPIcs.GD.2024.13 conf/gd/2024 db/conf/gd/gd2024.html#AngeliniBCCL0LP24 Carlos Alegría Susanna Caroppo Giordano Da Lozzo Marco D'Elia Giuseppe Di Battista Fabrizio Frati Fabrizio Grosso Maurizio Patrignani Upward Pointset Embeddings of Planar st-Graphs. 24:1-24:18 2024 GD https://doi.org/10.4230/LIPIcs.GD.2024.24 conf/gd/2024 db/conf/gd/gd2024.html#AlegriaCLDBFGP24 Giordano Da Lozzo Walter Didimo Fabrizio Montecchiani Miriam Münch Maurizio Patrignani Ignaz Rutter Simple Realizability of Abstract Topological Graphs. 23:1-23:15 2024 ISAAC https://doi.org/10.4230/LIPIcs.ISAAC.2024.23 conf/isaac/2024 db/conf/isaac/isaac2024.html#LozzoDMMPR24 Giuseppe Di Battista Fabrizio Grosso Silvia Montorselli Maurizio Patrignani Treebar Maps: Schematic Representation of Networks at Scale. 132-141 2024 PacificVis https://doi.org/10.1109/PacificVis60374.2024.00023 conf/pacificvis/2024 db/conf/pacificvis/pacificvis2024.html#BattistaGMP24 Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Fabrizio Grosso Maurizio Patrignani Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs. 350-364 2024 WALCOM https://doi.org/10.1007/978-981-97-0566-5_25 conf/walcom/2024 db/conf/walcom/walcom2024.html#LozzoBFGP24

Carlos Alegría Susanna Caroppo Giordano Da Lozzo Marco D'Elia Giuseppe Di Battista Fabrizio Frati Fabrizio Grosso Maurizio Patrignani Upward Pointset Embeddings of Planar st-Graphs. 2024 abs/2408.17369 CoRR https://doi.org/10.48550/arXiv.2408.17369 db/journals/corr/corr2408.html#abs-2408-17369 streams/journals/corr

Patrizio Angelini Therese Biedl Markus Chimani Sabine Cornelsen Giordano Da Lozzo Seok-Hee Hong 0001 Giuseppe Liotta Maurizio Patrignani Sergey Pupyrev Ignaz Rutter Alexander Wolff 0001 The Price of Upwardness. 2024 abs/2409.01475 CoRR https://doi.org/10.48550/arXiv.2409.01475 db/journals/corr/corr2409.html#abs-2409-01475 streams/journals/corr

Giordano Da Lozzo Walter Didimo Fabrizio Montecchiani Miriam Münch Maurizio Patrignani Ignaz Rutter Simple Realizability of Abstract Topological Graphs. 2024 abs/2409.20108 CoRR https://doi.org/10.48550/arXiv.2409.20108 db/journals/corr/corr2409.html#abs-2409-20108 streams/journals/corr

Giuseppe Di Battista Fabrizio Grosso Giulia Maragno Maurizio Patrignani Ranking and Unranking of the Planar Embeddings of a Planar Graph. 2024 abs/2411.10319 CoRR https://doi.org/10.48550/arXiv.2411.10319 db/journals/corr/corr2411.html#abs-2411-10319 streams/journals/corr

Carla Binucci Giordano Da Lozzo Emilio Di Giacomo Walter Didimo Tamara Mchedlidze Maurizio Patrignani Upward Book Embeddability of st-Graphs: Complexity and Algorithms. 3521-3571 2023 December 85 Algorithmica 12 https://doi.org/10.1007/s00453-023-01142-y db/journals/algorithmica/algorithmica85.html#BinucciLGDMP23

Steven Chaplick Markus Chimani Sabine Cornelsen Giordano Da Lozzo Martin Nöllenburg Maurizio Patrignani Ioannis G. Tollis Alexander Wolff 0001 Planar L-Drawings of Directed Graphs. 7 2023 2 Comput. Geom. Topol. 1 https://doi.org/10.57717/cgt.v2i1.43 db/journals/cgt/cgt2.html#ChaplickCCLNPT023

Carla Binucci Walter Didimo Maurizio Patrignani st-Orientations with Few Transitive Edges. 625-650 2023 27 J. Graph Algorithms Appl. 8 https://doi.org/10.7155/jgaa.00638 db/journals/jgaa/jgaa27.html#BinucciDP23

Giuseppe Di Battista Walter Didimo Luca Grilli 0001 Fabrizio Grosso Giacomo Ortali Maurizio Patrignani Alessandra Tappini Small Point-Sets Supporting Graph Stories. 651-677 2023 27 J. Graph Algorithms Appl. 8 https://doi.org/10.7155/jgaa.00639 db/journals/jgaa/jgaa27.html#BattistaDGGOPT23

Marco D'Elia Irene Finocchi Maurizio Patrignani Clique-TF-IDF: A New Partitioning Framework Based on Dense Substructures. 396-410 2023 AI*IA https://doi.org/10.1007/978-3-031-47546-7_27 conf/aiia/2023 db/conf/aiia/aiia2023.html#DEliaFP23 Walter Didimo Michael Kaufmann 0001 Giuseppe Liotta Giacomo Ortali Maurizio Patrignani Rectilinear-Upward Planarity Testing of Digraphs. 26:1-26:20 2023 ISAAC https://doi.org/10.4230/LIPIcs.ISAAC.2023.26 conf/isaac/2023 db/conf/isaac/isaac2023.html#Didimo0LOP23 Tommaso Caiazzi Mariano Scazzariello Samuele Quinzi Lorenzo Ariemma Maurizio Patrignani Giuseppe Di Battista Nesting Containers for Faithful Datacenters Emulations. 1-4 2023 NOMS https://doi.org/10.1109/NOMS56928.2023.10154391 conf/noms/2023 db/conf/noms/noms2023.html#CaiazziSQAPB23

Giuseppe Di Battista Fabrizio Grosso Silvia Montorselli Maurizio Patrignani Treebar Maps: Schematic Representation of Networks at Scale. 2023 abs/2307.12393 CoRR https://doi.org/10.48550/arXiv.2307.12393 db/journals/corr/corr2307.html#abs-2307-12393

Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Fabrizio Grosso Maurizio Patrignani Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs. 2023 abs/2310.02247 CoRR https://doi.org/10.48550/arXiv.2310.02247 db/journals/corr/corr2310.html#abs-2310-02247

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. 743-786 2022 67 Discret. Comput. Geom. 3 https://doi.org/10.1007/s00454-021-00363-8 db/journals/dcg/dcg67.html#Barrera-CruzBLB22

Michael A. Bekos Carla Binucci Giuseppe Di Battista Walter Didimo Martin Gronemann Karsten Klein 0001 Maurizio Patrignani Ignaz Rutter On Turn-Regular Orthogonal Representations. 285-306 2022 26 J. Graph Algorithms Appl. 3 https://doi.org/10.7155/jgaa.00595 db/journals/jgaa/jgaa26.html#BekosBBDGKPR22

Carlos Alegría Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Fabrizio Grosso Maurizio Patrignani Unit-length Rectangular Drawings of Graphs. 127-143 2022 GD https://doi.org/10.1007/978-3-031-22203-0_10 conf/gd/2022 db/conf/gd/gd2022.html#AlegriaLBFGP22 Carla Binucci Walter Didimo Maurizio Patrignani st-Orientations with Few Transitive Edges. 201-216 2022 GD https://doi.org/10.1007/978-3-031-22203-0_15 conf/gd/2022 db/conf/gd/gd2022.html#BinucciDP22 Giuseppe Di Battista Walter Didimo Luca Grilli 0001 Fabrizio Grosso Giacomo Ortali Maurizio Patrignani Alessandra Tappini Small Point-Sets Supporting Graph Stories. 289-303 2022 GD https://doi.org/10.1007/978-3-031-22203-0_21 conf/gd/2022 db/conf/gd/gd2022.html#BattistaDGGOPT22

Carla Binucci Walter Didimo Maurizio Patrignani st-Orientations with Few Transitive Edges. 2022 abs/2208.11414 CoRR https://doi.org/10.48550/arXiv.2208.11414 db/journals/corr/corr2208.html#abs-2208-11414

Giuseppe Di Battista Walter Didimo Luca Grilli 0001 Fabrizio Grosso Giacomo Ortali Maurizio Patrignani Alessandra Tappini Small Point-Sets Supporting Graph Stories. 2022 abs/2208.14126 CoRR https://doi.org/10.48550/arXiv.2208.14126 db/journals/corr/corr2208.html#abs-2208-14126

Carlos Alegría Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Fabrizio Grosso Maurizio Patrignani Unit-length Rectangular Drawings of Graphs. 2022 abs/2208.14142 CoRR https://doi.org/10.48550/arXiv.2208.14142 db/journals/corr/corr2208.html#abs-2208-14142

Mariano Scazzariello Lorenzo Ariemma Giuseppe Di Battista Maurizio Patrignani Megalos: A Scalable Architecture for the Virtualization of Large Network Scenarios. 227 2021 13 Future Internet 9 https://doi.org/10.3390/fi13090227 db/journals/fi/fi13.html#ScazzarielloABP21

Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Marco Tais Schematic Representation of Large Biconnected Graphs. 311-352 2021 25 J. Graph Algorithms Appl. 1 https://doi.org/10.7155/jgaa.00560 db/journals/jgaa/jgaa25.html#BattistaFPT21

Alessio Conte Donatella Firmani Maurizio Patrignani Riccardo Torlone A meta-algorithm for finding large k-plexes. 1745-1769 2021 63 Knowl. Inf. Syst. 7 https://doi.org/10.1007/s10115-021-01570-8 https://www.wikidata.org/entity/Q124799424 db/journals/kais/kais63.html#ConteFPT21

Barbara Covella Fabrizio Frati Maurizio Patrignani On the area requirements of planar straight-line orthogonal drawings of ternary trees. 197-211 2021 852 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2020.11.032 db/journals/tcs/tcs852.html#CovellaFP21

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. 166-183 2021 GD https://doi.org/10.1007/978-3-030-92931-2_12 conf/gd/2021 db/conf/gd/gd2021.html#AlegriaBLBFP21 Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani 2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees. 2779-2798 2021 SODA https://doi.org/10.1137/1.9781611976465.165 conf/soda/2021 db/conf/soda/soda2021.html#AngeliniLBFP21

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. 2021 abs/2108.12628 CoRR https://arxiv.org/abs/2108.12628 db/journals/corr/corr2108.html#abs-2108-12628

Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Vincenzo Roselli Upward Planar Morphs. 2985-3017 2020 82 Algorithmica 10 https://doi.org/10.1007/s00453-020-00714-6 db/journals/algorithmica/algorithmica82.html#LozzoBFPR20

Fabrizio Frati Maurizio Patrignani Vincenzo Roselli LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs. 28-53 2020 107 J. Comput. Syst. Sci. https://doi.org/10.1016/j.jcss.2019.08.001 https://www.wikidata.org/entity/Q127405722 db/journals/jcss/jcss107.html#FratiPR20

Manuel Borrazzo Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Graph Stories in Small Area. 269-292 2020 24 J. Graph Algorithms Appl. 3 https://doi.org/10.7155/jgaa.00530 db/journals/jgaa/jgaa24.html#BorrazzoLBFP20

Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Ignaz Rutter Beyond level planarity: Cyclic, torus, and simultaneous level planarity. 161-170 2020 804 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2019.11.024 db/journals/tcs/tcs804.html#AngeliniLBFPR20

Tiziana Calamoneri Valentino Di Donato Diego Mariottini Maurizio Patrignani Visualizing co-phylogenetic reconciliations. 228-245 2020 815 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2019.12.024 https://www.wikidata.org/entity/Q126328255 db/journals/tcs/tcs815.html#CalamoneriDMP20

Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Marco Tais Schematic Representation of Biconnected Graphs. 160-172 2020 GD https://doi.org/10.1007/978-3-030-68766-3_13 conf/gd/2020 db/conf/gd/gd2020.html#BattistaFPT20 Emanuele Balloni Giuseppe Di Battista Maurizio Patrignani A Tipping Point for the Planarity of Small and Medium Sized Graphs. 181-188 2020 GD https://doi.org/10.1007/978-3-030-68766-3_15 conf/gd/2020 db/conf/gd/gd2020.html#BalloniBP20 Michael A. Bekos Carla Binucci Giuseppe Di Battista Walter Didimo Martin Gronemann Karsten Klein 0001 Maurizio Patrignani Ignaz Rutter On Turn-Regular Orthogonal Representations. 250-264 2020 GD https://doi.org/10.1007/978-3-030-68766-3_20 conf/gd/2020 db/conf/gd/gd2020.html#BekosBBDG0PR20 Mariano Scazzariello Lorenzo Ariemma Giuseppe Di Battista Maurizio Patrignani Megalos: A Scalable Architecture for the Virtualization of Network Scenarios. 1-7 2020 NOMS https://doi.org/10.1109/NOMS47738.2020.9110288 conf/noms/2020 db/conf/noms/noms2020.html#ScazzarielloABP20 Walter Didimo Giuseppe Liotta Giacomo Ortali Maurizio Patrignani Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time. 806-825 2020 SODA https://doi.org/10.1137/1.9781611975994.49 conf/soda/2020 db/conf/soda/soda2020.html#DidimoLOP20

Michael A. Bekos Carla Binucci Giuseppe Di Battista Walter Didimo Martin Gronemann Karsten Klein 0001 Maurizio Patrignani Ignaz Rutter On Turn-Regular Orthogonal Representations. 2020 abs/2008.09002 CoRR https://arxiv.org/abs/2008.09002 db/journals/corr/corr2008.html#abs-2008-09002

Emanuele Balloni Giuseppe Di Battista Maurizio Patrignani A Tipping Point for the Planarity of Small and Medium Sized Graphs. 2020 abs/2008.09405 CoRR https://arxiv.org/abs/2008.09405 db/journals/corr/corr2008.html#abs-2008-09405

Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Marco Tais Schematic Representation of Large Biconnected Graphs. 2020 abs/2008.09414 CoRR https://arxiv.org/abs/2008.09414 db/journals/corr/corr2008.html#abs-2008-09414

Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani 2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees. 2020 abs/2011.02431 CoRR https://arxiv.org/abs/2011.02431 db/journals/corr/corr2011.html#abs-2011-02431

Emilio Di Giacomo Giuseppe Liotta Maurizio Patrignani Ignaz Rutter Alessandra Tappini NodeTrix Planarity Testing with Small Clusters. 3464-3493 2019 81 Algorithmica 9 https://doi.org/10.1007/s00453-019-00585-6 db/journals/algorithmica/algorithmica81.html#GiacomoLPRT19

Walter Didimo Giuseppe Liotta Maurizio Patrignani HV-planarity: Algorithms and complexity. 72-90 2019 99 J. Comput. Syst. Sci. https://doi.org/10.1016/j.jcss.2018.08.003 https://www.wikidata.org/entity/Q62042358 db/journals/jcss/jcss99.html#DidimoLP19

Alessio Conte Donatella Firmani Maurizio Patrignani Riccardo Torlone Shared-Nothing Distributed Enumeration of 2-Plexes. 2469-2472 2019 CIKM https://doi.org/10.1145/3357384.3358083 https://www.wikidata.org/entity/Q130885940 conf/cikm/2019 db/conf/cikm/cikm2019.html#ConteFPT19 Carla Binucci Giordano Da Lozzo Emilio Di Giacomo Walter Didimo Tamara Mchedlidze Maurizio Patrignani Upward Book Embeddings of st-Graphs. 13:1-13:22 2019 SoCG https://doi.org/10.4230/LIPIcs.SoCG.2019.13 conf/compgeom/2019 db/conf/compgeom/compgeom2019.html#BinucciLGDMP19 Patrizio Angelini Henry Förster Michael Hoffmann 0001 Michael Kaufmann 0001 Stephen G. Kobourov Giuseppe Liotta Maurizio Patrignani The QuaSEFE Problem. 268-275 2019 GD https://doi.org/10.1007/978-3-030-35802-0_21 conf/gd/2019 db/conf/gd/gd2019.html#AngeliniF00KLP19 Manuel Borrazzo Giordano Da Lozzo Fabrizio Frati Maurizio Patrignani Graph Stories in Small Area. 545-558 2019 GD https://doi.org/10.1007/978-3-030-35802-0_41 conf/gd/2019 db/conf/gd/gd2019.html#BorrazzoLFP19 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. 57-70 2019 WADS https://doi.org/10.1007/978-3-030-24766-9_5 conf/wads/2019 db/conf/wads/wads2019.html#Barrera-CruzBLB19

Barbara Covella Fabrizio Frati Maurizio Patrignani On the Area Requirements of Planar Straight-Line Orthogonal Drawings of Ternary Trees. 2019 abs/1902.11044 CoRR http://arxiv.org/abs/1902.11044 db/journals/corr/corr1902.html#abs-1902-11044

Carla Binucci Giordano Da Lozzo Emilio Di Giacomo Walter Didimo Tamara Mchedlidze Maurizio Patrignani Upward Book Embeddings of st-Graphs. 2019 abs/1903.07966 CoRR http://arxiv.org/abs/1903.07966 db/journals/corr/corr1903.html#abs-1903-07966

Patrizio Angelini Henry Förster Michael Hoffmann 0001 Michael Kaufmann 0001 Stephen G. Kobourov Giuseppe Liotta Maurizio Patrignani The QuaSEFE Problem. 2019 abs/1908.08708 CoRR http://arxiv.org/abs/1908.08708 db/journals/corr/corr1908.html#abs-1908-08708

Manuel Borrazzo Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Graph Stories in Small Area. 2019 abs/1908.09318 CoRR http://arxiv.org/abs/1908.09318 db/journals/corr/corr1908.html#abs-1908-09318

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. 2019 abs/1909.07093 CoRR http://arxiv.org/abs/1909.07093 db/journals/corr/corr1909.html#abs-1909-07093

Walter Didimo Giuseppe Liotta Giacomo Ortali Maurizio Patrignani Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time. 2019 abs/1910.11782 CoRR http://arxiv.org/abs/1910.11782 db/journals/corr/corr1910.html#abs-1910-11782

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. 2018 29 Int. J. Found. Comput. Sci. 4 https://doi.org/10.1142/S0129054118410010 https://www.wikidata.org/entity/Q129643659 db/journals/ijfcs/ijfcs29.html#KariOALBDPRT18a 461-480

Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Computing NodeTrix Representations of Clustered Graphs. 139-176 2018 22 J. Graph Algorithms Appl. 2 https://doi.org/10.7155/jgaa.00461 db/journals/jgaa/jgaa22.html#LozzoBFP18

Pier Francesco Cortese Maurizio Patrignani Clustered Planarity = Flat Clustered Planarity. 23-38 2018 GD https://doi.org/10.1007/978-3-030-04414-5_2 conf/gd/2018 db/conf/gd/gd2018.html#CorteseP18 Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Vincenzo Roselli Upward Planar Morphs. 92-105 2018 GD https://doi.org/10.1007/978-3-030-04414-5_7 conf/gd/2018 db/conf/gd/gd2018.html#LozzoBFPR18 Walter Didimo Giuseppe Liotta Maurizio Patrignani Bend-Minimum Orthogonal Drawings in Quadratic Time. 481-494 2018 GD https://doi.org/10.1007/978-3-030-04414-5_34 conf/gd/2018 db/conf/gd/gd2018.html#DidimoLP18 Valentino Di Donato Maurizio Patrignani Claudio Squarcella Exploring Flow Metrics in Dense Geographical Networks. 52-61 2018 VISIGRAPP (3: IVAPP) https://doi.org/10.5220/0006548700520061 conf/grapp/2018ivapp db/conf/grapp/ivapp2018.html#DonatoPS18 Barbara Covella Fabrizio Frati Maurizio Patrignani On the Area Requirements of Straight-Line Orthogonal Drawings of Ternary Trees. 128-140 2018 IWOCA https://doi.org/10.1007/978-3-319-94667-2_11 conf/iwoca/2018 db/conf/iwoca/iwoca2018.html#CovellaFP18 Alessio Conte Donatella Firmani Caterina Mordente Maurizio Patrignani Riccardo Torlone Cliques are Too Strict for Representing Communities: Finding Large k-plexes in Real Networks. 2018 SEBD https://ceur-ws.org/Vol-2161/paper41.pdf conf/sebd/2018 db/conf/sebd/sebd2018.html#ConteFMPT18

Walter Didimo Giuseppe Liotta Maurizio Patrignani Efficient Algorithms for Bend-minimum Orthogonal Drawings of Planar 3-Graphs. 2018 abs/1804.05813 CoRR http://arxiv.org/abs/1804.05813 db/journals/corr/corr1804.html#abs-1804-05813

Pier Francesco Cortese Maurizio Patrignani Clustered Planarity = Flat Clustered Planarity. 2018 abs/1808.07437 CoRR http://arxiv.org/abs/1808.07437 db/journals/corr/corr1808.html#abs-1808-07437

Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Vincenzo Roselli Upward Planar Morphs. 2018 abs/1808.10826 CoRR http://arxiv.org/abs/1808.10826 db/journals/corr/corr1808.html#abs-1808-10826

Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Ignaz Rutter Intersection-Link Representations of Graphs. 731-755 2017 21 J. Graph Algorithms Appl. 4 https://doi.org/10.7155/jgaa.00437 db/journals/jgaa/jgaa21.html#AngeliniLBFPR17

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 0001 Bryan T. Wilkinson How to Morph Planar Graph Drawings. 824-852 2017 46 SIAM J. Comput. 2 https://doi.org/10.1137/16M1069171 db/journals/siamcomp/siamcomp46.html#AlamdariABCLBFH17

Alessandro Baroni 0001 Alessio Conte Maurizio Patrignani Salvatore Ruggieri Efficiently Clustering Very Large Attributed Graphs. 369-376 2017 ASONAM https://doi.org/10.1145/3110025.3110030 conf/asunam/2017 db/conf/asunam/asonam2017.html#0001CPR17 Tiziana Calamoneri Valentino Di Donato Diego Mariottini Maurizio Patrignani Visualizing Co-phylogenetic Reconciliations. 334-347 2017 GD https://doi.org/10.1007/978-3-319-73915-1_27 conf/gd/2017 db/conf/gd/gd2017.html#CalamoneriDMP17 Steven Chaplick Markus Chimani Sabine Cornelsen Giordano Da Lozzo Martin Nöllenburg Maurizio Patrignani Ioannis G. Tollis Alexander Wolff 0001 Planar L-Drawings of Directed Graphs. 465-478 2017 GD https://doi.org/10.1007/978-3-319-73915-1_36 conf/gd/2017 db/conf/gd/gd2017.html#ChaplickCCLNPTW17 Emilio Di Giacomo Giuseppe Liotta Maurizio Patrignani Alessandra Tappini NodeTrix Planarity Testing with Small Clusters. 479-491 2017 GD https://doi.org/10.1007/978-3-319-73915-1_37 conf/gd/2017 db/conf/gd/gd2017.html#GiacomoLPT17 Alessio Conte Donatella Firmani Caterina Mordente Maurizio Patrignani Riccardo Torlone Fast Enumeration of Large k-Plexes. 115-124 2017 KDD https://doi.org/10.1145/3097983.3098031 conf/kdd/2017 db/conf/kdd/kdd2017.html#ConteFMPT17 Fabrizio Frati Maurizio Patrignani Vincenzo Roselli LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings of Outerplanar Graphs. 1980-1999 2017 SODA https://doi.org/10.1137/1.9781611974782.129 http://dl.acm.org/citation.cfm?id=3039815 conf/soda/2017 db/conf/soda/soda2017.html#FratiPR17

Alessandro Baroni 0001 Alessio Conte Maurizio Patrignani Salvatore Ruggieri Efficiently Clustering Very Large Attributed Graphs. 2017 abs/1703.08590 CoRR http://arxiv.org/abs/1703.08590 db/journals/corr/corr1703.html#0001CPR17

Steven Chaplick Markus Chimani Sabine Cornelsen Giordano Da Lozzo Martin Nöllenburg Maurizio Patrignani Ioannis G. Tollis Alexander Wolff 0001 Planar L-Drawings of Directed Graphs. 2017 abs/1708.09107 CoRR http://arxiv.org/abs/1708.09107 db/journals/corr/corr1708.html#abs-1708-09107

Emilio Di Giacomo Giuseppe Liotta Maurizio Patrignani Alessandra Tappini NodeTrix Planarity Testing with Small Clusters. 2017 abs/1708.09281 CoRR http://arxiv.org/abs/1708.09281 db/journals/corr/corr1708.html#abs-1708-09281

Tiziana Calamoneri Valentino Di Donato Diego Mariottini Maurizio Patrignani Visualizing Co-Phylogenetic Reconciliations. 2017 abs/1708.09691 CoRR http://arxiv.org/abs/1708.09691 db/journals/corr/corr1708.html#abs-1708-09691

Valentino Di Donato Maurizio Patrignani Claudio Squarcella NetFork: Mapping Time to Space in Network Visualization. 92-99 2016 AVI https://doi.org/10.1145/2909132.2909245 https://www.wikidata.org/entity/Q130979224 conf/avi/2016 db/conf/avi/avi2016.html#DonatoPS16 Alessio Conte Roberto De Virgilio Antonio Maccioni Maurizio Patrignani Riccardo Torlone Finding All Maximal Cliques in Very Large Social Networks. 173-184 2016 EDBT https://doi.org/10.5441/002/edbt.2016.18 conf/edbt/2016 db/conf/edbt/edbt2016.html#ConteVMPT16 Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Computing NodeTrix Representations of Clustered Graphs. 107-120 2016 GD https://doi.org/10.1007/978-3-319-50106-2_9 conf/gd/2016 db/conf/gd/gd2016.html#LozzoBFP16 Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Ignaz Rutter Beyond Level Planarity. 482-495 2016 GD https://doi.org/10.1007/978-3-319-50106-2_37 conf/gd/2016 db/conf/gd/gd2016.html#AngeliniLBFPR16 Davide Ceneda Marco Di Bartolomeo Valentino Di Donato Maurizio Patrignani Maurizio Pizzonia Massimo Rimondini RoutingWatch: Visual exploration and analysis of routing events. 591-597 2016 NOMS https://doi.org/10.1109/NOMS.2016.7502863 conf/noms/2016 db/conf/noms/noms2016.html#CenedaBDPPR16 Alessio Conte Roberto De Virgilio Antonio Maccioni Maurizio Patrignani Riccardo Torlone Community Detection in Social Networks: Breaking the Taboos. 118-125 2016 SEBD conf/sebd/2016 db/conf/sebd/sebd2016.html#ConteVMPT16 Patrizio Angelini Giordano Da Lozzo Marco Di Bartolomeo Valentino Di Donato Maurizio Patrignani Vincenzo Roselli Ioannis G. Tollis L-Drawings of Directed Graphs. 134-147 2016 SOFSEM https://doi.org/10.1007/978-3-662-49192-8_11 conf/sofsem/2016 db/conf/sofsem/sofsem2016.html#AngeliniLBDPRT16 Maurizio Patrignani Bend Minimization for Orthogonal Drawings of Plane Graphs. 177-181 2016 Encyclopedia of Algorithms https://doi.org/10.1007/978-1-4939-2864-4_651 db/reference/algo/algo2016.html#Patrignani16

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 0001 Bryan T. Wilkinson How to morph planar graph drawings. 2016 abs/1606.00425 CoRR http://arxiv.org/abs/1606.00425 db/journals/corr/corr1606.html#AlamdariABCLBFH16

Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Computing NodeTrix Representations of Clustered Graphs. 2016 abs/1608.08952 CoRR http://arxiv.org/abs/1608.08952 db/journals/corr/corr1608.html#LozzoBFP16

Fabrizio Frati Maurizio Patrignani Vincenzo Roselli LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings of Outerplanar Graphs. 2016 abs/1610.02841 CoRR http://arxiv.org/abs/1610.02841 db/journals/corr/corr1610.html#FratiPR16

Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Vincenzo Roselli Relaxing the constraints of clustered planarity. 42-75 2015 48 Comput. Geom. 2 https://doi.org/10.1016/j.comgeo.2014.08.001 https://www.wikidata.org/entity/Q62046555 db/journals/comgeo/comgeo48.html#AngeliniLBFPR15

Patrizio Angelini Carla Binucci Giordano Da Lozzo Walter Didimo Luca Grilli 0001 Fabrizio Montecchiani Maurizio Patrignani Ioannis G. Tollis Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs. 34-48 2015 50 Comput. Geom. https://doi.org/10.1016/j.comgeo.2015.07.002 https://www.wikidata.org/entity/Q62046547 db/journals/comgeo/comgeo50.html#AngeliniBLDGMPT15

Patrizio Angelini Giuseppe Di Battista Fabrizio Frati Vít Jelínek Jan Kratochvíl Maurizio Patrignani Ignaz Rutter Testing Planarity of Partially Embedded Graphs. 32:1-32:42 2015 11 ACM Trans. Algorithms 4 https://doi.org/10.1145/2629341 https://www.wikidata.org/entity/Q130880629 db/journals/talg/talg11.html#AngeliniBFJKPR15

Carla Binucci Emilio Di Giacomo Walter Didimo Fabrizio Montecchiani Maurizio Patrignani Antonios Symvonis Ioannis G. Tollis Fan-planarity: Properties and complexity. 76-86 2015 589 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2015.04.020 db/journals/tcs/tcs589.html#BinucciGDMPST15

Marco Chiesa Giuseppe Di Battista Thomas Erlebach Maurizio Patrignani Computational complexity of traffic hijacking under BGP and S-BGP. 143-154 2015 600 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2015.07.038 db/journals/tcs/tcs600.html#ChiesaBEP15

Patrizio Angelini Giordano Da Lozzo Fabrizio Frati Anna Lubiw Maurizio Patrignani Vincenzo Roselli Optimal Morphs of Convex Drawings. 126-140 2015 SoCG https://doi.org/10.4230/LIPIcs.SOCG.2015.126 conf/compgeom/2015 db/conf/compgeom/compgeom2015.html#AngeliniLFLPR15 Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Ignaz Rutter Intersection-Link Representations of Graphs. 217-230 2015 GD https://doi.org/10.1007/978-3-319-27261-0_19 https://www.wikidata.org/entity/Q62046549 conf/gd/2015 db/conf/gd/gd2015.html#AngeliniLBFPR15 Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Ignaz Rutter On the Relationship Between Map Graphs and Clique Planar Graphs. 548-550 2015 GD https://doi.org/10.1007/978-3-319-27261-0_46 https://www.wikidata.org/entity/Q62046551 conf/gd/2015 db/conf/gd/gd2015.html#AngeliniLBFPR15a Giordano Da Lozzo Marco Di Bartolomeo Maurizio Patrignani Giuseppe Di Battista Davide Cannone Sergio Tortora Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data. 109-116 2015 IVAPP https://doi.org/10.5220/0005266601090116 conf/grapp/2015ivapp db/conf/grapp/ivapp2015.html#LozzoBPBCT15 Giuseppe Di Battista Valentino Di Donato Maurizio Patrignani Maurizio Pizzonia Vincenzo Roselli Roberto Tamassia Bitconeview: visualization of flows in the bitcoin transaction graph. 1-8 2015 VizSEC https://doi.org/10.1109/VIZSEC.2015.7312773 https://doi.ieeecomputersociety.org/10.1109/VIZSEC.2015.7312773 https://www.wikidata.org/entity/Q111690288 conf/vizsec/2015 db/conf/vizsec/vizsec2015.html#BattistaDPPRT15

Patrizio Angelini Giordano Da Lozzo Fabrizio Frati Anna Lubiw Maurizio Patrignani Vincenzo Roselli Optimal Morphs of Convex Drawings. 2015 abs/1503.09021 CoRR http://arxiv.org/abs/1503.09021 db/journals/corr/corr1503.html#AngeliniLFLPR15

Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Ignaz Rutter Intersection-Link Representations of Graphs. 2015 abs/1508.07557 CoRR http://arxiv.org/abs/1508.07557 db/journals/corr/corr1508.html#AngeliniLBFPR15

Patrizio Angelini Giordano Da Lozzo Marco Di Bartolomeo Valentino Di Donato Maurizio Patrignani Vincenzo Roselli Ioannis G. Tollis L-Drawings of Directed Graphs. 2015 abs/1509.00684 CoRR http://arxiv.org/abs/1509.00684 db/journals/corr/corr1509.html#AngeliniLBDPRT15

Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Ignaz Rutter Testing Cyclic Level and Simultaneous Level Planarity. 2015 abs/1510.08274 CoRR http://arxiv.org/abs/1510.08274 db/journals/corr/corr1510.html#AngeliniLBFPR15a

Carla Binucci Walter Didimo Maurizio Patrignani Upward and quasi-upward planarity testing of embedded mixed graphs. 75-89 2014 526 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2014.01.015 db/journals/tcs/tcs526.html#BinucciDP14

Carla Binucci Emilio Di Giacomo Walter Didimo Fabrizio Montecchiani Maurizio Patrignani Ioannis G. Tollis Fan-Planar Graphs: Combinatorial Properties and Complexity Results. 186-197 2014 GD https://doi.org/10.1007/978-3-662-45803-7_16 conf/gd/2014 db/conf/gd/gd2014.html#BinucciGDMPT14 Walter Didimo Giuseppe Liotta Maurizio Patrignani On the Complexity of HV-rectilinear Planarity Testing. 343-354 2014 GD https://doi.org/10.1007/978-3-662-45803-7_29 conf/gd/2014 db/conf/gd/gd2014.html#DidimoLP14 Patrizio Angelini Giordano Da Lozzo Marco Di Bartolomeo Giuseppe Di Battista Seok-Hee Hong 0001 Maurizio Patrignani Vincenzo Roselli Anchored Drawings of Planar Graphs. 404-415 2014 GD https://doi.org/10.1007/978-3-662-45803-7_34 conf/gd/2014 db/conf/gd/gd2014.html#AngeliniLBBHPR14 Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Vincenzo Roselli Morphing Planar Graph Drawings Optimally. 126-137 2014 ICALP (1) https://doi.org/10.1007/978-3-662-43948-7_11 https://www.wikidata.org/entity/Q62046559 conf/icalp/2014-1 db/conf/icalp/icalp2014-1.html#AngeliniLBFPR14

Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Vincenzo Roselli Morphing Planar Graph Drawings Optimally. 2014 abs/1402.4364 CoRR http://arxiv.org/abs/1402.4364 db/journals/corr/corr1402.html#AngeliniLBFPR14

Carla Binucci Emilio Di Giacomo Walter Didimo Fabrizio Montecchiani Maurizio Patrignani Ioannis G. Tollis Properties and Complexity of Fan-Planarity. 2014 abs/1406.5299 CoRR http://arxiv.org/abs/1406.5299 db/journals/corr/corr1406.html#BinucciGDMPT14

Walter Didimo Maurizio Patrignani Guest Editors' Foreword. 363-365 2013 17 J. Graph Algorithms Appl. 4 https://doi.org/10.7155/jgaa.00297 db/journals/jgaa/jgaa17.html#DidimoP13

Patrizio Angelini Pier Francesco Cortese Giuseppe Di Battista Maurizio Patrignani Topological morphing of planar graphs. 2-20 2013 514 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2013.08.018 db/journals/tcs/tcs514.html#AngeliniCBP13

Patrizio Angelini Fabrizio Frati Maurizio Patrignani Vincenzo Roselli Morphing Planar Graph Drawings Efficiently. 49-60 2013 GD https://doi.org/10.1007/978-3-319-03841-4_5 conf/gd/2013 db/conf/gd/gd2013.html#AngeliniFPR13 Patrizio Angelini Carla Binucci Giordano Da Lozzo Walter Didimo Luca Grilli 0001 Fabrizio Montecchiani Maurizio Patrignani Ioannis G. Tollis Drawing Non-Planar Graphs with Crossing-Free Subgraphs. 292-303 2013 GD https://doi.org/10.1007/978-3-319-03841-4_26 conf/gd/2013 db/conf/gd/gd2013.html#AngeliniBLDGMPT13 Soroush Alamdari Patrizio Angelini Timothy M. Chan Giuseppe Di Battista Fabrizio Frati Anna Lubiw Maurizio Patrignani Vincenzo Roselli Sahil Singla 0001 Bryan T. Wilkinson Morphing Planar Graph Drawings with a Polynomial Number of Steps. 1656-1667 2013 SODA https://doi.org/10.1137/1.9781611973105.119 conf/soda/2013 db/conf/soda/soda2013.html#AlamdariACBFLPRSW13 Walter Didimo Maurizio Patrignani Graph Drawing - 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers 2013 Springer Lecture Notes in Computer Science 7704 https://doi.org/10.1007/978-3-642-36763-2 978-3-642-36762-5 GD db/conf/gd/gd2012.html Maurizio Patrignani Planarity Testing and Embedding. 1-42 2013 Handbook of Graph Drawing and Visualization reference/crc/2013gd db/reference/crc/gd2013.html#Patrignani13

Patrizio Angelini Fabrizio Frati Maurizio Patrignani Vincenzo Roselli Morphing Planar Graphs Drawings Efficiently. 2013 CoRR http://arxiv.org/abs/1308.4291 abs/1308.4291 db/journals/corr/corr1308.html#AngeliniFPR13

Patrizio Angelini Carla Binucci Giordano Da Lozzo Walter Didimo Luca Grilli 0001 Fabrizio Montecchiani Maurizio Patrignani Ioannis G. Tollis Drawings of Non-planar Graphs with Crossing-free Subgraphs. 2013 CoRR http://arxiv.org/abs/1308.6706 abs/1308.6706 db/journals/corr/corr1308.html#AngeliniBLDGMPT13

Carla Binucci Ulrik Brandes Giuseppe Di Battista Walter Didimo Marco Gaertler Pietro Palladino Maurizio Patrignani Antonios Symvonis Katharina A. Zweig Drawing trees in a streaming model. 418-422 2012 112 Inf. Process. Lett. 11 https://doi.org/10.1016/j.ipl.2012.02.011 db/journals/ipl/ipl112.html#BinucciBBDGPPSZ12

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. 150-172 2012 14 J. Discrete Algorithms https://doi.org/10.1016/j.jda.2011.12.015 https://www.wikidata.org/entity/Q56689204 db/journals/jda/jda14.html#AngeliniBFPR12

Patrizio Angelini Enrico Colasante Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Monotone Drawings of Graphs. 5-35 2012 16 J. Graph Algorithms Appl. 1 https://doi.org/10.7155/jgaa.00249 db/journals/jgaa/jgaa16.html#AngeliniCBFP12

Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Nonconvex Representations of Plane Graphs. 1670-1681 2012 26 SIAM J. Discret. Math. 4 https://doi.org/10.1137/090748640 db/journals/siamdm/siamdm26.html#BattistaFP12

Marco Chiesa Giuseppe Di Battista Thomas Erlebach Maurizio Patrignani Computational Complexity of Traffic Hijacking under BGP and S-BGP. 476-487 2012 ICALP (2) https://doi.org/10.1007/978-3-642-31585-5_43 conf/icalp/2012-2 db/conf/icalp/icalp2012-2.html#ChiesaBEP12

Marco Chiesa Giuseppe Di Battista Thomas Erlebach Maurizio Patrignani Computational Complexity of Traffic Hijacking under BGP and S-BGP http://arxiv.org/abs/1205.4564 2012 CoRR abs/1205.4564 db/journals/corr/corr1205.html#abs-1205-4564

Patrizio Angelini Giuseppe Di Battista Maurizio Patrignani Finding a Minimum-depth Embedding of a Planar Graph in O(n4) Time. 890-937 2011 60 Algorithmica 4 https://doi.org/10.1007/s00453-009-9380-6 db/journals/algorithmica/algorithmica60.html#AngeliniBP11

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. 1587-1598 2011 17 IEEE Trans. Vis. Comput. Graph. 11 https://doi.org/10.1109/TVCG.2010.265 http://doi.ieeecomputersociety.org/10.1109/TVCG.2010.265 https://www.wikidata.org/entity/Q51823556 db/journals/tvcg/tvcg17.html#BatageljBDLPP11

Ioannis G. Tollis Maurizio Patrignani Guest Editor's Foreword. 3-4 2010 14 J. Graph Algorithms Appl. 1 https://doi.org/10.7155/jgaa.00195 db/journals/jgaa/jgaa14.html#TollisP10

Vladimir Batagelj Walter Didimo Giuseppe Liotta Pietro Palladino Maurizio Patrignani Visual analysis of large graphs using (X, Y)-clustering and hybrid visualizations. 209-216 2010 PacificVis https://doi.org/10.1109/PACIFICVIS.2010.5429591 https://doi.ieeecomputersociety.org/10.1109/PACIFICVIS.2010.5429591 https://www.wikidata.org/entity/Q62042537 conf/apvis/2010 db/conf/apvis/pacificvis2010.html#BatageljDLPP10 Patrizio Angelini Enrico Colasante Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Monotone Drawings of Graphs. 13-24 2010 GD https://doi.org/10.1007/978-3-642-18469-7_2 conf/gd/2010 db/conf/gd/gd2010.html#AngeliniCBFP10 Luca Cittadini Giuseppe Di Battista Thomas Erlebach Maurizio Patrignani Massimo Rimondini Assigning AS relationships to satisfy the Gao-Rexford conditions. 113-123 2010 ICNP https://doi.org/10.1109/ICNP.2010.5762760 https://doi.ieeecomputersociety.org/10.1109/ICNP.2010.5762760 conf/icnp/2010 db/conf/icnp/icnp2010.html#CittadiniBEPR10 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. 212-225 2010 IWOCA https://doi.org/10.1007/978-3-642-19222-7_22 conf/iwoca/2010 db/conf/iwoca/iwoca2010.html#AngeliniBFPR10 Patrizio Angelini Giuseppe Di Battista Fabrizio Frati Vít Jelínek Jan Kratochvíl Maurizio Patrignani Ignaz Rutter Testing Planarity of Partially Embedded Graphs. 202-221 2010 SODA https://doi.org/10.1137/1.9781611973075.19 conf/soda/2010 db/conf/soda/soda2010.html#AngeliniBFJKPR10

Pier Francesco Cortese Giuseppe Di Battista Maurizio Patrignani Maurizio Pizzonia On embedding a cycle in a plane graph. 1856-1869 2009 309 Discret. Math. 7 https://doi.org/10.1016/j.disc.2007.12.090 db/journals/dm/dm309.html#CorteseBPP09

Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. 143-159 2009 44 Theory Comput. Syst. 2 https://doi.org/10.1007/s00224-008-9115-0 db/journals/mst/mst44.html#BattistaFP09

Patrizio Angelini Fabrizio Frati Maurizio Patrignani Splitting Clusters to Get C-Planarity. 57-68 2009 GD https://doi.org/10.1007/978-3-642-11805-0_8 conf/gd/2009 db/conf/gd/gd2009.html#AngeliniFP09 Carla Binucci Ulrik Brandes Giuseppe Di Battista Walter Didimo Marco Gaertler Pietro Palladino Maurizio Patrignani Antonios Symvonis Katharina A. Zweig Drawing Trees in a Streaming Model. 292-303 2009 GD https://doi.org/10.1007/978-3-642-11805-0_28 conf/gd/2009 db/conf/gd/gd2009.html#BinucciBBDGPPSZ09 Mario Cola Giorgio De Lucia Daria Mazza Maurizio Patrignani Massimo Rimondini Covert Channel for One-Way Delay Measurements. 1-6 2009 ICCCN https://doi.org/10.1109/ICCCN.2009.5235268 https://doi.ieeecomputersociety.org/10.1109/ICCCN.2009.5235268 conf/icccn/2009 db/conf/icccn/icccn2009.html#ColaLMPR09 Ioannis G. Tollis Maurizio Patrignani Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers 5417 2009 https://doi.org/10.1007/978-3-642-00219-9 978-3-642-00218-2 GD Lecture Notes in Computer Science Springer db/conf/gd/gd2008.html

Maurizio Patrignani Complexity results for three-dimensional orthogonal graph drawing. 140-161 2008 6 J. Discrete Algorithms 1 https://doi.org/10.1016/j.jda.2006.06.002 db/journals/jda/jda6.html#Patrignani08

Pier Francesco Cortese Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Maurizio Pizzonia C-Planarity of C-Connected Clustered Graphs. 225-262 2008 12 J. Graph Algorithms Appl. 2 https://doi.org/10.7155/jgaa.00165 db/journals/jgaa/jgaa12.html#CorteseBFPP08

Patrizio Angelini Pier Francesco Cortese Giuseppe Di Battista Maurizio Patrignani Topological Morphing of Planar Graphs. 145-156 2008 GD https://doi.org/10.1007/978-3-642-00219-9_15 conf/gd/2008 db/conf/gd/gd2008.html#AngeliniCBP08 Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Non-convex Representations of Graphs. 390-395 2008 GD https://doi.org/10.1007/978-3-642-00219-9_38 conf/gd/2008 db/conf/gd/gd2008.html#BattistaFP08 Vladimir Batagelj Franz J. Brandenburg Walter Didimo Giuseppe Liotta Maurizio Patrignani 08191 Working Group Report - X-graphs of Y-graphs and their Representations. 2008 Graph Drawing with Applications to Bioinformatics and Social Sciences http://drops.dagstuhl.de/opus/volltexte/2008/1556/ conf/dagstuhl/2008P8191 db/conf/dagstuhl/P8191.html#BatageljBDLP08

Lorenzo Colitti Giuseppe Di Battista Maurizio Patrignani Maurizio Pizzonia Massimo Rimondini Investigating prefix propagation through active BGP probing. 460-474 2007 31 Microprocess. Microsystems 7 https://doi.org/10.1016/j.micpro.2007.05.001 db/journals/mam/mam31.html#ColittiBPPR07

Giuseppe Di Battista Thomas Erlebach Alexander Hall Maurizio Patrignani Maurizio Pizzonia Thomas Schank Computing the types of the relationships between autonomous systems. 267-280 2007 15 IEEE/ACM Trans. Netw. 2 http://doi.acm.org/10.1145/1279660.1279662 db/journals/ton/ton15.html#BattistaEHPPS07

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. 233-236 2007 conf/cccg/2007 CCCG db/conf/cccg/cccg2007.html#BadentBGDFGKPPT07 http://cccg.ca/proceedings/2007/09b4.pdf Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. 1-13 2007 conf/fun/2007 FUN https://doi.org/10.1007/978-3-540-72914-3_1 db/conf/fun/fun2007.html#BattistaFP07 Fabrizio Frati Maurizio Patrignani A Note on Minimum-Area Straight-Line Drawings of Planar Graphs. 339-344 2007 conf/gd/2007 GD https://doi.org/10.1007/978-3-540-77537-9_33 db/conf/gd/gd2007.html#FratiP07 Patrizio Angelini Giuseppe Di Battista Maurizio Patrignani Computing a Minimum-Depth Planar Graph Embedding in O ( n 4) Time. 287-299 2007 conf/wads/2007 WADS https://doi.org/10.1007/978-3-540-73951-7_26 db/conf/wads/wads2007.html#AngeliniBP07

Maurizio Patrignani On Extending a Partial Straight-line Drawing. 1061-1070 2006 17 Int. J. Found. Comput. Sci. 5 https://doi.org/10.1142/S0129054106004261 db/journals/ijfcs/ijfcs17.html#Patrignani06

Pier Francesco Cortese Giuseppe Di Battista Antonello Moneta Maurizio Patrignani Maurizio Pizzonia Topographic Visualization of Prefix Propagation in the Internet. 725-732 2006 12 IEEE Trans. Vis. Comput. Graph. 5 https://doi.org/10.1109/TVCG.2006.185 http://doi.ieeecomputersociety.org/10.1109/TVCG.2006.185 https://www.wikidata.org/entity/Q51929671 db/journals/tvcg/tvcg12.html#CorteseBMPP06

Pier Francesco Cortese Giuseppe Di Battista Fabrizio Frati Luca Grilli 0001 Katharina Anna Lehmann Giuseppe Liotta Maurizio Patrignani Ioannis G. Tollis Francesco Trotta On the Topologies of Local Minimum Spanning Trees. 31-44 2006 conf/caan/2006 CAAN https://doi.org/10.1007/11922377_4 https://www.wikidata.org/entity/Q62042589 db/conf/caan/caan2006.html#CorteseBFGLLPTT06 Lorenzo Colitti Giuseppe Di Battista Maurizio Patrignani Maurizio Pizzonia Massimo Rimondini Investigating Prefix Propagation through Active BGP Probing. 497-504 2006 conf/iscc/2006 ISCC https://doi.org/10.1109/ISCC.2006.89 https://doi.ieeecomputersociety.org/10.1109/ISCC.2006.89 db/conf/iscc/iscc2006.html#ColittiBPPR06

Lorenzo Colitti Giuseppe Di Battista Federico Mariani Maurizio Patrignani Maurizio Pizzonia Visualizing Interdomain Routing with BGPlay. 117-148 2005 9 J. Graph Algorithms Appl. 1 https://doi.org/10.7155/jgaa.00102 db/journals/jgaa/jgaa9.html#ColittiBMPP05

Pier Francesco Cortese Giuseppe Di Battista Maurizio Patrignani Maurizio Pizzonia Clustering Cycles into Cycles of Clusters. 391-413 2005 9 J. Graph Algorithms Appl. 3 https://doi.org/10.7155/jgaa.00115 db/journals/jgaa/jgaa9.html#CorteseBPP05

Pier Francesco Cortese Giuseppe Di Battista Maurizio Patrignani Maurizio Pizzonia On Embedding a Cycle in a Plane Graph. 49-60 2005 conf/gd/2005 GD https://doi.org/10.1007/11618058_5 db/conf/gd/gd2005.html#CorteseBPP05 Maurizio Patrignani Complexity Results for Three-Dimensional Orthogonal Graph Drawing. 368-379 2005 conf/gd/2005 GD https://doi.org/10.1007/11618058_33 db/conf/gd/gd2005.html#Patrignani05 Maurizio Patrignani On Extending a Partial Straight-Line Drawing. 380-385 2005 conf/gd/2005 GD https://doi.org/10.1007/11618058_34 db/conf/gd/gd2005.html#Patrignani05a

Emilio Di Giacomo Giuseppe Liotta Maurizio Patrignani A note on 3D orthogonal drawings with direction constrained edges. 97-101 2004 90 Inf. Process. Lett. 2 https://doi.org/10.1016/j.ipl.2004.01.015 https://www.wikidata.org/entity/Q62042611 db/journals/ipl/ipl90.html#GiacomoLP04

Lorenzo Colitti Giuseppe Di Battista Maurizio Patrignani IPv6-in-IPv4 Tunnel Discovery: Methods and Experimental Results. 30-38 2004 1 IEEE Trans. Netw. Serv. Manag. 1 https://doi.org/10.1109/TNSM.2004.4623692 db/journals/tnsm/tnsm1.html#ColittiBP04

Pier Francesco Cortese Giuseppe Di Battista Maurizio Patrignani Maurizio Pizzonia Clustering Cycles into Cycles of Clusters. 100-110 https://doi.org/10.1007/978-3-540-31843-9_12 2004 conf/gd/2004 GD db/conf/gd/gd2004.html#CorteseBPP04 Maurizio Patrignani A Note on the Self-similarity of Some Orthogonal Drawings. 389-394 https://doi.org/10.1007/978-3-540-31843-9_39 2004 conf/gd/2004 GD db/conf/gd/gd2004.html#Patrignani04 Lorenzo Colitti Giuseppe Di Battista Maurizio Patrignani Discovering IPv6-in-IPv4 tunnels in the Internet. 613-626 2004 NOMS (1) https://doi.org/10.1109/NOMS.2004.1317748 conf/noms/2004 db/conf/noms/noms2004.html#ColittiBP04 Giuseppe Di Battista Walter Didimo Maurizio Patrignani Maurizio Pizzonia DBdraw - Automatic Layout of Relational Database Schemas. 237-256 2004 books/sp/Juenger04 Graph Drawing Software https://doi.org/10.1007/978-3-642-18638-7_11 db/books/collections/Juenger2004.html#BattistaDPP04 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. 25-36 https://doi.org/10.1007/978-3-540-24595-7_3 https://www.wikidata.org/entity/Q29011557 2003 conf/gd/2003 GD db/conf/gd/gd2003.html#BoyerCPB03 Giuseppe Di Battista Federico Mariani Maurizio Patrignani Maurizio Pizzonia BGPlay: A System for Visualizing the Interdomain Routing Evolution. 295-306 https://doi.org/10.1007/978-3-540-24595-7_27 2003 conf/gd/2003 GD db/conf/gd/gd2003.html#BattistaMPP03 Giuseppe Di Battista Maurizio Patrignani Maurizio Pizzonia Computing the Types of the Relationships between Autonomous Systems. 2003 conf/infocom/2003 INFOCOM https://doi.org/10.1109/INFCOM.2003.1208668 https://doi.ieeecomputersociety.org/10.1109/INFCOM.2003.1208668 db/conf/infocom/infocom2003.html#BattistaPP03 156-165

Giuseppe Di Battista Walter Didimo Maurizio Patrignani Maurizio Pizzonia Drawing database schemas. 1065-1098 2002 32 Softw. Pract. Exp. 11 db/journals/spe/spe32.html#BattistaDPP02 https://doi.org/10.1002/spe.474

Emilio Di Giacomo Giuseppe Liotta Maurizio Patrignani Orthogonal 3D Shapes of Theta Graphs. 142-149 2002 conf/gd/2002 GD https://doi.org/10.1007/3-540-36151-0_14 db/conf/gd/gd2002.html#GiacomoLP02

Maurizio Patrignani On the complexity of orthogonal compaction. 47-67 2001 19 Comput. Geom. 1 db/journals/comgeo/comgeo19.html#Patrignani01 https://doi.org/10.1016/S0925-7721(01)00010-4

Giuseppe Di Battista Walter Didimo Maurizio Patrignani Maurizio Pizzonia Drawing Database Schemas with DBdraw. 451-452 2001 conf/gd/2001 GD https://doi.org/10.1007/3-540-45848-4_41 db/conf/gd/gd2001.html#BattistaDPP00 Walter Didimo Maurizio Patrignani Maurizio Pizzonia Industrial Plant Drawer. 475-476 2001 conf/gd/2001 GD https://doi.org/10.1007/3-540-45848-4_53 db/conf/gd/gd2001.html#DidimoPP00 Maurizio Patrignani Maurizio Pizzonia The Complexity of the Matching-Cut Problem. 284-295 2001 conf/wg/2001 WG https://doi.org/10.1007/3-540-45477-2_26 db/conf/wg/wg2001.html#PatrignaniP01

Giuseppe Di Battista Maurizio Patrignani Francesco Vargiu A Split & Push Approach to 3D Orthogonal Drawing. 105-133 2000 4 J. Graph Algorithms Appl. 3 https://doi.org/10.7155/jgaa.00027 db/journals/jgaa/jgaa4.html#BattistaPV00

Neal Lesh Joe Marks Maurizio Patrignani Interactive Partitioning (System Demonstration, Short). 31-36 https://doi.org/10.1007/3-540-44541-2_4 2000 conf/gd/2000 GD db/conf/gd/gd2000.html#LeshMP00 Giuseppe Di Battista Walter Didimo Maurizio Patrignani Maurizio Pizzonia Drawing Relational Schemas. 53-62 2000 VisSym https://doi.org/10.1007/978-3-7091-6783-0_6 https://doi.org/10.2312/VisSym/VisSym00/053-062 conf/vissym/2000 db/conf/vissym/vissym2000.html#BattistaDPP00 Giuseppe Di Battista Walter Didimo Maurizio Patrignani Maurizio Pizzonia Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size. 297-310 1999 conf/gd/1999 GD https://doi.org/10.1007/3-540-46648-7_31 db/conf/gd/gd1999.html#BattistaDPP99 Camil Demetrescu Giuseppe Di Battista Irene Finocchi Giuseppe Liotta Maurizio Patrignani Maurizio Pizzonia Infinite Trees and the Future. 379-391 1999 conf/gd/1999 GD https://doi.org/10.1007/3-540-46648-7_39 db/conf/gd/gd1999.html#DemetrescuBFLPP99 Maurizio Patrignani On the Complexity of Orthogonal Compaction. 56-61 https://doi.org/10.1007/3-540-48447-7_7 1999 conf/wads/1999 WADS db/conf/wads/wads99.html#Patrignani99 Giuseppe Di Battista Maurizio Patrignani Francesco Vargiu A Split&Push Approach to 3D Orthogonal Drawing. 87-101 1998 conf/gd/1998 GD https://doi.org/10.1007/3-540-37623-2_7 db/conf/gd/gd98.html#BattistaPV98 Maurizio Patrignani Francesco Vargiu 3DCube: A Tool for Three Dimensional Graph Drawing. 284-290 1997 conf/gd/1997 GD db/conf/gd/gd1997.html#PatrignaniV97 https://doi.org/10.1007/3-540-63938-1_70 Soroush Alamdari Carlos Alegría-GaliciaCarlos Alegría Giordano Andreola Patrizio Angelini Lorenzo Ariemma Emanuele Balloni Alessandro Baroni 0001 Fidel Barrera-Cruz Marco Di Bartolomeo Vladimir Batagelj Giuseppe Di Battista Melanie BaurMelanie Badent Michael A. Bekos Therese Biedl Carla Binucci Annika Bonerath Manuel Borrazzo John M. Boyer Franz-Josef BrandenburgFranz J. Brandenburg Ulrik Brandes Tommaso Caiazzi Tiziana Calamoneri Davide Cannone Claus-Christian Carbon Susanna Caroppo Davide Ceneda Timothy M. Chan Steven Chaplick Marco Chiesa Markus Chimani Luca Cittadini Mario Cola Enrico Colasante Lorenzo Colitti Alessio Conte Sabine Cornelsen Pier Francesco Cortese Barbara Covella Marco D'Elia Camil Demetrescu Walter Didimo Giordano Dionisi Valentino Di Donato Thomas Erlebach Stefan Felsner Irene Finocchi Donatella Firmani Henry Förster Fabrizio Frati Marco GärtlerMarco Gaertler Emilio Di Giacomo Francesco Giordano Luca Grilli 0001 Martin Gronemann Fabrizio Grosso Alexander Hall Penny E. HaxellPenny Haxell Michael Hoffmann 0001 Seok-Hee Hong 0001 Vít Jelínek Eleni Katsanou Michael Kaufmann 0001 Karsten Klein 0001 Stephen G. Kobourov Jan Kratochvíl Neal Lesh Giuseppe Liotta Giordano Da Lozzo Anna Lubiw Giorgio De Lucia Antonio Maccioni Giulia Maragno Federico Mariani Diego Mariottini Joe Marks Daria Mazza Tamara Mchedlidze Silvia Miksch Antonello Moneta Fabrizio Montecchiani Silvia Montorselli Caterina Mordente Miriam Münch Martin Nöllenburg Giacomo Ortali Pietro Palladino Maurizio Pizzonia Sergey Pupyrev Samuele Quinzi Massimo Rimondini Vincenzo Roselli Salvatore Ruggieri Ignaz Rutter Mariano Scazzariello Thomas Schank Blerina Sinaimeri Sahil Singla 0001 Claudio Squarcella Allegra Strippoli Antonios Symvonis Marco Tais Roberto Tamassia Alessandra Tappini Ioannis G. Tollis Riccardo Torlone Sergio Tortora Francesco Trotta Francesco Vargiu Roberto De Virgilio Bryan T. Wilkinson Samuel Wolf Alexander Wolff 0001 Katharina A. ZweigKatharina Anna Lehmann