Giuseppe Di Battista

According to our database1, Giuseppe Di Battista authored at least 198 papers between 1986 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Multi-view routing visualization for the identification of BGP issues.
J. Comput. Lang., 2020

Beyond level planarity: Cyclic, torus, and simultaneous level planarity.
Theor. Comput. Sci., 2020

Simple <i>k</i>-planar graphs are simple (<i>k</i> + 1)-quasiplanar.
J. Comb. Theory, Ser. B, 2020

Extending upward planar graph drawings.
Comput. Geom., 2020

Megalos: A Scalable Architecture for the Virtualization of Network Scenarios.
Proceedings of the NOMS 2020, 2020

2019
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs.
Int. J. Found. Comput. Sci., 2019

Simple k-Planar Graphs are Simple (k+1)-Quasiplanar.
CoRR, 2019

Graph Stories in Small Area.
CoRR, 2019

Periodic Path Changes in RIPE Atlas.
IEEE Access, 2019

How to Morph a Tree on a Small Grid.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

2018
Radian: Visual Exploration of Traceroutes.
IEEE Trans. Vis. Comput. Graph., 2018

Windrose Planarity: Embedding Graphs with Direction-Constrained Edges.
ACM Trans. Algorithms, 2018

Computing NodeTrix Representations of Clustered Graphs.
J. Graph Algorithms Appl., 2018

Small Universal Point Sets for k-Outerplanar Graphs.
Discret. Comput. Geom., 2018

Upstream Visibility: A Multi-View Routing Visualization.
Proceedings of the 11th International Symposium on Visual Information Communication and Interaction, 2018

Kathará: A container-based framework for implementing network function virtualization and software defined networks.
Proceedings of the 2018 IEEE/IFIP Network Operations and Management Symposium, 2018

Upward Planar Morphs.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2017
How to Morph Planar Graph Drawings.
SIAM J. Comput., 2017

Intersection-Link Representations of Graphs.
J. Graph Algorithms Appl., 2017

The Internet Pendulum: On the periodicity of Internet Topology Measurements.
CoRR, 2017

Strip Planarity Testing for Embedded Planar Graphs.
Algorithmica, 2017

On the Relationship Between k-Planar and k-Quasi-Planar Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

SDNetkit: A testbed for experimenting SDN in multi-domain networks.
Proceedings of the 2017 IEEE Conference on Network Softwarization, 2017

SDNS: Exploiting SDN and the DNS to exchange traffic in a federated network.
Proceedings of the 2017 IEEE Conference on Network Softwarization, 2017

PrIXP: Preserving the privacy of routing policies at Internet eXchange Points.
Proceedings of the 2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM), 2017

Long Transaction Chains and the Bitcoin Heartbeat.
Proceedings of the Euro-Par 2017: Parallel Processing Workshops, 2017

2016
Supporting end-to-end connectivity in federated networks using SDN.
Proceedings of the 2016 IEEE/IFIP Network Operations and Management Symposium, 2016

How to handle ARP in a software-defined network.
Proceedings of the IEEE NetSoft Conference and Workshops, 2016

Beyond Level Planarity.
Proceedings of the Graph Drawing and Network Visualization, 2016

Simultaneous Orthogonal Planarity.
Proceedings of the Graph Drawing and Network Visualization, 2016

2015
On iBGP Routing Policies.
IEEE/ACM Trans. Netw., 2015

Computational complexity of traffic hijacking under BGP and S-BGP.
Theor. Comput. Sci., 2015

The importance of being proper: (In clustered-level planarity and T-level planarity).
Theor. Comput. Sci., 2015

Testing Planarity of Partially Embedded Graphs.
ACM Trans. Algorithms, 2015

Testing Cyclic Level and Simultaneous Level Planarity.
CoRR, 2015

Relaxing the constraints of clustered planarity.
Comput. Geom., 2015

Bitconeview: visualization of flows in the bitcoin transaction graph.
Proceedings of the 2015 IEEE Symposium on Visualization for Cyber Security, 2015

Is it really worth to peer at IXPs? A comparative study.
Proceedings of the 2015 IEEE Symposium on Computers and Communication, 2015

Making MPLS VPNs manageable through the adoption of SDN.
Proceedings of the IFIP/IEEE International Symposium on Integrated Network Management, 2015

Rethinking virtual private networks in the software-defined era.
Proceedings of the IFIP/IEEE International Symposium on Integrated Network Management, 2015

Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data.
Proceedings of the IVAPP 2015, 2015

On the Relationship Between Map Graphs and Clique Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014
A Survey on Small-Area Planar Graph Drawing.
CoRR, 2014

