Follow
Carla Binucci
Title
Cited by
Cited by
Year
Fan-planarity: Properties and complexity
C Binucci, E Di Giacomo, W Didimo, F Montecchiani, M Patrignani, ...
Theoretical Computer Science 589, 76-86, 2015
562015
Designing the content analyzer of a travel recommender system
C Binucci, F De Luca, E Di Giacomo, G Liotta, F Montecchiani
Expert Systems with Applications 87, 199-208, 2017
432017
Drawing trees in a streaming model
C Binucci, U Brandes, G Di Battista, W Didimo, M Gaertler, P Palladino, ...
Information Processing Letters 112 (11), 418-422, 2012
352012
Orthogonal drawings of graphs with vertex and edge labels
C Binucci, W Didimo, G Liotta, M Nonato
Computational Geometry 32 (2), 71-114, 2005
322005
Upward straight-line embeddings of directed graphs into point sets
C Binucci, E Di Giacomo, W Didimo, A Estrella-Balderrama, F Frati, ...
Computational Geometry 43 (2), 219-232, 2010
302010
Homothetic Triangle Contact Representations of Planar Graphs.
M Badent, C Binucci, E Di Giacomo, W Didimo, S Felsner, F Giordano, ...
CCCG, 233-236, 2007
282007
Algorithms and characterizations for 2-layer fan-planarity: From caterpillar to stegosaurus
C Binucci, M Chimani, W Didimo, M Gronemann, K Klein, J Kratochvíl, ...
Journal of Graph Algorithms and Applications 21 (1), 81-102, 2017
242017
Upward book embeddings of st-graphs
C Binucci, G Da Lozzo, E Di Giacomo, W Didimo, T Mchedlidze, ...
arXiv preprint arXiv:1903.07966, 2019
232019
1-page and 2-page drawings with bounded number of crossings per edge
C Binucci, E Di Giacomo, MI Hossain, G Liotta
European Journal of Combinatorics 68, 24-37, 2018
202018
Upward and quasi-upward planarity testing of embedded mixed graphs
C Binucci, W Didimo, M Patrignani
Theoretical Computer Science 526, 75-89, 2014
192014
Maximum upward planar subgraphs of embedded planar digraphs
C Binucci, W Didimo, F Giordano
Computational Geometry 41 (3), 230-246, 2008
162008
Labeling heuristics for orthogonal drawings
C Binucci, W Didimo, G Liotta, M Nonato
Graph Drawing: 9th International Symposium, GD 2001 Vienna, Austria …, 2002
162002
Universal point subsets for planar graphs
P Angelini, C Binucci, W Evans, F Hurtado, G Liotta, T Mchedlidze, ...
International Symposium on Algorithms and Computation, 423-432, 2012
152012
Partial edge drawing: Homogeneity is more important than crossings and ink
C Binucci, G Liotta, F Montecchiani, A Tappini
2016 7th International Conference on Information, Intelligence, Systems …, 2016
142016
Computing quasi-upward planar drawings of mixed graphs
C Binucci, W Didimo
The Computer Journal 59 (1), 133-150, 2016
122016
10 reasons to get interested in graph drawing
C Binucci, U Brandes, T Dwyer, M Gronemann, R von Hanxleden, ...
Computing and Software Science: State of the Art and Perspectives, 85-104, 2019
112019
Placing arrows in directed graph drawings
C Binucci, M Chimani, W Didimo, G Liotta, F Montecchiani
Graph Drawing and Network Visualization: 24th International Symposium, GD …, 2016
102016
Fan-planar graphs: combinatorial properties and complexity results
C Binucci, E Di Giacomo, W Didimo, F Montecchiani, M Patrignani, ...
Graph Drawing: 22nd International Symposium, GD 2014, Würzburg, Germany …, 2014
102014
Computing labeled orthogonal drawings
C Binucci, W Didimo, G Liotta, M Nonato
Graph Drawing: 10th International Symposium, GD 2002 Irvine, CA, USA, August …, 2002
102002
Fully dynamic semantic word clouds
C Binucci, W Didimo, E Spataro
2016 7th International Conference on Information, Intelligence, Systems …, 2016
92016
The system can't perform the operation now. Try again later.
Articles 1–20