From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Block Crossings in Storyline Visualizations.

T. van Dijk, M. Fink, N. Fischer, F. Lipp, P. Markfelder, A. Ravsky, S. Suri, и A. Wolff. J. Graph Algorithms Appl., 21 (5): 873-913 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Computing Height-Optimal Tangles Faster.O. Firman, P. Kindermann, A. Ravsky, A. Wolff, и J. Zink. GD, том 11904 из Lecture Notes in Computer Science, стр. 203-215. Springer, (2019)Computing Optimal Tangles FasterO. Firman, P. Kindermann, A. Ravsky, A. Wolff, и J. Zink. Proc. 35th Europ. Workshop Comput. Geom. (EuroCG'19), стр. 61:1-7. (2019)On collinear sets in straight line drawingsA. Ravsky, и O. Verbitsky. CoRR, (2008)On Collinear Sets in Straight-Line Drawings.A. Ravsky, и O. Verbitsky. WG, том 6986 из Lecture Notes in Computer Science, стр. 295-306. Springer, (2011)Bundled Crossings RevisitedS. Chaplick, T. van Dijk, M. Kryven, J. won Park, A. Ravsky, и A. Wolff. CoRR, (2018)The Complexity of Finding TanglesO. Firman, S. Felsner, P. Kindermann, A. Ravsky, A. Wolff, и J. Zink. Proc. 36th European Workshop on Computational Geometry (EuroCG'20), стр. 67:1--8. (2020)