On the Complexity of Clustered-Level Planarity and T-Level Planarity.
CoRR, 2014

Visual discovery of the correlation between BGP routing and round-trip delay active measurements.
Computing, 2014

Intra-domain routing with pathlets.
Comput. Commun., 2014

Towards an Automated Investigation of the Impact of BGP Routing Changes on Network Delay Variations.
Proceedings of the Passive and Active Measurement - 15th International Conference, 2014

Morphing Planar Graph Drawings Optimally.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Anchored Drawings of Planar Graphs.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

2013
Computer Networks.
Proceedings of the Handbook on Graph Drawing and Visualization., 2013

GDToolkit.
Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Topological morphing of planar graphs.
Theor. Comput. Sci., 2013

On the Queue Number of Planar Graphs.
SIAM J. Comput., 2013

Simultaneous Embedding of Embedded Planar graphs.
Int. J. Comput. Geom. Appl., 2013

From BGP to RTT and Beyond: Matching BGP Routing Changes and Network Delay Variations with an Eye on Traceroute Paths.
CoRR, 2013

Morphing Planar Graph Drawings with a Polynomial Number of Steps.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Using routers to build logic circuits: How powerful is BGP?
Proceedings of the 2013 21st IEEE International Conference on Network Protocols, 2013

Intra-Domain Pathlet Routing.
Proceedings of the 22nd International Conference on Computer Communication and Networks, 2013

Dynamic Traceroute Visualization at Multiple Abstraction Levels.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

Strip Planarity Testing.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012
Guest Editor's Introduction: Special Section on the IEEE Pacific Visualization Symposium.
IEEE Trans. Vis. Comput. Graph., 2012

Nonconvex Representations of Plane Graphs.
SIAM J. Discret. Math., 2012

Succinct greedy drawings do not always exist.
Networks, 2012

Drawing Graphs on a Smartphone.
J. Graph Algorithms Appl., 2012

How to Visualize the K-root Name Server.
J. Graph Algorithms Appl., 2012

Monotone Drawings of Graphs.
J. Graph Algorithms Appl., 2012

Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph.
J. Discrete Algorithms, 2012

Drawing trees in a streaming model.
Inf. Process. Lett., 2012

The Shape of Orthogonal Cycles in Three Dimensions.
Discret. Comput. Geom., 2012

On the stability of interdomain routing.
ACM Comput. Surv., 2012

Beyond Clustered Planarity
CoRR, 2012

