Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Pavel Valtr
2010 – today
- 2012
[j44]Michael S. Payne, Attila Pór, Pavel Valtr, David R. Wood: On the Connectivity of Visibility Graphs. Discrete & Computational Geometry 48(3): 669-681 (2012)- [c16]
- [c15]Jens M. Schmidt, Pavel Valtr: Cubic plane graphs on a given point set. Symposium on Computational Geometry 2012: 201-208
- [i5]Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr: Graph sharing games: complexity and connectivity. CoRR abs/1202.0847 (2012)
- [i4]János Barát, Vida Dujmovic, Gwenaël Joret, Michael S. Payne, Ludmila Scharf, Daria Schymura, Pavel Valtr, David R. Wood: Empty pentagons in point sets with collinearities. CoRR abs/1207.3633 (2012)
- 2011
- [j43]Marwan Al-Jubeh, Mashhood Ishaque, Kristóf Rédei, Diane L. Souvaine, Csaba D. Tóth, Pavel Valtr: Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three. Algorithmica 61(4): 971-999 (2011)
- [j42]Stefan Felsner, Pavel Valtr: Coding and Counting Arrangements of Pseudolines. Discrete & Computational Geometry 46(3): 405-416 (2011)
- [j41]Fernando Pérez-Fontán, Veikko Hovinen, Michael Schönhuber, Roberto Prieto-Cerdeira, Franz Teschl, Jukka Kyrolainen, Pavel Valtr: A wideband, directional model for the satellite-to-indoor propagation channel at S-band. Int. J. Satellite Communications Networking 29(1): 23-45 (2011)
- [c14]Birgit Vogtenhuber, Oswin Aichholzer, Ruy Fabila Monroy, Clemens Huemer, Jorge Urrutia, Marco A. Heredia, Hernán González-Aguilar, Thomas Hackl, Pavel Valtr: On k-Gons and k-Holes in Point Sets. CCCG 2011
- [i3]Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr: Universal Sets for Straight-Line Embeddings of Bicolored Graphs. CoRR abs/1102.0874 (2011)
- [i2]
- 2010
- [j40]Konrad J. Swanepoel, Pavel Valtr: Large Convexly Independent Subsets of Minkowski Sums. Electr. J. Comb. 17(1) (2010)
- [c13]Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr: On Three Parameters of Invisibility Graphs. COCOON 2010: 192-198
- [c12]Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr: Graph Sharing Games: Complexity and Connectivity. TAMC 2010: 340-349
2000 – 2009
- 2009
- [j39]Alfredo García Olaverri, Ferran Hurtado, Clemens Huemer, Javier Tejel, Pavel Valtr: On triconnected and cubic plane graphs on given point sets. Comput. Geom. 42(9): 913-922 (2009)
- [j38]Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr: Traversing a Set of Points with a Minimum Number of Turns. Discrete & Computational Geometry 41(4): 513-532 (2009)
- [j37]Jan Kyncl, Pavel Valtr: On edges crossing few other edges in simple topological complete graphs. Discrete Mathematics 309(7): 1917-1923 (2009)
- [j36]Nektarios Moraitis, Philip Constantinou, Fernando Pérez-Fontán, Pavel Valtr: Propagation Measurements and Comparison with EM Techniques for In-Cabin Wireless Networks. EURASIP J. Wireless Comm. and Networking 2009 (2009)
- [j35]Imre Bárány, Attila Pór, Pavel Valtr: Paths with No Small Angles. SIAM J. Discrete Math. 23(4): 1655-1666 (2009)
- [c11]Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr: Solution of Peter Winkler's Pizza Problem. IWOCA 2009: 356-367
- 2008
- [j34]Fernando Pérez-Fontán, Veikko Hovinen, Michael Schönhuber, Roberto Prieto-Cerdeira, José Antonio Delgado-Penín, Franz Teschl, Jukka Kyröläinen, Pavel Valtr: Building Entry Loss and Delay Spread Measurements on a Simulated HAP-to-Indoor Link at S-Band. EURASIP J. Wireless Comm. and Networking 2008 (2008)
- [c10]Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr: Hamiltonian Alternating Paths on Bicolored Double-Chains. Graph Drawing 2008: 181-192
- [c9]
- [i1]Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr: Solution of Peter Winkler's Pizza Problem. CoRR abs/0812.4322 (2008)
- 2007
- [j33]Pavel Valtr: Open Caps and Cups in Planar Point Sets. Discrete & Computational Geometry 37(4): 565-576 (2007)
- [j32]Alfredo García Olaverri, Ferran Hurtado, Clemens Huemer, Javier Tejel, Pavel Valtr: On embedding triconnected cubic graphs on point sets. Electronic Notes in Discrete Mathematics 29: 531-538 (2007)
- [j31]Pavel Valtr, Gábor Lippner, Gyula Károlyi: Empty convex polygons in almost convex sets. Periodica Mathematica Hungarica 55(2): 121-127 (2007)
- [j30]Robert Babilon, Vít Jelínek, Daniel Král, Pavel Valtr: Labelings of Graphs with Fixed and Variable Edge-Weights. SIAM J. Discrete Math. 21(3): 688-706 (2007)
- [c8]Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr: Traversing a set of points with a minimum number of turns. Symposium on Computational Geometry 2007: 46-55
- 2006
- [j29]Attila Pór, Pavel Valtr: On the positive fraction Erdos-Szekeres theorem for convex sets. Eur. J. Comb. 27(7): 1199-1205 (2006)
- 2005
- [c7]Jan Kyncl, Pavel Valtr: On Edges Crossing Few Other Edges in Simple Topological Complete Graphs. Graph Drawing 2005: 274-284
- 2004
- [j28]Volkan Isler, Sampath Kannan, Kostas Daniilidis, Pavel Valtr: VC-Dimension of Exterior Visibility. IEEE Trans. Pattern Anal. Mach. Intell. 26(5): 667-671 (2004)
- 2003
- [j27]
- [j26]Gyula Károlyi, Pavel Valtr: Point Configurations in d-Space without Large Subsets in Convex Position. Discrete & Computational Geometry 30(2): 277-286 (2003)
- [j25]Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr: Low-Distortion Embeddings of Trees. J. Graph Algorithms Appl. 7(4): 399-409 (2003)
- 2002
- [j24]Attila Pór, Pavel Valtr: The Partitioned Version of the Erdös - Szekeres Theorem. Discrete & Computational Geometry 28(4): 625-637 (2002)
- [j23]Pavel Valtr: A Sufficient Condition for the Existence of Large Empty Convex Polygons. Discrete & Computational Geometry 28(4): 671-682 (2002)
- 2001
- [c6]Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr: Low-Distortion Embeddings of Trees. Graph Drawing 2001: 343-351
- [c5]Bernd Gärtner, József Solymosi, Falk Tschirschnitz, Emo Welzl, Pavel Valtr: One line and n points. STOC 2001: 306-315
1990 – 1999
- 1999
- [j22]Pavel Valtr: On Galleries with No Bad Points. Discrete & Computational Geometry 21(2): 193-200 (1999)
- [j21]Krystyna Kuperberg, Wlodzimierz Kuperberg, Jirí Matousek, Pavel Valtr: Almost-Tiling the Plane by Ellipses. Discrete & Computational Geometry 22(3): 367-375 (1999)
- [j20]Géza Tóth, Pavel Valtr: Geometric Graphs with Few Disjoint Edges. Discrete & Computational Geometry 22(4): 633-642 (1999)
- [j19]
- 1998
- [j18]Hazel Everett, Ivan Stojmenovic, Pavel Valtr, Sue Whitesides: The largest k-ball in a d-dimensional box. Comput. Geom. 11(2): 59-67 (1998)
- [j17]Imre Bárány, Pavel Valtr: A Positive Fraction Erdos - Szekeres Theorem. Discrete & Computational Geometry 19(3): 335-342 (1998)
- [j16]Géza Tóth, Pavel Valtr: Note on the Erdos - Szekeres Theorem. Discrete & Computational Geometry 19(3): 457-459 (1998)
- [j15]Pavel Valtr: On Geometric Graphs with No k Pairwise Parallel Edges. Discrete & Computational Geometry 19(3): 461-469 (1998)
- [j14]Gyula Károlyi, János Pach, Géza Tóth, Pavel Valtr: Ramsey-Type Results for Geometric Graphs, II. Discrete & Computational Geometry 20(3): 375-388 (1998)
- [j13]Pavel Valtr: On the Density of Subgraphs in a Graph with Bounded Independence Number. J. Comb. Theory, Ser. B 73(2): 146-158 (1998)
- [j12]Jaroslav Nesetril, Pavel Valtr: A Ramsey Property of Order Types. J. Comb. Theory, Ser. A 81(1): 88-107 (1998)
- [c4]Géza Tóth, Pavel Valtr: Geometric Graphs with Few Disjoint Edges. Symposium on Computational Geometry 1998: 184-191
- 1997
- [j11]Herbert Edelsbrunner, Pavel Valtr, Emo Welzl: Cutting Dense Point Sets in Half. Discrete & Computational Geometry 17(3): 243-255 (1997)
- [c3]Gyula Károlyi, János Pach, Géza Tóth, Pavel Valtr: Ramsey-Type Results for Geometric Graphs II. Symposium on Computational Geometry 1997: 94-103
- [c2]
- 1996
- [j10]Pavel Valtr: Lines, Line-Point Incidences and Crossing Families in Dense Sets. Combinatorica 16(2): 269-294 (1996)
- [j9]Pavel Valtr: The Probability that n Random Points in a Triangle Are in Convex Position. Combinatorica 16(4): 567-573 (1996)
- [j8]
- 1995
- [j7]Pavel Valtr: Probability that n Random Points are in Convex Position. Discrete & Computational Geometry 13: 637-643 (1995)
- 1994
- [j6]Martin Klazar, Pavel Valtr: Generalized Davenport-Schinzel Sequences. Combinatorica 14(4): 463-476 (1994)
- [j5]Jaroslav Nesetril, Pavel Valtr: A Ramsey-type Theorem in the Plane. Combinatorics, Probability & Computing 3: 127-135 (1994)
- [j4]Pavel Valtr: Unit Squares Intersecting All Secants of a Square. Discrete & Computational Geometry 11: 235-239 (1994)
- [c1]Herbert Edelsbrunner, Pavel Valtr, Emo Welzl: Cutting Dense Point Sets in Half. Symposium on Computational Geometry 1994: 203-209
- 1992
- [j3]Pavel Valtr: Convex Independent Sets and 7-holes in Restricted Planar Point Sets. Discrete & Computational Geometry 7: 135-152 (1992)
- [j2]Pavel Valtr: Sets in Rd with no large empty convex subsets. Discrete Mathematics 108(1-3): 115-124 (1992)
- [j1]Radek Adamec, Martin Klazar, Pavel Valtr: Generalized Davenport-Schinzel sequences with linear upper bound. Discrete Mathematics 108(1-3): 219-229 (1992)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-18 21:27 CEST by the dblp team