Giuseppe Liotta

Orcid: 0000-0002-2886-9694

Affiliations:
  • University of Perugia, Department of Engineering, Italy


According to our database1, Giuseppe Liotta authored at least 296 papers between 1991 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the complexity of the storyplan problem.
J. Comput. Syst. Sci., February, 2024

Outerplanar and Forest Storyplans.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023
k-Planar Placement and Packing of Δ-Regular Caterpillars.
Int. J. Found. Comput. Sci., November, 2023

Mutual witness Gabriel drawings of complete bipartite graphs.
Theor. Comput. Sci., September, 2023

Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time.
Algorithmica, September, 2023

Parameterized complexity of graph planarity with restricted cyclic orders.
J. Comput. Syst. Sci., August, 2023

Drawing Partial 2-Trees with Few Slopes.
Algorithmica, May, 2023

Rectilinear Planarity of Partial 2-Trees.
J. Graph Algorithms Appl., 2023

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

Nonplanar Graph Drawings with k Vertices per Face.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Parameterized Approaches to Orthogonal Compaction.
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Rectilinear-Upward Planarity Testing of Digraphs.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges (short paper).
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

Three Edge-Disjoint Plane Spanning Paths in a Point Set.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Mutual Witness Proximity Drawings of Isomorphic Trees.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Min-k-planar Drawings of Graphs.
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.
Proceedings of the Advanced Information Networking and Applications, 2023

2022
Influence Maximization With Visual Analytics.
IEEE Trans. Vis. Comput. Graph., 2022

Editor in Chief's Foreword.
J. Graph Algorithms Appl., 2022

Orthogonal planarity testing of bounded treewidth graphs.
J. Comput. Syst. Sci., 2022

Placing Arrows in Directed Graph Layouts: Algorithms and Experiments.
Comput. Graph. Forum, 2022

Universal Slope Sets for Upward Planar Drawings.
Algorithmica, 2022

BrowVis: Visualizing Large Graphs in the Browser.
IEEE Access, 2022

In-browser Visualization of Large-scale Graphs.
Proceedings of the 1st Italian Conference on Big Data and Data Science (itaDATA 2022), 2022

2021
Simultaneous FPQ-ordering and hybrid planarity testing.
Theor. Comput. Sci., 2021

Ortho-polygon visibility representations of 3-connected 1-plane graphs.
Theor. Comput. Sci., 2021

(<i>k</i>, <i>p</i>)-planarity: A relaxation of hybrid planarity.
Theor. Comput. Sci., 2021

2-colored point-set embeddings of partial 2-trees.
Theor. Comput. Sci., 2021

Packing Trees into 1-planar Graphs.
J. Graph Algorithms Appl., 2021

Stable visualization of connected components in dynamic graphs.
Inf. Vis., 2021

On Edge-Length Ratios of Partial 2-Trees.
Int. J. Comput. Geom. Appl., 2021

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

Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Long-Lasting Sequences of BGP Updates.
Proceedings of the Passive and Active Measurement - 22nd International Conference, 2021

Quasi-upward Planar Drawings with Minimum Curve Complexity.
Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

Optimal-Area Visibility Representations of Outer-1-Plane Graphs.
Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

Generalized LR-Drawings of Trees.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020
Corrigendum to "On the edge-length ratio of outerplanar graphs" [Theoret. Comput. Sci. 770 (2019) 88-94].
Theor. Comput. Sci., 2020

On the curve complexity of 3-colored point-set embeddings.
Theor. Comput. Sci., 2020

Polyline drawings with topological constraints.
Theor. Comput. Sci., 2020

Trends and Perspectives for Graph Drawing and Network Visualization (NII Shonan Meeting 171).
NII Shonan Meet. Rep., 2020

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

1-bend upward planar slope number of SP-digraphs.
Comput. Geom., 2020

Colored anchored visibility representations in 2D and 3D space.
Comput. Geom., 2020

Graph Planarity by Replacing Cliques with Paths.
Algorithms, 2020

Combining Network Visualization and Data Mining for Tax Risk Assessment.
IEEE Access, 2020

Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Storyline Visualizations with Ubiquitous Actors.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

On the Edge-Length Ratio of 2-Trees.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

VAIM: Visual Analytics for Influence Maximization.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

Visual Analytics for Financial Crime Detection at the University of Perugia.
Proceedings of the Advanced Visual Interfaces. Supporting Artificial Intelligence and Big Data Applications, 2020