Visualization Applications and Design Studies [Guest editors' introduction].
IEEE Computer Graphics and Applications, 2012

Monitoring the status of MPLS VPN and VPLS based on BGP signaling information.
Proceedings of the 2012 IEEE Network Operations and Management Symposium, 2012

Implementing a Partitioned 2-Page Book Embedding Testing Algorithm.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011
Wheel + ring = reel: the impact of route filtering on the stability of policy routing.
IEEE/ACM Trans. Netw., 2011

From Theory to Practice: Efficiently Checking BGP Configurations for Guaranteed Convergence.
IEEE Trans. Network and Service Management, 2011

On the Perspectives Opened by Right Angle Crossing Drawings.
J. Graph Algorithms Appl., 2011

Finding a Minimum-depth Embedding of a Planar Graph in <i>O</i>(<i>n</i><sup>4</sup>) Time.
Algorithmica, 2011

Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Local transit policies and the complexity of BGP Stability Testing.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

How to Visualize the K-Root Name Server (Demo).
Proceedings of the Graph Drawing - 19th International Symposium, 2011

Small Point Sets for Simply-Nested Planar Graphs.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

Preface.
Proceedings of the IEEE Pacific Visualization Symposium, 2011

2010
Doing don'ts: Modifying BGP attributes within an autonomous system.
Proceedings of the IEEE/IFIP Network Operations and Management Symposium, 2010

Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Assigning AS relationships to satisfy the Gao-Rexford conditions.
Proceedings of the 18th annual IEEE International Conference on Network Protocols, 2010

2009
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features.
Theory Comput. Syst., 2009

Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces.
J. Graph Algorithms Appl., 2009

How to draw a clustered tree.
J. Discrete Algorithms, 2009

On embedding a cycle in a plane graph.
Discret. Math., 2009

Small Area Drawings of Outerplanar Graphs.
Algorithmica, 2009

On the feasibility of static analysis for BGP convergence.
Proceedings of the Integrated Network Management, 2009

Measuring Route Diversity in the Internet from Remote Vantage Points.
Proceedings of the Eighth International Conference on Networks, 2009

2008
C-Planarity of C-Connected Clustered Graphs.
J. Graph Algorithms Appl., 2008

(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

Tracking back the root cause of a path change in interdomain routing.
Proceedings of the IEEE/IFIP Network Operations and Management Symposium: Pervasive Management for Ubioquitous Networks and Services, 2008

Measuring and visualizing interdomain routing dynamics with BGPATH.
Proceedings of the 13th IEEE Symposium on Computers and Communications (ISCC 2008), 2008

Policy-Aware Visualization of Internet Dynamics.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

Non-convex Representations of Graphs.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

2007
Computing the types of the relationships between autonomous systems.
IEEE/ACM Trans. Netw., 2007

Investigating prefix propagation through active BGP probing.
Microprocess. Microsystems, 2007

Computing a Minimum-Depth Planar Graph Embedding in <i>O</i> ( <i>n</i> <sup>4</sup>) Time.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Authenticated Relational Tables and Authenticated Skip Lists.
Proceedings of the Data and Applications Security XXI, 2007

2006
Topographic Visualization of Prefix Propagation in the Internet.
IEEE Trans. Vis. Comput. Graph., 2006

The strength of weak proximity.
J. Discrete Algorithms, 2006

How to extract BGP peering information from the internet routing registry.
Proceedings of the 2nd Annual ACM Workshop on Mining Network Data, 2006

Three-Dimensional Drawings of Bounded Degree Trees.
Proceedings of the Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, 2006

On the Topologies of Local Minimum Spanning Trees.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

2005
Clustering Cycles into Cycles of Clusters.
J. Graph Algorithms Appl., 2005

Visualizing Interdomain Routing with BGPlay.
J. Graph Algorithms Appl., 2005

Clustered planarity.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004
IPv6-in-IPv4 Tunnel Discovery: Methods and Experimental Results.
IEEE Trans. Network and Service Management, 2004

Discovering IPv6-in-IPv4 tunnels in the Internet.
Proceedings of the Managing Next Generation Convergence Networks and Services, 2004

DBdraw - Automatic Layout of Relational Database Schemas.
Proceedings of the Graph Drawing Software, 2004

Polyphemus and Hermes - Exploration and Visualization of Computer Networks.
Proceedings of the Graph Drawing Software, 2004

2003
Computing the Types of the Relationships between Autonomous Systems.
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

BGPlay: A System for Visualizing the Interdomain Routing Evolution.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002
Embedding problems for paths with direction constrained edges.
Theor. Comput. Sci., 2002

Drawing database schemas.
Softw. Pract. Exp., 2002

Visualization of the High Level Structure of the Internet with HERMES.
J. Graph Algorithms Appl., 2002

Quasi-Upward Planarity.
Algorithmica, 2002

2001
Incremental Convex Planarity Testing.
Inf. Comput., 2001

Drawing Database Schemas with DBdraw.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

Planarization of Clustered Graphs.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

Exploration and Visualization of Computer Networks: Polyphemus and Hermes.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

2000
Computing Orthogonal Drawings with the Minimum Number of Bends.
IEEE Trans. Computers, 2000

Experimental studies on graph drawing algorithms.
Softw. Pract. Exp., 2000

A Split & Push Approach to 3D Orthogonal Drawing.
J. Graph Algorithms Appl., 2000

Drawing Directed Acyclic Graphs: An Experimental Study.
Int. J. Comput. Geom. Appl., 2000

Turn-regularity and optimal area drawings of orthogonal representations.
Comput. Geom., 2000

Drawing Relational Schemas.
Proceedings of the 2nd Joint Eurographics - IEEE TCVG Symposium on Visualization, 2000

Visualization of the Autonomous Systems Interconnections with HERMES.
Proceedings of the Graph Drawing, 8th International Symposium, 2000

Orthogonal Drawings of Cycles in 3D Space (Extended Abstract).
Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999
Guest Editors' Introduction.
J. Graph Algorithms Appl., 1999

Output-Sensitive Reporting of Disjoint Paths.
Algorithmica, 1999

Infinite Trees and the Future.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

Turn-Regularity and Planar Orthogonal Drawings.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

Object-Oriented Design of Graph Oriented Data Structures.
Proceedings of the Algorithm Engineering and Experimentation, 1999

Graph Drawing: Algorithms for the Visualization of Graphs
Prentice-Hall, ISBN: 0-13-301615-3, 1999

1998
Optimal Upward Planarity Testing of Single-Source Digraphs.
SIAM J. Comput., 1998

Spirality and Optimal Orthogonal Drawings.
SIAM J. Comput., 1998

Ptolomaeus: The Web Cartographer.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

Upward Planarity Checking: "Faces Are More than Polygons".
Proceedings of the Graph Drawing, 6th International Symposium, 1998

1997
An Experimental Comparison of Four Graph Drawing Algorithms.
Comput. Geom., 1997

1996
Angles of Planar Triangular Graphs.
SIAM J. Discret. Math., 1996

On-Line Planarity Testing.
SIAM J. Comput., 1996

Guest Editors' Introduction to the Special Issue on Graph Drwaing.
Algorithmica, 1996

On-Line Maintenance of Triconnected Components with SPQR-Trees.
Algorithmica, 1996

Output-Sensitive Reporting of Disjoint Paths (Extended Abstract).
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995
Diagram Server.
J. Vis. Lang. Comput., 1995

Parametric Graph Drawing.
IEEE Trans. Software Eng., 1995

Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs.
SIAM J. Comput., 1995

Computing Proximity Drawings of Trees in the 3-Dimemsional Space.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

GD-Workbench: A System for Prototyping and Testing Graph Drawing Algorithms.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, 1995

An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract).
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
How to Draw a Series-Parallel Digraph.
Int. J. Comput. Geom. Appl., 1994

Algorithms for Drawing Graphs: an Annotated Bibliography.
Comput. Geom., 1994

Upward Drawings of Triconnected Digraphs.
Algorithmica, 1994

On-Line Convex Plabarity Testing.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

Proximity Constraints and Representable Trees.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Proximity Drawability: a Survey.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Orthogonal Drawings with the Minimum Number of Bends.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
Structuring Primitives for a Dictionary of Entity Relationship Data Schemas.
IEEE Trans. Software Eng., 1993

Deductive Entity-Relationship Modeling.
IEEE Trans. Knowl. Data Eng., 1993

Area requirements (abstract).
SIGACT News, 1993

Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-Planar Graphs (Extended Abstract).
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Reinventing the wheel: an optimal data structure for connectivity queries.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Multilevel Schema Integration.
Proceedings of the Entity-Relationship Approach, 1993

1992
Constrained Visibility Representations of Graphs.
Inf. Process. Lett., 1992

Area Requirement and Symmetry Display of Planar Upward Drawings.
Discret. Comput. Geom., 1992

A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees.
Comput. Geom., 1992

How to Draw a Series-Parallel Digraph (Extended Abstract).
Proceedings of the Algorithm Theory, 1992

A Formal Framework for Multilevel Schema Documentation in a Data Dictionary.
Proceedings of the Information System Concepts: Improving the Understanding, 1992

A Framework for Dynamic Graph Drawing.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

Diagram Server.
Proceedings of the Advanced Visual Interfaces - Proceedings of the International Workshop, 1992

1991
A Tailorable and Extensible Automatic Layout Facility.
Proceedings of the 1991 IEEE Workshop on Visual Languages, Kobe, Japan, October 8-11, 1991, 1991

On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract)
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

