Carla Binucci

According to our database1, Carla Binucci authored at least 37 papers between 2001 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
An Experimental Study of a 1-Planarity Testing and Embedding Algorithm.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

2019
10 Reasons to Get Interested in Graph Drawing.
Proceedings of the Computing and Software Science - State of the Art and Perspectives, 2019

Coloring outerplanar graphs and planar 3-trees with small monochromatic components.
CoRR, 2019

Upward Book Embeddings of st-Graphs.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

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

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

2017
Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus.
J. Graph Algorithms Appl., 2017

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

2016
Computing Quasi-Upward Planar Drawings of Mixed Graphs.
Comput. J., 2016

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

Fully dynamic semantic word clouds.
Proceedings of the 7th International Conference on Information, 2016

Placing Arrows in Directed Graph Drawings.
Proceedings of the Graph Drawing and Network Visualization, 2016

2015
Fan-planarity: Properties and complexity.
Theor. Comput. Sci., 2015

Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs.
Comput. Geom., 2015

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

2-Layer Fan-Planarity: From Caterpillar to Stegosaurus.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014
Upward and quasi-upward planarity testing of embedded mixed graphs.
Theor. Comput. Sci., 2014

Properties and Complexity of Fan-Planarity.
CoRR, 2014

Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Fan-Planar Graphs: Combinatorial Properties and Complexity Results.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

2013
Drawings of Non-planar Graphs with Crossing-free Subgraphs.
CoRR, 2013

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

Drawing Non-Planar Graphs with Crossing-Free Subgraphs.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

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

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

2011
Switch-Regular Upward Planarity Testing of Directed Trees.
J. Graph Algorithms Appl., 2011

Upward Planarity Testing of Embedded Mixed Graphs.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

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

Switch-Regular Upward Planar Embeddings of Trees.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

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

2008
Maximum upward planar subgraphs of embedded planar digraphs.
Comput. Geom., 2008

2007
Homothetic Triangle Contact Representations of Planar Graphs.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

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

Experiments on Area Compaction Algorithms for Orthogonal Drawings.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2002
A Software System for Computing Labeled Orthogonal Drawings of Graphs.
Electr. Notes Theor. Comput. Sci., 2002

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

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


  Loading...