Edge Partitions and Visibility Representations of 1-planar Graphs.
Proceedings of the Beyond Planar Graphs, Communications of NII Shonan Meetings., 2020

2019
A Distributed Multilevel Force-Directed Algorithm.
IEEE Trans. Parallel Distributed Syst., 2019

On the edge-length ratio of outerplanar graphs.
Theor. Comput. Sci., 2019

An Experimental Study on the Ply Number of Straight-line Drawings.
J. Graph Algorithms Appl., 2019

HV-planarity: Algorithms and complexity.
J. Comput. Syst. Sci., 2019

Visual querying and analysis of temporal fiscal networks.
Inf. Sci., 2019

Edge partitions of optimal 2-plane and 3-plane graphs.
Discret. Math., 2019

A Survey on Graph Drawing Beyond Planarity.
ACM Comput. Surv., 2019

On the edge-length ratio of 2-trees.
CoRR, 2019

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

Graph Planarity Testing with Hierarchical Embedding Constraints.
CoRR, 2019

NodeTrix Planarity Testing with Small Clusters.
Algorithmica, 2019

Universal Slope Sets for 1-Bend Planar Drawings.
Algorithmica, 2019

(k, p)-Planarity: A Relaxation of Hybrid Planarity.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

The QuaSEFE Problem.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018
Drawing subcubic planar graphs with four slopes and optimal angular resolution.
Theor. Comput. Sci., 2018

New results on edge partitions of 1-plane graphs.
Theor. Comput. Sci., 2018

Profiling distributed graph processing systems through visual analytics.
Future Gener. Comput. Syst., 2018

1-page and 2-page drawings with bounded number of crossings per edge.
Eur. J. Comb., 2018

A visual analytics system to support tax evasion discovery.
Decis. Support Syst., 2018

Monotone Simultaneous Paths Embeddings in ℝ<sup>d</sup>.
Discret. Math. Theor. Comput. Sci., 2018

Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs.
Discret. Comput. Geom., 2018

(k, p)-Planarity: A Generalization of Hybrid Planarity.
CoRR, 2018

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

Visibility representations of boxes in 2.5 dimensions.
Comput. Geom., 2018

Ortho-polygon Visibility Representations of Embedded Graphs.
Algorithmica, 2018

On the Planar Split Thickness of Graphs.
Algorithmica, 2018

The Partial Visibility Representation Extension Problem.
Algorithmica, 2018

Bend-Minimum Orthogonal Drawings in Quadratic Time.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

Turning Cliques into Paths to Achieve Planarity.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2017
On partitioning the edges of 1-plane graphs.
Theor. Comput. Sci., 2017

On RAC drawings of 1-planar graphs.
Theor. Comput. Sci., 2017

Large graph visualizations using a distributed computing platform.
Inf. Sci., 2017

Designing the Content Analyzer of a Travel Recommender System.
Expert Syst. Appl., 2017

An annotated bibliography on 1-planarity.
Comput. Sci. Rev., 2017

Area-Thickness Trade-Offs for Straight-Line Drawings of Planar Graphs.
Comput. J., 2017

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

NodeTrix Planarity Testing with Small Clusters.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Colored Point-Set Embeddings of Acyclic Graphs.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

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

GiViP: A Visual Profiler for Distributed Graph Processing Systems.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

A Universal Slope Set for 1-Bend Planar Drawings.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
Lower and upper bounds for long induced paths in 3-connected planar graphs.
Theor. Comput. Sci., 2016

Simultaneous visibility representations of plane st-graphs using L-shapes.
Theor. Comput. Sci., 2016

Recognizing and drawing IC-planar graphs.
Theor. Comput. Sci., 2016

Dynamic Networks Visual Analytics: Approaches to facilitate visual analysis of complex and dynamic network data (NII Shonan Meeting 2016-11).
NII Shonan Meet. Rep., 2016

L-visibility drawings of IC-planar graphs.
Inf. Process. Lett., 2016

Monotone Simultaneous Embeddings of Paths in R^d.
CoRR, 2016

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

Alternating paths and cycles of minimum length.
Comput. Geom., 2016

Partial edge drawing: Homogeneity is more important than crossings and ink.
Proceedings of the 7th International Conference on Information, 2016

1-Bend Upward Planar Drawings of SP-Digraphs.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

1-Bend RAC Drawings of 1-Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Monotone Simultaneous Embeddings of Paths in d Dimensions.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Placing Arrows in Directed Graph Drawings.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

