Andrew Suk

According to our database1, Andrew Suk authored at least 52 papers between 2008 and 2026.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2026
Big line or big convex polygon.
Comput. Geom., 2026

2025
A structure theorem for pseudosegments and its applications.
J. Comb. Theory B, 2025

A Note on the No-(d+2)-On-a-Sphere Problem.
Proceedings of the 41st International Symposium on Computational Geometry, 2025

Immersions and Albertson's Conjecture.
Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024
On Cliques in Three-Dimensional Dense Point-Line Arrangements.
SIAM J. Discret. Math., 2024

Ramsey numbers of cliques versus monotone paths.
Eur. J. Comb., 2024

Enumeration of Intersection Graphs of x-Monotone Curves.
Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

A Structure Theorem for Pseudo-Segments and Its Applications.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
Hypergraph Ramsey numbers of cliques versus stars.
Random Struct. Algorithms, October, 2023

Short edges and noncrossing paths in complete topological graphs.
CoRR, 2023

On Higher Dimensional Point Sets in General Position.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

Disjoint Faces in Drawings of the Complete Graph and Topological Heilbronn Problems.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022
Disjoint faces in simple drawings of the complete graph and topological Heilbronn problems.
CoRR, 2022

Unavoidable Patterns in Complete Simple Topological Graphs.
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

Quasiplanar Graphs, String Graphs, and the Erdős-Gallai Problem.
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

A Positive Fraction Erdős-Szekeres Theorem and Its Applications.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
Point sets with no four collinear and no large visible island.
CoRR, 2021

On the Number of Edges of Separated Multigraphs.
Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

Sunflowers in Set Systems of Bounded Dimension.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
A positive fraction mutually avoiding sets theorem.
Discret. Math., 2020

Bounded VC-Dimension Implies the Schur-Erdős Conjecture.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019
On Grids in Point-Line Arrangements in the Plane.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

Semi-Algebraic Colorings of Complete Graphs.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Constructions in Ramsey theory.
J. Lond. Math. Soc., 2018

Ramsey-Turán Numbers for Semi-Algebraic Graphs.
Electron. J. Comb., 2018

More Distinct Distances Under Local Conditions.
Comb., 2018

2017
Off-diagonal hypergraph Ramsey numbers.
J. Comb. Theory B, 2017

Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing.
SIAM J. Comput., 2016

On the Erdos-Szekeres convex polygon problem.
CoRR, 2016

Approximating the Rectilinear Crossing Number.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

2015
The joints problem for matroids.
J. Comb. Theory A, 2015

A polynomial regularity lemma for semi-algebraic hypergraphs and its applications in geometry and property testing.
CoRR, 2015

Density and regularity theorems for semi-algebraic hypergraphs.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Semi-algebraic Ramsey Numbers.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
Coloring intersection graphs of x-monotone curves in the plane.
Comb., 2014

Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture.
Proceedings of the Graph Drawing - 22nd International Symposium, 2014

2013
The Number of Edges in k-Quasi-planar Graphs.
SIAM J. Discret. Math., 2013

A note on order-type homogeneous point sets
CoRR, 2013

New Bounds on the Maximum Number of Edges in k-Quasi-Planar Graphs.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

A Ramsey-Type Result for Geometric ℓ-Hypergraphs.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

Ramsey-type results for semi-algebraic relations.
Proceedings of the Symposium on Computational Geometry 2013, 2013

2012
Density Theorems for Intersection Graphs of t-Monotone Curves.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Disjoint edges in complete topological graphs.
Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011
Order Types of Convex Bodies.
Order, 2011

On disjoint crossing families in geometric graphs.
Electron. Notes Discret. Math., 2011

k-Quasi-Planar Graphs.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010
On Order Types of Systems of Segments in the Plane.
Order, 2010

Tangencies between families of disjoint regions in the plane.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009
Edge intersection graphs of systems of paths on a grid with a bounded number of bends.
Discret. Appl. Math., 2009

On grids in topological graphs.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008
A Note on K<sub>k, k</sub>-Cross Free Families.
Electron. J. Comb., 2008


  Loading...