Walter Didimo

J. Graph Algorithms Appl., 2023

Small Point-Sets Supporting Graph Stories.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2023

New Bounds on the Local and Global Edge-length Ratio of Planar Graphs.

[BibT_eX]

[DOI]

Stephen K. Wismath

CoRR, 2023

Brand Network Booster: A New System for Improving Brand Connectivity.

[BibT_eX]

[DOI]

Jacopo Cancellieri

Andrea Fronzetti Colladon

CoRR, 2023

1-planarity testing and embedding: An experimental study.

[BibT_eX]

[DOI]

Comput. Geom., 2023

Nonplanar Graph Drawings with k Vertices per Face.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Parameterized Approaches to Orthogonal Compaction.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

Rectilinear-Upward Planarity Testing of Digraphs.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Min-k-planar Drawings of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Design of a Process and a Container-Based Cloud Architecture for the Automatic Generation of Storyline Visualizations.

[BibT_eX]

[DOI]

Proceedings of the Advanced Information Networking and Applications, 2023

2022

Influence Maximization With Visual Analytics.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 2022

Hybrid Graph Visualizations With ChordLink: Algorithms, Experiments, and Applications.

[BibT_eX]

[DOI]

Lorenzo Angori

IEEE Trans. Vis. Comput. Graph., 2022

On Turn-Regular Orthogonal Representations.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2022

Placing Arrows in Directed Graph Layouts: Algorithms and Experiments.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2022

Universal Slope Sets for Upward Planar Drawings.

[BibT_eX]

[DOI]

Algorithmica, 2022

BrowVis: Visualizing Large Graphs in the Browser.

[BibT_eX]

[DOI]

Luca Consalvi

IEEE Access, 2022

In-browser Visualization of Large-scale Graphs.

[BibT_eX]

[DOI]

Luca Consalvi

Proceedings of the 1st Italian Conference on Big Data and Data Science (itaDATA 2022), 2022

st-Orientations with Few Transitive Edges.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

2021

Stable visualization of connected components in dynamic graphs.

[BibT_eX]

[DOI]

Inf. Vis., 2021

Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs.

[BibT_eX]

[DOI]

CoRR, 2021

A User Study on Hybrid Graph Visualizations.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

2020

Simple k-planar graphs are simple (k + 1)-quasiplanar.

[BibT_eX]

[DOI]

Ignaz Rutter

Csaba D. Tóth

J. Comb. Theory B, 2020

Combining Network Visualization and Data Mining for Tax Risk Assessment.

[BibT_eX]

[DOI]

IEEE Access, 2020

An Experimental Study of a 1-Planarity Testing and Embedding Algorithm.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Storyline Visualizations with Ubiquitous Actors.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

VAIM: Visual Analytics for Influence Maximization.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

Visual Analytics for Financial Crime Detection at the University of Perugia.

[BibT_eX]

[DOI]

Proceedings of the Advanced Visual Interfaces. Supporting Artificial Intelligence and Big Data Applications, 2020

Right Angle Crossing Drawings of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Beyond Planar Graphs, Communications of NII Shonan Meetings., 2020

2019

A Distributed Multilevel Force-Directed Algorithm.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2019

Planar drawings of fixed-mobile bigraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Greedy rectilinear drawings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

An Experimental Study on the Ply Number of Straight-line Drawings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

HV-planarity: Algorithms and complexity.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Visual querying and analysis of temporal fiscal networks.

[BibT_eX]

[DOI]

Luca Grilli

Inf. Sci., 2019

Edge partitions of optimal 2-plane and 3-plane graphs.

[BibT_eX]

[DOI]

Chrysanthi N. Raftopoulou

Discret. Math., 2019

A Survey on Graph Drawing Beyond Planarity.

[BibT_eX]

[DOI]

ACM Comput. Surv., 2019

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

[BibT_eX]

[DOI]

Ignaz Rutter

Csaba D. Tóth

CoRR, 2019

ChordLink: A New Hybrid Visualization Model.

[BibT_eX]

[DOI]

Lorenzo Angori

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Upward Book Embeddings of st-Graphs.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

New results on edge partitions of 1-plane graphs.

[BibT_eX]

[DOI]

Stephen K. Wismath

Theor. Comput. Sci., 2018

Profiling distributed graph processing systems through visual analytics.

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 2018