On Visibility Representations of Non-Planar Graphs.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Big Graph Drawing: Metrics and Methods (NII Shonan Meeting 2015-1).
NII Shonan Meet. Rep., 2015

Drawing Outer 1-planar Graphs with Few Slopes.
J. Graph Algorithms Appl., 2015

Computing upward topological book embeddings of upward planar digraphs.
J. Discrete Algorithms, 2015

On Partitioning the Edges of 1-Planar Graphs.
CoRR, 2015

Planar and Quasi-Planar Simultaneous Geometric Embedding.
Comput. J., 2015

Heuristics for the Maximum 2-Layer RAC Subgraph Problem.
Comput. J., 2015

A Linear-Time Algorithm for Testing Outer-1-Planarity.
Algorithmica, 2015

The Approximate Rectangle of Influence Drawability Problem.
Algorithmica, 2015

Straight-Line Drawability of a Planar Graph Plus an Edge.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Network visualization retargeting.
Proceedings of the 6th International Conference on Information, 2015

Low ply graph drawing.
Proceedings of the 6th International Conference on Information, 2015

VisFLOWer: Visual analysis of touristic flows.
Proceedings of the 6th International Conference on Information, 2015

A Million Edge Drawing for a Fistful of Dollars.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014
Techniques for Edge Stratification of Complex Graph Drawings.
J. Vis. Lang. Comput., 2014

Network visualization for financial crime detection.
J. Vis. Lang. Comput., 2014

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

2-Layer Right Angle Crossing Drawings.
Algorithmica, 2014

The Planar Slope Number of Subcubic Graphs.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Upward-rightward planar drawings.
Proceedings of the 5th International Conference on Information, 2014

3D proportional contact representations of graphs.
Proceedings of the 5th International Conference on Information, 2014

Graph drawing beyond planarity: some results and open problems.
Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

A Model of Web-Based Follow-Up to Reduce Assistive Technology Abandonment.
Proceedings of the Human-Computer Interaction. Applications and Services, 2014

On the Complexity of HV-rectilinear Planarity Testing.
Proceedings of the Graph Drawing - 22nd International Symposium, 2014

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

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

A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system.
Theor. Comput. Sci., 2013

Proximity Drawings of High-Degree Trees.
Int. J. Comput. Geom. Appl., 2013

Right angle crossing graphs and 1-planarity.
Discret. Appl. Math., 2013

Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs.
CoRR, 2013

Area requirement of graph drawings with few crossings per edge.
Comput. Geom., 2013

Approximate proximity drawings.
Comput. Geom., 2013

On point-sets that support planar graphs.
Comput. Geom., 2013

On the robustness of the Drosophila neural network.
Proceedings of the 2nd IEEE Network Science Workshop, 2013

TRART: A system to support territorial policies.
Proceedings of the Workshop Proceedings of the 9th International Conference on Intelligent Environments, 2013

Planar and Plane Slope Number of Partial 2-Trees.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

Exploring Complex Drawings via Edge Stratification.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012
Hamiltonian orthogeodesic alternating paths.
J. Discrete Algorithms, 2012

Drawing a tree as a minimum spanning tree approximation.
J. Comput. Syst. Sci., 2012

Universal point sets for 2-coloured trees.
Inf. Process. Lett., 2012

Vertex angle and crossing angle resolution of leveled tree drawings.
Inf. Process. Lett., 2012

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

Bounds on the crossing resolution of complete geometric graphs.
Discret. Appl. Math., 2012

How many vertex locations can be arbitrarily chosen when drawing planar graphs?
CoRR, 2012

h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Universal Point Subsets for Planar Graphs.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Vis4AUI: Visual Analysis of Banking Activity Networks.
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

Point-Set Embeddability of 2-Colored Trees.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract).
Proceedings of the Graph Drawing - 20th International Symposium, 2012

On Representing Graphs by Touching Cuboids.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Fáry's Theorem for 1-Planar Graphs.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011
Visual Analysis of Large Graphs Using (X, Y)-Clustering and Hybrid Visualizations.
IEEE Trans. Vis. Comput. Graph., 2011

Drawing graphs with right angle crossings.
Theor. Comput. Sci., 2011

Upward Topological Book Embeddings of DAGs.
SIAM J. Discret. Math., 2011

Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings.
Theory Comput. Syst., 2011

