Pavel Valtr

From MaRDI portal
Person:322286

Available identifiers

zbMath Open valtr.pavelDBLP08/4029-1WikidataQ102288120 ScholiaQ102288120MaRDI QIDQ322286

List of research outcomes





PublicationDate of PublicationType
Erdős-Szekeres-type problems in the real projective plane2024-11-22Paper
The crossing Tverberg theorem2024-10-25Paper
Improved bounds for the binary paint shop problem2024-08-22Paper
Generalized coloring of permutations2024-08-02Paper
Three edge-disjoint plane spanning paths in a point set2024-06-21Paper
Bounding and computing obstacle numbers of graphs2024-05-22Paper
On the connectivity and the diameter of betweenness-uniform graphs2024-01-24Paper
Long Alternating Paths Exist2023-11-02Paper
Holes and Islands in Random Point Sets2023-11-02Paper
Tight bounds on the expected number of holes in random point sets2023-10-17Paper
Holes and islands in random point sets2023-10-12Paper
https://portal.mardi4nfdi.de/entity/Q50444522022-10-31Paper
https://portal.mardi4nfdi.de/entity/Q50889682022-07-18Paper
Non-homotopic loops with a bounded number of pairwise intersections2022-07-01Paper
Linear layouts of complete graphs2022-07-01Paper
On crossing-families in planar point sets2022-06-13Paper
On the intersections of non-homotopic loops2022-03-24Paper
On the connectivity and the diameter of betweenness-uniform graphs2022-03-24Paper
Erd\H{o}s--Szekeres-type problems in the real projective plane2022-03-14Paper
Crossing numbers of beyond-planar graphs2021-12-01Paper
Upward point set embeddings of paths and trees2021-10-04Paper
On the Connectivity and the Diameter of Betweenness-Uniform Graphs2021-09-22Paper
Non-homotopic Loops with a Bounded Number of Pairwise Intersections2021-08-31Paper
Linear Layouts of Complete Graphs2021-08-11Paper
Generalized Coloring of Permutations2021-08-04Paper
On the average complexity of the $k$-level2020-11-12Paper
Crossing numbers of beyond-planar graphs2020-10-26Paper
On Erdős-Szekeres-type problems for \(k\)-convex point sets2020-09-15Paper
Almost-equidistant sets2020-04-30Paper
A superlinear lower bound on the number of 5-holes2020-03-20Paper
On Erdős-Szekeres-type problems for \(k\)-convex point sets2020-02-25Paper
Obstacle Numbers of Planar Graphs2019-02-20Paper
On Vertex- and Empty-Ply Proximity Drawings2019-02-20Paper
Covering lattice points by subspaces and counting point-hyperplane incidences2019-01-29Paper
On ordered Ramsey numbers of bounded-degree graphs2018-12-20Paper
The Crossing Tverberg Theorem2018-12-12Paper
Holes in 2-convex point sets2018-10-31Paper
A superlinear lower bound on the number of 5-holes2018-08-13Paper
Covering lattice points by subspaces and counting point-hyperplane incidences2018-08-13Paper
On the maximum crossing number2018-06-15Paper
Holes in 2-convex point sets2018-06-15Paper
Bounded stub resolution for some maximal 1-planar graphs2018-06-05Paper
Peeling Potatoes Near-Optimally in Near-Linear Time2018-04-23Paper
The exact chromatic number of the convex segment disjointness graph2018-04-03Paper
Drawing graphs using a small number of obstacles2018-02-28Paper
On the Maximum Crossing Number2018-01-12Paper
A Mode-Matching Technique for Analysis of Scattering by Periodic Comb Surfaces2017-10-30Paper
Experimental Study on Terrestrial Links Enhancement at 11 and 38 GHz2017-10-30Paper
Inclusion of Higher Order Diffracted Fields in the Epstein–Peterson Method2017-10-30Paper
On the Beer Index of Convexity and Its Variants2017-10-10Paper
Peeling Potatoes Near-Optimally in Near-Linear Time2017-10-06Paper
A SAT attack on the Erdős-Szekeres conjecture2017-09-11Paper
Reconstructing Point Set Order Types from Radial Orderings2017-05-19Paper
On three measures of non-convexity2017-04-28Paper
On the Beer index of convexity and its variants2017-02-24Paper
Low Ply Drawings of Trees2017-02-21Paper
Drawing graphs using a small number of obstacles2017-02-10Paper
A Note on the Number of General 4-holes in (Perturbed) Grids2017-02-01Paper
A SAT attack on the Erdős-Szekeres conjecture2016-10-14Paper
On \(k\)-gons and \(k\)-holes in point sets2015-12-30Paper
Empty Pentagons in Point Sets with Collinearities2015-11-27Paper
Reconstructing Point Set Order Typesfrom Radial Orderings2015-09-11Paper
Jiří Matoušek, March 10, 1963 -- March 9, 20152015-07-20Paper
One line and ε2015-02-27Paper
On the geometric Ramsey number of outerplanar graphs2015-02-19Paper
On planar point sets with the pentagon property2015-02-17Paper
https://portal.mardi4nfdi.de/entity/Q51731632015-02-09Paper
Splittings and Ramsey properties of permutation classes2014-12-09Paper
Cubic plane graphs on a given point set2014-11-24Paper
Cubic plane graphs on a given point set2014-08-07Paper
On \(k\)-convex point sets2014-06-27Paper
https://portal.mardi4nfdi.de/entity/Q54199612014-06-11Paper
Bend-optimal orthogonal graph drawing in the general position model2014-01-22Paper
Graph sharing games: complexity and connectivity2014-01-10Paper
Universal Sets for Straight-Line Embeddings of Bicolored Graphs2013-09-25Paper
On the connectivity of visibility graphs2012-10-15Paper
Augmenting the edge connectivity of planar straight line graphs to three2011-12-14Paper
Coding and counting arrangements of pseudolines2011-11-07Paper
Large convexly independent subsets of Minkowski sums2010-12-16Paper
https://portal.mardi4nfdi.de/entity/Q30608582010-12-13Paper
Paths with No Small Angles2010-12-03Paper
On Three Parameters of Invisibility Graphs2010-07-20Paper
Graph Sharing Games: Complexity and Connectivity2010-06-17Paper
Solution of Peter Winkler’s Pizza Problem2009-12-11Paper
On triconnected and cubic plane graphs on given point sets2009-08-14Paper
Traversing a set of points with a minimum number of turns2009-05-06Paper
On edges crossing few other edges in simple topological complete graphs2009-04-09Paper
Hamiltonian Alternating Paths on Bicolored Double-Chains2009-03-03Paper
Traversing a set of points with a minimum number of turns2009-02-12Paper
Empty convex polygons in almost convex sets2008-10-22Paper
Labelings of Graphs with Fixed and Variable Edge-Weights2008-08-13Paper
https://portal.mardi4nfdi.de/entity/Q35145312008-07-21Paper
On embedding triconnected cubic graphs on point sets2008-06-05Paper
Paths with no Small Angles2008-04-15Paper
Open caps and cups in planar point sets2007-06-21Paper
On the positive fraction Erdős-Szekeres theorem for convex sets2006-11-15Paper
Graph Drawing2006-11-13Paper
https://portal.mardi4nfdi.de/entity/Q52902792006-04-28Paper
https://portal.mardi4nfdi.de/entity/Q52902802006-04-28Paper
Planar point sets with a small number of empty convex polygons2005-10-04Paper
https://portal.mardi4nfdi.de/entity/Q56927012005-09-28Paper
Low-Distortion Embeddings of Trees2005-05-25Paper
https://portal.mardi4nfdi.de/entity/Q46575882005-03-14Paper
https://portal.mardi4nfdi.de/entity/Q46575972005-03-14Paper
https://portal.mardi4nfdi.de/entity/Q30437352004-08-06Paper
Point configurations in \(d\)-space without large subsets in convex position2004-03-07Paper
One line and n points2004-02-03Paper
Davenport-Schinzel trees2003-12-14Paper
A sufficient condition for the existence of large empty convex polygons2003-03-17Paper
The partitioned version of the Erdős-Szekeres theorem2003-03-17Paper
Almost-tiling the plane by ellipses2001-01-03Paper
Geometric graphs with few disjoint edges2000-06-27Paper
https://portal.mardi4nfdi.de/entity/Q42634792000-04-10Paper
On visibility and covering by convex sets2000-01-17Paper
https://portal.mardi4nfdi.de/entity/Q42634881999-12-02Paper
On an extremal problem for colored trees1999-11-10Paper
A positive fraction Erdős-Szekeres theorem1999-06-14Paper
On galleries with no bad points1999-05-31Paper
Ramsey-type results for geometric graphs. II1999-05-16Paper
On geometric graphs with no \(k\) pairwise parallel edges1999-03-18Paper
On the density of subgraphs in a graph with bounded independence number1999-01-03Paper
The largest \(k\)-ball in a \(d\)-dimensional box1998-12-21Paper
Note on the Erdős-Szekeres theorem1998-12-15Paper
A Ramsey property of order types1998-12-03Paper
https://portal.mardi4nfdi.de/entity/Q43523381998-02-03Paper
The probability that \(n\) random points in a triangle are in convex position1998-01-11Paper
Guarding galleries where no point sees a small area.1998-01-01Paper
https://portal.mardi4nfdi.de/entity/Q43523351997-08-28Paper
https://portal.mardi4nfdi.de/entity/Q43479121997-08-11Paper
https://portal.mardi4nfdi.de/entity/Q48791001997-07-06Paper
Cutting dense point sets in half1997-05-19Paper
Ramsey-remainder1997-03-23Paper
https://portal.mardi4nfdi.de/entity/Q56890211997-03-11Paper
Lines, line-point incidences and crossing families in dense sets1996-10-20Paper
https://portal.mardi4nfdi.de/entity/Q48614161996-01-17Paper
Probability that \(n\) random points are in convex position1995-07-02Paper
Generalized Davenport-Schinzel sequences1995-02-01Paper
A Ramsey-Type Theorem in the Plane1995-01-02Paper
Unit squares intersecting all secants of a square1994-11-09Paper
Generalized Davenport-Schinzel sequences with linear upper bound1993-01-17Paper
Sets in \(\mathbb{R}^ d\) with no large empty convex subsets1993-01-17Paper
Convex independent sets and 7-holes in restricted planar point sets1992-06-28Paper
Bounding and computing obstacle numbers of graphsN/APaper
Structure of betweenness uniform graphs with low values of betweenness centralityN/APaper

Research outcomes over time

This page was built for person: Pavel Valtr