Pavel Valtr

According to our database1, Pavel Valtr authored at least 86 papers between 1992 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Quantifying Wet Antenna Attenuation in 38-GHz Commercial Microwave Links of Cellular Backhaul.
IEEE Geosci. Remote Sensing Lett., 2019

On ordered Ramsey numbers of bounded-degree graphs.
J. Comb. Theory, Ser. B, 2019

On Erdős-Szekeres-Type Problems for k-convex Point Sets.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

The Crossing Tverberg Theorem.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Generalized Coloring of Permutations.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Bounded Stub Resolution for Some Maximal 1-Planar Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017
A SAT attack on the Erdős-Szekeres conjecture.
Eur. J. Comb., 2017

On the Maximum Crossing Number.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Holes in 2-Convex Point Sets.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Obstacle Numbers of Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

On Vertex- and Empty-Ply Proximity Drawings.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

A Superlinear Lower Bound on the Number of 5-Holes.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
Reconstructing Point Set Order Types from Radial Orderings.
Int. J. Comput. Geometry Appl., 2016

Low Ply Drawings of Trees.
Proceedings of the Graph Drawing and Network Visualization, 2016

2015
Empty Pentagons in Point Sets with Collinearities.
SIAM J. Discrete Math., 2015

A SAT attack on the Erdős-Szekeres conjecture.
Electronic Notes in Discrete Mathematics, 2015

On the Geometric Ramsey Number of Outerplanar Graphs.
Discrete & Computational Geometry, 2015

On k-gons and k-holes in point sets.
Comput. Geom., 2015

A Note on the Number of General 4-holes in (Perturbed) Grids.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Drawing Graphs Using a Small Number of Obstacles.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

On the Beer Index of Convexity and Its Variants.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Discrete Mathematics & Theoretical Computer Science, 2014

Bend-optimal orthogonal graph drawing in the general position model.
Comput. Geom., 2014

On k-convex point sets.
Comput. Geom., 2014

The Happy End Theorem and Related Results.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Reconstructing Point Set Order Typesfrom Radial Orderings.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Peeling Potatoes Near-Optimally in Near-Linear Time.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
On planar point sets with the pentagon property.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

On Mutually Avoiding Sets.
Proceedings of the Mathematics of Paul Erdős I, 2013

2012
On the Connectivity of Visibility Graphs.
Discrete & Computational Geometry, 2012

Cubic plane graphs on a given point set.
Proceedings of the Symposuim on Computational Geometry 2012, 2012

On empty pentagons and hexagons in planar point sets.
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2011
A wideband, directional model for the satellite-to-indoor propagation channel at S-band.
Int. J. Satellite Communications Networking, 2011

Coding and Counting Arrangements of Pseudolines.
Discrete & Computational Geometry, 2011

Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three.
Algorithmica, 2011

On k-Gons and k-Holes in Point Sets.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Large Convexly Independent Subsets of Minkowski Sums.
Electr. J. Comb., 2010

Graph Sharing Games: Complexity and Connectivity.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

On Three Parameters of Invisibility Graphs.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009
Propagation Measurements and Comparison with EM Techniques for In-Cabin Wireless Networks.
EURASIP J. Wireless Comm. and Networking, 2009

On triconnected and cubic plane graphs on given point sets.
Comput. Geom., 2009

Solution of Peter Winkler's Pizza Problem.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008
Building Entry Loss and Delay Spread Measurements on a Simulated HAP-to-Indoor Link at S-Band.
EURASIP J. Wireless Comm. and Networking, 2008

Paths with no Small Angles.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Hamiltonian Alternating Paths on Bicolored Double-Chains.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

2007
Labelings of Graphs with Fixed and Variable Edge-Weights.
SIAM J. Discrete Math., 2007

Empty convex polygons in almost convex sets.
Periodica Mathematica Hungarica, 2007

On embedding triconnected cubic graphs on point sets.
Electronic Notes in Discrete Mathematics, 2007

Open Caps and Cups in Planar Point Sets.
Discrete & Computational Geometry, 2007

Traversing a set of points with a minimum number of turns.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

2006
On the positive fraction Erdos-Szekeres theorem for convex sets.
Eur. J. Comb., 2006

2005
On Edges Crossing Few Other Edges in Simple Topological Complete Graphs.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

2004
VC-Dimension of Exterior Visibility.
IEEE Trans. Pattern Anal. Mach. Intell., 2004

2003
Point Configurations in d-Space without Large Subsets in Convex Position.
Discrete & Computational Geometry, 2003

Davenport-Schinzel Trees.
Combinatorica, 2003

2002
A Sufficient Condition for the Existence of Large Empty Convex Polygons.
Discrete & Computational Geometry, 2002

The Partitioned Version of the Erdös - Szekeres Theorem.
Discrete & Computational Geometry, 2002

2001
One line and n points.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Low-Distortion Embeddings of Trees.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

1999
On an Extremal Problem for Colored Trees.
Eur. J. Comb., 1999

On Galleries with No Bad Points.
Discrete & Computational Geometry, 1999

Almost-Tiling the Plane by Ellipses.
Discrete & Computational Geometry, 1999

1998
On the Density of Subgraphs in a Graph with Bounded Independence Number.
J. Comb. Theory, Ser. B, 1998

A Ramsey Property of Order Types.
J. Comb. Theory, Ser. A, 1998

On Geometric Graphs with No k Pairwise Parallel Edges.
Discrete & Computational Geometry, 1998

Note on the Erdos - Szekeres Theorem.
Discrete & Computational Geometry, 1998

Ramsey-Type Results for Geometric Graphs, II.
Discrete & Computational Geometry, 1998

A Positive Fraction Erdos - Szekeres Theorem.
Discrete & Computational Geometry, 1998

The largest k-ball in a d-dimensional box.
Comput. Geom., 1998

Geometric Graphs with Few Disjoint Edges.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
Graph Drawings with no k Pairwise Crossing Edges.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

Generalizations of Davenport-Schinzel sequences.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

Induced monochromatic subconfigurations.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

Ramsey-Type Results for Geometric Graphs II.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Ramsey-remainder.
Eur. J. Comb., 1996

The Probability that n Random Points in a Triangle Are in Convex Position.
Combinatorica, 1996

Lines, Line-Point Incidences and Crossing Families in Dense Sets.
Combinatorica, 1996

1995
Probability that n Random Points are in Convex Position.
Discrete & Computational Geometry, 1995

1994
Unit Squares Intersecting All Secants of a Square.
Discrete & Computational Geometry, 1994

A Ramsey-type Theorem in the Plane.
Combinatorics, Probability & Computing, 1994

Generalized Davenport-Schinzel Sequences.
Combinatorica, 1994

Cutting Dense Point Sets in Half.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1992
Sets in Rd with no large empty convex subsets.
Discrete Mathematics, 1992

Generalized Davenport-Schinzel sequences with linear upper bound.
Discrete Mathematics, 1992

Convex Independent Sets and 7-holes in Restricted Planar Point Sets.
Discrete & Computational Geometry, 1992


  Loading...