A Graph Drawing Application to Web Site Traffic Analysis.
J. Graph Algorithms Appl., 2011

Geometric Simultaneous Embeddings of a Graph and a Matching.
J. Graph Algorithms Appl., 2011

Colored Simultaneous Geometric Embeddings and Universal Pointsets.
Algorithmica, 2011

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

An advanced network visualization system for financial crime detection.
Proceedings of the IEEE Pacific Visualization Symposium, 2011

2010
Visual Analysis of One-To-Many Matched Graphs.
J. Graph Algorithms Appl., 2010

A characterization of complete bipartite RAC graphs.
Inf. Process. Lett., 2010

Constrained Point-Set Embeddability of Planar Graphs.
Int. J. Comput. Geom. Appl., 2010

Universal Sets of <i>n</i> Points for One-bend Drawings of Planar Graphs with <i>n</i> Vertices.
Discret. Comput. Geom., 2010

Matched drawability of graph pairs and of graph triples.
Comput. Geom., 2010

Upward straight-line embeddings of directed graphs into point sets.
Comput. Geom., 2010

Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge.
Algorithmica, 2010

The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Beyond a Visuocentric Way of a Visual Web Search Clustering Engine: The Sonification of WhatsOnWeb.
Proceedings of the Computers Helping People with Special Needs, 2010

Universal Pointsets for 2-Coloured Trees.
Proceedings of the Graph Drawing - 18th International Symposium, 2010

On Graphs Supported by Line Sets.
Proceedings of the Graph Drawing - 18th International Symposium, 2010

Topology-Driven Force-Directed Algorithms.
Proceedings of the Graph Drawing - 18th International Symposium, 2010

Information Visualization Techniques for Motion Impaired People.
Proceedings of the HEALTHINF 2010, 2010

Visual analysis of financial crimes: [system paper].
Proceedings of the International Conference on Advanced Visual Interfaces, 2010

Graph visualization techniques for conceptual Web site traffic analysis.
Proceedings of the IEEE Pacific Visualization Symposium PacificVis 2010, 2010

Visual analysis of large graphs using (X, Y)-clustering and hybrid visualizations.
Proceedings of the IEEE Pacific Visualization Symposium PacificVis 2010, 2010

2009
Upward Spirality and Upward Planarity Testing.
SIAM J. Discret. Math., 2009

Matched Drawings of Planar Graphs.
J. Graph Algorithms Appl., 2009

Volume requirements of 3D upward drawings.
Discret. Math., 2009

Point-set embeddings of trees with given partial drawings.
Comput. Geom., 2009

On Directed Graphs with an Upward Straight-line.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
Drawing colored graphs on colored points.
Theor. Comput. Sci., 2008

Drawing Bipartite Graphs on Two Parallel Convex Curves.
J. Graph Algorithms Appl., 2008

k-colored Point-set Embeddability of Outerplanar Graphs.
J. Graph Algorithms Appl., 2008

Overlapping Cluster Planarity.
J. Graph Algorithms Appl., 2008

Radial drawings of graphs: Geometric constraints and trade-offs.
J. Discrete Algorithms, 2008

On the Parameterized Complexity of Layered Graph Drawing.
Algorithmica, 2008

Embeddability Problems for Upward Planar Digraphs.
Proceedings of the Graph Drawing, 16th International Symposium, 2008

08191 Working Group Report - X-graphs of Y-graphs and their Representations.
Proceedings of the Graph Drawing with Applications to Bioinformatics and Social Sciences, 04.05., 2008

A note on alpha-drawable k-trees.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

WhatsOnWeb+ : An Enhanced Visual Search Clustering Engine.
Proceedings of the IEEE VGTC Pacific Visualization Symposium 2008, 2008

2007
Graph Visualization Techniques for Web Clustering Engines.
IEEE Trans. Vis. Comput. Graph., 2007

Simultaneous Embedding of Outerplanar Graphs, Paths, and Cycles.
Int. J. Comput. Geom. Appl., 2007

Advances in graph drawing: The 11th International Symposium on Graph Drawing.
Discret. Appl. Math., 2007

Computing Upward Topological Book Embeddings of Upward Planar Digraphs.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Point-Set Embedding of Trees with Edge Constraints.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

Universal Sets of <i>n</i> Points for 1-Bend Drawings of Planar Graphs with <i>n</i> Vertices.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

Colored Simultaneous Geometric Embeddings.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

A Note on Drawing Direction-constrained Paths in 3D.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
<i>k</i>-Spine, 1-bend planarity.
Theor. Comput. Sci., 2006

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

On Embedding a Graph on Two Sets of Points.
Int. J. Found. Comput. Sci., 2006

Book Embeddability of Series-Parallel Digraphs.
Algorithmica, 2006

A Fixed-Parameter Approach to 2-Layer Planarization.
Algorithmica, 2006

Drawing Bipartite Graphs on Two Curves.
Proceedings of the Graph Drawing, 14th International Symposium, 2006

<i>k</i> -Colored Point-Set Embeddability of Outerplanar Graphs.
Proceedings of the Graph Drawing, 14th International Symposium, 2006

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

2005
Guest Editor's Foreword.
J. Graph Algorithms Appl., 2005

Computing Radial Drawings on the Minimum Number of Circles.
J. Graph Algorithms Appl., 2005

Computing straight-line 3D grid drawings of graphs in linear volume.
Comput. Geom., 2005

Curve-constrained drawings of planar graphs.
Comput. Geom., 2005

Orthogonal drawings of graphs with vertex and edge labels.
Comput. Geom., 2005

A Topology-Driven Approach to the Design of Web Meta-search Clustering Engines.
Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

How to Embed a Path onto Two Sets of Points.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

WhatsOnWeb: Using Graph Drawing to Search the Web.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

A note on simultaneous embedding of planar graphs.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

2004
Graph drawing.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

A note on 3D orthogonal drawings with direction constrained edges.
Inf. Process. Lett., 2004

Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003
Guest Editors' Foreword.
J. Graph Algorithms Appl., 2003

Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions.
J. Graph Algorithms Appl., 2003

Voronoi drawings of trees.
Comput. Geom., 2003

Optimal and suboptimal robust algorithms for proximity graphs.
Comput. Geom., 2003

Drawing Planar Graphs on a Curve.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Selected Open Problems in Graph Drawing.
Proceedings of the Graph Drawing, 11th International Symposium, 2003


2002
The drawability problem for minimum weight triangulations.
Theor. Comput. Sci., 2002

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

Orthogonal 3D Shapes of Theta Graphs.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

Computing Labeled Orthogonal Drawings.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

Drawing series-parallel graphs on a box.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

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

A Fixed-Parameter Approach to Two-Layer Planarization.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

Labeling Heuristics for Orthogonal Drawings.
Proceedings of the Graph Drawing, 9th International Symposium, 2001


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

Guest Editors' Foreword.
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

Visualizing Algorithms over the Web with the Publication-Driven Approach.
Proceedings of the Algorithm Engineering, 2000

Minimum Weight Drawings of Maximal Triangulations (Extended Abstract).
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
Visualizing geometric algorithms over the Web.
Comput. Geom., 1999

Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time.
Proceedings of the Graph Drawing, 7th International Symposium, 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

1998
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design.
SIAM J. Comput., 1998

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

The rectangle of influence drawability problem.
Comput. Geom., 1998

Checking the convexity of polytopes and the planarity of subdivisions.
Comput. Geom., 1998

Computing Orthogonal Drawings in a Variable Embedding Setting.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

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

Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract).
Proceedings of the Algorithms, 1998

A note on checking proximity graphs.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Area Requirement of Visibility Representations of Trees.
Inf. Process. Lett., 1997

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

Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Drawable and Forbidden Minimum Weight Triangulations.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

Area Requirement of Gabriel Drawings.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996
Drawing Outerplanar Minimum Weight Triangulations.
Inf. Process. Lett., 1996

Characterizing Proximity Trees.
Algorithmica, 1996

Proximity Drawings of Outerplanar Graphs.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

Animating Geometric Algorithms Over the Web.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Robust Proximity Queries in Implicit Voronoi Diagrams.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

The Mocha algorithm animation system.
Proceedings of the workshop on Advanced visual interfaces 1996, 1996

Algorithm animation over the World Wide Web.
Proceedings of the workshop on Advanced visual interfaces 1996, 1996

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

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

A New Model for Algorithm Animation Over the WWW.
ACM Comput. Surv., 1995

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

How to Draw Outerplanar Minimum Weight Triangulations.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

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

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

1994
Upward Drawings of Triconnected Digraphs.
Algorithmica, 1994

Recognizing Rectangle of Influence Drawable Graphs.
Proceedings of the Graph Drawing, DIMACS International Workshop, 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
An automatic layout facility (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

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


  Loading...