Pavel Valtr

Manfred Scheucher

Random Struct. Algorithms, 2023

Three Edge-Disjoint Plane Spanning Paths in a Point Set.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Improved Bounds for the Binary Paint Shop Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022

On crossing-families in planar point sets.

[BibT_eX]

[DOI]

Comput. Geom., 2022

Bounding and Computing Obstacle Numbers of Graphs.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Erdős-Szekeres-Type Problems in the Real Projective Plane.

[BibT_eX]

[DOI]

Manfred Scheucher

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Orientation preserving maps of the n × n grid.

[BibT_eX]

[DOI]

J. Comput. Geom., 2021

Graph Drawing and Network Visualization GD2020.

[BibT_eX]

[DOI]

David Auber

CoRR, 2021

Upward Point Set Embeddings of Paths and Trees.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2021

Linear Layouts of Complete Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

Non-homotopic Loops with a Bounded Number of Pairwise Intersections.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

Orientation Preserving Maps of the Square Grid.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

On the Connectivity and the Diameter of Betweenness-Uniform Graphs.

[BibT_eX]

[DOI]

David Hartman

Aneta Pokorná

Chrysanthi N. Raftopoulou

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

On the Intersections of Non-homotopic Loops.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

On the Average Complexity of the k-Level.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

Almost-Equidistant Sets.

[BibT_eX]

[DOI]

Graphs Comb., 2020

Upward Point Set Embeddings of Paths and Trees.

[BibT_eX]

[DOI]

CoRR, 2020

The Stub Resolution of 1-Planar Graphs.

[BibT_eX]

[DOI]

Michael Kaufmann

Jan Kratochvíl

Fabian Lipp

Fabrizio Montecchiani

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Long Alternating Paths Exist.

[BibT_eX]

[DOI]

Wolfgang Mulzer

Proceedings of the 36th International Symposium on Computational Geometry, 2020

Holes and Islands in Random Point Sets.

[BibT_eX]

[DOI]

Manfred Scheucher

Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019

On ordered Ramsey numbers of bounded-degree graphs.

[BibT_eX]

[DOI]

Vít Jelínek

J. Comb. Theory B, 2019

On Erdős-Szekeres-Type Problems for k-convex Point Sets.

[BibT_eX]

[DOI]

Leonardo Martínez-Sandoval

Sujoy Bhore

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Crossing Numbers of Beyond-Planar Graphs.

[BibT_eX]

[DOI]

Markus Chimani

Philipp Kindermann

Fabrizio Montecchiani

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Minimal Representations of Order Types by Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

The Crossing Tverberg Theorem.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

The exact chromatic number of the convex segment disjointness graph.

[BibT_eX]

[DOI]

CoRR, 2018

Generalized Coloring of Permutations.

[BibT_eX]

[DOI]

Vít Jelínek

Michal Opler

Chrysanthi N. Raftopoulou

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Bounded Stub Resolution for Some Maximal 1-Planar Graphs.

[BibT_eX]

[DOI]

Michael Kaufmann

Jan Kratochvíl

Fabian Lipp

Fabrizio Montecchiani

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

On the Maximum Crossing Number.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Holes in 2-Convex Point Sets.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Obstacle Numbers of Planar Graphs.

[BibT_eX]

[DOI]

John Gimbel

Patrice Ossona de Mendez

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

On Vertex- and Empty-Ply Proximity Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences.

[BibT_eX]

[DOI]

Josef Cibulka

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

A Superlinear Lower Bound on the Number of 5-Holes.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

Reconstructing Point Set Order Types from Radial Orderings.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2016

Low Ply Drawings of Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

2015

Empty Pentagons in Point Sets with Collinearities.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

A SAT attack on the Erdős-Szekeres conjecture.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

On the Geometric Ramsey Number of Outerplanar Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2015

Splittings and Ramsey properties of permutation classes.

[BibT_eX]

[DOI]

Vít Jelínek

Adv. Appl. Math., 2015

A Note on the Number of General 4-holes in (Perturbed) Grids.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Drawing Graphs Using a Small Number of Obstacles.

[BibT_eX]

[DOI]

Josef Cibulka

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

On the Beer Index of Convexity and Its Variants.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

Bend-optimal orthogonal graph drawing in the general position model.

[BibT_eX]

[DOI]

Stefan Felsner

Michael Kaufmann

Comput. Geom., 2014

On k-convex point sets.

[BibT_eX]

[DOI]

Comput. Geom., 2014

The Happy End Theorem and Related Results.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Reconstructing Point Set Order Typesfrom Radial Orderings.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Peeling Potatoes Near-Optimally in Near-Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013

On planar point sets with the pentagon property.

[BibT_eX]

[DOI]

Josef Cibulka

Jan Kyncl

Proceedings of the Symposium on Computational Geometry 2013, 2013

On Mutually Avoiding Sets.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Paul Erdős I, 2013

2012

On the Connectivity of Visibility Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2012

Cubic plane graphs on a given point set.

[BibT_eX]

[DOI]

Jens M. Schmidt

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

On empty pentagons and hexagons in planar point sets.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2011

Coding and Counting Arrangements of Pseudolines.

[BibT_eX]

[DOI]

Stefan Felsner

