The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pavel Valtr: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Herbert Edelsbrunner, Pavel Valtr, Emo Welzl
    Cutting Dense Point Sets in Half. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:203-209 [Conf]
  2. Gyula Károlyi, János Pach, Géza Tóth, Pavel Valtr
    Ramsey-Type Results for Geometric Graphs II. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:94-103 [Conf]
  3. Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr
    Traversing a set of points with a minimum number of turns. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:46-55 [Conf]
  4. Géza Tóth, Pavel Valtr
    Geometric Graphs with Few Disjoint Edges. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:184-191 [Conf]
  5. Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr
    Low-Distortion Embeddings of Trees. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:343-351 [Conf]
  6. Jan Kyncl, Pavel Valtr
    On Edges Crossing Few Other Edges in Simple Topological Complete Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:274-284 [Conf]
  7. Pavel Valtr
    Graph Drawings with no k Pairwise Crossing Edges. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:205-218 [Conf]
  8. Bernd Gärtner, József Solymosi, Falk Tschirschnitz, Emo Welzl, Pavel Valtr
    One line and n points. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:306-315 [Conf]
  9. Martin Klazar, Pavel Valtr
    Generalized Davenport-Schinzel Sequences. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:4, pp:463-476 [Journal]
  10. Pavel Valtr
    Davenport-Schinzel Trees. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:1, pp:151-184 [Journal]
  11. Pavel Valtr
    Lines, Line-Point Incidences and Crossing Families in Dense Sets. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:2, pp:269-294 [Journal]
  12. Pavel Valtr
    The Probability that n Random Points in a Triangle Are in Convex Position. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:4, pp:567-573 [Journal]
  13. Hazel Everett, Ivan Stojmenovic, Pavel Valtr, Sue Whitesides
    The largest k-ball in a d-dimensional box. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:2, pp:59-67 [Journal]
  14. Jaroslav Nesetril, Pavel Valtr
    A Ramsey-type Theorem in the Plane. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:127-135 [Journal]
  15. Imre Bárány, Pavel Valtr
    A Positive Fraction Erdos - Szekeres Theorem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:3, pp:335-342 [Journal]
  16. Herbert Edelsbrunner, Pavel Valtr, Emo Welzl
    Cutting Dense Point Sets in Half. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:17, n:3, pp:243-255 [Journal]
  17. Gyula Károlyi, János Pach, Géza Tóth, Pavel Valtr
    Ramsey-Type Results for Geometric Graphs, II. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:3, pp:375-388 [Journal]
  18. Gyula Károlyi, Pavel Valtr
    Point Configurations in d-Space without Large Subsets in Convex Position. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:2, pp:277-286 [Journal]
  19. Krystyna Kuperberg, Wlodzimierz Kuperberg, Jirí Matousek, Pavel Valtr
    Almost-Tiling the Plane by Ellipses. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:3, pp:367-375 [Journal]
  20. Attila Pór, Pavel Valtr
    The Partitioned Version of the Erdös - Szekeres Theorem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:625-637 [Journal]
  21. Géza Tóth, Pavel Valtr
    Note on the Erdos - Szekeres Theorem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:3, pp:457-459 [Journal]
  22. Géza Tóth, Pavel Valtr
    Geometric Graphs with Few Disjoint Edges. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:4, pp:633-642 [Journal]
  23. Pavel Valtr
    A Sufficient Condition for the Existence of Large Empty Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:671-682 [Journal]
  24. Pavel Valtr
    Convex Independent Sets and 7-holes in Restricted Planar Point Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:135-152 [Journal]
  25. Pavel Valtr
    Unit Squares Intersecting All Secants of a Square. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:11, n:, pp:235-239 [Journal]
  26. Pavel Valtr
    Probability that n Random Points are in Convex Position. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:637-643 [Journal]
  27. Pavel Valtr
    On Geometric Graphs with No k Pairwise Parallel Edges. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:3, pp:461-469 [Journal]
  28. Pavel Valtr
    On Galleries with No Bad Points. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:21, n:2, pp:193-200 [Journal]
  29. Paul Erdös, Zsolt Tuza, Pavel Valtr
    Ramsey-remainder. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:6, pp:519-532 [Journal]
  30. Pavel Valtr
    On an Extremal Problem for Colored Trees. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1999, v:20, n:1, pp:115-121 [Journal]
  31. Attila Pór, Pavel Valtr
    On the positive fraction Erdos-Szekeres theorem for convex sets. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1199-1205 [Journal]
  32. Jaroslav Nesetril, Pavel Valtr
    A Ramsey Property of Order Types. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1998, v:81, n:1, pp:88-107 [Journal]
  33. Pavel Valtr
    On the Density of Subgraphs in a Graph with Bounded Independence Number. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:73, n:2, pp:146-158 [Journal]
  34. Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr
    Low-Distortion Embeddings of Trees. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2003, v:7, n:4, pp:399-409 [Journal]
  35. Volkan Isler, Sampath Kannan, Kostas Daniilidis, Pavel Valtr
    VC-Dimension of Exterior Visibility. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2004, v:26, n:5, pp:667-671 [Journal]
  36. Pavel Valtr
    Open Caps and Cups in Planar Point Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:4, pp:565-576 [Journal]
  37. Radek Adamec, Martin Klazar, Pavel Valtr
    Generalized Davenport-Schinzel sequences with linear upper bound. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:108, n:1-3, pp:219-229 [Journal]
  38. Pavel Valtr
    Sets in Rd with no large empty convex subsets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:108, n:1-3, pp:115-124 [Journal]

  39. On Three Parameters of Invisibility Graphs. [Citation Graph (, )][DBLP]


  40. Hamiltonian Alternating Paths on Bicolored Double-Chains. [Citation Graph (, )][DBLP]


  41. Paths with no Small Angles. [Citation Graph (, )][DBLP]


  42. Graph Sharing Games: Complexity and Connectivity. [Citation Graph (, )][DBLP]


  43. Solution of Peter Winkler's Pizza Problem. [Citation Graph (, )][DBLP]


  44. On triconnected and cubic plane graphs on given point sets. [Citation Graph (, )][DBLP]


  45. Solution of Peter Winkler's Pizza Problem [Citation Graph (, )][DBLP]


  46. Traversing a Set of Points with a Minimum Number of Turns. [Citation Graph (, )][DBLP]


  47. On edges crossing few other edges in simple topological complete graphs. [Citation Graph (, )][DBLP]


Search in 0.029secs, Finished in 0.033secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002