A visual analytics system to support tax evasion discovery.

[BibT_eX]

[DOI]

Luca Giamminonni

Decis. Support Syst., 2018

Efficient Algorithms for Bend-minimum Orthogonal Drawings of Planar 3-Graphs.

[BibT_eX]

[DOI]

CoRR, 2018

A Visualization Framework and User Studies for Overloaded Orthogonal Drawings.

[BibT_eX]

[DOI]

Evgenios M. Kornaropoulos

Comput. Graph. Forum, 2018

Ortho-polygon Visibility Representations of Embedded Graphs.

[BibT_eX]

[DOI]

Stephen K. Wismath

Algorithmica, 2018

Bend-Minimum Orthogonal Drawings in Quadratic Time.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2017

On RAC drawings of 1-planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

Vertex-Coloring with Defects.

[BibT_eX]

[DOI]

Chrysanthi N. Raftopoulou

Vincenzo Roselli

Antonios Symvonis

J. Graph Algorithms Appl., 2017

Large graph visualizations using a distributed computing platform.

[BibT_eX]

[DOI]

Inf. Sci., 2017

Area-Thickness Trade-Offs for Straight-Line Drawings of Planar Graphs.

[BibT_eX]

[DOI]

Comput. J., 2017

On the Relationship Between k-Planar and k-Quasi-Planar Graphs.

[BibT_eX]

[DOI]

Ignaz Rutter

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

GiViP: A Visual Profiler for Distributed Graph Processing Systems.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016

Upward Graph Drawing.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Recognizing and drawing IC-planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

A Distributed Force-Directed Algorithm on Giraph: Design and Experiments.

[BibT_eX]

[DOI]

CoRR, 2016

Computing Quasi-Upward Planar Drawings of Mixed Graphs.

[BibT_eX]

[DOI]

Comput. J., 2016

Fully dynamic semantic word clouds.

[BibT_eX]

[DOI]

Enrico Spataro

Proceedings of the 7th International Conference on Information, 2016

1-Bend RAC Drawings of 1-Planar Graphs.

[BibT_eX]

[DOI]

Saeed Mehrabi

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Placing Arrows in Directed Graph Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

2015

Fan-planarity: Properties and complexity.

[BibT_eX]

[DOI]

Antonios Symvonis

Theor. Comput. Sci., 2015

Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Planar and Quasi-Planar Simultaneous Geometric Embedding.

[BibT_eX]

[DOI]

Comput. J., 2015

Heuristics for the Maximum 2-Layer RAC Subgraph Problem.

[BibT_eX]

[DOI]

Comput. J., 2015

Monotone Drawings of Graphs with Fixed Embedding.

[BibT_eX]

[DOI]

Algorithmica, 2015

Network visualization retargeting.

[BibT_eX]

[DOI]

Proceedings of the 6th International Conference on Information, 2015

Low ply graph drawing.

[BibT_eX]

[DOI]

Proceedings of the 6th International Conference on Information, 2015

Kojaph: Visual Definition and Exploration of Patterns in Graph Databases.

[BibT_eX]

[DOI]

Francesco Giacchè

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2-Layer Fan-Planarity: From Caterpillar to Stegosaurus.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

A Million Edge Drawing for a Fistful of Dollars.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014

Techniques for Edge Stratification of Complex Graph Drawings.

[BibT_eX]

[DOI]

J. Vis. Lang. Comput., 2014

Network visualization for financial crime detection.

[BibT_eX]

[DOI]

J. Vis. Lang. Comput., 2014

Upward and quasi-upward planarity testing of embedded mixed graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Fast layout computation of clustered networks: Algorithmic advances and experimental analysis.

[BibT_eX]

[DOI]

Inf. Sci., 2014

Properties and Complexity of Fan-Planarity.

[BibT_eX]

[DOI]

CoRR, 2014

Special Issue on the 28th European Workshop on Computational Geometry, Guest Editors' Foreword.

[BibT_eX]

[DOI]

Comput. Geom., 2014

2-Layer Right Angle Crossing Drawings.

[BibT_eX]

[DOI]

Algorithmica, 2014

Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Upward-rightward planar drawings.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Information, 2014

How to visualize directed graphs: A user study.

[BibT_eX]

[DOI]

Evangelos Pallas

Proceedings of the 5th International Conference on Information, 2014

