2024
The Crossing Tverberg Theorem.
Discret. Comput. Geom., September, 2024
Generalized Coloring of Permutations.
Algorithmica, July, 2024
On the connectivity and the diameter of betweenness-uniform graphs.
Discret. Appl. Math., January, 2024
Bounding and Computing Obstacle Numbers of Graphs.
SIAM J. Discret. Math., 2024
Noncrossing Longest Paths and Cycles.
Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024
2023
Tight bounds on the expected number of holes in random point sets.
Random Struct. Algorithms, 2023
Three Edge-Disjoint Plane Spanning Paths in a Point Set.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023
Improved Bounds for the Binary Paint Shop Problem.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023
2022
Crossing numbers of beyond-planar graphs.
Theor. Comput. Sci., 2022
Holes and islands in random point sets.
Random Struct. Algorithms, 2022
On crossing-families in planar point sets.
Comput. Geom., 2022
Erdős-Szekeres-Type Problems in the Real Projective Plane.
Proceedings of the 38th International Symposium on Computational Geometry, 2022
2021
Orientation preserving maps of the n × n grid.
J. Comput. Geom., 2021
The Stub Resolution of 1-planar Graphs.
J. Graph Algorithms Appl., 2021
Graph Drawing and Network Visualization GD2020.
CoRR, 2021
Upward Point Set Embeddings of Paths and Trees.
Proceedings of the WALCOM: Algorithms and Computation, 2021
Linear Layouts of Complete Graphs.
Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021
Non-homotopic Loops with a Bounded Number of Pairwise Intersections.
Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021
Orientation Preserving Maps of the Square Grid.
Proceedings of the 37th International Symposium on Computational Geometry, 2021
On the Intersections of Non-homotopic Loops.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021
2020
On the Average Complexity of the k-Level.
J. Comput. Geom., 2020
Minimal Representations of Order Types by Geometric Graphs.
,
,
,
,
,
,
,
,
,
,
J. Graph Algorithms Appl., 2020
A superlinear lower bound on the number of 5-holes.
J. Comb. Theory A, 2020
On Erdős-Szekeres-type problems for k-convex point sets.
Eur. J. Comb., 2020
Upward Point Set Embeddings of Paths and Trees.
CoRR, 2020
Long Alternating Paths Exist.
Proceedings of the 36th International Symposium on Computational Geometry, 2020
2019
On ordered Ramsey numbers of bounded-degree graphs.
J. Comb. Theory B, 2019
Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences.
Discret. Comput. Geom., 2019
2018
On the Maximum Crossing Number.
J. Graph Algorithms Appl., 2018
Drawing Graphs Using a Small Number of Obstacles.
Discret. Comput. Geom., 2018
The exact chromatic number of the convex segment disjointness graph.
CoRR, 2018
Holes in 2-convex point sets.
Comput. Geom., 2018
Bounded Stub Resolution for Some Maximal 1-Planar Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2018
2017
Peeling Potatoes Near-Optimally in Near-Linear Time.
SIAM J. Comput., 2017
On the Beer Index of Convexity and Its Variants.
Discret. Comput. Geom., 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
2016
Reconstructing Point Set Order Types from Radial Orderings.
Int. J. Comput. Geom. Appl., 2016
Low Ply Drawings of Trees.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016
2015
Empty Pentagons in Point Sets with Collinearities.
SIAM J. Discret. Math., 2015
A SAT attack on the Erdős-Szekeres conjecture.
Electron. Notes Discret. Math., 2015
On the Geometric Ramsey Number of Outerplanar Graphs.
Discret. Comput. Geom., 2015
Cubic plane graphs on a given point set.
Comput. Geom., 2015
On k-gons and k-holes in point sets.
Comput. Geom., 2015
Splittings and Ramsey properties of permutation classes.
Adv. Appl. Math., 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
2014
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
,
,
,
,
,
,
,
,
,
,
Discret. Math. Theor. Comput. Sci., 2014
Bend-optimal orthogonal graph drawing in the general position model.
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
2013
Graph sharing games: Complexity and connectivity.
Theor. Comput. Sci., 2013
On planar point sets with the pentagon property.
Proceedings of the Symposium 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.
Discret. Comput. Geom., 2012
On empty pentagons and hexagons in planar point sets.
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012
2011
Coding and Counting Arrangements of Pseudolines.
Discret. Comput. Geom., 2011
Universal Sets for Straight-Line Embeddings of Bicolored Graphs
CoRR, 2011
Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three.
Algorithmica, 2011
2010
Large Convexly Independent Subsets of Minkowski Sums.
Electron. J. Comb., 2010
On Three Parameters of Invisibility Graphs.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010
2009
Paths with No Small Angles.
SIAM J. Discret. Math., 2009
On edges crossing few other edges in simple topological complete graphs.
Discret. Math., 2009
Traversing a Set of Points with a Minimum Number of Turns.
Discret. Comput. Geom., 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
Hamiltonian Alternating Paths on Bicolored Double-Chains.
Proceedings of the Graph Drawing, 16th International Symposium, 2008
2007
Labelings of Graphs with Fixed and Variable Edge-Weights.
SIAM J. Discret. Math., 2007
Empty convex polygons in almost convex sets.
Period. Math. Hung., 2007
On embedding triconnected cubic graphs on point sets.
Electron. Notes Discret. Math., 2007
Open Caps and Cups in Planar Point Sets.
Discret. Comput. Geom., 2007
2006
On the positive fraction Erdos-Szekeres theorem for convex sets.
Eur. J. Comb., 2006
2004
VC-Dimension of Exterior Visibility.
IEEE Trans. Pattern Anal. Mach. Intell., 2004
2003
Low-Distortion Embeddings of Trees.
J. Graph Algorithms Appl., 2003
Point Configurations in d-Space without Large Subsets in Convex Position.
Discret. Comput. Geom., 2003
Davenport-Schinzel Trees.
Comb., 2003
2002
A Sufficient Condition for the Existence of Large Empty Convex Polygons.
Discret. Comput. Geom., 2002
The Partitioned Version of the Erdös - Szekeres Theorem.
Discret. Comput. Geom., 2002
2001
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001
1999
On an Extremal Problem for Colored Trees.
Eur. J. Comb., 1999
On Galleries with No Bad Points.
Discret. Comput. Geom., 1999
Geometric Graphs with Few Disjoint Edges.
Discret. Comput. Geom., 1999
Almost-Tiling the Plane by Ellipses.
Discret. Comput. Geom., 1999
1998
On the Density of Subgraphs in a Graph with Bounded Independence Number.
J. Comb. Theory B, 1998
A Ramsey Property of Order Types.
J. Comb. Theory A, 1998
On Geometric Graphs with No k Pairwise Parallel Edges.
Discret. Comput. Geom., 1998
Note on the Erdos - Szekeres Theorem.
Discret. Comput. Geom., 1998
Ramsey-Type Results for Geometric Graphs, II.
Discret. Comput. Geom., 1998
A Positive Fraction Erdos - Szekeres Theorem.
Discret. Comput. Geom., 1998
The largest k-ball in a d-dimensional box.
Comput. Geom., 1998
1997
Cutting Dense Point Sets in Half.
Discret. Comput. Geom., 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
1996
The Probability that <i>n</i> Random Points in a Triangle Are in Convex Position.
Comb., 1996
Lines, Line-Point Incidences and Crossing Families in Dense Sets.
Comb., 1996
1995
Probability that n Random Points are in Convex Position.
Discret. Comput. Geom., 1995
1994
Unit Squares Intersecting All Secants of a Square.
Discret. Comput. Geom., 1994
A Ramsey-type Theorem in the Plane.
Comb. Probab. Comput., 1994
Generalized Davenport-Schinzel Sequences.
Comb., 1994
1992
Sets in R<sup>d</sup> with no large empty convex subsets.
Discret. Math., 1992
Generalized Davenport-Schinzel sequences with linear upper bound.
Discret. Math., 1992
Convex Independent Sets and 7-holes in Restricted Planar Point Sets.
Discret. Comput. Geom., 1992