On Upward Drawing Testing of Triconnected Digraphs (Extended Abstract).
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990
Bipartite Graphs, Upward Drawings, and Planarity.
Inf. Process. Lett., 1990

The Architecture of Diagram Server.
Proceedings of the 1990 IEEE Workshop on Visual Languages, 1990

On-Line Graph Algorithms with SPQR-Trees.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989
Definition Libraries for Conceptual Modelling.
Data Knowl. Eng., 1989

A Deductive Method for Entity-Relationship Modeling.
Proceedings of the Fifteenth International Conference on Very Large Data Bases, 1989

Automatic layout of PERT diagrams with X-PERT.
Proceedings of the IEEE Workshop on Visual Languages, 1989

Incremental Planarity Testing (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Area Requirement and Symmetry Display in Drawing Graphs.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988
Automatic graph drawing and readability of diagrams.
IEEE Trans. Syst. Man Cybern., 1988

Hierarchies and planarity theory.
IEEE Trans. Syst. Man Cybern., 1988

Algorithms for Plane Representations of Acyclic Digraphs.
Theor. Comput. Sci., 1988

Design of statistical databases: a methodology for the conceptual step.
Inf. Syst., 1988

A methodology for conceptual documentation and maintenance.
Inf. Syst., 1988

Automatic Drawing of Statistical Diagrams.
Proceedings of the Statistical and Scientific Database Management, 1988

Design of Statistical Information Media: Time Performance and Storage Constraints.
Proceedings of the Statistical and Scientific Database Management, 1988

Object Modeling Based on Logic.
Proceedings of the Entity-Relationship Approach: A Bridge to the User, 1988

1987
Upward Drawings of Acyclic Digraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, International Workshop, 1987

1986
An Algorithm for Testing Planarity of Hierarchical Graphs.
Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986


  Loading...