default search action
Pavel Valtr 0001
Person information
- affiliation: Charles University in Prague, Department of Applied Mathematics, Czech Republic
Other persons with the same name
- Pavel Valtr 0002
— Czech Technical University in Prague, Department of Electromagnetic Field, Prague, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j75]Vít Jelínek, Michal Opler, Pavel Valtr:
Generalized Coloring of Permutations. Algorithmica 86(7): 2174-2210 (2024) - [j74]David Hartman
On the connectivity and the diameter of betweenness-uniform graphs. Discret. Appl. Math. 342: 27-37 (2024) - [j73]Radoslav Fulek
The Crossing Tverberg Theorem. Discret. Comput. Geom. 72(2): 831-848 (2024) - [j72]Martin Balko
Bounding and Computing Obstacle Numbers of Graphs. SIAM J. Discret. Math. 38(2): 1537-1565 (2024) - [c52]Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr:
Noncrossing Longest Paths and Cycles. GD 2024: 36:1-36:17 - 2023
- [j71]Martin Balko
Tight bounds on the expected number of holes in random point sets. Random Struct. Algorithms 62(1): 29-51 (2023) - [c51]Jaroslav Hancl, Adam Kabela, Michal Opler, Jakub Sosnovec, Robert Sámal, Pavel Valtr:
Improved Bounds for the Binary Paint Shop Problem. COCOON (2) 2023: 210-221 - [c50]Philipp Kindermann
Three Edge-Disjoint Plane Spanning Paths in a Point Set. GD (1) 2023: 323-338 - [i31]Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr:
Three Edge-disjoint Plane Spanning Paths in a Point Set. CoRR abs/2306.07237 (2023) - 2022
- [j70]Oswin Aichholzer
On crossing-families in planar point sets. Comput. Geom. 107: 101899 (2022) - [j69]Martin Balko
Holes and islands in random point sets. Random Struct. Algorithms 60(3): 308-326 (2022) - [j68]Markus Chimani, Philipp Kindermann
Crossing numbers of beyond-planar graphs. Theor. Comput. Sci. 898: 44-49 (2022) - [c49]Martin Balko
Erdős-Szekeres-Type Problems in the Real Projective Plane. SoCG 2022: 10:1-10:15 - [c48]Martin Balko
Bounding and Computing Obstacle Numbers of Graphs. ESA 2022: 11:1-11:13 - [i30]Martin Balko
Erdős-Szekeres-type problems in the real projective plane. CoRR abs/2203.07518 (2022) - [i29]Martin Balko
Bounding and computing obstacle numbers of graphs. CoRR abs/2206.15414 (2022) - 2021
- [j67]Michael Kaufmann, Jan Kratochvíl
The Stub Resolution of 1-planar Graphs. J. Graph Algorithms Appl. 25(2): 625-642 (2021) - [j66]Imre Bárány, Attila Pór, Pavel Valtr:
Orientation preserving maps of the n × n grid. J. Comput. Geom. 13(2): 73-89 (2021) - [c47]Václav Blazej
On the Intersections of Non-homotopic Loops. CALDAM 2021: 196-205 - [c46]David Hartman
On the Connectivity and the Diameter of Betweenness-Uniform Graphs. CALDAM 2021: 317-330 - [c45]Imre Bárány, Attila Pór, Pavel Valtr:
Orientation Preserving Maps of the Square Grid. SoCG 2021: 14:1-14:12 - [c44]Václav Blazej
Non-homotopic Loops with a Bounded Number of Pairwise Intersections. GD 2021: 210-222 - [c43]Stefan Felsner, Laura Merker, Torsten Ueckerdt, Pavel Valtr:
Linear Layouts of Complete Graphs. GD 2021: 257-270 - [c42]Elena Arseneva
Upward Point Set Embeddings of Paths and Trees. WALCOM 2021: 234-246 - [i28]David Auber, Pavel Valtr:
Graph Drawing and Network Visualization GD2020. CoRR abs/2101.00449 (2021) - [i27]Stefan Felsner, Laura Merker, Torsten Ueckerdt, Pavel Valtr:
Linear Layouts of Complete Graphs. CoRR abs/2108.05112 (2021) - [i26]Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr:
Non-homotopic Loops with a Bounded Number of Pairwise Intersections. CoRR abs/2108.13953 (2021) - [i25]David Hartman, Aneta Pokorná, Pavel Valtr:
On the Connectivity and the Diameter of Betweenness-Uniform Graphs. CoRR abs/2109.10594 (2021) - [i24]Oswin Aichholzer, Jan Kyncl, Manfred Scheucher, Birgit Vogtenhuber, Pavel Valtr:
On Crossing-Families in Planar Point Sets. CoRR abs/2109.10705 (2021) - [i23]Martin Balko, Manfred Scheucher, Pavel Valtr:
Tight bounds on the expected number of holes in random point sets. CoRR abs/2111.12533 (2021) - 2020
- [j65]Martin Balko
On Erdős-Szekeres-type problems for k-convex point sets. Eur. J. Comb. 89: 103157 (2020) - [j64]Martin Balko
Almost-Equidistant Sets. Graphs Comb. 36(3): 729-754 (2020) - [j63]Oswin Aichholzer
A superlinear lower bound on the number of 5-holes. J. Comb. Theory A 173: 105236 (2020) - [j62]Oswin Aichholzer
Minimal Representations of Order Types by Geometric Graphs. J. Graph Algorithms Appl. 24(4): 551-572 (2020) - [j61]Raphael Steiner
On the Average Complexity of the k-Level. J. Comput. Geom. 11(1): 493-506 (2020) - [c41]Martin Balko
Holes and Islands in Random Point Sets. SoCG 2020: 14:1-14:16 - [c40]Wolfgang Mulzer
Long Alternating Paths Exist. SoCG 2020: 57:1-57:16 - [c39]Michael Kaufmann, Jan Kratochvíl
The Stub Resolution of 1-Planar Graphs. WALCOM 2020: 170-182 - [e1]David Auber
Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12590, Springer 2020, ISBN 978-3-030-68765-6 [contents] - [i22]Martin Balko, Manfred Scheucher, Pavel Valtr:
Holes and islands in random point sets. CoRR abs/2003.00909 (2020) - [i21]Wolfgang Mulzer, Pavel Valtr:
Long Alternating Paths Exist. CoRR abs/2003.13291 (2020) - [i20]Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr:
Upward Point Set Embeddings of Paths and Trees. CoRR abs/2012.10525 (2020)
2010 – 2019
- 2019
- [j60]Martin Balko
Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences. Discret. Comput. Geom. 61(2): 325-354 (2019) - [j59]Martin Balko
On ordered Ramsey numbers of bounded-degree graphs. J. Comb. Theory B 134: 179-202 (2019) - [c38]Radoslav Fulek
The Crossing Tverberg Theorem. SoCG 2019: 38:1-38:13 - [c37]Markus Chimani
Crossing Numbers of Beyond-Planar Graphs. GD 2019: 78-86 - [c36]Oswin Aichholzer
Minimal Representations of Order Types by Geometric Graphs. GD 2019: 101-113 - [c35]Martin Balko
On Erdős-Szekeres-Type Problems for k-convex Point Sets. IWOCA 2019: 35-47 - [i19]Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr:
Crossing Numbers of Beyond-Planar Graphs. CoRR abs/1908.03153 (2019) - [i18]Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl:
Minimal Representations of Order Types by Geometric Graphs. CoRR abs/1908.05124 (2019) - [i17]Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Patrick Schnider, Raphael Steiner, Pavel Valtr:
On the Average Complexity of the k-Level. CoRR abs/1911.02408 (2019) - 2018
- [j58]Oswin Aichholzer
Holes in 2-convex point sets. Comput. Geom. 74: 38-49 (2018) - [j57]Martin Balko
Drawing Graphs Using a Small Number of Obstacles. Discret. Comput. Geom. 59(1): 143-164 (2018) - [j56]Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff:
On the Maximum Crossing Number. J. Graph Algorithms Appl. 22(1): 67-87 (2018) - [c34]Michael Kaufmann, Jan Kratochvíl
Bounded Stub Resolution for Some Maximal 1-Planar Graphs. CALDAM 2018: 214-220 - [c33]Vít Jelínek
Generalized Coloring of Permutations. ESA 2018: 50:1-50:14 - [i16]Ruy Fabila Monroy, Jakob Jonsson, Pavel Valtr, David R. Wood:
The exact chromatic number of the convex segment disjointness graph. CoRR abs/1804.01057 (2018) - [i15]Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner:
The Crossing Tverberg Theorem. CoRR abs/1812.04911 (2018) - 2017
- [j55]Martin Balko
On the Beer Index of Convexity and Its Variants. Discret. Comput. Geom. 57(1): 179-214 (2017) - [j54]Martin Balko
A SAT attack on the Erdős-Szekeres conjecture. Eur. J. Comb. 66: 13-23 (2017) - [j53]Sergio Cabello
Peeling Potatoes Near-Optimally in Near-Linear Time. SIAM J. Comput. 46(5): 1574-1602 (2017) - [c32]Oswin Aichholzer
A Superlinear Lower Bound on the Number of 5-Holes. SoCG 2017: 8:1-8:16 - [c31]Martin Balko
Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences. SoCG 2017: 12:1-12:16 - [c30]Patrizio Angelini
On Vertex- and Empty-Ply Proximity Drawings. GD 2017: 24-37 - [c29]John Gimbel, Patrice Ossona de Mendez
Obstacle Numbers of Planar Graphs. GD 2017: 67-80 - [c28]Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff
On the Maximum Crossing Number. IWOCA 2017: 61-74 - [c27]Oswin Aichholzer
Holes in 2-Convex Point Sets. IWOCA 2017: 169-181 - [i14]Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff:
On the Maximum Crossing Number. CoRR abs/1705.05176 (2017) - [i13]Patrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala, Jan Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr:
On Vertex- and Empty-Ply Proximity Drawings. CoRR abs/1708.09233 (2017) - 2016
- [j52]Oswin Aichholzer
Reconstructing Point Set Order Types from Radial Orderings. Int. J. Comput. Geom. Appl. 26(3-4): 167-184 (2016) - [c26]Patrizio Angelini
Low Ply Drawings of Trees. GD 2016: 236-248 - [i12]Martin Balko, Vít Jelínek, Pavel Valtr:
On ordered Ramsey numbers of bounded-degree graphs. CoRR abs/1606.05628 (2016) - [i11]Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hancl, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis, Pavel Valtr:
Low Ply Drawings of Trees. CoRR abs/1608.08538 (2016) - 2015
- [j51]Vít Jelínek
Splittings and Ramsey properties of permutation classes. Adv. Appl. Math. 63: 41-67 (2015) - [j50]Jens M. Schmidt
Cubic plane graphs on a given point set. Comput. Geom. 48(1): 1-13 (2015) - [j49]Oswin Aichholzer, Ruy Fabila Monroy, Hernán González-Aguilar, Thomas Hackl, Marco A. Heredia
On k-gons and k-holes in point sets. Comput. Geom. 48(7): 528-537 (2015) - [j48]Josef Cibulka, Pu Gao, Marek Krcál, Tomás Valla
On the Geometric Ramsey Number of Outerplanar Graphs. Discret. Comput. Geom. 53(1): 64-79 (2015) - [j47]Martin Balko
A SAT attack on the Erdős-Szekeres conjecture. Electron. Notes Discret. Math. 49: 425-431 (2015) - [j46]János Barát
Empty Pentagons in Point Sets with Collinearities. SIAM J. Discret. Math. 29(1): 198-209 (2015) - [c25]Martin Balko
On the Beer Index of Convexity and Its Variants. SoCG 2015: 406-420 - [c24]Martin Balko
Drawing Graphs Using a Small Number of Obstacles. GD 2015: 360-372 - [c23]Oswin Aichholzer
A Note on the Number of General 4-holes in (Perturbed) Grids. JCDCGG 2015: 1-12 - 2014
- [j45]Stefan Felsner, Michael Kaufmann, Pavel Valtr:
Bend-optimal orthogonal graph drawing in the general position model. Comput. Geom. 47(3): 460-468 (2014) - [j44]Oswin Aichholzer
On k-convex point sets. Comput. Geom. 47(8): 809-832 (2014) - [j43]Oswin Aichholzer
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. Discret. Math. Theor. Comput. Sci. 16(3): 317-332 (2014) - [c22]Sergio Cabello
Peeling Potatoes Near-Optimally in Near-Linear Time. SoCG 2014: 224 - [c21]Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman
Reconstructing Point Set Order Typesfrom Radial Orderings. ISAAC 2014: 15-26 - [c20]Pavel Valtr:
The Happy End Theorem and Related Results. WALCOM 2014: 7 - [i10]Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr:
Peeling potatoes near-optimally in near-linear time. CoRR abs/1406.1368 (2014) - [i9]Oswin Aichholzer, Ruy Fabila Monroy, Hernán González-Aguilar, Thomas Hackl, Marco A. Heredia, Clemens Huemer, Jorge Urrutia, Pavel Valtr, Birgit Vogtenhuber:
On $k$-Gons and $k$-Holes in Point Sets. CoRR abs/1409.0081 (2014) - [i8]Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak:
On the Beer index of convexity and its variants. CoRR abs/1412.1769 (2014) - 2013
- [j42]Josef Cibulka, Jan Kyncl
Graph sharing games: Complexity and connectivity. Theor. Comput. Sci. 494: 49-62 (2013) - [c19]Josef Cibulka, Jan Kyncl
On planar point sets with the pentagon property. SoCG 2013: 81-90 - [p1]Pavel Valtr:
On Mutually Avoiding Sets. The Mathematics of Paul Erdős I 2013: 559-563 - [i7]Vít Jelínek, Pavel Valtr:
Splittings and Ramsey Properties of Permutation Classes. CoRR abs/1307.0027 (2013) - [i6]Josef Cibulka, Pu Gao, Marek Krcál, Tomás Valla, Pavel Valtr:
On the Geometric Ramsey Number of Outerplanar Graphs. CoRR abs/1310.7004 (2013) - 2012
- [j41]Michael S. Payne, Attila Pór, Pavel Valtr, David R. Wood
On the Connectivity of Visibility Graphs. Discret. Comput. Geom. 48(3): 669-681 (2012) - [c18]Pavel Valtr:
On empty pentagons and hexagons in planar point sets. CATS 2012: 47-48 - [c17]Jens M. Schmidt
Cubic plane graphs on a given point set. SCG 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
- [j40]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) - [j39]Stefan Felsner, Pavel Valtr:
Coding and Counting Arrangements of Pseudolines. Discret. Comput. Geom. 46(3): 405-416 (2011) - [c16]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]Pavel Valtr:
On empty pentagons and hexagons in planar point sets. CoRR abs/1111.5656 (2011) - 2010
- [j38]Konrad J. Swanepoel, Pavel Valtr:
Large Convexly Independent Subsets of Minkowski Sums. Electron. J. Comb. 17(1) (2010) - [c15]Josef Cibulka, Jan Kyncl
On Three Parameters of Invisibility Graphs. COCOON 2010: 192-198 - [c14]Josef Cibulka, Jan Kyncl
Graph Sharing Games: Complexity and Connectivity. TAMC 2010: 340-349
2000 – 2009
- 2009
- [j37]Alfredo García Olaverri, Ferran Hurtado, Clemens Huemer
On triconnected and cubic plane graphs on given point sets. Comput. Geom. 42(9): 913-922 (2009) - [j36]Sergey Bereg, Prosenjit Bose
Traversing a Set of Points with a Minimum Number of Turns. Discret. Comput. Geom. 41(4): 513-532 (2009) - [j35]Jan Kyncl
On edges crossing few other edges in simple topological complete graphs. Discret. Math. 309(7): 1917-1923 (2009) - [j34]Imre Bárány, Attila Pór, Pavel Valtr:
Paths with No Small Angles. SIAM J. Discret. Math. 23(4): 1655-1666 (2009) - [c13]Josef Cibulka, Jan Kyncl
Solution of Peter Winkler's Pizza Problem. IWOCA 2009: 356-367 - 2008
- [c12]Josef Cibulka, Jan Kyncl
Hamiltonian Alternating Paths on Bicolored Double-Chains. GD 2008: 181-192 - [c11]Imre Bárány, Attila Pór, Pavel Valtr:
Paths with no Small Angles. LATIN 2008: 654-663 - [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. Discret. Comput. Geom. 37(4): 565-576 (2007) - [j32]Alfredo García Olaverri, Ferran Hurtado, Clemens Huemer
On embedding triconnected cubic graphs on point sets. Electron. Notes Discret. Math. 29: 531-538 (2007) - [j31]Pavel Valtr, Gábor Lippner
Empty convex polygons in almost convex sets. Period. Math. Hung. 55(2): 121-127 (2007) - [j30]Robert Babilon, Vít Jelínek
Labelings of Graphs with Fixed and Variable Edge-Weights. SIAM J. Discret. Math. 21(3): 688-706 (2007) - [c10]Sergey Bereg, Prosenjit Bose
Traversing a set of points with a minimum number of turns. SCG 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
- [c9]Jan Kyncl
On Edges Crossing Few Other Edges in Simple Topological Complete Graphs. GD 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]Pavel Valtr:
Davenport-Schinzel Trees. Comb. 23(1): 151-184 (2003) - [j26]Gyula Károlyi, Pavel Valtr:
Point Configurations in d-Space without Large Subsets in Convex Position. Discret. Comput. Geom. 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. Discret. Comput. Geom. 28(4): 625-637 (2002) - [j23]Pavel Valtr:
A Sufficient Condition for the Existence of Large Empty Convex Polygons. Discret. Comput. Geom. 28(4): 671-682 (2002) - 2001
- [c8]Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr:
Low-Distortion Embeddings of Trees. GD 2001: 343-351 - [c7]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. Discret. Comput. Geom. 21(2): 193-200 (1999) - [j21]Krystyna Trybulec Kuperberg, Wlodzimierz Kuperberg, Jirí Matousek, Pavel Valtr:
Almost-Tiling the Plane by Ellipses. Discret. Comput. Geom. 22(3): 367-375 (1999) - [j20]Géza Tóth, Pavel Valtr:
Geometric Graphs with Few Disjoint Edges. Discret. Comput. Geom. 22(4): 633-642 (1999) - [j19]Pavel Valtr:
On an Extremal Problem for Colored Trees. Eur. J. Comb. 20(1): 115-121 (1999) - 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. Discret. Comput. Geom. 19(3): 335-342 (1998) - [j16]Géza Tóth, Pavel Valtr:
Note on the Erdos - Szekeres Theorem. Discret. Comput. Geom. 19(3): 457-459 (1998) - [j15]Pavel Valtr:
On Geometric Graphs with No k Pairwise Parallel Edges. Discret. Comput. Geom. 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. Discret. Comput. Geom. 20(3): 375-388 (1998) - [j13]Pavel Valtr:
On the Density of Subgraphs in a Graph with Bounded Independence Number. J. Comb. Theory B 73(2): 146-158 (1998) - [j12]Jaroslav Nesetril
A Ramsey Property of Order Types. J. Comb. Theory A 81(1): 88-107 (1998) - [c6]Géza Tóth, Pavel Valtr:
Geometric Graphs with Few Disjoint Edges. SCG 1998: 184-191 - 1997
- [j11]Herbert Edelsbrunner, Pavel Valtr, Emo Welzl:
Cutting Dense Point Sets in Half. Discret. Comput. Geom. 17(3): 243-255 (1997) - [c5]Gyula Károlyi, János Pach, Géza Tóth, Pavel Valtr:
Ramsey-Type Results for Geometric Graphs II. SCG 1997: 94-103 - [c4]Jaroslav Nesetril, József Solymosi, Pavel Valtr:
Induced monochromatic subconfigurations. Contemporary Trends in Discrete Mathematics 1997: 219-227 - [c3]Pavel Valtr:
Generalizations of Davenport-Schinzel sequences. Contemporary Trends in Discrete Mathematics 1997: 349-389 - [c2]Pavel Valtr:
Graph Drawings with no k Pairwise Crossing Edges. GD 1997: 205-218 - 1996
- [j10]Pavel Valtr:
Lines, Line-Point Incidences and Crossing Families in Dense Sets. Comb. 16(2): 269-294 (1996) - [j9]Pavel Valtr:
The Probability that n Random Points in a Triangle Are in Convex Position. Comb. 16(4): 567-573 (1996) - [j8]Paul Erdös, Zsolt Tuza, Pavel Valtr:
Ramsey-remainder. Eur. J. Comb. 17(6): 519-532 (1996) - 1995
- [j7]Pavel Valtr:
Probability that n Random Points are in Convex Position. Discret. Comput. Geom. 13: 637-643 (1995) - 1994
- [j6]Martin Klazar
Generalized Davenport-Schinzel Sequences. Comb. 14(4): 463-476 (1994) - [j5]Jaroslav Nesetril
A Ramsey-type Theorem in the Plane. Comb. Probab. Comput. 3: 127-135 (1994) - [j4]Pavel Valtr:
Unit Squares Intersecting All Secants of a Square. Discret. Comput. Geom. 11: 235-239 (1994) - [c1]Herbert Edelsbrunner, Pavel Valtr, Emo Welzl:
Cutting Dense Point Sets in Half. SCG 1994: 203-209 - 1992
- [j3]Pavel Valtr:
Convex Independent Sets and 7-holes in Restricted Planar Point Sets. Discret. Comput. Geom. 7: 135-152 (1992) - [j2]Pavel Valtr:
Sets in Rd with no large empty convex subsets. Discret. Math. 108(1-3): 115-124 (1992) - [j1]Radek Adamec, Martin Klazar
Generalized Davenport-Schinzel sequences with linear upper bound. Discret. Math. 108(1-3): 219-229 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-15 19:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: