2025
Progressions in Euclidean Ramsey theory.
Eur. J. Comb., 2025
2024
Monochromatic spanning trees and matchings in ordered complete graphs.
J. Graph Theory, April, 2024
Disjointness graphs of short polygonal chains.
J. Comb. Theory B, January, 2024
Corrigendum to "An algorithm to find maximum area polygons circumscribed about a convex polygon" [Discrete Appl. Math. 255 (2019) 98-108].
Discret. Appl. Math., 2024
1-Planar Unit Distance Graphs.
Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024
2023
Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph.
Order, October, 2023
Two trees are better than one.
CoRR, 2023
Crossing lemma for the odd-crossing number.
Comput. Geom., 2023
Saturated 2-plane drawings with few edges.
Ars Math. Contemp., 2023
2022
Crossings between non-homotopic edges.
J. Comb. Theory B, 2022
Improvement on the Crossing Number of Crossing-Critical Graphs.
Discret. Comput. Geom., 2022
2021
The number of crossings in multigraphs with no empty lens.
J. Graph Algorithms Appl., 2021
Disjointness graphs of segments in the space.
Comb. Probab. Comput., 2021
2020
Petruska's question on planar convex sets.
Discret. Math., 2020
A Crossing Lemma for Multigraphs.
Discret. Comput. Geom., 2020
Dense Point Sets with Many Halving Lines.
Discret. Comput. Geom., 2020
2019
Many touchings force many crossings.
J. Comb. Theory B, 2019
An algorithm to find maximum area polygons circumscribed about a convex polygon.
Discret. Appl. Math., 2019
2018
Improvements on the density of maximal 1-planar graphs.
J. Graph Theory, 2018
Note on k-planar crossing numbers.
Comput. Geom., 2018
2017
Disjointness Graphs of Segments.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017
2016
Separation with restricted families of sets.
J. Comb. Theory A, 2016
2015
Erdős-Szekeres Theorem for Lines.
Discret. Comput. Geom., 2015
Saturated simple and k-simple topological graphs.
Comput. Geom., 2015
Multiple Coverings with Closed Polygons.
Electron. J. Comb., 2015
2014
A Note on Coloring Line Arrangements.
Electron. J. Comb., 2014
2013
Improvement on the Decay of Crossing Numbers.
Graphs Comb., 2013
Monochromatic empty triangles in two-colored point sets.
Discret. Appl. Math., 2013
Separating families of convex sets.
Comput. Geom., 2013
2012
Erdős-Szekeres Theorem for Point Sets with Forbidden Subconfigurations.
Discret. Comput. Geom., 2012
Drawing Hamiltonian Cycles with no Large Angles.
Electron. J. Comb., 2012
2011
Graph unique-maximum and conflict-free colorings.
J. Discrete Algorithms, 2011
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011
Monotone Crossing Number.
Proceedings of the Graph Drawing - 19th International Symposium, 2011
2010
Cubic graphs have bounded slope parameter.
J. Graph Algorithms Appl., 2010
Convex Polygons are Cover-Decomposable.
Discret. Comput. Geom., 2010
Towards the Albertson Conjecture.
Electron. J. Comb., 2010
2009
Degenerate Crossing Numbers.
Discret. Comput. Geom., 2009
Decomposition of multiple coverings into many parts.
Comput. Geom., 2009
2008
Long alternating paths in bicolored point sets.
Discret. Math., 2008
Note on the Pair-crossing Number and the Odd-crossing Number.
Discret. Comput. Geom., 2008
Drawing cubic graphs with at most five slopes.
Comput. Geom., 2008
2007
Crossing Stars in Topological Graphs.
SIAM J. Discret. Math., 2007
Multiple Coverings of the Plane with Triangles.
Discret. Comput. Geom., 2007
2006
Planar Crossing Numbers of Graphs Embeddable in Another Surface.
Int. J. Found. Comput. Sci., 2006
Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs.
Discret. Comput. Geom., 2006
How Many Ways Can One Draw A Graph?
Comb., 2006
2005
Topological Graphs with No Large Grids.
Graphs Comb., 2005
Crossing Number of Toroidal Graphs.
Proceedings of the Graph Drawing, 13th International Symposium, 2005
Indecomposable Coverings.
Proceedings of the Discrete Geometry, 2005
2004
Monotone drawings of planar graphs.
J. Graph Theory, 2004
Geometric graphs with no self-intersecting path of length three.
Eur. J. Comb., 2004
Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract].
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004
2003
Unavoidable Configurations in Complete Topological Graphs.
Discret. Comput. Geom., 2003
Monotone paths in line arrangements.
Comput. Geom., 2003
Disjoint Edges in Topological Graphs.
Proceedings of the Combinatorial Geometry and Graph Theory, 2003
2002
Crossing numbers of random graphs.
Random Struct. Algorithms, 2002
Ramsey-Type Results for Unions of Comparability Graphs.
Graphs Comb., 2002
Recognizing String Graphs Is Decidable.
Discret. Comput. Geom., 2002
Relaxing Planarity for Topological Graphs.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002
2001
Point Sets with Many <i>k</i>-Sets.
Discret. Comput. Geom., 2001
Convex Sets in the Plane with Three of Every Four Meeting.
Comb., 2001
Monotone paths in line arrangement.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001
2000
Note on Geometric Graphs.
J. Comb. Theory A, 2000
Which Crossing Number Is It Anyway?
J. Comb. Theory B, 2000
New Bounds on Crossing Numbers.
Discret. Comput. Geom., 2000
Finding Convex Sets in Convex Position.
Comb., 2000
Unavoidable Configurations in Complete Topological Graphs.
Proceedings of the Graph Drawing, 8th International Symposium, 2000
1999
Geometric Graphs with Few Disjoint Edges.
Discret. Comput. Geom., 1999
Ramsey-type results for unions of comparability graphs and convex sets inrestricted position.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999
1998
Note on the Erdos - Szekeres Theorem.
Discret. Comput. Geom., 1998
A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets.
Discret. Comput. Geom., 1998
Ramsey-Type Results for Geometric Graphs, II.
Discret. Comput. Geom., 1998
ote on an art gallery problem.
Comput. Geom., 1998
1997
Ramsey-Type Results for Geometric Graphs, I.
Discret. Comput. Geom., 1997
The Shortest Distance Among Points in General Position.
Comput. Geom., 1997
Graphs Drawn with Few Crossings per Edge.
Comb., 1997
Three-dimensional Grid Drawings of Graphs.
Proceedings of the Graph Drawing, 5th International Symposium, 1997
1996
A ramsey-type bound for rectangles.
J. Graph Theory, 1996
A Ramsey-type problem on right-angled triangles in space.
Discret. Math., 1996
Ramsey-Type Results for Geometric Graphs.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996
1994
Note on a Ramsey-Type Problem in Geometry.
J. Comb. Theory A, 1994
