( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Low Ply Drawings of Trees.

, , , , , , , и . CoRR, (2016)

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.

Pavel Valtr

Dietrich Pavel

Wieland Werther Pavel

Luciana Pavel

Ji Pavelka

 

Другие публикации лиц с тем же именем

On Vertex- and Empty-Ply Proximity Drawings, , , , , , , , , и . Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD'17), том 10692 из LNCS, стр. 24--37. Cham, Springer International Publishing, (2017)The Stub Resolution of 1-Planar Graphs, , , , , и . WALCOM: Algorithms and Computation, том 12049 из Lecture Notes in Computer Science, стр. 170--182. Springer, (2020)Almost-Equidistant Sets., , , , и . Graphs Comb., 36 (3): 729-754 (2020)Upward Point Set Embeddings of Paths and Trees., , , , , , и . CoRR, (2020)Non-homotopic Loops with a Bounded Number of Pairwise Intersections., , , и . GD, том 12868 из Lecture Notes in Computer Science, стр. 210-222. Springer, (2021)Crossing Numbers of Beyond-Planar Graphs., , , и . GD, том 11904 из Lecture Notes in Computer Science, стр. 78-86. Springer, (2019)Paths with no Small Angles., , и . LATIN, том 4957 из Lecture Notes in Computer Science, стр. 654-663. Springer, (2008)Graph Sharing Games: Complexity and Connectivity., , , , и . TAMC, том 6108 из Lecture Notes in Computer Science, стр. 340-349. Springer, (2010)The Crossing Tverberg Theorem., , , , и . SoCG, том 129 из LIPIcs, стр. 38:1-38:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Reconstructing Point Set Order Types from Radial Orderings., , , , и . Int. J. Comput. Geom. Appl., 26 (3-4): 167-184 (2016)