A Model of Web-Based Follow-Up to Reduce Assistive Technology Abandonment.

[BibT_eX]

[DOI]

Stefano Federici

Maria Laura Mele

Proceedings of the Human-Computer Interaction. Applications and Services, 2014

On the Complexity of HV-rectilinear Planarity Testing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

Fan-Planar Graphs: Combinatorial Properties and Complexity Results.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

2013

Spine and Radial Drawings.

[BibT_eX]

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

GDToolkit.

[BibT_eX]

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

Guest Editors' Foreword.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2013

Density of straight-line 1-planar graph drawings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Drawings of Non-planar Graphs with Crossing-free Subgraphs.

[BibT_eX]

[DOI]

CoRR, 2013

Area requirement of graph drawings with few crossings per edge.

[BibT_eX]

[DOI]

Comput. Geom., 2013

On the robustness of the Drosophila neural network.

[BibT_eX]

[DOI]

Proceedings of the 2nd IEEE Network Science Workshop, 2013

TRART: A system to support territorial policies.

[BibT_eX]

[DOI]

Mariano Sartore

Proceedings of the Workshop Proceedings of the 9th International Conference on Intelligent Environments, 2013

Exploring Complex Drawings via Edge Stratification.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 21st International Symposium, 2013

Drawing Non-Planar Graphs with Crossing-Free Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012

Drawing a tree as a minimum spanning tree approximation.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

Vertex angle and crossing angle resolution of leveled tree drawings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Drawing trees in a streaming model.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Bounds on the crossing resolution of complete geometric graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Fast Layout Computation of Hierarchically Clustered Networks: Algorithmic Advances and Experimental Analysis.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Information Visualisation, 2012

Vis4AUI: Visual Analysis of Banking Activity Networks.

[BibT_eX]

[DOI]

Proceedings of the GRAPP & IVAPP 2012: Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications, 2012

2011

Visual Analysis of Large Graphs Using (X, Y)-Clustering and Hybrid Visualizations.

[BibT_eX]

[DOI]

Vladimir Batagelj

Franz-Josef Brandenburg

IEEE Trans. Vis. Comput. Graph., 2011

Drawing graphs with right angle crossings.

[BibT_eX]

[DOI]

Peter Eades

Theor. Comput. Sci., 2011

Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

A Graph Drawing Application to Web Site Traffic Analysis.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

Switch-Regular Upward Planarity Testing of Directed Trees.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

On the Perspectives Opened by Right Angle Crossing Drawings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Upward Planarity Testing of Embedded Mixed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 19th International Symposium, 2011

An advanced network visualization system for financial crime detection.

[BibT_eX]

[DOI]

Pietro Palladino

Proceedings of the IEEE Pacific Visualization Symposium, 2011

2010

Visual Analysis of One-To-Many Matched Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2010

A characterization of complete bipartite RAC graphs.

[BibT_eX]

[DOI]

Peter Eades

Inf. Process. Lett., 2010

Constrained Point-Set Embeddability of Planar Graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2010

Upward straight-line embeddings of directed graphs into point sets.

[BibT_eX]

[DOI]

Alejandro Estrella-Balderrama

Fabrizio Frati

Stephen G. Kobourov

Comput. Geom., 2010

Switch-Regular Upward Planar Embeddings of Trees.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Topology-Driven Force-Directed Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 18th International Symposium, 2010

Visual analysis of financial crimes: [system paper].

[BibT_eX]

[DOI]

Proceedings of the International Conference on Advanced Visual Interfaces, 2010

Graph visualization techniques for conceptual Web site traffic analysis.

[BibT_eX]

[DOI]

Proceedings of the IEEE Pacific Visualization Symposium PacificVis 2010, 2010

Visual analysis of large graphs using (X, Y)-clustering and hybrid visualizations.

[BibT_eX]

[DOI]

Proceedings of the IEEE Pacific Visualization Symposium PacificVis 2010, 2010

2009

Upward Spirality and Upward Planarity Testing.

[BibT_eX]

[DOI]

Francesco Giordano

SIAM J. Discret. Math., 2009

Matched Drawings of Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2009

Point-set embeddings of trees with given partial drawings.

[BibT_eX]

[DOI]

Comput. Geom., 2009

On Directed Graphs with an Upward Straight-line.

[BibT_eX]

[DOI]

Alejandro Estrella-Balderrama

