Pavel Valtr

From MaRDI portal
(Redirected from Person:322286)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Erdős-Szekeres-type problems in the real projective plane
Discrete & Computational Geometry
2024-11-22Paper
The crossing Tverberg theorem
Discrete & Computational Geometry
2024-10-25Paper
Improved bounds for the binary paint shop problem2024-08-22Paper
Generalized coloring of permutations
Algorithmica
2024-08-02Paper
Three edge-disjoint plane spanning paths in a point set2024-06-21Paper
Bounding and computing obstacle numbers of graphs
SIAM Journal on Discrete Mathematics
2024-05-22Paper
On the connectivity and the diameter of betweenness-uniform graphs
Discrete Applied Mathematics
2024-01-24Paper
Long Alternating Paths Exist
(available as arXiv preprint)
2023-11-02Paper
Holes and Islands in Random Point Sets2023-11-02Paper
Tight bounds on the expected number of holes in random point sets
Random Structures & Algorithms
2023-10-17Paper
Holes and islands in random point sets
Random Structures & Algorithms
2023-10-12Paper
Holes and islands in random point sets
Random Structures & Algorithms
2023-10-12Paper
scientific article; zbMATH DE number 7610225 (Why is no real title available?)2022-10-31Paper
The crossing Tverberg theorem
(available as arXiv preprint)
2022-07-18Paper
Linear layouts of complete graphs
(available as arXiv preprint)
2022-07-01Paper
Non-homotopic loops with a bounded number of pairwise intersections
(available as arXiv preprint)
2022-07-01Paper
On crossing-families in planar point sets
Computational Geometry
2022-06-13Paper
On the intersections of non-homotopic loops2022-03-24Paper
On the connectivity and the diameter of betweenness-uniform graphs
(available as arXiv preprint)
2022-03-24Paper
Erd\H{o}s--Szekeres-type problems in the real projective plane2022-03-14Paper
Crossing numbers of beyond-planar graphs
Theoretical Computer Science
2021-12-01Paper
Upward point set embeddings of paths and trees
(available as arXiv preprint)
2021-10-04Paper
On the Connectivity and the Diameter of Betweenness-Uniform Graphs
(available as arXiv preprint)
2021-09-22Paper
Non-homotopic Loops with a Bounded Number of Pairwise Intersections
(available as arXiv preprint)
2021-08-31Paper
Linear Layouts of Complete Graphs
(available as arXiv preprint)
2021-08-11Paper
Generalized Coloring of Permutations2021-08-04Paper
On the average complexity of the $k$-level
(available as arXiv preprint)
2020-11-12Paper
Crossing numbers of beyond-planar graphs
Lecture Notes in Computer Science
2020-10-26Paper
On Erdős-Szekeres-type problems for \(k\)-convex point sets
European Journal of Combinatorics
2020-09-15Paper
Almost-equidistant sets
Graphs and Combinatorics
2020-04-30Paper
A superlinear lower bound on the number of 5-holes
Journal of Combinatorial Theory. Series A
2020-03-20Paper
On Erdős-Szekeres-type problems for \(k\)-convex point sets
Lecture Notes in Computer Science
2020-02-25Paper
On vertex- and empty-ply proximity drawings
Lecture Notes in Computer Science
2019-02-20Paper
Obstacle numbers of planar graphs
Lecture Notes in Computer Science
2019-02-20Paper
Covering lattice points by subspaces and counting point-hyperplane incidences
Discrete & Computational Geometry
2019-01-29Paper
On ordered Ramsey numbers of bounded-degree graphs
Journal of Combinatorial Theory. Series B
2018-12-20Paper
The Crossing Tverberg Theorem
(available as arXiv preprint)
2018-12-12Paper
Holes in 2-convex point sets
Computational Geometry
2018-10-31Paper
A superlinear lower bound on the number of 5-holes
(available as arXiv preprint)
2018-08-13Paper
Covering lattice points by subspaces and counting point-hyperplane incidences
(available as arXiv preprint)
2018-08-13Paper
Holes in 2-convex point sets
Lecture Notes in Computer Science
2018-06-15Paper
On the maximum crossing number2018-06-15Paper
Bounded stub resolution for some maximal 1-planar graphs2018-06-05Paper
Peeling potatoes near-optimally in near-linear time
Proceedings of the thirtieth annual symposium on Computational geometry
2018-04-23Paper
The exact chromatic number of the convex segment disjointness graph2018-04-03Paper
Drawing graphs using a small number of obstacles
Discrete & Computational Geometry
2018-02-28Paper
On the Maximum Crossing Number
Journal of Graph Algorithms and Applications
2018-01-12Paper
Experimental Study on Terrestrial Links Enhancement at 11 and 38 GHz
IEEE Transactions on Antennas and Propagation
2017-10-30Paper
Inclusion of Higher Order Diffracted Fields in the Epstein–Peterson Method
IEEE Transactions on Antennas and Propagation
2017-10-30Paper
A Mode-Matching Technique for Analysis of Scattering by Periodic Comb Surfaces
IEEE Transactions on Antennas and Propagation
2017-10-30Paper
On the Beer index of convexity and its variants2017-10-10Paper
Peeling potatoes near-optimally in near-linear time
SIAM Journal on Computing
2017-10-06Paper
A SAT attack on the Erdős-Szekeres conjecture
European Journal of Combinatorics
2017-09-11Paper
Reconstructing Point Set Order Types from Radial Orderings
International Journal of Computational Geometry & Applications
2017-05-19Paper
On three measures of non-convexity
Israel Journal of Mathematics
2017-04-28Paper
On the Beer index of convexity and its variants
Discrete & Computational Geometry
2017-02-24Paper
Low Ply Drawings of Trees
Lecture Notes in Computer Science
2017-02-21Paper
Drawing graphs using a small number of obstacles
Lecture Notes in Computer Science
2017-02-10Paper
A note on the number of general 4-holes in (perturbed) grids
Lecture Notes in Computer Science
2017-02-01Paper
A SAT attack on the Erdős-Szekeres conjecture
Electronic Notes in Discrete Mathematics
2016-10-14Paper
On \(k\)-gons and \(k\)-holes in point sets
Computational Geometry
2015-12-30Paper
Empty pentagons in point sets with collinearities
SIAM Journal on Discrete Mathematics
2015-11-27Paper
Reconstructing point set order types from radial orderings
Algorithms and Computation
2015-09-11Paper
Jiří Matoušek, March 10, 1963 -- March 9, 2015
Discrete & Computational Geometry
2015-07-20Paper
One line and \(n\) points
Proceedings of the thirty-third annual ACM symposium on Theory of computing
2015-02-27Paper
On the geometric Ramsey number of outerplanar graphs
Discrete & Computational Geometry
2015-02-19Paper
On planar point sets with the pentagon property
Proceedings of the twenty-ninth annual symposium on Computational geometry
2015-02-17Paper
Cell-paths in mono- and bichromatic line arrangements in the plane2015-02-09Paper
Splittings and Ramsey properties of permutation classes
Advances in Applied Mathematics
2014-12-09Paper
Cubic plane graphs on a given point set
Computational Geometry
2014-11-24Paper
Cubic plane graphs on a given point set
Proceedings of the twenty-eighth annual symposium on Computational geometry
2014-08-07Paper
On \(k\)-convex point sets
Computational Geometry
2014-06-27Paper
scientific article; zbMATH DE number 6302983 (Why is no real title available?)2014-06-11Paper
Bend-optimal orthogonal graph drawing in the general position model
Computational Geometry
2014-01-22Paper
Graph sharing games: complexity and connectivity
Theoretical Computer Science
2014-01-10Paper
Universal sets for straight-line embeddings of bicolored graphs
Thirty Essays on Geometric Graph Theory
2013-09-25Paper
On the connectivity of visibility graphs
Discrete & Computational Geometry
2012-10-15Paper
Augmenting the edge connectivity of planar straight line graphs to three
Algorithmica
2011-12-14Paper
Coding and counting arrangements of pseudolines
Discrete & Computational Geometry
2011-11-07Paper
Large convexly independent subsets of Minkowski sums
The Electronic Journal of Combinatorics
2010-12-16Paper
Large convexly independent subsets of Minkowski sums
The Electronic Journal of Combinatorics
2010-12-16Paper
Large convexly independent subsets of Minkowski sums
The Electronic Journal of Combinatorics
2010-12-16Paper
Solution of Peter Winkler's pizza problem2010-12-13Paper
Paths with no small angles
SIAM Journal on Discrete Mathematics
2010-12-03Paper
On three parameters of invisibility graphs
Lecture Notes in Computer Science
2010-07-20Paper
Graph sharing games: complexity and connectivity
Lecture Notes in Computer Science
2010-06-17Paper
Solution of Peter Winkler's pizza problem
Lecture Notes in Computer Science
2009-12-11Paper
On triconnected and cubic plane graphs on given point sets
Computational Geometry
2009-08-14Paper
Traversing a set of points with a minimum number of turns
Discrete & Computational Geometry
2009-05-06Paper
On edges crossing few other edges in simple topological complete graphs
Discrete Mathematics
2009-04-09Paper
Hamiltonian Alternating Paths on Bicolored Double-Chains
Graph Drawing
2009-03-03Paper
Traversing a set of points with a minimum number of turns
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07
2009-02-12Paper
Empty convex polygons in almost convex sets
Periodica Mathematica Hungarica
2008-10-22Paper
Labelings of Graphs with Fixed and Variable Edge-Weights
SIAM Journal on Discrete Mathematics
2008-08-13Paper
On empty hexagons2008-07-21Paper
On embedding triconnected cubic graphs on point sets
Electronic Notes in Discrete Mathematics
2008-06-05Paper
Paths with no Small Angles
Lecture Notes in Computer Science
2008-04-15Paper
Open caps and cups in planar point sets
Discrete & Computational Geometry
2007-06-21Paper
On the positive fraction Erdős-Szekeres theorem for convex sets
European Journal of Combinatorics
2006-11-15Paper
Graph Drawing
Lecture Notes in Computer Science
2006-11-13Paper
scientific article; zbMATH DE number 5019923 (Why is no real title available?)2006-04-28Paper
scientific article; zbMATH DE number 5019924 (Why is no real title available?)2006-04-28Paper
Planar point sets with a small number of empty convex polygons
Studia Scientiarum Mathematicarum Hungarica
2005-10-04Paper
scientific article; zbMATH DE number 2209719 (Why is no real title available?)2005-09-28Paper
Low-Distortion Embeddings of Trees
Journal of Graph Algorithms and Applications
2005-05-25Paper
scientific article; zbMATH DE number 2145239 (Why is no real title available?)2005-03-14Paper
scientific article; zbMATH DE number 2145248 (Why is no real title available?)2005-03-14Paper
scientific article; zbMATH DE number 2084288 (Why is no real title available?)2004-08-06Paper
Point configurations in \(d\)-space without large subsets in convex position
Discrete & Computational Geometry
2004-03-07Paper
One line and n points
Random Structures & Algorithms
2004-02-03Paper
Davenport-Schinzel trees
Combinatorica
2003-12-14Paper
A sufficient condition for the existence of large empty convex polygons
Discrete & Computational Geometry
2003-03-17Paper
The partitioned version of the Erdős-Szekeres theorem
Discrete & Computational Geometry
2003-03-17Paper
Almost-tiling the plane by ellipses
Discrete & Computational Geometry
2001-01-03Paper
Geometric graphs with few disjoint edges
Discrete & Computational Geometry
2000-06-27Paper
scientific article; zbMATH DE number 1341917 (Why is no real title available?)2000-04-10Paper
On visibility and covering by convex sets
Israel Journal of Mathematics
2000-01-17Paper
scientific article; zbMATH DE number 1341926 (Why is no real title available?)1999-12-02Paper
On an extremal problem for colored trees
European Journal of Combinatorics
1999-11-10Paper
A positive fraction Erdős-Szekeres theorem
Discrete & Computational Geometry
1999-06-14Paper
On galleries with no bad points
Discrete & Computational Geometry
1999-05-31Paper
Ramsey-type results for geometric graphs. II
Discrete & Computational Geometry
1999-05-16Paper
On geometric graphs with no \(k\) pairwise parallel edges
Discrete & Computational Geometry
1999-03-18Paper
On the density of subgraphs in a graph with bounded independence number
Journal of Combinatorial Theory. Series B
1999-01-03Paper
The largest \(k\)-ball in a \(d\)-dimensional box
Computational Geometry
1998-12-21Paper
Note on the Erdős-Szekeres theorem
Discrete & Computational Geometry
1998-12-15Paper
A Ramsey property of order types
Journal of Combinatorial Theory. Series A
1998-12-03Paper
scientific article; zbMATH DE number 1054790 (Why is no real title available?)1998-02-03Paper
The probability that \(n\) random points in a triangle are in convex position
Combinatorica
1998-01-11Paper
Guarding galleries where no point sees a small area.
Israel Journal of Mathematics
1998-01-01Paper
scientific article; zbMATH DE number 1054787 (Why is no real title available?)1997-08-28Paper
scientific article; zbMATH DE number 1047745 (Why is no real title available?)1997-08-11Paper
scientific article; zbMATH DE number 881170 (Why is no real title available?)1997-07-06Paper
Cutting dense point sets in half
Discrete & Computational Geometry
1997-05-19Paper
Ramsey-remainder
European Journal of Combinatorics
1997-03-23Paper
scientific article; zbMATH DE number 970816 (Why is no real title available?)1997-03-11Paper
Lines, line-point incidences and crossing families in dense sets
Combinatorica
1996-10-20Paper
scientific article; zbMATH DE number 835734 (Why is no real title available?)1996-01-17Paper
Probability that \(n\) random points are in convex position
Discrete & Computational Geometry
1995-07-02Paper
Generalized Davenport-Schinzel sequences
Combinatorica
1995-02-01Paper
A Ramsey-Type Theorem in the Plane
Combinatorics, Probability and Computing
1995-01-02Paper
Unit squares intersecting all secants of a square
Discrete & Computational Geometry
1994-11-09Paper
Generalized Davenport-Schinzel sequences with linear upper bound
Discrete Mathematics
1993-01-17Paper
Sets in \(\mathbb{R}^ d\) with no large empty convex subsets
Discrete Mathematics
1993-01-17Paper
Convex independent sets and 7-holes in restricted planar point sets
Discrete & Computational Geometry
1992-06-28Paper
Bounding and computing obstacle numbers of graphs
(available as arXiv preprint)
N/APaper
Structure of betweenness uniform graphs with low values of betweenness centrality
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Pavel Valtr