Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Low Ply Drawings of Trees.

P. Angelini, M. Bekos, T. Bruckdorfer, J. Jr., M. Kaufmann, S. Kobourov, A. Symvonis, and P. Valtr. 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 Nedvedicky University of Stuttgart

Dr. Pavel Bashtrykov University of Stuttgart

Pavel Denisov University of Stuttgart

Pavel Ruchka University of Stuttgart

Other publications of authors with the same name

A wideband, directional model for the satellite-to-indoor propagation channel at S-band.F. Pérez-Fontán, V. Hovinen, M. Schönhuber, R. Prieto-Cerdeira, F. Teschl, J. Kyrolainen, and P. Valtr. Int. J. Satellite Communications Networking, 29 (1): 23-45 (2011)Coding and Counting Arrangements of Pseudolines.S. Felsner, and P. Valtr. Discrete & Computational Geometry, 46 (3): 405-416 (2011)Open Caps and Cups in Planar Point Sets.P. Valtr. Discrete & Computational Geometry, 37 (4): 565-576 (2007)On Galleries with No Bad Points.P. Valtr. Discrete & Computational Geometry, 21 (2): 193-200 (1999)Graph sharing games: Complexity and connectivity.J. Cibulka, J. Kyncl, V. Mészáros, R. Stolar, and P. Valtr. Theor. Comput. Sci., (2013)A Ramsey-type Theorem in the Plane.J. Nesetril, and P. Valtr. Combinatorics, Probability & Computing, (1994)Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.O. Aichholzer, J. Cardinal, T. Hackl, F. Hurtado, M. Korman, A. Pilz, R. Silveira, R. Uehara, P. Valtr, B. Vogtenhuber and 1 other author(s). Discrete Mathematics & Theoretical Computer Science, 16 (3): 317-332 (2014)Ramsey-Type Results for Geometric Graphs, II.G. Károlyi, J. Pach, G. Tóth, and P. Valtr. Discrete & Computational Geometry, 20 (3): 375-388 (1998)Labelings of Graphs with Fixed and Variable Edge-Weights.R. Babilon, V. Jelínek, D. Král, and P. Valtr. SIAM J. Discrete Math., 21 (3): 688-706 (2007)On Vertex- and Empty-Ply Proximity Drawings.P. Angelini, S. Chaplick, F. Luca, J. Fiala, J. Jr., N. Heinsohn, M. Kaufmann, S. Kobourov, J. Kratochvíl, and P. Valtr. Graph Drawing, volume 10692 of Lecture Notes in Computer Science, page 24-37. Springer, (2017)