Discret. Comput. Geom., 2011

Universal Sets for Straight-Line Embeddings of Bicolored Graphs

[BibT_eX]

[DOI]

CoRR, 2011

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

[BibT_eX]

[DOI]

Algorithmica, 2011

On k-Gons and k-Holes in Point Sets.

[BibT_eX]

[DOI]

Hernán González-Aguilar

Thomas Hackl

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Large Convexly Independent Subsets of Minkowski Sums.

[BibT_eX]

[DOI]

Konrad J. Swanepoel

Electron. J. Comb., 2010

Graph Sharing Games: Complexity and Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

On Three Parameters of Invisibility Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009

On triconnected and cubic plane graphs on given point sets.

[BibT_eX]

[DOI]

Alfredo García Olaverri

Comput. Geom., 2009

Solution of Peter Winkler's Pizza Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

Paths with no Small Angles.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Hamiltonian Alternating Paths on Bicolored Double-Chains.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 16th International Symposium, 2008

2007

Labelings of Graphs with Fixed and Variable Edge-Weights.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

Empty convex polygons in almost convex sets.

[BibT_eX]

[DOI]

Gábor Lippner

Gyula Károlyi

Period. Math. Hung., 2007

On embedding triconnected cubic graphs on point sets.

[BibT_eX]

[DOI]

Alfredo García Olaverri

Electron. Notes Discret. Math., 2007

Open Caps and Cups in Planar Point Sets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2007

Traversing a set of points with a minimum number of turns.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006

On the positive fraction Erdos-Szekeres theorem for convex sets.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

2005

On Edges Crossing Few Other Edges in Simple Topological Complete Graphs.

[BibT_eX]

[DOI]

Jan Kyncl

Proceedings of the Graph Drawing, 13th International Symposium, 2005

2004

VC-Dimension of Exterior Visibility.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 2004

2003

Point Configurations in d-Space without Large Subsets in Convex Position.

[BibT_eX]

[DOI]

Gyula Károlyi

Discret. Comput. Geom., 2003

Davenport-Schinzel Trees.

[BibT_eX]

[DOI]

Comb., 2003

2002

A Sufficient Condition for the Existence of Large Empty Convex Polygons.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2002

The Partitioned Version of the Erdös - Szekeres Theorem.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2002

2001

One line and n points.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Low-Distortion Embeddings of Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

1999

On an Extremal Problem for Colored Trees.

[BibT_eX]

[DOI]

Eur. J. Comb., 1999

On Galleries with No Bad Points.

[BibT_eX]

[DOI]

Krystyna Trybulec Kuperberg

Discret. Comput. Geom., 1999

Almost-Tiling the Plane by Ellipses.

[BibT_eX]

[DOI]

Wlodzimierz Kuperberg

Jirí Matousek

Discret. Comput. Geom., 1999

1998

On the Density of Subgraphs in a Graph with Bounded Independence Number.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1998

A Ramsey Property of Order Types.

[BibT_eX]

[DOI]

Jaroslav Nesetril

J. Comb. Theory A, 1998

On Geometric Graphs with No k Pairwise Parallel Edges.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1998

Note on the Erdos - Szekeres Theorem.

[BibT_eX]

[DOI]

Géza Tóth

Discret. Comput. Geom., 1998

A Positive Fraction Erdos - Szekeres Theorem.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1998

The largest k-ball in a d-dimensional box.

[BibT_eX]

[DOI]

Comput. Geom., 1998

Geometric Graphs with Few Disjoint Edges.

[BibT_eX]

[DOI]

Géza Tóth

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

Graph Drawings with no k Pairwise Crossing Edges.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

Generalizations of Davenport-Schinzel sequences.

[BibT_eX]

[DOI]

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

Induced monochromatic subconfigurations.

[BibT_eX]

[DOI]

Jaroslav Nesetril

József Solymosi

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

Ramsey-Type Results for Geometric Graphs II.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Ramsey-remainder.

[BibT_eX]

[DOI]

Paul Erdös

Zsolt Tuza

Eur. J. Comb., 1996

The Probability that <i>n</i> Random Points in a Triangle Are in Convex Position.

[BibT_eX]

[DOI]

Comb., 1996

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

[BibT_eX]

[DOI]

Comb., 1996

1995

Probability that n Random Points are in Convex Position.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1995

1994

Unit Squares Intersecting All Secants of a Square.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1994

A Ramsey-type Theorem in the Plane.

[BibT_eX]

[DOI]

Jaroslav Nesetril

Comb. Probab. Comput., 1994

Generalized Davenport-Schinzel Sequences.

[BibT_eX]

[DOI]

Martin Klazar

Comb., 1994

Cutting Dense Point Sets in Half.

[BibT_eX]

[DOI]

Herbert Edelsbrunner

Emo Welzl

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1992

Sets in R<sup>d</sup> with no large empty convex subsets.

[BibT_eX]

[DOI]

Discret. Math., 1992

Generalized Davenport-Schinzel sequences with linear upper bound.

[BibT_eX]

[DOI]

Radek Adamec

Martin Klazar

Discret. Math., 1992

Convex Independent Sets and 7-holes in Restricted Planar Point Sets.

[BibT_eX]

[DOI]