Carla Binucci
Title
Cited by
Cited by
Year
Drawing trees in a streaming model
C Binucci, U Brandes, G Di Battista, W Didimo, M Gaertler, P Palladino, ...
International Symposium on Graph Drawing, 292-303, 2009
282009
Orthogonal drawings of graphs with vertex and edge labels
C Binucci, W Didimo, G Liotta, M Nonato
Computational Geometry 32 (2), 71-114, 2005
282005
Fan-planarity: Properties and complexity
C Binucci, E Di Giacomo, W Didimo, F Montecchiani, M Patrignani, ...
Theoretical Computer Science 589, 76-86, 2015
272015
Homothetic Triangle Contact Representations of Planar Graphs.
M Badent, C Binucci, E Di Giacomo, W Didimo, S Felsner, F Giordano, ...
CCCG, 233-236, 2007
252007
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
232010
Labeling heuristics for orthogonal drawings
C Binucci, W Didimo, G Liotta, M Nonato
International Symposium on Graph Drawing, 139-153, 2001
142001
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
132012
Maximum upward planar subgraphs of embedded planar digraphs
C Binucci, W Didimo, F Giordano
Computational Geometry 41 (3), 230-246, 2008
132008
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
112018
Upward and quasi-upward planarity testing of embedded mixed graphs
C Binucci, W Didimo, M Patrignani
Theoretical Computer Science 526, 75-89, 2014
102014
Computing labeled orthogonal drawings
C Binucci, W Didimo, G Liotta, M Nonato
International Symposium on Graph Drawing, 66-73, 2002
102002
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
92017
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, ...
J. Graph Algorithms Appl. 21 (1), 81-102, 2017
82017
Upward planarity testing of embedded mixed graphs
C Binucci, W Didimo
International Symposium on Graph Drawing, 427-432, 2011
82011
Switch-Regular Upward Planarity Testing of Directed Trees.
C Binucci, E Di Giacomo, W Didimo, A Rextin
J. Graph Algorithms Appl. 15 (5), 587-629, 2011
62011
Placing arrows in directed graph drawings
C Binucci, M Chimani, W Didimo, G Liotta, F Montecchiani
International Symposium on Graph Drawing and Network Visualization, 44-51, 2016
52016
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
52016
Fan-planar graphs: combinatorial properties and complexity results
C Binucci, E Di Giacomo, W Didimo, F Montecchiani, M Patrignani, ...
International Symposium on Graph Drawing, 186-197, 2014
52014
Drawing non-planar graphs with crossing-free subgraphs
P Angelini, C Binucci, G Da Lozzo, W Didimo, L Grilli, F Montecchiani, ...
International Symposium on Graph Drawing, 292-303, 2013
52013
Upward book embeddings of st-graphs
C Binucci, G Da Lozzo, E Di Giacomo, W Didimo, T Mchedlidze, ...
arXiv preprint arXiv:1903.07966, 2019
42019
The system can't perform the operation now. Try again later.
Articles 1–20