Fabrizio Frati

Stephen G. Kobourov

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

k-colored Point-set Embeddability of Outerplanar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2008

Overlapping Cluster Planarity.

[BibT_eX]

[DOI]

Francesco Giordano

J. Graph Algorithms Appl., 2008

Radial drawings of graphs: Geometric constraints and trade-offs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

Maximum upward planar subgraphs of embedded planar digraphs.

[BibT_eX]

[DOI]

Francesco Giordano

Comput. Geom., 2008

08191 Working Group Report - X-graphs of Y-graphs and their Representations.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing with Applications to Bioinformatics and Social Sciences, 04.05., 2008

WhatsOnWeb+ : An Enhanced Visual Search Clustering Engine.

[BibT_eX]

[DOI]

Proceedings of the IEEE VGTC Pacific Visualization Symposium 2008, 2008

2007

Graph Visualization Techniques for Web Clustering Engines.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 2007

Point-Set Embedding of Trees with Edge Constraints.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 15th International Symposium, 2007

Homothetic Triangle Contact Representations of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

k-Spine, 1-bend planarity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Upward Planar Drawings and Switch-regularity Heuristics.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2006

Book Embeddability of Series-Parallel Digraphs.

[BibT_eX]

[DOI]

Algorithmica, 2006

k -Colored Point-Set Embeddability of Outerplanar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 14th International Symposium, 2006

2005

Computing Radial Drawings on the Minimum Number of Circles.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2005

Curve-constrained drawings of planar graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2005

Orthogonal drawings of graphs with vertex and edge labels.

[BibT_eX]

[DOI]

Comput. Geom., 2005

A Topology-Driven Approach to the Design of Web Meta-search Clustering Engines.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

Computing Upward Planar Drawings Using Switch-Regularity Heuristics.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

WhatsOnWeb: Using Graph Drawing to Search the Web.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 13th International Symposium, 2005

Experiments on Area Compaction Algorithms for Orthogonal Drawings.

[BibT_eX]

[DOI]

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 12th International Symposium, 2004

DBdraw - Automatic Layout of Relational Database Schemas.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing Software, 2004

Polyphemus and Hermes - Exploration and Visualization of Computer Networks.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing Software, 2004

2003

Upward Embeddings and Orientations of Undirected Planar Graphs.

[BibT_eX]

[DOI]

Maurizio Pizzonia

J. Graph Algorithms Appl., 2003

Drawing Planar Graphs on a Curve.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002

Drawing database schemas.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 2002

Visualization of the High Level Structure of the Internet with HERMES.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2002

A Software System for Computing Labeled Orthogonal Drawings of Graphs.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Graph-Based Tools, 2002

Quasi-Upward Planarity.

[BibT_eX]

[DOI]

Paola Bertolazzi

Algorithmica, 2002

Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 10th International Symposium, 2002

Computing Labeled Orthogonal Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 10th International Symposium, 2002

2001

Industrial Plant Drawer.

[BibT_eX]

[DOI]

Maurizio Pizzonia

Proceedings of the Graph Drawing, 9th International Symposium, 2001

Labeling Heuristics for Orthogonal Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

Drawing Database Schemas with DBdraw.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

Planarization of Clustered Graphs.

[BibT_eX]

[DOI]

A. Marcandalli

Proceedings of the Graph Drawing, 9th International Symposium, 2001

Exploration and Visualization of Computer Networks: Polyphemus and Hermes.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

2000

Computing Orthogonal Drawings with the Minimum Number of Bends.

[BibT_eX]

[DOI]

Paola Bertolazzi

IEEE Trans. Computers, 2000

Turn-regularity and optimal area drawings of orthogonal representations.

[BibT_eX]

[DOI]

Comput. Geom., 2000

Drawing Relational Schemas.

[BibT_eX]

[DOI]

Proceedings of the 2nd Joint Eurographics - IEEE TCVG Symposium on Visualization, 2000

Visualization of the Autonomous Systems Interconnections with HERMES.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999

Turn-Regularity and Planar Orthogonal Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 7th International Symposium, 1999

Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 7th International Symposium, 1999

1998

Computing Orthogonal Drawings in a Variable Embedding Setting.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997

GRID: An Interactive Tool for Computing Orthogonal Drawings With the Minimum Number of Bends.

[BibT_eX]

[DOI]