Andrew Suk

463 total citations
34 papers, 130 citations indexed

About

Andrew Suk is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Andrew Suk has authored 34 papers receiving a total of 130 indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Computational Theory and Mathematics, 19 papers in Computer Graphics and Computer-Aided Design and 17 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Andrew Suk's work include Advanced Graph Theory Research (24 papers), Computational Geometry and Mesh Generation (19 papers) and Limits and Structures in Graph Theory (17 papers). Andrew Suk is often cited by papers focused on Advanced Graph Theory Research (24 papers), Computational Geometry and Mesh Generation (19 papers) and Limits and Structures in Graph Theory (17 papers). Andrew Suk collaborates with scholars based in United States, Switzerland and Hungary. Andrew Suk's co-authors include János Pach, Jacob Fox, Benny Sudakov, David Conlon, Dhruv Mubayi, Bartosz Walczak, Csaba D. Tóth, Luis Montejano, Ji Zeng and Eyal Ackerman and has published in prestigious journals such as Transactions of the American Mathematical Society, Proceedings of the American Mathematical Society and Discrete Applied Mathematics.

In The Last Decade

Andrew Suk

28 papers receiving 118 citations

Peers

Andrew Suk

CTM

CGCD

DMC

CVPR

GT

Radoslav Fulek Switzerland

Ján Katrenič Slovakia

Eelko Penninkx Netherlands

Benjamin Lévêque France

A. N. Glebov Russia

Bernardo M. Ábrego United States

Joseph Miller Thomas United States

Steven Chaplick Germany

Marián Klešč Slovakia

Paweł Rzążewski Poland

Radoslav Fulek Switzerland

Andrew Suk

57 ×0.6

CTM

79 ×1.0

CGCD

10 ×0.2

DMC

42 ×1.3

CVPR

10 ×0.4

GT

Citations per year, relative to Andrew Suk Andrew Suk (= 1×) peers Radoslav Fulek

Countries citing papers authored by Andrew Suk

Since Specialization

Citations

This map shows the geographic impact of Andrew Suk's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Andrew Suk with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andrew Suk more than expected).

Fields of papers citing papers by Andrew Suk

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Andrew Suk. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Andrew Suk. The network helps show where Andrew Suk may publish in the future.

Co-authorship network of co-authors of Andrew Suk

This figure shows the co-authorship network connecting the top 25 collaborators of Andrew Suk. A scholar is included among the top collaborators of Andrew Suk based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Andrew Suk. Andrew Suk is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Conlon, David, Jacob Fox, Xiaoyu He, et al.. (2025). On Off-Diagonal Hypergraph Ramsey Numbers. International Mathematics Research Notices. 2025(11).

2.

Conlon, David, et al.. (2024). Set-Coloring Ramsey Numbers via Codes. Studia Scientiarum Mathematicarum Hungarica. 61(1). 1–15.

3.

Suk, Andrew. (2024). On Short Edges in Complete Topological Graphs. Discrete & Computational Geometry. 75(1). 193–204. 1 indexed citations

4.

Mubayi, Dhruv & Andrew Suk. (2024). Ramsey numbers of cliques versus monotone paths. European Journal of Combinatorics. 118. 103922–103922.

5.

Fox, Jacob, János Pach, & Andrew Suk. (2023). Sunflowers in Set Systems of Bounded Dimension. COMBINATORICA. 43(1). 187–202. 2 indexed citations

6.

Mubayi, Dhruv, et al.. (2022). A note on the Erdős-Hajnal hypergraph Ramsey problem. Proceedings of the American Mathematical Society. 150(9). 3675–3685. 1 indexed citations

7.

Fox, Jacob, János Pach, & Andrew Suk. (2020). The Schur-Erdős problem for semi-algebraic colorings. Israel Journal of Mathematics. 239(1). 39–57.

8.

Fox, Jacob, János Pach, & Andrew Suk. (2019). Approximating the rectilinear crossing number. Computational Geometry. 81. 45–53. 1 indexed citations

9.

Mubayi, Dhruv & Andrew Suk. (2017). A survey of quantitative bounds for hypergraph Ramsey problems. arXiv (Cornell University). 2 indexed citations

10.

Mubayi, Dhruv & Andrew Suk. (2017). Off-diagonal hypergraph Ramsey numbers. Journal of Combinatorial Theory Series B. 125. 168–177. 4 indexed citations

11.

Suk, Andrew, et al.. (2015). Disjoint edges in topological graphs and the tangled-thrackle conjecture. European Journal of Combinatorics. 51. 398–406. 2 indexed citations

12.

Suk, Andrew & Bartosz Walczak. (2015). New bounds on the maximum number of edges in k-quasi-planar graphs. Computational Geometry. 50. 24–33. 7 indexed citations

13.

Ackerman, Eyal, Jacob Fox, János Pach, & Andrew Suk. (2014). On grids in topological graphs. Computational Geometry. 47(7). 710–723. 3 indexed citations

14.

Conlon, David, Jacob Fox, János Pach, Benny Sudakov, & Andrew Suk. (2013). Ramsey-type results for semi-algebraic relations. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 3. 309–318. 6 indexed citations

15.

Fox, Jacob, János Pach, & Andrew Suk. (2013). The Number of Edges in $k$-Quasi-planar Graphs. SIAM Journal on Discrete Mathematics. 27(1). 550–561. 23 indexed citations

16.

Suk, Andrew. (2012). Disjoint Edges in Complete Topological Graphs. Discrete & Computational Geometry. 49(2). 280–286. 9 indexed citations

17.

Pach, János, et al.. (2011). Tangencies between families of disjoint regions in the plane. Computational Geometry. 45(3). 131–138. 4 indexed citations

18.

Suk, Andrew, et al.. (2009). Edge intersection graphs of systems of paths on a grid with a bounded number of bends. Discrete Applied Mathematics. 157(14). 3174–3180. 19 indexed citations

19.

Ackerman, Eyal, Jacob Fox, János Pach, & Andrew Suk. (2009). On grids in topological graphs. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 403–412. 2 indexed citations

20.

Suk, Andrew, et al.. (2008). Edge intersection graphs of systems of grid paths with bounded number of bends. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact