受强制性开放获取政策约束的文章 - Carla Binucci了解详情
无法在其他位置公开访问的文章：6 篇
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
强制性开放获取政策： Government of Italy
Computing quasi-upward planar drawings of mixed graphs
C Binucci, W Didimo
The Computer Journal 59 (1), 133-150, 2016
强制性开放获取政策： Government of Italy
Nonplanar Graph Drawings with k Vertices per Face
C Binucci, G Di Battista, W Didimo, SH Hong, M Kaufmann, G Liotta, ...
International Workshop on Graph-Theoretic Concepts in Computer Science, 86-100, 2023
强制性开放获取政策： Government of Italy
Placing arrows in directed graph layouts: Algorithms and experiments
C Binucci, W Didimo, M Kaufmann, G Liotta, F Montecchiani
Computer Graphics Forum 41 (1), 364-376, 2022
强制性开放获取政策： Government of Italy
1-planarity testing and embedding: An experimental study
C Binucci, W Didimo, F Montecchiani
Computational Geometry 108, 101900, 2023
强制性开放获取政策： Government of Italy
VisFLOWer: Visual analysis of touristic flows
C Binucci, F De Luca, E Di Giacomo, G Liotta, F Montecchiani
2015 6th International Conference on Information, Intelligence, Systems and …, 2015
强制性开放获取政策： Government of Italy
可在其他位置公开访问的文章：23 篇
Fan-planarity: Properties and complexity
C Binucci, E Di Giacomo, W Didimo, F Montecchiani, M Patrignani, ...
Theoretical Computer Science 589, 76-86, 2015
强制性开放获取政策： Government of Italy
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
强制性开放获取政策： Australian Research Council, Government of Italy
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
强制性开放获取政策： Government of Italy
Upward and quasi-upward planarity testing of embedded mixed graphs
C Binucci, W Didimo, M Patrignani
Theoretical Computer Science 526, 75-89, 2014
强制性开放获取政策： Government of Italy
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
强制性开放获取政策： Government of Spain
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
强制性开放获取政策： German Research Foundation, Netherlands Organisation for Scientific Research
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
强制性开放获取政策： Government of Italy
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
强制性开放获取政策： Government of Italy
Fully dynamic semantic word clouds
C Binucci, W Didimo, E Spataro
2016 7th International Conference on Information, Intelligence, Systems …, 2016
强制性开放获取政策： Government of Italy
Visibility representations of boxes in 2.5 dimensions
A Arleo, C Binucci, E Di Giacomo, WS Evans, L Grilli, G Liotta, H Meijer, ...
Computational Geometry 72, 19-33, 2018
强制性开放获取政策： Natural Sciences and Engineering Research Council of Canada
On the complexity of the storyplan problem
C Binucci, E Di Giacomo, WJ Lenhart, G Liotta, F Montecchiani, ...
International Symposium on Graph Drawing and Network Visualization, 304-318, 2022
强制性开放获取政策： Government of Italy, Vienna Science and Technology Fund, Austria
Quasi-upward planar drawings with minimum curve complexity
C Binucci, E Di Giacomo, G Liotta, A Tappini
Graph Drawing and Network Visualization: 29th International Symposium, GD …, 2021
强制性开放获取政策： Government of Italy
Visibility representations of boxes in 2.5 dimensions
A Arleo, C Binucci, E Di Giacomo, WS Evans, L Grilli, G Liotta, H Meijer, ...
International Symposium on Graph Drawing and Network Visualization, 251-265, 2016
强制性开放获取政策： Natural Sciences and Engineering Research Council of Canada, Government of Italy
On turn-regular orthogonal representations
MA Bekos, C Binucci, GD Battista, W Didimo, M Gronemann, K Klein, ...
International Symposium on Graph Drawing and Network Visualization, 250-264, 2020
强制性开放获取政策： German Research Foundation, Government of Italy
出版信息和资助信息由计算机程序自动确定