 | 2009 |
|---|
| 45 |       | Josef Cibulka,
Jan Kyncl,
Viola Mészáros,
Rudolf Stolar,
Pavel Valtr:
Solution of Peter Winkler's Pizza Problem.
IWOCA 2009: 356-367 |
| 44 | | 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) |
| 2008 |
|---|
| 43 | | Josef Cibulka,
Jan Kyncl,
Viola Mészáros,
Rudolf Stolar,
Pavel Valtr:
Hamiltonian Alternating Paths on Bicolored Double-Chains.
Graph Drawing 2008: 181-192 |
| 42 | | Imre Bárány,
Attila Pór,
Pavel Valtr:
Paths with no Small Angles.
LATIN 2008: 654-663 |
| 41 | | 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 |
|---|
| 40 | | 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 |
| 39 | | Pavel Valtr:
Open Caps and Cups in Planar Point Sets.
Discrete & Computational Geometry 37(4): 565-576 (2007) |
| 38 | | Alfredo García,
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) |
| 37 | | 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) |
| 2006 |
|---|
| 36 | | Attila Pór,
Pavel Valtr:
On the positive fraction Erdos-Szekeres theorem for convex sets.
Eur. J. Comb. 27(7): 1199-1205 (2006) |
| 2005 |
|---|
| 35 | | Jan Kyncl,
Pavel Valtr:
On Edges Crossing Few Other Edges in Simple Topological Complete Graphs.
Graph Drawing 2005: 274-284 |
| 2004 |
|---|
| 34 | | 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 |
|---|
| 33 | | Pavel Valtr:
Davenport-Schinzel Trees.
Combinatorica 23(1): 151-184 (2003) |
| 32 | | Gyula Károlyi,
Pavel Valtr:
Point Configurations in d-Space without Large Subsets in Convex Position.
Discrete & Computational Geometry 30(2): 277-286 (2003) |
| 31 | | Robert Babilon,
Jirí Matousek,
Jana Maxová,
Pavel Valtr:
Low-Distortion Embeddings of Trees.
J. Graph Algorithms Appl. 7(4): 399-409 (2003) |
| 2002 |
|---|
| 30 | | Attila Pór,
Pavel Valtr:
The Partitioned Version of the Erdös - Szekeres Theorem.
Discrete & Computational Geometry 28(4): 625-637 (2002) |
| 29 | | Pavel Valtr:
A Sufficient Condition for the Existence of Large Empty Convex Polygons.
Discrete & Computational Geometry 28(4): 671-682 (2002) |
| 2001 |
|---|
| 28 | | Robert Babilon,
Jirí Matousek,
Jana Maxová,
Pavel Valtr:
Low-Distortion Embeddings of Trees.
Graph Drawing 2001: 343-351 |
| 27 | | Bernd Gärtner,
József Solymosi,
Falk Tschirschnitz,
Emo Welzl,
Pavel Valtr:
One line and n points.
STOC 2001: 306-315 |
| 1999 |
|---|
| 26 | | Pavel Valtr:
On Galleries with No Bad Points.
Discrete & Computational Geometry 21(2): 193-200 (1999) |
| 25 | | Krystyna Kuperberg,
Wlodzimierz Kuperberg,
Jirí Matousek,
Pavel Valtr:
Almost-Tiling the Plane by Ellipses.
Discrete & Computational Geometry 22(3): 367-375 (1999) |
| 24 | | Géza Tóth,
Pavel Valtr:
Geometric Graphs with Few Disjoint Edges.
Discrete & Computational Geometry 22(4): 633-642 (1999) |
| 23 | | Pavel Valtr:
On an Extremal Problem for Colored Trees.
Eur. J. Comb. 20(1): 115-121 (1999) |
| 1998 |
|---|
| 22 | | Géza Tóth,
Pavel Valtr:
Geometric Graphs with Few Disjoint Edges.
Symposium on Computational Geometry 1998: 184-191 |
| 21 |  | Hazel Everett,
Ivan Stojmenovic,
Pavel Valtr,
Sue Whitesides:
The largest k-ball in a d-dimensional box.
Comput. Geom. 11(2): 59-67 (1998) |
| 20 | | Imre Bárány,
Pavel Valtr:
A Positive Fraction Erdos - Szekeres Theorem.
Discrete & Computational Geometry 19(3): 335-342 (1998) |
| 19 | | Géza Tóth,
Pavel Valtr:
Note on the Erdos - Szekeres Theorem.
Discrete & Computational Geometry 19(3): 457-459 (1998) |
| 18 | | Pavel Valtr:
On Geometric Graphs with No k Pairwise Parallel Edges.
Discrete & Computational Geometry 19(3): 461-469 (1998) |
| 17 | | 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) |
| 16 | | Jaroslav Nesetril,
Pavel Valtr:
A Ramsey Property of Order Types.
J. Comb. Theory, Ser. A 81(1): 88-107 (1998) |
| 15 | | Pavel Valtr:
On the Density of Subgraphs in a Graph with Bounded Independence Number.
J. Comb. Theory, Ser. B 73(2): 146-158 (1998) |
| 1997 |
|---|
| 14 | | Pavel Valtr:
Graph Drawings with no k Pairwise Crossing Edges.
Graph Drawing 1997: 205-218 |
| 13 | | 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 |
| 12 | | Herbert Edelsbrunner,
Pavel Valtr,
Emo Welzl:
Cutting Dense Point Sets in Half.
Discrete & Computational Geometry 17(3): 243-255 (1997) |
| 1996 |
|---|
| 11 | | Pavel Valtr:
Lines, Line-Point Incidences and Crossing Families in Dense Sets.
Combinatorica 16(2): 269-294 (1996) |
| 10 | | Pavel Valtr:
The Probability that n Random Points in a Triangle Are in Convex Position.
Combinatorica 16(4): 567-573 (1996) |
| 9 | | Paul Erdös,
Zsolt Tuza,
Pavel Valtr:
Ramsey-remainder.
Eur. J. Comb. 17(6): 519-532 (1996) |
| 1995 |
|---|
| 8 | | Pavel Valtr:
Probability that n Random Points are in Convex Position.
Discrete & Computational Geometry 13: 637-643 (1995) |
| 1994 |
|---|
| 7 | | Herbert Edelsbrunner,
Pavel Valtr,
Emo Welzl:
Cutting Dense Point Sets in Half.
Symposium on Computational Geometry 1994: 203-209 |
| 6 | | Martin Klazar,
Pavel Valtr:
Generalized Davenport-Schinzel Sequences.
Combinatorica 14(4): 463-476 (1994) |
| 5 | | Jaroslav Nesetril,
Pavel Valtr:
A Ramsey-type Theorem in the Plane.
Combinatorics, Probability & Computing 3: 127-135 (1994) |
| 4 | | Pavel Valtr:
Unit Squares Intersecting All Secants of a Square.
Discrete & Computational Geometry 11: 235-239 (1994) |
| 1992 |
|---|
| 3 | | Pavel Valtr:
Convex Independent Sets and 7-holes in Restricted Planar Point Sets.
Discrete & Computational Geometry 7: 135-152 (1992) |
| 2 | | Pavel Valtr:
Sets in Rd with no large empty convex subsets.
Discrete Mathematics 108(1-3): 115-124 (1992) |
| 1 | | Radek Adamec,
Martin Klazar,
Pavel Valtr:
Generalized Davenport-Schinzel sequences with linear upper bound.
Discrete Mathematics 108(1-3): 219-229 (1992) |
