( en | de | ru )

 

Disambiguation of "Valtr, Pavel"

Author of the publication

copydeleteadd this publication to your clipboard
Low Ply Drawings of Trees.

, , , , , , , and . Graph Drawing, volume 9801 of Lecture Notes in Computer Science, page 236-248. Springer, (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. You can also use the button next to the name to display some publications already assigned to the person.

Pavel Valtr

Dietrich Pavel

Wieland Werther Pavel

Luciana Pavel

Ji Pavelka

 

Other publications of authors with the same name

On Vertex- and Empty-Ply Proximity Drawings, , , , , , , , , and . Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD'17), volume 10692 of LNCS, page 24--37. Cham, Springer International Publishing, (2017)The Stub Resolution of 1-Planar Graphs, , , , , and . WALCOM: Algorithms and Computation, volume 12049 of Lecture Notes in Computer Science, page 170--182. Springer, (2020)Labelings of Graphs with Fixed and Variable Edge-Weights., , , and . SIAM J. Discret. Math., 21 (3): 688-706 (2007)Crossing numbers of beyond-planar graphs., , , and . Theor. Comput. Sci., (2022)Graph sharing games: Complexity and connectivity., , , , and . Theor. Comput. Sci., (2013)Almost-Equidistant Sets., , , , and . Graphs Comb., 36 (3): 729-754 (2020)A Ramsey-type Theorem in the Plane., and . Comb. Probab. Comput., (1994)Ramsey-Type Results for Geometric Graphs, II., , , and . Discret. Comput. Geom., 20 (3): 375-388 (1998)Coding and Counting Arrangements of Pseudolines., and . Discret. Comput. Geom., 46 (3): 405-416 (2011)On Galleries with No Bad Points.. Discret. Comput. Geom., 21 (2): 193-200 (1999)