Giuseppe Di Battista

317 papers A* 13A 65B 47C 8Misc 3Journal 154Unranked 22

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	A Walk on the Wild Side: A Shape-First Methodology for Orthogonal Drawings. GD Giordano Andreola, Susanna Caroppo, Giuseppe Di Battista, Fabrizio Grosso, Maurizio Patrignani, Allegra Strippoli
2025	J	`jnl`	A Walk on the Wild Side: a Shape-First Methodology for Orthogonal Drawings. CoRR Giordano Andreola, Susanna Caroppo, Giuseppe Di Battista, Fabrizio Grosso, Maurizio Patrignani, Allegra Strippoli
2025	J	`jnl`	Drawing graphs with k vertices per face: Complexity and algorithms. Theor. Comput. Sci. Michael A. Bekos, Giuseppe Di Battista, Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Fabrizio Montecchiani
2025	J	`jnl`	Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs. J. Graph Algorithms Appl. Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani
2025	J	`jnl`	From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs. Discret. Math. Theor. Comput. Sci. Giuseppe Di Battista, Fabrizio Frati
2025	B	`conf`	On Planar Straight-Line Dominance Drawings. WADS Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Giacomo Ortali
2025	J	`jnl`	On Planar Straight-Line Dominance Drawings. CoRR Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Giacomo Ortali
2025	J	`jnl`	Quantum Graph Drawing. J. Graph Algorithms Appl. Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista
2025	B	`conf`	Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms. WADS Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista, Michael T. Goodrich, Martin Nöllenburg
2025	J	`jnl`	Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms. CoRR Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista, Michael T. Goodrich, Martin Nöllenburg
2025	J	`jnl`	Quantum algorithms for one-sided crossing minimization. Theor. Comput. Sci. Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista
2025	B	`conf`	Ranking and Unranking of the Planar Embeddings of a Planar Graph. WALCOM Giuseppe Di Battista, Fabrizio Grosso, Giulia Maragno, Maurizio Patrignani
2025	A	`conf`	Tangling and Untangling Trees on Point-Sets. GD Giuseppe Di Battista, Giuseppe Liotta, Maurizio Patrignani, Antonios Symvonis, Ioannis G. Tollis
2025	J	`jnl`	Tangling and Untangling Trees on Point-sets. CoRR Giuseppe Di Battista, Giuseppe Liotta, Maurizio Patrignani, Antonios Symvonis, Ioannis G. Tollis
2025	B	`conf`	The Sound of Silence: Is the Collector Peer Operational at This Time? NOMS Samuele Quinzi, Lorenzo Ariemma, Gabriele Lospoto, Giuseppe Di Battista
2025	J	`jnl`	Unit Edge-Length Rectilinear Drawings with Crossings and Rectangular Faces. CoRR Patrizio Angelini, Carla Binucci, Giuseppe Di Battista, Emilio Di Giacomo, Walter Didimo, Fabrizio Grosso, Giacomo Ortali, Ioannis G. Tollis
2025	J	`jnl`	Upward Pointset Embeddings of Planar st-Graphs. Algorithmica Carlos Alegría-Galicia, Susanna Caroppo, Giordano Da Lozzo, Marco D'Elia, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani
2024	B	`conf`	Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs. WALCOM Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani
2024	J	`jnl`	Graphs Drawn With Some Vertices per Face: Density and Relationships. IEEE Access Carla Binucci, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
2024	J	`jnl`	Min- J. Graph Algorithms Appl. Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
2024	A	`conf`	On the Complexity of Recognizing k^+-Real Face Graphs. GD Michael A. Bekos, Giuseppe Di Battista, Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Fabrizio Montecchiani
2024	A	`conf`	Quantum Algorithms for One-Sided Crossing Minimization. GD Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista
2024	J	`jnl`	Quantum Algorithms for One-Sided Crossing Minimization. CoRR Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista
2024	B	`conf`	Quantum Graph Drawing. WALCOM Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista
2024	J	`jnl`	Ranking and Unranking of the Planar Embeddings of a Planar Graph. CoRR Giuseppe Di Battista, Fabrizio Grosso, Giulia Maragno, Maurizio Patrignani
2024	J	`jnl`	Testing the planar straight-line realizability of 2-trees with prescribed edge lengths. Eur. J. Comb. Carlos Alegría, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
2024	B	`conf`	Treebar Maps: Schematic Representation of Networks at Scale. PacificVis Giuseppe Di Battista, Fabrizio Grosso, Silvia Montorselli, Maurizio Patrignani
2024	J	`jnl`	Unit-length Rectangular Drawings of Graphs. J. Graph Algorithms Appl. Carlos Alegría, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani
2024	A	`conf`	Upward Pointset Embeddings of Planar st-Graphs. GD Carlos Alegría, Susanna Caroppo, Giordano Da Lozzo, Marco D'Elia, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani
2024	J	`jnl`	Upward Pointset Embeddings of Planar st-Graphs. CoRR Carlos Alegría, Susanna Caroppo, Giordano Da Lozzo, Marco D'Elia, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani
2023	J	`jnl`	Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs. CoRR Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani
2023	J	`jnl`	Long-lasting sequences of BGP updates. Comput. Networks Lorenzo Ariemma, Alessandro Dell'Orco, Simone Liotta, Massimo Candela, Giuseppe Di Battista
2023	—	`conf`	Min-k-planar Drawings of Graphs. GD (1) Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
2023	J	`jnl`	Min-k-planar Drawings of Graphs. CoRR Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
2023	B	`conf`	Nesting Containers for Faithful Datacenters Emulations. NOMS Tommaso Caiazzi, Mariano Scazzariello, Samuele Quinzi, Lorenzo Ariemma, Maurizio Patrignani, Giuseppe Di Battista
2023	B	`conf`	Nonplanar Graph Drawings with k Vertices per Face. WG Carla Binucci, Giuseppe Di Battista, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
2023	J	`jnl`	Quantum Graph Drawing. CoRR Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista
2023	J	`jnl`	Small Point-Sets Supporting Graph Stories. J. Graph Algorithms Appl. Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini
2023	J	`jnl`	Splitting Vertices in 2-Layer Graph Drawings. IEEE Computer Graphics and Applications Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger
2023	J	`jnl`	Splitting Vertices in 2-Layer Graph Drawings. CoRR Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger
2023	J	`jnl`	Treebar Maps: Schematic Representation of Networks at Scale. CoRR Giuseppe Di Battista, Fabrizio Grosso, Silvia Montorselli, Maurizio Patrignani
2022	J	`jnl`	How to Morph a Tree on a Small Grid. Discret. Comput. Geom. Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli
2022	J	`jnl`	On Turn-Regular Orthogonal Representations. J. Graph Algorithms Appl. Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter
2022	B	`conf`	Sibyl: a Framework for Evaluating the Implementation of Routing Protocols in Fat-Trees. NOMS Tommaso Caiazzi, Mariano Scazzariello, Leonardo Alberro, Lorenzo Ariemma, Alberto Castro, Eduardo Grampín, Giuseppe Di Battista
2022	A	`conf`	Small Point-Sets Supporting Graph Stories. GD Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini
2022	J	`jnl`	Small Point-Sets Supporting Graph Stories. CoRR Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini
2022	A	`conf`	Unit-length Rectangular Drawings of Graphs. GD Carlos Alegría, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani
2022	J	`jnl`	Unit-length Rectangular Drawings of Graphs. CoRR Carlos Alegría, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani
2021	A*	`conf`	2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees. SODA Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
2021	J	`jnl`	DeSI: A Decentralized Software-Defined Network Architecture for Internet Exchange Points. IEEE Trans. Netw. Sci. Eng. Habib Mostafaei, Davinder Kumar, Gabriele Lospoto, Marco Chiesa, Giuseppe Di Battista
2021	A	`conf`	From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-Line Drawings and Morphs. GD Giuseppe Di Battista, Fabrizio Frati
2021	J	`jnl`	From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs. CoRR Giuseppe Di Battista, Fabrizio Frati
2021	B	`conf`	Long-Lasting Sequences of BGP Updates. PAM Lorenzo Ariemma, Giuseppe Liotta, Massimo Candela, Giuseppe Di Battista
2021	J	`jnl`	Megalos: A Scalable Architecture for the Virtualization of Large Network Scenarios. Future Internet Mariano Scazzariello, Lorenzo Ariemma, Giuseppe Di Battista, Maurizio Patrignani
2021	A	`conf`	Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths. GD Carlos Alegría, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
2021	J	`jnl`	Planar Straight-line Realizations of 2-Trees with Prescribed Edge Lengths. CoRR Carlos Alegría, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
2021	J	`jnl`	Schematic Representation of Large Biconnected Graphs. J. Graph Algorithms Appl. Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais
2020	J	`jnl`	2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees. CoRR Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
2020	A	`conf`	A Tipping Point for the Planarity of Small and Medium Sized Graphs. GD Emanuele Balloni, Giuseppe Di Battista, Maurizio Patrignani
2020	J	`jnl`	A Tipping Point for the Planarity of Small and Medium Sized Graphs. CoRR Emanuele Balloni, Giuseppe Di Battista, Maurizio Patrignani
2020	J	`jnl`	A framework for multi-provider virtual private networks in software-defined federated networks. Int. J. Netw. Manag. Habib Mostafaei, Gabriele Lospoto, Roberto di Lallo, Massimo Rimondini, Giuseppe Di Battista
2020	J	`jnl`	Beyond level planarity: Cyclic, torus, and simultaneous level planarity. Theor. Comput. Sci. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2020	J	`jnl`	Extending upward planar graph drawings. Comput. Geom. Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati
2020	J	`jnl`	Graph Stories in Small Area. J. Graph Algorithms Appl. Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
2020	B	`conf`	Megalos: A Scalable Architecture for the Virtualization of Network Scenarios. NOMS Mariano Scazzariello, Lorenzo Ariemma, Giuseppe Di Battista, Maurizio Patrignani
2020	J	`jnl`	Multi-view routing visualization for the identification of BGP issues. J. Comput. Lang. Massimo Candela, Giuseppe Di Battista, Luca Marzialetti
2020	A	`conf`	On Turn-Regular Orthogonal Representations. GD Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter
2020	J	`jnl`	On Turn-Regular Orthogonal Representations. CoRR Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter
2020	A	`conf`	Schematic Representation of Biconnected Graphs. GD Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais
2020	J	`jnl`	Schematic Representation of Large Biconnected Graphs. CoRR Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais
2020	J	`jnl`	Simple J. Comb. Theory B Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Michael Hoffmann, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth
2020	J	`jnl`	Upward Planar Morphs. Algorithmica Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli
2019	J	`jnl`	Advances on Testing C-Planarity of Embedded Flat Clustered Graphs. Int. J. Found. Comput. Sci. Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein
2019	B	`conf`	Extending Upward Planar Graph Drawings. WADS Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati
2019	J	`jnl`	Extending Upward Planar Graph Drawings. CoRR Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati
2019	J	`jnl`	Graph Stories in Small Area. CoRR Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
2019	B	`conf`	How to Morph a Tree on a Small Grid. WADS Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli
2019	J	`jnl`	How to Morph a Tree on a Small Grid. CoRR Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli
2019	J	`jnl`	Periodic Path Changes in RIPE Atlas. IEEE Access Mattia Iodice, Massimo Candela, Giuseppe Di Battista
2019	J	`jnl`	Simple k-Planar Graphs are Simple (k+1)-Quasiplanar. CoRR Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Michael Hoffmann, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth
2018	J	`jnl`	Computing NodeTrix Representations of Clustered Graphs. J. Graph Algorithms Appl. Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
2018	B	`conf`	Kathará: A container-based framework for implementing network function virtualization and software defined networks. NOMS Gaetano Bonofiglio, Veronica Iovinella, Gabriele Lospoto, Giuseppe Di Battista
2018	J	`jnl`	Radian: Visual Exploration of Traceroutes. IEEE Trans. Vis. Comput. Graph. Massimo Candela, Marco Di Bartolomeo, Giuseppe Di Battista, Claudio Squarcella
2018	J	`jnl`	Small Universal Point Sets for k-Outerplanar Graphs. Discret. Comput. Geom. Patrizio Angelini, Till Bruckdorfer, Giuseppe Di Battista, Michael Kaufmann, Tamara Mchedlidze, Vincenzo Roselli, Claudio Squarcella
2018	C	`conf`	Upstream Visibility: A Multi-View Routing Visualization. VINCI Luca Marzialetti, Massimo Candela, Giuseppe Di Battista
2018	A	`conf`	Upward Planar Morphs. GD Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli
2018	J	`jnl`	Upward Planar Morphs. CoRR Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli
2018	J	`jnl`	Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. ACM Trans. Algorithms Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter
2017	J	`jnl`	How to Morph Planar Graph Drawings. SIAM J. Comput. 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
2017	J	`jnl`	Intersection-Link Representations of Graphs. J. Graph Algorithms Appl. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2017	—	`conf`	Long Transaction Chains and the Bitcoin Heartbeat. Euro-Par Workshops Giuseppe Di Battista, Valentino Di Donato, Maurizio Pizzonia
2017	B	`conf`	On the Relationship Between k-Planar and k-Quasi-Planar Graphs. WG Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter
2017	B	`conf`	PrIXP: Preserving the privacy of routing policies at Internet eXchange Points. IM Marco Chiesa, Roberto di Lallo, Gabriele Lospoto, Habib Mostafaei, Massimo Rimondini, Giuseppe Di Battista
2017	B	`conf`	SDNS: Exploiting SDN and the DNS to exchange traffic in a federated network. NetSoft Habib Mostafaei, Gabriele Lospoto, Andrea Brandimartey, Roberto di Lallo, Massimo Rimondini, Giuseppe Di Battista
2017	B	`conf`	SDNetkit: A testbed for experimenting SDN in multi-domain networks. NetSoft Habib Mostafaei, Gabriele Lospoto, Roberto di Lallo, Massimo Rimondini, Giuseppe Di Battista
2017	J	`jnl`	Strip Planarity Testing for Embedded Planar Graphs. Algorithmica Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati
2017	J	`jnl`	The Internet Pendulum: On the periodicity of Internet Topology Measurements. CoRR Mattia Iodice, Massimo Candela, Giuseppe Di Battista
2016	A	`conf`	Beyond Level Planarity. GD Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2016	A	`conf`	Computing NodeTrix Representations of Clustered Graphs. GD Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
2016	J	`jnl`	Computing NodeTrix Representations of Clustered Graphs. CoRR Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
2016	B	`conf`	How to handle ARP in a software-defined network. NetSoft Roberto di Lallo, Gabriele Lospoto, Massimo Rimondini, Giuseppe Di Battista
2016	J	`jnl`	How to morph planar graph drawings. CoRR 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
2016	A	`conf`	Simultaneous Orthogonal Planarity. GD Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter
2016	J	`jnl`	Simultaneous Orthogonal Planarity. CoRR Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter
2016	B	`conf`	Supporting end-to-end connectivity in federated networks using SDN. NOMS Roberto di Lallo, Gabriele Lospoto, Massimo Rimondini, Giuseppe Di Battista
2016	A*	`conf`	Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. SODA Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter
2015	C	`conf`	Bitconeview: visualization of flows in the bitcoin transaction graph. VizSEC Giuseppe Di Battista, Valentino Di Donato, Maurizio Patrignani, Maurizio Pizzonia, Vincenzo Roselli, Roberto Tamassia
2015	J	`jnl`	Computational complexity of traffic hijacking under BGP and S-BGP. Theor. Comput. Sci. Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani
2015	—	`conf`	Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data. IVAPP Giordano Da Lozzo, Marco Di Bartolomeo, Maurizio Patrignani, Giuseppe Di Battista, Davide Cannone, Sergio Tortora
2015	A	`conf`	Intersection-Link Representations of Graphs. GD Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2015	J	`jnl`	Intersection-Link Representations of Graphs. CoRR Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2015	C	`conf`	Is it really worth to peer at IXPs? A comparative study. ISCC Marco Di Bartolomeo, Giuseppe Di Battista, Roberto di Lallo, Claudio Squarcella
2015	B	`conf`	Making MPLS VPNs manageable through the adoption of SDN. IM Gabriele Lospoto, Massimo Rimondini, Benedetto Gabriele Vignoli, Giuseppe Di Battista
2015	J	`jnl`	On iBGP Routing Policies. IEEE/ACM Trans. Netw. Stefano Vissicchio, Luca Cittadini, Giuseppe Di Battista
2015	A	`conf`	On the Relationship Between Map Graphs and Clique Planar Graphs. GD Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2015	J	`jnl`	Relaxing the constraints of clustered planarity. Comput. Geom. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli
2015	B	`conf`	Rethinking virtual private networks in the software-defined era. IM Gabriele Lospoto, Massimo Rimondini, Benedetto Gabriele Vignoli, Giuseppe Di Battista
2015	J	`jnl`	Testing Cyclic Level and Simultaneous Level Planarity. CoRR Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2015	J	`jnl`	Testing Planarity of Partially Embedded Graphs. ACM Trans. Algorithms Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter
2015	J	`jnl`	The importance of being proper: (In clustered-level planarity and T-level planarity). Theor. Comput. Sci. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli
2015	J	`jnl`	Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. CoRR Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter
2014	J	`jnl`	A Survey on Small-Area Planar Graph Drawing. CoRR Giuseppe Di Battista, Fabrizio Frati
2014	A	`conf`	Advances on Testing C-Planarity of Embedded Flat Clustered Graphs. GD Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein
2014	J	`jnl`	Advances on Testing C-Planarity of Embedded Flat Clustered Graphs. CoRR Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein
2014	A	`conf`	Anchored Drawings of Planar Graphs. GD Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Giuseppe Di Battista, Seok-Hee Hong, Maurizio Patrignani, Vincenzo Roselli
2014	J	`jnl`	Intra-domain routing with pathlets. Comput. Commun. Marco Chiesa, Gabriele Lospoto, Massimo Rimondini, Giuseppe Di Battista
2014	—	`conf`	Morphing Planar Graph Drawings Optimally. ICALP (1) Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli
2014	J	`jnl`	Morphing Planar Graph Drawings Optimally. CoRR Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli
2014	J	`jnl`	On the Complexity of Clustered-Level Planarity and T-Level Planarity. CoRR Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli
2014	A	`conf`	The Importance of Being Proper - (In Clustered-Level Planarity and T-Level Planarity). GD Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli
2014	B	`conf`	Towards an Automated Investigation of the Impact of BGP Routing Changes on Network Delay Variations. PAM Massimo Rimondini, Claudio Squarcella, Giuseppe Di Battista
2014	J	`jnl`	Visual discovery of the correlation between BGP routing and round-trip delay active measurements. Computing Giordano Da Lozzo, Giuseppe Di Battista, Claudio Squarcella
2013	—	`ch.`	Computer Networks. Handbook of Graph Drawing and Visualization Giuseppe Di Battista, Massimo Rimondini
2013	A	`conf`	Dynamic Traceroute Visualization at Multiple Abstraction Levels. GD Massimo Candela, Marco Di Bartolomeo, Giuseppe Di Battista, Claudio Squarcella
2013	J	`jnl`	From BGP to RTT and Beyond: Matching BGP Routing Changes and Network Delay Variations with an Eye on Traceroute Paths. CoRR Massimo Rimondini, Claudio Squarcella, Giuseppe Di Battista
2013	—	`ch.`	GDToolkit. Handbook of Graph Drawing and Visualization Giuseppe Di Battista, Walter Didimo
2013	J	`jnl`	Intra-Domain Pathlet Routing CoRR Giuseppe Di Battista, Marco Chiesa, Gabriele Lospoto, Massimo Rimondini
2013	B	`conf`	Intra-Domain Pathlet Routing. ICCCN Marco Chiesa, Gabriele Lospoto, Massimo Rimondini, Giuseppe Di Battista
2013	A*	`conf`	Morphing Planar Graph Drawings with a Polynomial Number of Steps. SODA Soroush Alamdari, Patrizio Angelini, Timothy M. Chan, Giuseppe Di Battista, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson
2013	J	`jnl`	On the Queue Number of Planar Graphs. SIAM J. Comput. Giuseppe Di Battista, Fabrizio Frati, János Pach
2013	J	`jnl`	Simultaneous Embedding of Embedded Planar graphs. Int. J. Comput. Geom. Appl. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati
2013	J	`jnl`	Strip Planarity Testing of Embedded Planar Graphs. CoRR Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati
2013	A	`conf`	Strip Planarity Testing. GD Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati
2013	J	`jnl`	Topological morphing of planar graphs. Theor. Comput. Sci. Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani
2013	B	`conf`	Using routers to build logic circuits: How powerful is BGP? ICNP Marco Chiesa, Luca Cittadini, Giuseppe Di Battista, Laurent Vanbever, Stefano Vissicchio
2012	J	`jnl`	Beyond Clustered Planarity CoRR Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli
2012	J	`jnl`	Computational Complexity of Traffic Hijacking under BGP and S-BGP CoRR Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani
2012	—	`conf`	Computational Complexity of Traffic Hijacking under BGP and S-BGP. ICALP (2) Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani
2012	J	`jnl`	Drawing Graphs on a Smartphone. J. Graph Algorithms Appl. Giordano Da Lozzo, Giuseppe Di Battista, Francesco Ingrassia
2012	J	`jnl`	Drawing trees in a streaming model. Inf. Process. Lett. Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina A. Zweig
2012	J	`jnl`	Guest Editor's Introduction: Special Section on the IEEE Pacific Visualization Symposium. IEEE Trans. Vis. Comput. Graph. Giuseppe Di Battista, Jean-Daniel Fekete, Huamin Qu
2012	J	`jnl`	How to Visualize the K-root Name Server. J. Graph Algorithms Appl. Giuseppe Di Battista, Claudio Squarcella, Wolfgang Nagele
2012	A	`conf`	Implementing a Partitioned 2-Page Book Embedding Testing Algorithm. GD Patrizio Angelini, Marco Di Bartolomeo, Giuseppe Di Battista
2012	J	`jnl`	Implementing a Partitioned 2-page Book Embedding Testing Algorithm CoRR Patrizio Angelini, Marco Di Bartolomeo, Giuseppe Di Battista
2012	B	`conf`	Monitoring the status of MPLS VPN and VPLS based on BGP signaling information. NOMS Giuseppe Di Battista, Massimo Rimondini, Giorgio Sadolfo
2012	J	`jnl`	Monotone Drawings of Graphs. J. Graph Algorithms Appl. Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
2012	J	`jnl`	Nonconvex Representations of Plane Graphs. SIAM J. Discret. Math. Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
2012	J	`jnl`	On the stability of interdomain routing. ACM Comput. Surv. Luca Cittadini, Giuseppe Di Battista, Massimo Rimondini
2012	J	`jnl`	Succinct greedy drawings do not always exist. Networks Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati
2012	J	`jnl`	Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. J. Discrete Algorithms Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2012	J	`jnl`	The Shape of Orthogonal Cycles in Three Dimensions. Discret. Comput. Geom. Giuseppe Di Battista, Ethan Kim, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
2012	J	`jnl`	Visualization Applications and Design Studies [Guest editors' introduction]. IEEE Computer Graphics and Applications Giuseppe Di Battista, Jean-Daniel Fekete, Huamin Qu
2011	J	`jnl`	Finding a Minimum-depth Embedding of a Planar Graph in Algorithmica Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani
2011	J	`jnl`	From Theory to Practice: Efficiently Checking BGP Configurations for Guaranteed Convergence. IEEE Trans. Netw. Serv. Manag. Luca Cittadini, Massimo Rimondini, Stefano Vissicchio, Matteo Corea, Giuseppe Di Battista
2011	A	`conf`	How to Visualize the K-Root Name Server (Demo). GD Giuseppe Di Battista, Claudio Squarcella, Wolfgang Nagele
2011	B	`ed.`	IEEE Pacific Visualization Symposium, PacificVis 2011, Hong Kong, China, 1-4 March, 2011 PacificVis Giuseppe Di Battista, Jean-Daniel Fekete, Huamin Qu
2011	—	`conf`	Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area. EGC Patrizio Angelini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Anna Lubiw
2011	A*	`conf`	Local transit policies and the complexity of BGP Stability Testing. INFOCOM Marco Chiesa, Luca Cittadini, Giuseppe Di Battista, Stefano Vissicchio
2011	J	`jnl`	On the Perspectives Opened by Right Angle Crossing Drawings. J. Graph Algorithms Appl. Patrizio Angelini, Luca Cittadini, Walter Didimo, Fabrizio Frati, Giuseppe Di Battista, Michael Kaufmann, Antonios Symvonis
2011	B	`conf`	Preface. PacificVis Giuseppe Di Battista, Jean-Daniel Fekete, Huamin Qu
2011	B	`conf`	Simultaneous Embedding of Embedded Planar Graphs. ISAAC Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati
2011	A	`conf`	Small Point Sets for Simply-Nested Planar Graphs. GD Patrizio Angelini, Giuseppe Di Battista, Michael Kaufmann, Tamara Mchedlidze, Vincenzo Roselli, Claudio Squarcella
2011	J	`jnl`	Wheel + ring = reel: the impact of route filtering on the stability of policy routing. IEEE/ACM Trans. Netw. Luca Cittadini, Giuseppe Di Battista, Massimo Rimondini, Stefano Vissicchio
2010	B	`conf`	Assigning AS relationships to satisfy the Gao-Rexford conditions. ICNP Luca Cittadini, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani, Massimo Rimondini
2010	B	`conf`	Doing don'ts: Modifying BGP attributes within an autonomous system. NOMS Luca Cittadini, Stefano Vissicchio, Giuseppe Di Battista
2010	A	`conf`	Drawing Graphs on a Smartphone. GD Giordano Da Lozzo, Giuseppe Di Battista, Francesco Ingrassia
2010	A	`conf`	Monotone Drawings of Graphs. GD Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
2010	A*	`conf`	On the Queue Number of Planar Graphs. FOCS Giuseppe Di Battista, Fabrizio Frati, János Pach
2010	A*	`conf`	Testing Planarity of Partially Embedded Graphs. SODA Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter
2010	C	`conf`	Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree. IWOCA Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2009	A	`conf`	Drawing Trees in a Streaming Model. GD Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina A. Zweig
2009	J	`jnl`	Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. J. Graph Algorithms Appl. Giuseppe Di Battista, Fabrizio Frati
2009	J	`jnl`	How to draw a clustered tree. J. Discrete Algorithms Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati
2009	—	`conf`	Measuring Route Diversity in the Internet from Remote Vantage Points. ICN Andrea Di Menna, Tiziana Refice, Luca Cittadini, Giuseppe Di Battista
2009	J	`jnl`	On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. Theory Comput. Syst. Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
2009	J	`jnl`	On embedding a cycle in a plane graph. Discret. Math. Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia
2009	A	`conf`	On the Perspectives Opened by Right Angle Crossing Drawings. GD Patrizio Angelini, Luca Cittadini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Michael Kaufmann, Antonios Symvonis
2009	—	`conf`	On the feasibility of static analysis for BGP convergence. Integrated Network Management Luca Cittadini, Massimo Rimondini, Matteo Corea, Giuseppe Di Battista
2009	J	`jnl`	Small Area Drawings of Outerplanar Graphs. Algorithmica Giuseppe Di Battista, Fabrizio Frati
2009	A	`conf`	Succinct Greedy Drawings Do Not Always Exist. GD Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati
2009	B	`conf`	Wheel + Ring = Reel: the Impact of Route Filtering on the Stability of Policy Routing. ICNP Luca Cittadini, Giuseppe Di Battista, Massimo Rimondini, Stefano Vissicchio
2008	B	`conf`	(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective. WG Luca Cittadini, Giuseppe Di Battista, Massimo Rimondini
2008	J	`jnl`	C-Planarity of C-Connected Clustered Graphs. J. Graph Algorithms Appl. Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Maurizio Pizzonia
2008	C	`conf`	Measuring and visualizing interdomain routing dynamics with BGPATH. ISCC Luca Cittadini, Tiziana Refice, Alessio Campisano, Giuseppe Di Battista, Claudio Sasso
2008	A	`conf`	Non-convex Representations of Graphs. GD Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
2008	A	`conf`	Policy-Aware Visualization of Internet Dynamics. GD Luca Cittadini, Tiziana Refice, Alessio Campisano, Giuseppe Di Battista, Claudio Sasso
2008	A	`conf`	Topological Morphing of Planar Graphs. GD Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani
2008	B	`conf`	Tracking back the root cause of a path change in interdomain routing. NOMS Alessio Campisano, Luca Cittadini, Giuseppe Di Battista, Tiziana Refice, Claudio Sasso
2007	B	`conf`	Authenticated Relational Tables and Authenticated Skip Lists. DBSec Giuseppe Di Battista, Bernardo Palazzi
2007	B	`conf`	Computing a Minimum-Depth Planar Graph Embedding in WADS Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani
2007	J	`jnl`	Computing the types of the relationships between autonomous systems. IEEE/ACM Trans. Netw. Giuseppe Di Battista, Thomas Erlebach, Alexander Hall, Maurizio Patrignani, Maurizio Pizzonia, Thomas Schank
2007	A	`conf`	Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. GD Giuseppe Di Battista, Fabrizio Frati
2007	B	`conf`	How to Draw a Clustered Tree. WADS Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati
2007	J	`jnl`	Investigating prefix propagation through active BGP probing. Microprocess. Microsystems Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia, Massimo Rimondini
2007	Misc	`conf`	On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. FUN Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
2006	—	`conf`	How to extract BGP peering information from the internet routing registry. MineNet Giuseppe Di Battista, Tiziana Refice, Massimo Rimondini
2006	C	`conf`	Investigating Prefix Propagation through Active BGP Probing. ISCC Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia, Massimo Rimondini
2006	—	`conf`	On the Topologies of Local Minimum Spanning Trees. CAAN Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Katharina Anna Lehmann, Giuseppe Liotta, Maurizio Patrignani, Ioannis G. Tollis, Francesco Trotta
2006	J	`jnl`	The strength of weak proximity. J. Discrete Algorithms Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides
2006	A	`conf`	Three-Dimensional Drawings of Bounded Degree Trees. GD Fabrizio Frati, Giuseppe Di Battista
2006	J	`jnl`	Topographic Visualization of Prefix Propagation in the Internet. IEEE Trans. Vis. Comput. Graph. Pier Francesco Cortese, Giuseppe Di Battista, Antonello Moneta, Maurizio Patrignani, Maurizio Pizzonia
2005	—	`conf`	Clustered planarity. SCG Pier Francesco Cortese, Giuseppe Di Battista
2005	J	`jnl`	Clustering Cycles into Cycles of Clusters. J. Graph Algorithms Appl. Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia
2005	A	`conf`	On Embedding a Cycle in a Plane Graph. GD Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia
2005	A	`conf`	Small Area Drawings of Outerplanar Graphs. GD Giuseppe Di Battista, Fabrizio Frati
2005	J	`jnl`	Visualizing Interdomain Routing with BGPlay. J. Graph Algorithms Appl. Lorenzo Colitti, Giuseppe Di Battista, Federico Mariani, Maurizio Patrignani, Maurizio Pizzonia
2004	A	`conf`	Clustering Cycles into Cycles of Clusters. GD Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia
2004	—	`ch.`	DBdraw - Automatic Layout of Relational Database Schemas. Graph Drawing Software Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
2004	—	`conf`	Discovering IPv6-in-IPv4 tunnels in the Internet. NOMS (1) Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani
2004	J	`jnl`	IPv6-in-IPv4 Tunnel Discovery: Methods and Experimental Results. IEEE Trans. Netw. Serv. Manag. Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani
2004	—	`ch.`	Polyphemus and Hermes - Exploration and Visualization of Computer Networks. Graph Drawing Software Gabriele Barbagallo, Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Maurizio Pizzonia
2003	A	`ed.`	Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings ESA Giuseppe Di Battista, Uri Zwick
2003	A	`conf`	BGPlay: A System for Visualizing the Interdomain Routing Evolution. GD Giuseppe Di Battista, Federico Mariani, Maurizio Patrignani, Maurizio Pizzonia
2003	A*	`conf`	Computing the Types of the Relationships between Autonomous Systems. INFOCOM Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia
2003	A	`conf`	Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm. GD John M. Boyer, Pier Francesco Cortese, Maurizio Patrignani, Giuseppe Di Battista
2002	J	`jnl`	Drawing database schemas. Softw. Pract. Exp. Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
2002	J	`jnl`	Embedding problems for paths with direction constrained edges. Theor. Comput. Sci. Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
2002	J	`jnl`	Quasi-Upward Planarity. Algorithmica Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo
2002	J	`jnl`	Visualization of the High Level Structure of the Internet with HERMES. J. Graph Algorithms Appl. Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Francesco Matera, Maurizio Pizzonia
2001	A	`conf`	Drawing Database Schemas with DBdraw. GD Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
2001	A	`conf`	Exploration and Visualization of Computer Networks: Polyphemus and Hermes. GD Gabriele Barbagallo, Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Maurizio Pizzonia
2001	J	`jnl`	Incremental Convex Planarity Testing. Inf. Comput. Giuseppe Di Battista, Roberto Tamassia, Luca Vismara
2001	A	`conf`	Planarization of Clustered Graphs. GD Giuseppe Di Battista, Walter Didimo, A. Marcandalli
2000	J	`jnl`	A Split & Push Approach to 3D Orthogonal Drawing. J. Graph Algorithms Appl. Giuseppe Di Battista, Maurizio Patrignani, Francesco Vargiu
2000	J	`jnl`	Computing Orthogonal Drawings with the Minimum Number of Bends. IEEE Trans. Computers Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo
2000	J	`jnl`	Drawing Directed Acyclic Graphs: An Experimental Study. Int. J. Comput. Geom. Appl. Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Armando Parise, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, Luca Vismara
2000	—	`conf`	Drawing Relational Schemas. VisSym Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
2000	Misc	`conf`	Embedding Problems for Paths with Direction Constrained Edges. COCOON Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
2000	J	`jnl`	Experimental studies on graph drawing algorithms. Softw. Pract. Exp. Luca Vismara, Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Francesco Vargiu
2000	A	`conf`	Orthogonal Drawings of Cycles in 3D Space (Extended Abstract). GD Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
2000	J	`jnl`	Turn-regularity and optimal area drawings of orthogonal representations. Comput. Geom. Stina S. Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara
2000	A	`conf`	Visualization of the Autonomous Systems Interconnections with HERMES. GD Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Francesco Matera, Maurizio Pizzonia
1999	—	`book`	Graph Drawing: Algorithms for the Visualization of Graphs Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis
1999	J	`jnl`	Guest Editors' Introduction. J. Graph Algorithms Appl. Giuseppe Di Battista, Petra Mutzel
1999	A	`conf`	Infinite Trees and the Future. GD Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia
1999	A	`conf`	Object-Oriented Design of Graph Oriented Data Structures. ALENEX Maurizio Pizzonia, Giuseppe Di Battista
1999	A	`conf`	Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size. GD Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
1999	J	`jnl`	Output-Sensitive Reporting of Disjoint Paths. Algorithmica Giuseppe Di Battista, Roberto Tamassia, Luca Vismara
1999	A	`conf`	Turn-Regularity and Planar Orthogonal Drawings. GD Stina S. Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara
1998	A	`conf`	A Split&Push Approach to 3D Orthogonal Drawing. GD Giuseppe Di Battista, Maurizio Patrignani, Francesco Vargiu
1998	J	`jnl`	Object-Oriented Design of Graph Oriented Data Structures CoRR Maurizio Pizzonia, Giuseppe Di Battista
1998	J	`jnl`	Optimal Upward Planarity Testing of Single-Source Digraphs. SIAM J. Comput. Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia
1998	A	`conf`	Ptolomaeus: The Web Cartographer. GD Giuseppe Di Battista, Renato Lillo, Fabio Vernacotola
1998	A	`conf`	Quasi-Upward Planarity. GD Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo
1998	J	`jnl`	Spirality and Optimal Orthogonal Drawings. SIAM J. Comput. Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu
1998	A	`conf`	Upward Planarity Checking: "Faces Are More than Polygons". GD Giuseppe Di Battista, Giuseppe Liotta
1997	C	`ed.`	Algorithms and Complexity, Third Italian Conference, CIAC '97, Rome, Italy, March 12-14, 1997, Proceedings CIAC Gian Carlo Bongiovanni, Daniel P. Bovet, Giuseppe Di Battista
1997	J	`jnl`	An Experimental Comparison of Four Graph Drawing Algorithms. Comput. Geom. Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu
1997	B	`conf`	Computing Orthogonal Drawings with the Minimum Number of Bends. WADS Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo
1997	A	`ed.`	Graph Drawing, 5th International Symposium, GD '97, Rome, Italy, September 18-20, 1997, Proceedings GD Giuseppe Di Battista
1996	J	`jnl`	Angles of Planar Triangular Graphs. SIAM J. Discret. Math. Giuseppe Di Battista, Luca Vismara
1996	A	`conf`	Drawing Directed Acyclic Graphs: An Experimental Study. GD Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Armando Parise, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, Luca Vismara
1996	J	`jnl`	Guest Editors' Introduction to the Special Issue on Graph Drwaing. Algorithmica Giuseppe Di Battista, Roberto Tamassia
1996	J	`jnl`	On-Line Maintenance of Triconnected Components with SPQR-Trees. Algorithmica Giuseppe Di Battista, Roberto Tamassia
1996	J	`jnl`	On-Line Planarity Testing. SIAM J. Comput. Giuseppe Di Battista, Roberto Tamassia
1996	Misc	`conf`	Output-Sensitive Reporting of Disjoint Paths (Extended Abstract). COCOON Giuseppe Di Battista, Roberto Tamassia, Luca Vismara
1995	—	`conf`	An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract). SCG Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu
1995	B	`conf`	Computing Proximity Drawings of Trees in the 3-Dimemsional Space. WADS Giuseppe Liotta, Giuseppe Di Battista
1995	J	`jnl`	Diagram Server. J. Vis. Lang. Comput. Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu
1995	J	`jnl`	Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs. SIAM J. Comput. Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis
1995	A	`conf`	GD-Workbench: A System for Prototyping and Testing Graph Drawing Algorithms. GD Luciano Buti, Giuseppe Di Battista, Giuseppe Liotta, Emanuele Tassinari, Francesco Vargiu, Luca Vismara
1995	J	`jnl`	Parametric Graph Drawing. IEEE Trans. Software Eng. Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta
1995	A	`conf`	The Strength of Weak Proximity. GD Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides
1994	J	`jnl`	Algorithms for Drawing Graphs: an Annotated Bibliography. Comput. Geom. Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis
1994	J	`jnl`	How to Draw a Series-Parallel Digraph. Int. J. Comput. Geom. Appl. Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis
1994	B	`conf`	On-Line Convex Plabarity Testing. WG Giuseppe Di Battista, Roberto Tamassia, Luca Vismara
1994	—	`conf`	Orthogonal Drawings with the Minimum Number of Bends. CCCG Giuseppe Liotta, Francesco Vargiu, Giuseppe Di Battista
1994	A	`conf`	Proximity Constraints and Representable Trees. GD Prosenjit Bose, Giuseppe Di Battista, William J. Lenhart, Giuseppe Liotta
1994	A	`conf`	Proximity Drawability: a Survey. GD Giuseppe Di Battista, William J. Lenhart, Giuseppe Liotta
1994	J	`jnl`	Upward Drawings of Triconnected Digraphs. Algorithmica Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta, Carlo Mannino
1993	A*	`conf`	Angles of planar triangular graphs. STOC Giuseppe Di Battista, Luca Vismara
1993	J	`jnl`	Area requirements (abstract). SIGACT News Giuseppe Di Battista
1993	J	`jnl`	Deductive Entity-Relationship Modeling. IEEE Trans. Knowl. Data Eng. Giuseppe Di Battista, Maurizio Lenzerini
1993	A	`conf`	Multilevel Schema Integration. ER Giuseppe Santucci, Carlo Batini, Giuseppe Di Battista
1993	A	`conf`	Optimal Upward Planarity Testing of Single-Source Digraphs. ESA Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia
1993	A*	`conf`	Reinventing the wheel: an optimal data structure for connectivity queries. STOC Robert F. Cohen, Giuseppe Di Battista, Arkady Kanevsky, Roberto Tamassia
1993	B	`conf`	Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-Planar Graphs (Extended Abstract). WADS Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu
1993	J	`jnl`	Structuring Primitives for a Dictionary of Entity Relationship Data Schemas. IEEE Trans. Software Eng. Carlo Batini, Giuseppe Di Battista, Giuseppe Santucci
1992	C	`conf`	A Formal Framework for Multilevel Schema Documentation in a Data Dictionary. ISCO Carlo Batini, Giuseppe Di Battista, Giuseppe Santucci
1992	—	`conf`	A Framework for Dynamic Graph Drawing. SCG Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis, Paola Bertolazzi
1992	J	`jnl`	A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees. Comput. Geom. Pierluigi Crescenzi, Giuseppe Di Battista, Adolfo Piperno
1992	J	`jnl`	Area Requirement and Symmetry Display of Planar Upward Drawings. Discret. Comput. Geom. Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis
1992	J	`jnl`	Constrained Visibility Representations of Graphs. Inf. Process. Lett. Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis
1992	B	`conf`	Diagram Server. Advanced Visual Interfaces Giuseppe Di Battista, Giuseppe Liotta, M. Strani, Francesco Vargiu
1992	—	`conf`	How to Draw a Series-Parallel Digraph (Extended Abstract). SWAT Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis
1991	—	`conf`	A Tailorable and Extensible Automatic Layout Facility. VL Massimiliano Beccaria, Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta
1991	—	`conf`	On Upward Drawing Testing of Triconnected Digraphs (Extended Abstract). SCG Paola Bertolazzi, Giuseppe Di Battista
1991	A*	`conf`	On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract) FOCS Arkady Kanevsky, Roberto Tamassia, Giuseppe Di Battista, Jianer Chen
1990	J	`jnl`	Bipartite Graphs, Upward Drawings, and Planarity. Inf. Process. Lett. Giuseppe Di Battista, Wei-Ping Liu, Ivan Rival
1990	A*	`conf`	On-Line Graph Algorithms with SPQR-Trees. ICALP Giuseppe Di Battista, Roberto Tamassia
1990	—	`conf`	The Architecture of Diagram Server. VL Giuseppe Di Battista, Amadeo Giammarco, Giuseppe Santucci, Roberto Tamassia
1989	A*	`conf`	A Deductive Method for Entity-Relationship Modeling. VLDB Giuseppe Di Battista, Maurizio Lenzerini
1989	—	`conf`	Area Requirement and Symmetry Display in Drawing Graphs. SCG Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis
1989	—	`conf`	Automatic layout of PERT diagrams with X-PERT. VL Giuseppe Di Battista, E. Pietrosanti, Roberto Tamassia, Ioannis G. Tollis
1989	J	`jnl`	Definition Libraries for Conceptual Modelling. Data Knowl. Eng. Giuseppe Di Battista, Hannu Kangassalo, Roberto Tamassia
1989	A*	`conf`	Incremental Planarity Testing (Extended Abstract) FOCS Giuseppe Di Battista, Roberto Tamassia
1988	J	`jnl`	A methodology for conceptual documentation and maintenance. Inf. Syst. Carlo Batini, Giuseppe Di Battista
1988	J	`jnl`	Algorithms for Plane Representations of Acyclic Digraphs. Theor. Comput. Sci. Giuseppe Di Battista, Roberto Tamassia
1988	B	`conf`	Automatic Drawing of Statistical Diagrams. SSDBM Giuseppe Di Battista
1988	J	`jnl`	Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern. Roberto Tamassia, Giuseppe Di Battista, Carlo Batini
1988	A	`conf`	Definition Libraries for Conceptual Modelling. ER Giuseppe Di Battista, Hannu Kangassalo, Roberto Tamassia
1988	B	`conf`	Design of Statistical Information Media: Time Performance and Storage Constraints. SSDBM G. Barcaroli, Giuseppe Di Battista, E. Fortunato, C. Leporelli
1988	J	`jnl`	Design of statistical databases: a methodology for the conceptual step. Inf. Syst. Giuseppe Di Battista, Carlo Batini
1988	J	`jnl`	Hierarchies and planarity theory. IEEE Trans. Syst. Man Cybern. Giuseppe Di Battista, Enrico Nardelli
1988	A	`conf`	Object Modeling Based on Logic. ER Giuseppe Di Battista, Maurizio Lenzerini
1987	B	`conf`	Upward Drawings of Acyclic Digraphs. WG Giuseppe Di Battista, Roberto Tamassia
1986	B	`conf`	An Algorithm for Testing Planarity of Hierarchical Graphs. WG Giuseppe Di Battista, Enrico Nardelli