default search action
Andrew Suk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j31]Andrew Suk, Ji Zeng:
A Positive Fraction Erdős-Szekeres Theorem and Its Applications. Discret. Comput. Geom. 71(1): 308-325 (2024) - [j30]Dhruv Mubayi, Andrew Suk:
Ramsey numbers of cliques versus monotone paths. Eur. J. Comb. 118: 103922 (2024) - [j29]Jacob Fox, János Pach, Andrew Suk:
Quasiplanar graphs, string graphs, and the Erdős-Gallai problem. Eur. J. Comb. 119: 103811 (2024) - [c25]Jacob Fox, János Pach, Andrew Suk:
A Structure Theorem for Pseudo-Segments and Its Applications. SoCG 2024: 59:1-59:14 - [c24]Jacob Fox, János Pach, Andrew Suk:
Enumeration of Intersection Graphs of x-Monotone Curves. GD 2024: 4:1-4:12 - 2023
- [j28]Jacob Fox, János Pach, Andrew Suk:
Sunflowers in Set Systems of Bounded Dimension. Comb. 43(1): 187-202 (2023) - [j27]David Conlon, Jacob Fox, Xiaoyu He
, Dhruv Mubayi, Andrew Suk, Jacques Verstraëte:
Hypergraph Ramsey numbers of cliques versus stars. Random Struct. Algorithms 63(3): 610-623 (2023) - [c23]Alfredo Hubard, Andrew Suk:
Disjoint Faces in Drawings of the Complete Graph and Topological Heilbronn Problems. SoCG 2023: 41:1-41:15 - [c22]Andrew Suk, Ji Zeng:
On Higher Dimensional Point Sets in General Position. SoCG 2023: 59:1-59:13 - [i20]Andrew Suk:
Short edges and noncrossing paths in complete topological graphs. CoRR abs/2307.08165 (2023) - [i19]Jacob Fox, János Pach, Andrew Suk:
A structure theorem for pseudo-segments and its applications. CoRR abs/2312.01028 (2023) - 2022
- [c21]Andrew Suk, Ji Zeng:
A Positive Fraction Erdős-Szekeres Theorem and Its Applications. SoCG 2022: 62:1-62:15 - [c20]Andrew Suk, Ji Zeng:
Unavoidable Patterns in Complete Simple Topological Graphs. GD 2022: 3-15 - [c19]Jacob Fox, János Pach, Andrew Suk:
Quasiplanar Graphs, String Graphs, and the Erdős-Gallai Problem. GD 2022: 219-231 - [i18]Alfredo Hubard, Andrew Suk:
Disjoint faces in simple drawings of the complete graph and topological Heilbronn problems. CoRR abs/2212.01311 (2022) - 2021
- [j26]Jacob Fox, János Pach, Andrew Suk:
Bounded VC-Dimension Implies the Schur-Erdős Conjecture. Comb. 41(6): 803-813 (2021) - [j25]Mozhgan Mirzaei
On Grids in Point-Line Arrangements in the Plane. Discret. Comput. Geom. 65(4): 1232-1243 (2021) - [c18]Jacob Fox, János Pach, Andrew Suk:
Sunflowers in Set Systems of Bounded Dimension. SoCG 2021: 37:1-37:13 - [c17]Jacob Fox, János Pach, Andrew Suk:
On the Number of Edges of Separated Multigraphs. GD 2021: 223-227 - [i17]Jacob Fox, János Pach, Andrew Suk:
On the number of edges of separated multigraphs. CoRR abs/2108.11290 (2021) - [i16]Sophie Leuchtner, Andrew Suk:
Point sets with no four collinear and no large visible island. CoRR abs/2109.00022 (2021) - [i15]Jacob Fox, János Pach, Andrew Suk:
Quasiplanar graphs, string graphs, and the Erdős-Gallai problem. CoRR abs/2112.02378 (2021) - 2020
- [j24]Mozhgan Mirzaei, Andrew Suk:
A positive fraction mutually avoiding sets theorem. Discret. Math. 343(3): 111730 (2020) - [c16]Jacob Fox, János Pach, Andrew Suk:
Bounded VC-Dimension Implies the Schur-Erdős Conjecture. SoCG 2020: 46:1-46:8
2010 – 2019
- 2019
- [j23]Jacob Fox, János Pach, Andrew Suk:
Approximating the rectilinear crossing number. Comput. Geom. 81: 45-53 (2019) - [j22]Jacob Fox, János Pach, Andrew Suk:
Erdős-Hajnal Conjecture for Graphs with Bounded VC-Dimension. Discret. Comput. Geom. 61(4): 809-829 (2019) - [c15]Jacob Fox, János Pach, Andrew Suk:
Semi-Algebraic Colorings of Complete Graphs. SoCG 2019: 36:1-36:12 - [c14]Mozhgan Mirzaei, Andrew Suk:
On Grids in Point-Line Arrangements in the Plane. SoCG 2019: 50:1-50:11 - 2018
- [j21]Jacob Fox, János Pach, Andrew Suk:
More Distinct Distances Under Local Conditions. Comb. 38(2): 501-509 (2018) - [j20]Jacob Fox, János Pach, Andrew Suk:
Ramsey-Turán Numbers for Semi-Algebraic Graphs. Electron. J. Comb. 25(4): 4 (2018) - [j19]Dhruv Mubayi, Andrew Suk:
Constructions in Ramsey theory. J. Lond. Math. Soc. 97(2): 247-257 (2018) - 2017
- [j18]Dhruv Mubayi, Andrew Suk:
Off-diagonal hypergraph Ramsey numbers. J. Comb. Theory B 125: 168-177 (2017) - [c13]Jacob Fox, János Pach, Andrew Suk:
Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension. SoCG 2017: 43:1-43:15 - 2016
- [j17]Andres J. Ruiz-Vargas, Andrew Suk, Csaba D. Tóth:
Disjoint edges in topological graphs and the tangled-thrackle conjecture. Eur. J. Comb. 51: 398-406 (2016) - [j16]Andrew Suk:
Semi-algebraic Ramsey numbers. J. Comb. Theory B 116: 465-483 (2016) - [j15]Jacob Fox, János Pach, Andrew Suk:
A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing. SIAM J. Comput. 45(6): 2199-2223 (2016) - [c12]Jacob Fox, János Pach, Andrew Suk:
Approximating the Rectilinear Crossing Number. GD 2016: 413-426 - [i14]Andrew Suk:
On the Erdos-Szekeres convex polygon problem. CoRR abs/1604.08657 (2016) - [i13]Jacob Fox, János Pach, Andrew Suk:
Approximating the rectilinear crossing number. CoRR abs/1606.03753 (2016) - 2015
- [j14]Andrew Suk, Bartosz Walczak
New bounds on the maximum number of edges in k-quasi-planar graphs. Comput. Geom. 50: 24-33 (2015) - [j13]Larry Guth, Andrew Suk:
The joints problem for matroids. J. Comb. Theory A 131: 71-87 (2015) - [c11]Andrew Suk:
Semi-algebraic Ramsey Numbers. SoCG 2015: 59-73 - [c10]Jacob Fox, János Pach, Andrew Suk:
Density and regularity theorems for semi-algebraic hypergraphs. SODA 2015: 1517-1530 - [i12]Jacob Fox, János Pach, Andrew Suk:
A polynomial regularity lemma for semi-algebraic hypergraphs and its applications in geometry and property testing. CoRR abs/1502.01730 (2015) - [i11]Jacob Fox, János Pach, Andrew Suk:
Semi-algebraic colorings of complete graphs. CoRR abs/1505.07429 (2015) - 2014
- [j12]Andrew Suk:
Coloring intersection graphs of x-monotone curves in the plane. Comb. 34(4): 487-505 (2014) - [j11]Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk:
On grids in topological graphs. Comput. Geom. 47(7): 710-723 (2014) - [j10]Dhruv Mubayi, Andrew Suk:
A Ramsey-type result for geometric l-hypergraphs. Eur. J. Comb. 41: 232-241 (2014) - [c9]Andres J. Ruiz-Vargas, Andrew Suk, Csaba D. Tóth:
Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture. GD 2014: 284-293 - [i10]Andres J. Ruiz-Vargas, Andrew Suk, Csaba D. Tóth:
Disjoint edges in topological graphs and the tangled-thrackle conjecture. CoRR abs/1406.2726 (2014) - [i9]Andrew Suk:
Semi-algebraic Ramsey numbers. CoRR abs/1406.6550 (2014) - 2013
- [j9]Andrew Suk:
Disjoint Edges in Complete Topological Graphs. Discret. Comput. Geom. 49(2): 280-286 (2013) - [j8]Jacob Fox, János Pach, Andrew Suk:
The Number of Edges in k-Quasi-planar Graphs. SIAM J. Discret. Math. 27(1): 550-561 (2013) - [j7]Andrew Suk:
Density Theorems for Intersection Graphs of t-Monotone Curves. SIAM J. Discret. Math. 27(3): 1323-1334 (2013) - [c8]David Conlon, Jacob Fox, János Pach, Benny Sudakov, Andrew Suk:
Ramsey-type results for semi-algebraic relations. SoCG 2013: 309-318 - [c7]Andrew Suk, Bartosz Walczak
New Bounds on the Maximum Number of Edges in k-Quasi-Planar Graphs. GD 2013: 95-106 - [c6]Dhruv Mubayi, Andrew Suk:
A Ramsey-Type Result for Geometric ℓ-Hypergraphs. GD 2013: 364-375 - [i8]Andrew Suk:
A note on order-type homogeneous point sets. CoRR abs/1305.5934 (2013) - [i7]Andrew Suk, Bartosz Walczak:
New bounds on the maximum number of edges in k-quasi-planar graphs. CoRR abs/1309.0395 (2013) - 2012
- [j6]János Pach, Andrew Suk, Miroslav Treml:
Tangencies between families of disjoint regions in the plane. Comput. Geom. 45(3): 131-138 (2012) - [c5]Andrew Suk:
Disjoint edges in complete topological graphs. SCG 2012: 383-386 - [c4]Andrew Suk:
Density Theorems for Intersection Graphs of t-Monotone Curves. GD 2012: 352-363 - [i6]Andrew Suk:
Coloring intersection graphs of x-monotone curves in the plane. CoRR abs/1201.0887 (2012) - [i5]Andrew Suk:
Density theorems for intersection graphs of t-monotone curves. CoRR abs/1206.2955 (2012) - 2011
- [j5]Radoslav Fulek
On disjoint crossing families in geometric graphs. Electron. Notes Discret. Math. 38: 367-375 (2011) - [j4]Alfredo Hubard, Luis Montejano, Emiliano Mora, Andrew Suk:
Order Types of Convex Bodies. Order 28(1): 121-130 (2011) - [c3]Andrew Suk:
k-Quasi-Planar Graphs. GD 2011: 266-277 - [i4]Andrew Suk:
$k$-quasi planar graphs. CoRR abs/1106.0958 (2011) - [i3]Andrew Suk:
Disjoint edges in complete topological graphs. CoRR abs/1110.5684 (2011) - [i2]Jacob Fox, János Pach, Andrew Suk:
The number of edges in k-quasi-planar graphs. CoRR abs/1112.2361 (2011) - 2010
- [j3]Andrew Suk:
On Order Types of Systems of Segments in the Plane. Order 27(1): 63-68 (2010) - [c2]János Pach, Andrew Suk, Miroslav Treml:
Tangencies between families of disjoint regions in the plane. SCG 2010: 423-428 - [i1]Radoslav Fulek, Andrew Suk:
On disjoint crossing families in geometric graphs. CoRR abs/1004.2850 (2010)
2000 – 2009
- 2009
- [j2]Andrei Asinowski
Edge intersection graphs of systems of paths on a grid with a bounded number of bends. Discret. Appl. Math. 157(14): 3174-3180 (2009) - [c1]Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk:
On grids in topological graphs. SCG 2009: 403-412 - 2008
- [j1]Andrew Suk:
A Note on Kk, k-Cross Free Families. Electron. J. Comb. 15(1) (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: