Emilio Di Giacomo

Martin Nöllenburg

Antonios Symvonis

J. Comput. Syst. Sci., February, 2024

On 1-Bend Upward Point-Set Embeddings of st-Digraphs.

[BibT_eX]

[DOI]

Antonios Symvonis

Anaïs Villedieu

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

Upward Book Embeddability of st-Graphs: Complexity and Algorithms.

[BibT_eX]

[DOI]

Algorithmica, December, 2023

k-Planar Placement and Packing of Δ-Regular Caterpillars.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., November, 2023

Editorial.

[BibT_eX]

[DOI]

Comput. Geom., April, 2023

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

[BibT_eX]

[DOI]

CoRR, 2023

On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity.

[BibT_eX]

[DOI]

Giacomo Ortali

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

Orthogonal planarity testing of bounded treewidth graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

Universal Slope Sets for Upward Planar Drawings.

[BibT_eX]

[DOI]

Chrysanthi N. Raftopoulou

Algorithmica, 2022

Testing Upward Planarity of Partial 2-Trees.

[BibT_eX]

[DOI]

Kirill Simonov

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

Parameterized Algorithms for Upward Planarity.

[BibT_eX]

[DOI]

Chrysanthi N. Raftopoulou

Kirill Simonov

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

(k, p)-planarity: A relaxation of hybrid planarity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

2-colored point-set embeddings of partial 2-trees.

[BibT_eX]

[DOI]

Jaroslav Hancl Jr.

Theor. Comput. Sci., 2021

Packing Trees into 1-planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2021

Stable visualization of connected components in dynamic graphs.

[BibT_eX]

[DOI]

Inf. Vis., 2021

Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

A User Study on Hybrid Graph Visualizations.

[BibT_eX]

[DOI]

Alessandra Tappini

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

Quasi-upward Planar Drawings with Minimum Curve Complexity.

[BibT_eX]

[DOI]

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

2020

On the curve complexity of 3-colored point-set embeddings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Polyline drawings with topological constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

1-bend upward planar slope number of SP-digraphs.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Colored anchored visibility representations in 2D and 3D space.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Storyline Visualizations with Ubiquitous Actors.

[BibT_eX]

[DOI]

Alessandra Tappini

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

2019

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

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

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

[BibT_eX]

[DOI]

Chrysanthi N. Raftopoulou

Discret. Math., 2019

NodeTrix Planarity Testing with Small Clusters.

[BibT_eX]

[DOI]

Algorithmica, 2019

(k, p)-Planarity: A Relaxation of Hybrid Planarity.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs.

[BibT_eX]

[DOI]

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

Drawing subcubic planar graphs with four slopes and optimal angular resolution.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

New results on edge partitions of 1-plane graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

1-page and 2-page drawings with bounded number of crossings per edge.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

Visibility representations of boxes in 2.5 dimensions.

[BibT_eX]

[DOI]

Sue Whitesides

Comput. Geom., 2018

Ortho-polygon Visibility Representations of Embedded Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2018

2017

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Anna Lubiw

J. Graph Algorithms Appl., 2017

Designing the Content Analyzer of a Travel Recommender System.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2017

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

[BibT_eX]

[DOI]

Comput. J., 2017

NodeTrix Planarity Testing with Small Clusters.

[BibT_eX]

[DOI]

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

Colored Point-Set Embeddings of Acyclic Graphs.

[BibT_eX]

[DOI]

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

2016

Lower and upper bounds for long induced paths in 3-connected planar graphs.

[BibT_eX]

[DOI]

Tamara Mchedlidze

Theor. Comput. Sci., 2016

1-Bend Upward Planar Drawings of SP-Digraphs.

[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

Drawing Outer 1-planar Graphs with Few Slopes.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 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]

Salvatore Agostino Romeo

Comput. J., 2015

The Approximate Rectangle of Influence Drawability Problem.

[BibT_eX]

[DOI]

Henk Meijer

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

VisFLOWer: Visual analysis of touristic flows.

[BibT_eX]

[DOI]

Proceedings of the 6th International Conference on Information, 2015

2014

Techniques for Edge Stratification of Complex Graph Drawings.

[BibT_eX]

[DOI]

J. Vis. Lang. Comput., 2014

Properties and Complexity of Fan-Planarity.

[BibT_eX]

[DOI]

CoRR, 2014

2-Layer Right Angle Crossing Drawings.

[BibT_eX]

[DOI]

Algorithmica, 2014

The Planar Slope Number of Subcubic Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Upward-rightward planar drawings.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Information, 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

Orthogeodesic point-set embedding of trees.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Area requirement of graph drawings with few crossings per edge.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Exploring Complex Drawings via Edge Stratification.

[BibT_eX]

[DOI]

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

2012

Hamiltonian orthogeodesic alternating paths.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Drawing a tree as a minimum spanning tree approximation.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

Bounds on the crossing resolution of complete geometric graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

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

[BibT_eX]

[DOI]

Tamara Mchedlidze

CoRR, 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

2011

Upward Topological Book Embeddings of DAGs.

[BibT_eX]

[DOI]

Francesco Giordano

SIAM J. Discret. Math., 2011

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

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

Switch-Regular Upward Planarity Testing of Directed Trees.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

2010

Visual Analysis of One-To-Many Matched Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 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

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

[BibT_eX]

[DOI]

Francesco Trotta

Algorithmica, 2010

The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing.

[BibT_eX]

[DOI]

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

Switch-Regular Upward Planar Embeddings of Trees.

[BibT_eX]

[DOI]

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

Information Visualization Techniques for Motion Impaired People.

[BibT_eX]

Stefano Federici

Proceedings of the HEALTHINF 2010, 2010

Visual analysis of financial crimes: [system paper].

[BibT_eX]

[DOI]

Proceedings of the International Conference on Advanced Visual Interfaces, 2010

2009

Matched Drawings of Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2009

Volume requirements of 3D upward drawings.

[BibT_eX]

[DOI]

Discret. Math., 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

Drawing colored graphs on colored points.

[BibT_eX]

[DOI]

Melanie Badent

Theor. Comput. Sci., 2008

Drawing Bipartite Graphs on Two Parallel Convex Curves.

[BibT_eX]

[DOI]

Luca Grilli

J. Graph Algorithms Appl., 2008

k-colored Point-set Embeddability of Outerplanar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2008

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

[BibT_eX]

[DOI]

J. Discrete Algorithms, 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

Simultaneous Embedding of Outerplanar Graphs, Paths, and Cycles.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 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

On Embedding a Graph on Two Sets of Points.

[BibT_eX]

[DOI]

Francesco Trotta

Int. J. Found. Comput. Sci., 2006

Book Embeddability of Series-Parallel Digraphs.

[BibT_eX]

[DOI]

Algorithmica, 2006

Drawing Bipartite Graphs on Two Curves.

[BibT_eX]

[DOI]

Luca Grilli

Proceedings of the Graph Drawing, 14th International Symposium, 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

Computing straight-line 3D grid drawings of graphs in linear volume.

[BibT_eX]

[DOI]

Henk Meijer

Comput. Geom., 2005

Curve-constrained drawings of planar graphs.

[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

How to Embed a Path onto Two Sets of Points.

[BibT_eX]

[DOI]

Francesco Trotta

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

WhatsOnWeb: Using Graph Drawing to Search the Web.

[BibT_eX]

[DOI]

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

A note on simultaneous embedding of planar graphs.

[BibT_eX]

[DOI]

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

2004

A note on 3D orthogonal drawings with direction constrained edges.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

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

[BibT_eX]

[DOI]

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

2003

Drawing Planar Graphs on a Curve.

[BibT_eX]

[DOI]

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

Track Drawings of Graphs with Constant Queue Number.

[BibT_eX]

[DOI]

Henk Meijer

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

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

[BibT_eX]

[DOI]

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

Drawing Series-Parallel Graphs on Restricted Integer 3D Grids.

[BibT_eX]

[DOI]

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

2002

Orthogonal 3D Shapes of Theta Graphs.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

Drawing series-parallel graphs on a box.

[BibT_eX]

[DOI]

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001

WAVE.

[BibT_eX]

[DOI]