Vincenzo Roselli
From MaRDI portal
Person:1725737
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Morphing triangle contact representations of triangulations Discrete & Computational Geometry | 2023-10-12 | Paper |
| Morphing Contact Representations of Graphs (available as arXiv preprint) | 2022-07-18 | Paper |
| How to morph a tree on a small grid Discrete & Computational Geometry | 2022-03-22 | Paper |
| Upward planar morphs Algorithmica | 2020-10-12 | Paper |
| How to morph a tree on a small grid Lecture Notes in Computer Science | 2020-01-16 | Paper |
| LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs Journal of Computer and System Sciences | 2019-11-29 | Paper |
| Morphing planar graph drawings with a polynomial number of steps Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Drawing planar graphs with many collinear vertices | 2019-02-27 | Paper |
| Upward planar morphs Lecture Notes in Computer Science | 2019-02-15 | Paper |
| Small universal point sets for \(k\)-outerplanar graphs Discrete & Computational Geometry | 2018-10-30 | Paper |
| Algorithms and bounds for L-drawings of directed graphs International Journal of Foundations of Computer Science | 2018-07-24 | Paper |
| LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| An exact algorithm for a multicommodity min-cost flow over time problem | 2018-04-11 | Paper |
| Optimal morphs of convex drawings (available as arXiv preprint) | 2017-10-10 | Paper |
| How to morph planar graph drawings SIAM Journal on Computing | 2017-05-30 | Paper |
| Vertex-coloring with defects Journal of Graph Algorithms and Applications | 2017-04-05 | Paper |
| Drawing planar graphs with many collinear vertices Lecture Notes in Computer Science | 2017-02-21 | Paper |
| Drawing planar graphs with many collinear vertices Lecture Notes in Computer Science | 2017-02-21 | Paper |
| Vertex-coloring with star-defects WALCOM: Algorithms and Computation | 2016-05-03 | Paper |
| L-Drawings of Directed Graphs Lecture Notes in Computer Science | 2016-03-10 | Paper |
| Monotone drawings of graphs with fixed embedding Algorithmica | 2015-05-26 | Paper |
| Relaxing the constraints of clustered planarity Computational Geometry | 2015-03-06 | Paper |
| The importance of being proper Theoretical Computer Science | 2015-01-30 | Paper |
| Slanted orthogonal drawings: model, algorithms and evaluations Journal of Graph Algorithms and Applications | 2015-01-15 | Paper |
| The importance of being proper (in clustered-level planarity and T-level planarity) Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
| Anchored drawings of planar graphs Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
| Morphing Planar Graph Drawings Optimally Automata, Languages, and Programming | 2014-07-01 | Paper |
| Morphing Planar Graph Drawings Efficiently Graph Drawing | 2013-12-20 | Paper |
| Slanted orthogonal drawings Graph Drawing | 2013-12-20 | Paper |
| Small point sets for simply-nested planar graphs Graph Drawing | 2012-03-09 | Paper |
| Monotone Drawings of Graphs with Fixed Embedding Graph Drawing | 2012-03-09 | Paper |
Research outcomes over time
This page was built for person: Vincenzo Roselli
