default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiuseppe Di Battista
Person information
- affiliation: Roma Tre University, Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j103]Carla Binucci
, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Graphs Drawn With Some Vertices per Face: Density and Relationships. IEEE Access 12: 68828-68846 (2024)- [j102]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. Eur. J. Comb. 119: 103806 (2024) - [j101]Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. J. Graph Algorithms Appl. 28(2): 1-35 (2024) - [c148]Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista:
Quantum Algorithms for One-Sided Crossing Minimization. GD 2024: 20:1-20:9 - [c147]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. GD 2024: 24:1-24:18 - [c146]Michael A. Bekos, Giuseppe Di Battista, Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Fabrizio Montecchiani:
On the Complexity of Recognizing k^+-Real Face Graphs. GD 2024: 32:1-32:22 - [c145]Giuseppe Di Battista, Fabrizio Grosso, Silvia Montorselli, Maurizio Patrignani:
Treebar Maps: Schematic Representation of Networks at Scale. PacificVis 2024: 132-141 - [c144]Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista:
Quantum Graph Drawing. WALCOM 2024: 32-46 - [c143]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs. WALCOM 2024: 350-364 - [i38]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. CoRR abs/2408.17369 (2024) - [i37]Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista:
Quantum Algorithms for One-Sided Crossing Minimization. CoRR abs/2409.01942 (2024) - 2023
- [j100]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:
Splitting Vertices in 2-Layer Graph Drawings. IEEE Computer Graphics and Applications 43(3): 24-35 (2023) - [j99]Lorenzo Ariemma, Alessandro Dell'Orco, Simone Liotta, Massimo Candela, Giuseppe Di Battista:
Long-lasting sequences of BGP updates. Comput. Networks 220: 109481 (2023) - [j98]Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini:
Small Point-Sets Supporting Graph Stories. J. Graph Algorithms Appl. 27(8): 651-677 (2023) - [c142]Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. GD (1) 2023: 39-52 - [c141]Tommaso Caiazzi, Mariano Scazzariello, Samuele Quinzi, Lorenzo Ariemma, Maurizio Patrignani, Giuseppe Di Battista:
Nesting Containers for Faithful Datacenters Emulations. NOMS 2023: 1-4 - [c140]Carla Binucci, Giuseppe Di Battista, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Nonplanar Graph Drawings with k Vertices per Face. WG 2023: 86-100 - [i36]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:
Splitting Vertices in 2-Layer Graph Drawings. CoRR abs/2301.10872 (2023) - [i35]Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista:
Quantum Graph Drawing. CoRR abs/2307.08371 (2023) - [i34]Giuseppe Di Battista, Fabrizio Grosso, Silvia Montorselli, Maurizio Patrignani:
Treebar Maps: Schematic Representation of Networks at Scale. CoRR abs/2307.12393 (2023) - [i33]Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. CoRR abs/2308.13401 (2023) - [i32]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs. CoRR abs/2310.02247 (2023) - 2022
- [j97]Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
How to Morph a Tree on a Small Grid. Discret. Comput. Geom. 67(3): 743-786 (2022) - [j96]Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter:
On Turn-Regular Orthogonal Representations. J. Graph Algorithms Appl. 26(3): 285-306 (2022) - [c139]Carlos Alegría, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Unit-length Rectangular Drawings of Graphs. GD 2022: 127-143 - [c138]Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini:
Small Point-Sets Supporting Graph Stories. GD 2022: 289-303 - [c137]Tommaso Caiazzi, Mariano Scazzariello, Leonardo Alberro, Lorenzo Ariemma, Alberto Castro, Eduardo Grampín, Giuseppe Di Battista:
Sibyl: a Framework for Evaluating the Implementation of Routing Protocols in Fat-Trees. NOMS 2022: 1-7 - [i31]Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini:
Small Point-Sets Supporting Graph Stories. CoRR abs/2208.14126 (2022) - [i30]Carlos Alegría, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Unit-length Rectangular Drawings of Graphs. CoRR abs/2208.14142 (2022) - 2021
- [j95]Mariano Scazzariello, Lorenzo Ariemma, Giuseppe Di Battista, Maurizio Patrignani:
Megalos: A Scalable Architecture for the Virtualization of Large Network Scenarios. Future Internet 13(9): 227 (2021) - [j94]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais:
Schematic Representation of Large Biconnected Graphs. J. Graph Algorithms Appl. 25(1): 311-352 (2021) - [j93]Habib Mostafaei, Davinder Kumar, Gabriele Lospoto, Marco Chiesa, Giuseppe Di Battista:
DeSI: A Decentralized Software-Defined Network Architecture for Internet Exchange Points. IEEE Trans. Netw. Sci. Eng. 8(3): 2198-2212 (2021) - [c136]Giuseppe Di Battista, Fabrizio Frati:
From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-Line Drawings and Morphs. GD 2021: 109-122 - [c135]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. GD 2021: 166-183 - [c134]Lorenzo Ariemma, Giuseppe Liotta, Massimo Candela, Giuseppe Di Battista:
Long-Lasting Sequences of BGP Updates. PAM 2021: 213-229 - [c133]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees. SODA 2021: 2779-2798 - [i29]Giuseppe Di Battista, Fabrizio Frati:
From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs. CoRR abs/2108.09483 (2021) - [i28]Carlos Alegría, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Planar Straight-line Realizations of 2-Trees with Prescribed Edge Lengths. CoRR abs/2108.12628 (2021) - 2020
- [j92]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Upward Planar Morphs. Algorithmica 82(10): 2985-3017 (2020) - [j91]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Extending upward planar graph drawings. Comput. Geom. 91: 101668 (2020) - [j90]Habib Mostafaei, Gabriele Lospoto, Roberto di Lallo, Massimo Rimondini, Giuseppe Di Battista:
A framework for multi-provider virtual private networks in software-defined federated networks. Int. J. Netw. Manag. 30(6) (2020) - [j89]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:
Simple k-planar graphs are simple (k + 1)-quasiplanar. J. Comb. Theory B 142: 1-35 (2020) - [j88]Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Graph Stories in Small Area. J. Graph Algorithms Appl. 24(3): 269-292 (2020) - [j87]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Beyond level planarity: Cyclic, torus, and simultaneous level planarity. Theor. Comput. Sci. 804: 161-170 (2020) - [j86]Massimo Candela, Giuseppe Di Battista, Luca Marzialetti:
Multi-view routing visualization for the identification of BGP issues. J. Comput. Lang. 58: 100966 (2020) - [c132]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais:
Schematic Representation of Biconnected Graphs. GD 2020: 160-172 - [c131]Emanuele Balloni, Giuseppe Di Battista, Maurizio Patrignani:
A Tipping Point for the Planarity of Small and Medium Sized Graphs. GD 2020: 181-188 - [c130]Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter:
On Turn-Regular Orthogonal Representations. GD 2020: 250-264 - [c129]Mariano Scazzariello, Lorenzo Ariemma, Giuseppe Di Battista, Maurizio Patrignani:
Megalos: A Scalable Architecture for the Virtualization of Network Scenarios. NOMS 2020: 1-7 - [i27]Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter:
On Turn-Regular Orthogonal Representations. CoRR abs/2008.09002 (2020) - [i26]Emanuele Balloni, Giuseppe Di Battista, Maurizio Patrignani:
A Tipping Point for the Planarity of Small and Medium Sized Graphs. CoRR abs/2008.09405 (2020) - [i25]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais:
Schematic Representation of Large Biconnected Graphs. CoRR abs/2008.09414 (2020) - [i24]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees. CoRR abs/2011.02431 (2020)
2010 – 2019
- 2019
- [j85]Mattia Iodice, Massimo Candela, Giuseppe Di Battista:
Periodic Path Changes in RIPE Atlas. IEEE Access 7: 65518-65526 (2019) - [j84]Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein:
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs. Int. J. Found. Comput. Sci. 30(2): 197-230 (2019) - [c128]Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
How to Morph a Tree on a Small Grid. WADS 2019: 57-70 - [c127]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Extending Upward Planar Graph Drawings. WADS 2019: 339-352 - [i23]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Extending Upward Planar Graph Drawings. CoRR abs/1902.06575 (2019) - [i22]Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Graph Stories in Small Area. CoRR abs/1908.09318 (2019) - [i21]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:
Simple k-Planar Graphs are Simple (k+1)-Quasiplanar. CoRR abs/1909.00223 (2019) - [i20]Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
How to Morph a Tree on a Small Grid. CoRR abs/1909.07093 (2019) - 2018
- [j83]Patrizio Angelini, Till Bruckdorfer, Giuseppe Di Battista, Michael Kaufmann, Tamara Mchedlidze, Vincenzo Roselli, Claudio Squarcella:
Small Universal Point Sets for k-Outerplanar Graphs. Discret. Comput. Geom. 60(2): 430-470 (2018) - [j82]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Computing NodeTrix Representations of Clustered Graphs. J. Graph Algorithms Appl. 22(2): 139-176 (2018) - [j81]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter:
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. ACM Trans. Algorithms 14(4): 54:1-54:24 (2018) - [j80]Massimo Candela, Marco Di Bartolomeo, Giuseppe Di Battista, Claudio Squarcella:
Radian: Visual Exploration of Traceroutes. IEEE Trans. Vis. Comput. Graph. 24(7): 2194-2208 (2018) - [c126]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Upward Planar Morphs. GD 2018: 92-105 - [c125]Gaetano Bonofiglio, Veronica Iovinella, Gabriele Lospoto, Giuseppe Di Battista:
Kathará: A container-based framework for implementing network function virtualization and software defined networks. NOMS 2018: 1-9 - [c124]Luca Marzialetti, Massimo Candela, Giuseppe Di Battista:
Upstream Visibility: A Multi-View Routing Visualization. VINCI 2018: 80-87 - [i19]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Upward Planar Morphs. CoRR abs/1808.10826 (2018) - 2017
- [j79]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Strip Planarity Testing for Embedded Planar Graphs. Algorithmica 77(4): 1022-1059 (2017) - [j78]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. J. Graph Algorithms Appl. 21(4): 731-755 (2017) - [j77]Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
How to Morph Planar Graph Drawings. SIAM J. Comput. 46(2): 824-852 (2017) - [c123]Giuseppe Di Battista, Valentino Di Donato, Maurizio Pizzonia:
Long Transaction Chains and the Bitcoin Heartbeat. Euro-Par Workshops 2017: 507-516 - [c122]Marco Chiesa, Roberto di Lallo, Gabriele Lospoto, Habib Mostafaei, Massimo Rimondini, Giuseppe Di Battista:
PrIXP: Preserving the privacy of routing policies at Internet eXchange Points. IM 2017: 435-441 - [c121]Habib Mostafaei, Gabriele Lospoto, Andrea Brandimartey, Roberto di Lallo, Massimo Rimondini, Giuseppe Di Battista:
SDNS: Exploiting SDN and the DNS to exchange traffic in a federated network. NetSoft 2017: 1-5 - [c120]Habib Mostafaei, Gabriele Lospoto, Roberto di Lallo, Massimo Rimondini, Giuseppe Di Battista:
SDNetkit: A testbed for experimenting SDN in multi-domain networks. NetSoft 2017: 1-6 - [c119]Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter:
On the Relationship Between k-Planar and k-Quasi-Planar Graphs. WG 2017: 59-74 - [i18]Mattia Iodice, Massimo Candela, Giuseppe Di Battista:
The Internet Pendulum: On the periodicity of Internet Topology Measurements. CoRR abs/1709.05969 (2017) - 2016
- [c118]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Computing NodeTrix Representations of Clustered Graphs. GD 2016: 107-120 - [c117]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Beyond Level Planarity. GD 2016: 482-495 - [c116]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter:
Simultaneous Orthogonal Planarity. GD 2016: 532-545 - [c115]Roberto di Lallo, Gabriele Lospoto, Massimo Rimondini, Giuseppe Di Battista:
How to handle ARP in a software-defined network. NetSoft 2016: 63-67 - [c114]Roberto di Lallo, Gabriele Lospoto, Massimo Rimondini, Giuseppe Di Battista:
Supporting end-to-end connectivity in federated networks using SDN. NOMS 2016: 759-762 - [c113]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter:
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. SODA 2016: 985-996 - [i17]Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
How to morph planar graph drawings. CoRR abs/1606.00425 (2016) - [i16]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter:
Simultaneous Orthogonal Planarity. CoRR abs/1608.08427 (2016) - [i15]Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Computing NodeTrix Representations of Clustered Graphs. CoRR abs/1608.08952 (2016) - 2015
- [j76]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Relaxing the constraints of clustered planarity. Comput. Geom. 48(2): 42-75 (2015) - [j75]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter:
Testing Planarity of Partially Embedded Graphs. ACM Trans. Algorithms 11(4): 32:1-32:42 (2015) - [j74]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli:
The importance of being proper: (In clustered-level planarity and T-level planarity). Theor. Comput. Sci. 571: 1-9 (2015) - [j73]Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani:
Computational complexity of traffic hijacking under BGP and S-BGP. Theor. Comput. Sci. 600: 143-154 (2015) - [j72]Stefano Vissicchio, Luca Cittadini, Giuseppe Di Battista:
On iBGP Routing Policies. IEEE/ACM Trans. Netw. 23(1): 227-240 (2015) - [c112]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. GD 2015: 217-230 - [c111]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
On the Relationship Between Map Graphs and Clique Planar Graphs. GD 2015: 548-550 - [c110]Giordano Da Lozzo, Marco Di Bartolomeo, Maurizio Patrignani, Giuseppe Di Battista, Davide Cannone, Sergio Tortora:
Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data. IVAPP 2015: 109-116 - [c109]Gabriele Lospoto, Massimo Rimondini, Benedetto Gabriele Vignoli, Giuseppe Di Battista:
Rethinking virtual private networks in the software-defined era. IM 2015: 379-387 - [c108]Gabriele Lospoto, Massimo Rimondini, Benedetto Gabriele Vignoli, Giuseppe Di Battista:
Making MPLS VPNs manageable through the adoption of SDN. IM 2015: 1155-1156 - [c107]Marco Di Bartolomeo, Giuseppe Di Battista, Roberto di Lallo, Claudio Squarcella:
Is it really worth to peer at IXPs? A comparative study. ISCC 2015: 421-426 - [c106]Giuseppe Di Battista, Valentino Di Donato, Maurizio Patrignani, Maurizio Pizzonia, Vincenzo Roselli, Roberto Tamassia:
Bitconeview: visualization of flows in the bitcoin transaction graph. VizSEC 2015: 1-8 - [i14]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. CoRR abs/1508.07557 (2015) - [i13]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter:
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. CoRR abs/1510.02659 (2015) - [i12]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Testing Cyclic Level and Simultaneous Level Planarity. CoRR abs/1510.08274 (2015) - 2014
- [j71]Marco Chiesa, Gabriele Lospoto, Massimo Rimondini, Giuseppe Di Battista:
Intra-domain routing with pathlets. Comput. Commun. 46: 76-86 (2014) - [j70]Giordano Da Lozzo, Giuseppe Di Battista, Claudio Squarcella:
Visual discovery of the correlation between BGP routing and round-trip delay active measurements. Computing 96(1): 67-77 (2014) - [c105]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli:
The Importance of Being Proper - (In Clustered-Level Planarity and T-Level Planarity). GD 2014: 246-258 - [c104]Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Giuseppe Di Battista, Seok-Hee Hong, Maurizio Patrignani, Vincenzo Roselli:
Anchored Drawings of Planar Graphs. GD 2014: 404-415 - [c103]Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein:
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs. GD 2014: 416-427 - [c102]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graph Drawings Optimally. ICALP (1) 2014: 126-137 - [c101]Massimo Rimondini, Claudio Squarcella, Giuseppe Di Battista:
Towards an Automated Investigation of the Impact of BGP Routing Changes on Network Delay Variations. PAM 2014: 193-203 - [i11]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graph Drawings Optimally. CoRR abs/1402.4364 (2014) - [i10]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli:
On the Complexity of Clustered-Level Planarity and T-Level Planarity. CoRR abs/1406.6533 (2014) - [i9]Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein:
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs. CoRR abs/1408.2595 (2014) - [i8]Giuseppe Di Battista, Fabrizio Frati:
A Survey on Small-Area Planar Graph Drawing. CoRR abs/1410.1006 (2014) - 2013
- [j69]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati:
Simultaneous Embedding of Embedded Planar graphs. Int. J. Comput. Geom. Appl. 23(2): 93-126 (2013) - [j68]Giuseppe Di Battista, Fabrizio Frati, János Pach:
On the Queue Number of Planar Graphs. SIAM J. Comput. 42(6): 2243-2285 (2013) - [j67]Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani:
Topological morphing of planar graphs. Theor. Comput. Sci. 514: 2-20 (2013) - [c100]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Strip Planarity Testing. GD 2013: 37-48 - [c99]Massimo Candela, Marco Di Bartolomeo, Giuseppe Di Battista, Claudio Squarcella:
Dynamic Traceroute Visualization at Multiple Abstraction Levels. GD 2013: 496-507 - [c98]Marco Chiesa, Gabriele Lospoto, Massimo Rimondini, Giuseppe Di Battista:
Intra-Domain Pathlet Routing. ICCCN 2013: 1-9 - [c97]Marco Chiesa, Luca Cittadini, Giuseppe Di Battista, Laurent Vanbever, Stefano Vissicchio:
Using routers to build logic circuits: How powerful is BGP? ICNP 2013: 1-10 - [c96]Soroush Alamdari, Patrizio Angelini, Timothy M. Chan, Giuseppe Di Battista, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
Morphing Planar Graph Drawings with a Polynomial Number of Steps. SODA 2013: 1656-1667 - [r2]Giuseppe Di Battista, Walter Didimo:
GDToolkit. Handbook of Graph Drawing and Visualization 2013: 571-597 - [r1]Giuseppe Di Battista, Massimo Rimondini:
Computer Networks. Handbook of Graph Drawing and Visualization 2013: 763-803 - [i7]Giuseppe Di Battista, Marco Chiesa, Gabriele Lospoto, Massimo Rimondini:
Intra-Domain Pathlet Routing. CoRR abs/1302.5414 (2013) - [i6]Massimo Rimondini, Claudio Squarcella, Giuseppe Di Battista:
From BGP to RTT and Beyond: Matching BGP Routing Changes and Network Delay Variations with an Eye on Traceroute Paths. CoRR abs/1309.0632 (2013) - [i5]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Strip Planarity Testing of Embedded Planar Graphs. CoRR abs/1309.0683 (2013) - 2012
- [j66]Giuseppe Di Battista, Jean-Daniel Fekete, Huamin Qu:
Visualization Applications and Design Studies [Guest editors' introduction]. IEEE Computer Graphics and Applications 32(1): 20-21 (2012) - [j65]Luca Cittadini, Giuseppe Di Battista, Massimo Rimondini:
On the stability of interdomain routing. ACM Comput. Surv. 44(4): 26:1-26:40 (2012) - [j64]Giuseppe Di Battista, Ethan Kim, Giuseppe Liotta, Anna Lubiw, Sue Whitesides:
The Shape of Orthogonal Cycles in Three Dimensions. Discret. Comput. Geom. 47(3): 461-491 (2012) - [j63]Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig:
Drawing trees in a streaming model. Inf. Process. Lett. 112(11): 418-422 (2012) - [j62]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. J. Discrete Algorithms 14: 150-172 (2012) - [j61]Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Monotone Drawings of Graphs. J. Graph Algorithms Appl. 16(1): 5-35 (2012) - [j60]Giordano Da Lozzo, Giuseppe Di Battista, Francesco Ingrassia:
Drawing Graphs on a Smartphone. J. Graph Algorithms Appl. 16(1): 109-126 (2012) - [j59]Giuseppe Di Battista, Claudio Squarcella, Wolfgang Nagele:
How to Visualize the K-root Name Server. J. Graph Algorithms Appl. 16(3): 675-699 (2012) - [j58]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati:
Succinct greedy drawings do not always exist. Networks 59(3): 267-274 (2012) - [j57]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Nonconvex Representations of Plane Graphs. SIAM J. Discret. Math. 26(4): 1670-1681 (2012) - [j56]Giuseppe Di Battista, Jean-Daniel Fekete, Huamin Qu:
Guest Editor's Introduction: Special Section on the IEEE Pacific Visualization Symposium. IEEE Trans. Vis. Comput. Graph. 18(9): 1381-1382 (2012) - [c95]Patrizio Angelini, Marco Di Bartolomeo, Giuseppe Di Battista:
Implementing a Partitioned 2-Page Book Embedding Testing Algorithm. GD 2012: 79-89 - [c94]Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani:
Computational Complexity of Traffic Hijacking under BGP and S-BGP. ICALP (2) 2012: 476-487 - [c93]Giuseppe Di Battista, Massimo Rimondini, Giorgio Sadolfo:
Monitoring the status of MPLS VPN and VPLS based on BGP signaling information. NOMS 2012: 237-244 - [i4]Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani:
Computational Complexity of Traffic Hijacking under BGP and S-BGP. CoRR abs/1205.4564 (2012) - [i3]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli:
Beyond Clustered Planarity. CoRR abs/1207.3934 (2012) - [i2]Patrizio Angelini, Marco Di Bartolomeo, Giuseppe Di Battista:
Implementing a Partitioned 2-page Book Embedding Testing Algorithm. CoRR abs/1209.0598 (2012) - 2011
- [j55]Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani:
Finding a Minimum-depth Embedding of a Planar Graph in O(n4) Time. Algorithmica 60(4): 890-937 (2011) - [j54]Patrizio Angelini, Luca Cittadini, Walter Didimo, Fabrizio Frati, Giuseppe Di Battista, Michael Kaufmann, Antonios Symvonis:
On the Perspectives Opened by Right Angle Crossing Drawings. J. Graph Algorithms Appl. 15(1): 53-78 (2011) - [j53]Luca Cittadini, Massimo Rimondini, Stefano Vissicchio, Matteo Corea, Giuseppe Di Battista:
From Theory to Practice: Efficiently Checking BGP Configurations for Guaranteed Convergence. IEEE Trans. Netw. Serv. Manag. 8(4): 387-400 (2011) - [j52]Luca Cittadini, Giuseppe Di Battista, Massimo Rimondini, Stefano Vissicchio:
Wheel + ring = reel: the impact of route filtering on the stability of policy routing. IEEE/ACM Trans. Netw. 19(4): 1085-1096 (2011) - [c92]Giuseppe Di Battista, Jean-Daniel Fekete, Huamin Qu:
Preface. PacificVis 2011 - [c91]Patrizio Angelini, Giuseppe Di Battista, Michael Kaufmann, Tamara Mchedlidze, Vincenzo Roselli, Claudio Squarcella:
Small Point Sets for Simply-Nested Planar Graphs. GD 2011: 75-85 - [c90]Giuseppe Di Battista, Claudio Squarcella, Wolfgang Nagele:
How to Visualize the K-Root Name Server (Demo). GD 2011: 191-202 - [c89]Marco Chiesa, Luca Cittadini, Giuseppe Di Battista, Stefano Vissicchio:
Local transit policies and the complexity of BGP Stability Testing. INFOCOM 2011: 2957-2965 - [c88]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati:
Simultaneous Embedding of Embedded Planar Graphs. ISAAC 2011: 271-280 - [c87]Patrizio Angelini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Anna Lubiw:
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area. EGC 2011: 200-209 - [e4]Giuseppe Di Battista, Jean-Daniel Fekete, Huamin Qu:
IEEE Pacific Visualization Symposium, PacificVis 2011, Hong Kong, China, 1-4 March, 2011. IEEE Computer Society 2011, ISBN 978-1-61284-935-5 [contents] - 2010
- [c86]Giuseppe Di Battista, Fabrizio Frati, János Pach:
On the Queue Number of Planar Graphs. FOCS 2010: 365-374 - [c85]Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Monotone Drawings of Graphs. GD 2010: 13-24 - [c84]Giordano Da Lozzo, Giuseppe Di Battista, Francesco Ingrassia:
Drawing Graphs on a Smartphone. GD 2010: 153-164 - [c83]Luca Cittadini, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani, Massimo Rimondini:
Assigning AS relationships to satisfy the Gao-Rexford conditions. ICNP 2010: 113-123 - [c82]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree. IWOCA 2010: 212-225 - [c81]Luca Cittadini, Stefano Vissicchio, Giuseppe Di Battista:
Doing don'ts: Modifying BGP attributes within an autonomous system. NOMS 2010: 293-300 - [c80]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter:
Testing Planarity of Partially Embedded Graphs. SODA 2010: 202-221
2000 – 2009
- 2009
- [j51]Giuseppe Di Battista, Fabrizio Frati:
Small Area Drawings of Outerplanar Graphs. Algorithmica 54(1): 25-53 (2009) - [j50]Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia:
On embedding a cycle in a plane graph. Discret. Math. 309(7): 1856-1869 (2009) - [j49]Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati:
How to draw a clustered tree. J. Discrete Algorithms 7(4): 479-499 (2009) - [j48]Giuseppe Di Battista, Fabrizio Frati:
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. J. Graph Algorithms Appl. 13(3): 349-378 (2009) - [j47]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. Theory Comput. Syst. 44(2): 143-159 (2009) - [c79]Patrizio Angelini, Luca Cittadini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Michael Kaufmann, Antonios Symvonis:
On the Perspectives Opened by Right Angle Crossing Drawings. GD 2009: 21-32 - [c78]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati:
Succinct Greedy Drawings Do Not Always Exist. GD 2009: 171-182 - [c77]Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig:
Drawing Trees in a Streaming Model. GD 2009: 292-303 - [c76]Andrea Di Menna, Tiziana Refice, Luca Cittadini, Giuseppe Di Battista:
Measuring Route Diversity in the Internet from Remote Vantage Points. ICN 2009: 24-29 - [c75]Luca Cittadini, Giuseppe Di Battista, Massimo Rimondini, Stefano Vissicchio:
Wheel + Ring = Reel: the Impact of Route Filtering on the Stability of Policy Routing. ICNP 2009: 274-283 - [c74]Luca Cittadini, Massimo Rimondini, Matteo Corea, Giuseppe Di Battista:
On the feasibility of static analysis for BGP convergence. Integrated Network Management 2009: 521-528 - 2008
- [j46]Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Maurizio Pizzonia:
C-Planarity of C-Connected Clustered Graphs. J. Graph Algorithms Appl. 12(2): 225-262 (2008) - [c73]Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani:
Topological Morphing of Planar Graphs. GD 2008: 145-156 - [c72]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Non-convex Representations of Graphs. GD 2008: 390-395 - [c71]Luca Cittadini, Tiziana Refice, Alessio Campisano, Giuseppe Di Battista, Claudio Sasso:
Policy-Aware Visualization of Internet Dynamics. GD 2008: 435-436 - [c70]Luca Cittadini, Tiziana Refice, Alessio Campisano, Giuseppe Di Battista, Claudio Sasso:
Measuring and visualizing interdomain routing dynamics with BGPATH. ISCC 2008: 780-787 - [c69]Alessio Campisano, Luca Cittadini, Giuseppe Di Battista, Tiziana Refice, Claudio Sasso:
Tracking back the root cause of a path change in interdomain routing. NOMS 2008: 441-448 - [c68]Luca Cittadini, Giuseppe Di Battista, Massimo Rimondini:
(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective. WG 2008: 1-13 - 2007
- [j45]Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia, Massimo Rimondini:
Investigating prefix propagation through active BGP probing. Microprocess. Microsystems 31(7): 460-474 (2007) - [j44]Giuseppe Di Battista, Thomas Erlebach, Alexander Hall, Maurizio Patrignani, Maurizio Pizzonia, Thomas Schank:
Computing the types of the relationships between autonomous systems. IEEE/ACM Trans. Netw. 15(2): 267-280 (2007) - [c67]Giuseppe Di Battista, Bernardo Palazzi:
Authenticated Relational Tables and Authenticated Skip Lists. DBSec 2007: 31-46 - [c66]Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. FUN 2007: 1-13 - [c65]Giuseppe Di Battista, Fabrizio Frati:
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. GD 2007: 291-302 - [c64]Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati:
How to Draw a Clustered Tree. WADS 2007: 89-101 - [c63]Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani:
Computing a Minimum-Depth Planar Graph Embedding in O ( n 4) Time. WADS 2007: 287-299 - 2006
- [j43]Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides:
The strength of weak proximity. J. Discrete Algorithms 4(3): 384-400 (2006) - [j42]Pier Francesco Cortese, Giuseppe Di Battista, Antonello Moneta, Maurizio Patrignani, Maurizio Pizzonia:
Topographic Visualization of Prefix Propagation in the Internet. IEEE Trans. Vis. Comput. Graph. 12(5): 725-732 (2006) - [c62]Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Katharina Anna Lehmann, Giuseppe Liotta, Maurizio Patrignani, Ioannis G. Tollis, Francesco Trotta:
On the Topologies of Local Minimum Spanning Trees. CAAN 2006: 31-44 - [c61]Fabrizio Frati, Giuseppe Di Battista:
Three-Dimensional Drawings of Bounded Degree Trees. GD 2006: 89-94 - [c60]Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia, Massimo Rimondini:
Investigating Prefix Propagation through Active BGP Probing. ISCC 2006: 497-504 - [c59]Giuseppe Di Battista, Tiziana Refice, Massimo Rimondini:
How to extract BGP peering information from the internet routing registry. MineNet 2006: 317-322 - 2005
- [j41]Lorenzo Colitti, Giuseppe Di Battista, Federico Mariani, Maurizio Patrignani, Maurizio Pizzonia:
Visualizing Interdomain Routing with BGPlay. J. Graph Algorithms Appl. 9(1): 117-148 (2005) - [j40]Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia:
Clustering Cycles into Cycles of Clusters. J. Graph Algorithms Appl. 9(3): 391-413 (2005) - [c58]Pier Francesco Cortese, Giuseppe Di Battista:
Clustered planarity. SCG 2005: 32-34 - [c57]Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia:
On Embedding a Cycle in a Plane Graph. GD 2005: 49-60 - [c56]Giuseppe Di Battista, Fabrizio Frati:
Small Area Drawings of Outerplanar Graphs. GD 2005: 89-100 - 2004
- [j39]Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani:
IPv6-in-IPv4 Tunnel Discovery: Methods and Experimental Results. IEEE Trans. Netw. Serv. Manag. 1(1): 30-38 (2004) - [c55]Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia:
Clustering Cycles into Cycles of Clusters. GD 2004: 100-110 - [c54]Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani:
Discovering IPv6-in-IPv4 tunnels in the Internet. NOMS (1) 2004: 613-626 - [p2]Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia:
DBdraw - Automatic Layout of Relational Database Schemas. Graph Drawing Software 2004: 237-256 - [p1]Gabriele Barbagallo, Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Maurizio Pizzonia:
Polyphemus and Hermes - Exploration and Visualization of Computer Networks. Graph Drawing Software 2004: 341-364 - 2003
- [c53]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. GD 2003: 25-36 - [c52]Giuseppe Di Battista, Federico Mariani, Maurizio Patrignani, Maurizio Pizzonia:
BGPlay: A System for Visualizing the Interdomain Routing Evolution. GD 2003: 295-306 - [c51]Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia:
Computing the Types of the Relationships between Autonomous Systems. INFOCOM 2003: 156-165 - [e3]Giuseppe Di Battista, Uri Zwick:
Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings. Lecture Notes in Computer Science 2832, Springer 2003, ISBN 3-540-20064-9 [contents] - 2002
- [j38]Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo:
Quasi-Upward Planarity. Algorithmica 32(3): 474-506 (2002) - [j37]Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Francesco Matera, Maurizio Pizzonia:
Visualization of the High Level Structure of the Internet with HERMES. J. Graph Algorithms Appl. 6(3): 281-311 (2002) - [j36]Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia:
Drawing database schemas. Softw. Pract. Exp. 32(11): 1065-1098 (2002) - [j35]Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides:
Embedding problems for paths with direction constrained edges. Theor. Comput. Sci. 289(2): 897-917 (2002) - 2001
- [j34]Giuseppe Di Battista, Roberto Tamassia, Luca Vismara:
Incremental Convex Planarity Testing. Inf. Comput. 169(1): 94-126 (2001) - [c50]Giuseppe Di Battista, Walter Didimo, A. Marcandalli:
Planarization of Clustered Graphs. GD 2001: 60-74 - [c49]Gabriele Barbagallo, Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Maurizio Pizzonia:
Exploration and Visualization of Computer Networks: Polyphemus and Hermes. GD 2001: 444-445 - [c48]Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia:
Drawing Database Schemas with DBdraw. GD 2001: 451-452 - 2000
- [j33]Stina S. Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara:
Turn-regularity and optimal area drawings of orthogonal representations. Comput. Geom. 16(1): 53-93 (2000) - [j32]Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Armando Parise, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, Luca Vismara:
Drawing Directed Acyclic Graphs: An Experimental Study. Int. J. Comput. Geom. Appl. 10(6): 623-648 (2000) - [j31]Giuseppe Di Battista, Maurizio Patrignani, Francesco Vargiu:
A Split & Push Approach to 3D Orthogonal Drawing. J. Graph Algorithms Appl. 4(3): 105-133 (2000) - [j30]Luca Vismara, Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Francesco Vargiu:
Experimental studies on graph drawing algorithms. Softw. Pract. Exp. 30(11): 1235-1284 (2000) - [j29]Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo:
Computing Orthogonal Drawings with the Minimum Number of Bends. IEEE Trans. Computers 49(8): 826-840 (2000) - [c47]Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides:
Embedding Problems for Paths with Direction Constrained Edges. COCOON 2000: 64-73 - [c46]Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Francesco Matera, Maurizio Pizzonia:
Visualization of the Autonomous Systems Interconnections with HERMES. GD 2000: 150-163 - [c45]Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides:
Orthogonal Drawings of Cycles in 3D Space (Extended Abstract). GD 2000: 272-283 - [c44]Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia:
Drawing Relational Schemas. VisSym 2000: 53-62
1990 – 1999
- 1999
- [b1]Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis:
Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall 1999, ISBN 0-13-301615-3 - [j28]Giuseppe Di Battista, Roberto Tamassia, Luca Vismara:
Output-Sensitive Reporting of Disjoint Paths. Algorithmica 23(4): 302-340 (1999) - [j27]Giuseppe Di Battista, Petra Mutzel:
Guest Editors' Introduction. J. Graph Algorithms Appl. 3(4): 1-2 (1999) - [c43]Maurizio Pizzonia, Giuseppe Di Battista:
Object-Oriented Design of Graph Oriented Data Structures. ALENEX 1999: 140-155 - [c42]Stina S. Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara:
Turn-Regularity and Planar Orthogonal Drawings. GD 1999: 8-26 - [c41]Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia:
Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size. GD 1999: 297-310 - [c40]Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia:
Infinite Trees and the Future. GD 1999: 379-391 - 1998
- [j26]Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia:
Optimal Upward Planarity Testing of Single-Source Digraphs. SIAM J. Comput. 27(1): 132-169 (1998) - [j25]Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu:
Spirality and Optimal Orthogonal Drawings. SIAM J. Comput. 27(6): 1764-1811 (1998) - [c39]Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo:
Quasi-Upward Planarity. GD 1998: 15-29 - [c38]Giuseppe Di Battista, Giuseppe Liotta:
Upward Planarity Checking: "Faces Are More than Polygons". GD 1998: 72-86 - [c37]Giuseppe Di Battista, Maurizio Patrignani, Francesco Vargiu:
A Split&Push Approach to 3D Orthogonal Drawing. GD 1998: 87-101 - [c36]Giuseppe Di Battista, Renato Lillo, Fabio Vernacotola:
Ptolomaeus: The Web Cartographer. GD 1998: 444-445 - [i1]Maurizio Pizzonia, Giuseppe Di Battista:
Object-Oriented Design of Graph Oriented Data Structures. CoRR cs.SE/9810009 (1998) - 1997
- [j24]Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu:
An Experimental Comparison of Four Graph Drawing Algorithms. Comput. Geom. 7: 303-325 (1997) - [c35]Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo:
Computing Orthogonal Drawings with the Minimum Number of Bends. WADS 1997: 331-344 - [e2]Gian Carlo Bongiovanni, Daniel P. Bovet, Giuseppe Di Battista:
Algorithms and Complexity, Third Italian Conference, CIAC '97, Rome, Italy, March 12-14, 1997, Proceedings. Lecture Notes in Computer Science 1203, Springer 1997, ISBN 3-540-62592-5 [contents] - [e1]Giuseppe Di Battista:
Graph Drawing, 5th International Symposium, GD '97, Rome, Italy, September 18-20, 1997, Proceedings. Lecture Notes in Computer Science 1353, Springer 1997, ISBN 3-540-63938-1 [contents] - 1996
- [j23]Giuseppe Di Battista, Roberto Tamassia:
On-Line Maintenance of Triconnected Components with SPQR-Trees. Algorithmica 15(4): 302-318 (1996) - [j22]Giuseppe Di Battista, Roberto Tamassia:
Guest Editors' Introduction to the Special Issue on Graph Drwaing. Algorithmica 16(1): 1-3 (1996) - [j21]Giuseppe Di Battista, Roberto Tamassia:
On-Line Planarity Testing. SIAM J. Comput. 25(5): 956-997 (1996) - [j20]Giuseppe Di Battista, Luca Vismara:
Angles of Planar Triangular Graphs. SIAM J. Discret. Math. 9(3): 349-359 (1996) - [c34]Giuseppe Di Battista, Roberto Tamassia, Luca Vismara:
Output-Sensitive Reporting of Disjoint Paths (Extended Abstract). COCOON 1996: 81-91 - [c33]Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Armando Parise, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, Luca Vismara:
Drawing Directed Acyclic Graphs: An Experimental Study. GD 1996: 76-91 - 1995
- [j19]Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis:
Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs. SIAM J. Comput. 24(5): 970-1001 (1995) - [j18]Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta:
Parametric Graph Drawing. IEEE Trans. Software Eng. 21(8): 662-673 (1995) - [j17]Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu:
Diagram Server. J. Vis. Lang. Comput. 6(3): 275-298 (1995) - [c32]Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu:
An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract). SCG 1995: 306-315 - [c31]Luciano Buti, Giuseppe Di Battista, Giuseppe Liotta, Emanuele Tassinari, Francesco Vargiu, Luca Vismara:
GD-Workbench: A System for Prototyping and Testing Graph Drawing Algorithms. GD 1995: 111-122 - [c30]Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides:
The Strength of Weak Proximity. GD 1995: 178-189 - [c29]Giuseppe Liotta, Giuseppe Di Battista:
Computing Proximity Drawings of Trees in the 3-Dimemsional Space. WADS 1995: 239-250 - 1994
- [j16]Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta, Carlo Mannino:
Upward Drawings of Triconnected Digraphs. Algorithmica 12(6): 476-497 (1994) - [j15]Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis:
Algorithms for Drawing Graphs: an Annotated Bibliography. Comput. Geom. 4: 235-282 (1994) - [j14]Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis:
How to Draw a Series-Parallel Digraph. Int. J. Comput. Geom. Appl. 4(4): 385-402 (1994) - [c28]Giuseppe Liotta, Francesco Vargiu, Giuseppe Di Battista:
Orthogonal Drawings with the Minimum Number of Bends. CCCG 1994: 281-286 - [c27]Giuseppe Di Battista, William J. Lenhart, Giuseppe Liotta:
Proximity Drawability: a Survey. GD 1994: 328-339 - [c26]Prosenjit Bose, Giuseppe Di Battista, William J. Lenhart, Giuseppe Liotta:
Proximity Constraints and Representable Trees. GD 1994: 340-351 - [c25]Giuseppe Di Battista, Roberto Tamassia, Luca Vismara:
On-Line Convex Plabarity Testing. WG 1994: 242-255 - 1993
- [j13]Giuseppe Di Battista:
Area requirements (abstract). SIGACT News 24(1): 58-59 (1993) - [j12]Giuseppe Di Battista, Maurizio Lenzerini:
Deductive Entity-Relationship Modeling. IEEE Trans. Knowl. Data Eng. 5(3): 439-450 (1993) - [j11]Carlo Batini, Giuseppe Di Battista, Giuseppe Santucci:
Structuring Primitives for a Dictionary of Entity Relationship Data Schemas. IEEE Trans. Software Eng. 19(4): 344-365 (1993) - [c24]Giuseppe Santucci, Carlo Batini, Giuseppe Di Battista:
Multilevel Schema Integration. ER 1993: 327-338 - [c23]Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia:
Optimal Upward Planarity Testing of Single-Source Digraphs. ESA 1993: 37-48 - [c22]Robert F. Cohen, Giuseppe Di Battista, Arkady Kanevsky, Roberto Tamassia:
Reinventing the wheel: an optimal data structure for connectivity queries. STOC 1993: 194-200 - [c21]Giuseppe Di Battista, Luca Vismara:
Angles of planar triangular graphs. STOC 1993: 431-437 - [c20]Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu:
Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-Planar Graphs (Extended Abstract). WADS 1993: 151-162 - 1992
- [j10]Pierluigi Crescenzi, Giuseppe Di Battista, Adolfo Piperno:
A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees. Comput. Geom. 2: 187-200 (1992) - [j9]Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis:
Area Requirement and Symmetry Display of Planar Upward Drawings. Discret. Comput. Geom. 7: 381-401 (1992) - [j8]Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis:
Constrained Visibility Representations of Graphs. Inf. Process. Lett. 41(1): 1-7 (1992) - [c19]Giuseppe Di Battista, Giuseppe Liotta, M. Strani, Francesco Vargiu:
Diagram Server. Advanced Visual Interfaces 1992: 415-117 - [c18]Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis, Paola Bertolazzi:
A Framework for Dynamic Graph Drawing. SCG 1992: 261-270 - [c17]Carlo Batini, Giuseppe Di Battista, Giuseppe Santucci:
A Formal Framework for Multilevel Schema Documentation in a Data Dictionary. ISCO 1992: 53-85 - [c16]Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis:
How to Draw a Series-Parallel Digraph (Extended Abstract). SWAT 1992: 272-283 - 1991
- [c15]Paola Bertolazzi, Giuseppe Di Battista:
On Upward Drawing Testing of Triconnected Digraphs (Extended Abstract). SCG 1991: 272-280 - [c14]Arkady Kanevsky, Roberto Tamassia, Giuseppe Di Battista, Jianer Chen:
On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract). FOCS 1991: 793-801 - [c13]Massimiliano Beccaria, Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta:
A Tailorable and Extensible Automatic Layout Facility. VL 1991: 68-73 - 1990
- [j7]Giuseppe Di Battista, Wei-Ping Liu, Ivan Rival:
Bipartite Graphs, Upward Drawings, and Planarity. Inf. Process. Lett. 36(6): 317-322 (1990) - [c12]Giuseppe Di Battista, Roberto Tamassia:
On-Line Graph Algorithms with SPQR-Trees. ICALP 1990: 598-611 - [c11]Giuseppe Di Battista, Amadeo Giammarco, Giuseppe Santucci, Roberto Tamassia:
The Architecture of Diagram Server. VL 1990: 60-65
1980 – 1989
- 1989
- [j6]Giuseppe Di Battista, Hannu Kangassalo, Roberto Tamassia:
Definition Libraries for Conceptual Modelling. Data Knowl. Eng. 4: 245-260 (1989) - [c10]Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis:
Area Requirement and Symmetry Display in Drawing Graphs. SCG 1989: 51-60 - [c9]Giuseppe Di Battista, Roberto Tamassia:
Incremental Planarity Testing (Extended Abstract). FOCS 1989: 436-441 - [c8]Giuseppe Di Battista, E. Pietrosanti, Roberto Tamassia, Ioannis G. Tollis:
Automatic layout of PERT diagrams with X-PERT. VL 1989: 171-176 - [c7]Giuseppe Di Battista, Maurizio Lenzerini:
A Deductive Method for Entity-Relationship Modeling. VLDB 1989: 13-21 - 1988
- [j5]Carlo Batini, Giuseppe Di Battista:
A methodology for conceptual documentation and maintenance. Inf. Syst. 13(3): 297-318 (1988) - [j4]Giuseppe Di Battista, Carlo Batini:
Design of statistical databases: a methodology for the conceptual step. Inf. Syst. 13(4): 407-422 (1988) - [j3]Giuseppe Di Battista, Roberto Tamassia:
Algorithms for Plane Representations of Acyclic Digraphs. Theor. Comput. Sci. 61: 175-198 (1988) - [j2]Roberto Tamassia, Giuseppe Di Battista, Carlo Batini:
Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern. 18(1): 61-79 (1988) - [j1]Giuseppe Di Battista, Enrico Nardelli:
Hierarchies and planarity theory. IEEE Trans. Syst. Man Cybern. 18(6): 1035-1046 (1988) - [c6]Giuseppe Di Battista, Maurizio Lenzerini:
Object Modeling Based on Logic. ER 1988: 207-225 - [c5]Giuseppe Di Battista, Hannu Kangassalo, Roberto Tamassia:
Definition Libraries for Conceptual Modelling. ER 1988: 251-267 - [c4]G. Barcaroli, Giuseppe Di Battista, E. Fortunato, C. Leporelli:
Design of Statistical Information Media: Time Performance and Storage Constraints. SSDBM 1988: 93-104 - [c3]Giuseppe Di Battista:
Automatic Drawing of Statistical Diagrams. SSDBM 1988: 141-156 - 1987
- [c2]Giuseppe Di Battista, Roberto Tamassia:
Upward Drawings of Acyclic Digraphs. WG 1987: 121-133 - 1986
- [c1]Giuseppe Di Battista, Enrico Nardelli:
An Algorithm for Testing Planarity of Hierarchical Graphs. WG 1986: 277-289
Coauthor Index
[j100] [i36] [c133] [j89] [j87] [i24] [i21] [j83] [j81] [j79] [j78] [j77] [c119] [c117] [c116] [c113] [i17] [i16] [j76] [j75] [j74] [c112] [c111] [i14] [i13] [i12] [c105] [c104] [c102] [i11] [i10] [j69] [j67] [c100] [c96] [i5] [j62] [j61] [j58] [c95] [i3] [i2] [j55] [j54] [c91] [c88] [c87] [c85] [c82] [c80] [c79] [c78] [c73] [c63]
[j102] [c147] [c143] [i38] [i32] [j97] [c139] [i30] [j94] [c136] [c135] [c133] [i29] [i28] [j92] [j91] [j88] [j87] [c132] [i25] [i24] [j84] [c128] [c127] [i23] [i22] [i20] [j82] [c126] [i19] [j79] [j78] [j77] [c118] [c117] [i17] [i15] [j76] [j75] [j74] [c112] [c111] [i14] [i12] [c105] [c103] [c102] [i11] [i10] [i9] [i8] [j69] [j68] [c100] [c96] [i5] [j62] [j61] [j58] [j57] [i3] [j54] [c88] [c87] [c86] [c85] [c82] [c80] [j51] [j49] [j48] [j47] [c79] [c78] [j46] [c72] [c66] [c65] [c64] [c62] [c61] [c56]
[j102] [c148] [c147] [c144] [c143] [i38] [i37] [i35] [i32] [j97] [c139] [i30] [c135] [c133] [i28] [j92] [j91] [j89] [j88] [j87] [i24] [c128] [c127] [i23] [i22] [i21] [i20] [j82] [j81] [c126] [i19] [j79] [j78] [j77] [c119] [c118] [c117] [c116] [c113] [i17] [i16] [i15] [j76] [j74] [c112] [c111] [c110] [i14] [i13] [i12] [j70] [c105] [c104] [c102] [i11] [i10] [c100] [i5] [j60] [i3] [c84]
[j102] [c147] [c145] [c143] [i38] [j98] [c141] [i34] [i32] [j97] [j96] [c139] [c138] [i31] [i30] [j95] [j94] [c135] [c133] [i28] [j92] [j88] [j87] [c132] [c131] [c130] [c129] [i27] [i26] [i25] [i24] [c128] [i22] [i20] [j82] [c126] [i19] [j78] [j77] [c118] [c117] [i17] [i15] [j76] [j75] [j73] [c112] [c111] [c110] [c106] [i14] [i12] [c104] [c102] [i11] [j67] [c96] [j63] [j62] [j61] [j57] [c94] [i4] [j55] [c85] [c83] [c82] [c80] [j50] [j47] [c77] [j46] [c73] [c72] [j45] [j44] [c66] [c63] [j42] [c62] [c60] [j41] [j40] [c57] [j39] [c55] [c54] [p2] [c53] [c52] [c51] [j36] [c48] [j31] [c44] [c41] [c40] [c37]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
