Seth Chaiken

750 total citations
21 papers, 352 citations indexed

About

Seth Chaiken is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, Seth Chaiken has authored 21 papers receiving a total of 352 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Computational Theory and Mathematics, 7 papers in Discrete Mathematics and Combinatorics and 6 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in Seth Chaiken's work include Advanced Combinatorial Mathematics (7 papers), Computational Geometry and Mesh Generation (6 papers) and Advanced Graph Theory Research (6 papers). Seth Chaiken is often cited by papers focused on Advanced Combinatorial Mathematics (7 papers), Computational Geometry and Mesh Generation (6 papers) and Advanced Graph Theory Research (6 papers). Seth Chaiken collaborates with scholars based in United States. Seth Chaiken's co-authors include Daniel J. Kleitman, James B. Shearer, Michael Saks, A. K. Dewdney, Peter J. Slater, Thomas Zasĺavsky, Erik Rosenthal, Neil V. Murray, S. S. Ravi and Dan E. Willard and has published in prestigious journals such as Annals of the New York Academy of Sciences, Journal of Combinatorial Theory Series B and Algorithmica.

In The Last Decade

Seth Chaiken

18 papers receiving 319 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Seth Chaiken United States 5 163 128 76 49 49 21 352
Martin Loebl Czechia 11 222 1.4× 79 0.6× 119 1.6× 31 0.6× 36 0.7× 58 414
Caterina De Simone Italy 10 231 1.4× 29 0.2× 40 0.5× 47 1.0× 69 1.4× 26 390
Martin Henk Germany 16 138 0.8× 186 1.5× 122 1.6× 15 0.3× 53 1.1× 69 708
J. Kahn United States 7 312 1.9× 101 0.8× 138 1.8× 29 0.6× 46 0.9× 17 589
Neil J. Calkin United States 11 240 1.5× 121 0.9× 177 2.3× 31 0.6× 56 1.1× 48 504
Diane Maclagan United States 11 326 2.0× 291 2.3× 82 1.1× 42 0.9× 21 0.4× 23 515
Catherine H. Yan United States 13 166 1.0× 206 1.6× 272 3.6× 89 1.8× 45 0.9× 56 612
Suk-Geun Hwang South Korea 8 125 0.8× 75 0.6× 49 0.6× 36 0.7× 89 1.8× 48 306
Prasoon Tiwari United States 12 279 1.7× 74 0.6× 23 0.3× 64 1.3× 56 1.1× 25 597
Dan Romik United States 11 85 0.5× 73 0.6× 190 2.5× 32 0.7× 29 0.6× 44 450

Countries citing papers authored by Seth Chaiken

Since Specialization
Citations

This map shows the geographic impact of Seth Chaiken'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 Seth Chaiken with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Seth Chaiken more than expected).

Fields of papers citing papers by Seth Chaiken

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Seth Chaiken. 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 Seth Chaiken. The network helps show where Seth Chaiken may publish in the future.

Co-authorship network of co-authors of Seth Chaiken

This figure shows the co-authorship network connecting the top 25 collaborators of Seth Chaiken. A scholar is included among the top collaborators of Seth Chaiken 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 Seth Chaiken. Seth Chaiken is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Chaiken, Seth, et al.. (2019). A q -queens problem III. Nonattacking partial queens.. Australas. J Comb.. 74. 305–331.
2.
Chaiken, Seth, et al.. (2019). A q-queens problem. VI. The bishops' period. Ars Mathematica Contemporanea. 16(2). 549–561.
3.
Chaiken, Seth, et al.. (2014). A $$q$$ q -Queens Problem. II. The square board. Journal of Algebraic Combinatorics. 41(3). 619–642. 3 indexed citations
4.
Chaiken, Seth, et al.. (2013). A $q$-Queens Problem. arXiv (Cornell University). 2 indexed citations
5.
Chaiken, Seth, et al.. (2010). Nonattacking Queens in a Rectangular Strip. Annals of Combinatorics. 14(4). 419–441. 2 indexed citations
6.
Chaiken, Seth, et al.. (2005). Towards a framework for source code instrumentation measurement validation. 123–130. 1 indexed citations
7.
8.
Chaiken, Seth, et al.. (2004). Validated observation and reporting of microscopic performance using Pentium II counter facilities. ACM SIGSOFT Software Engineering Notes. 29(1). 161–165. 3 indexed citations
9.
Chaiken, Seth, et al.. (2000). Source Code Instrumentation and its Perturbation Analysis in Pentium II. 1 indexed citations
10.
Chaiken, Seth, et al.. (1994). Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors. Algorithmica. 12(6). 421–435. 4 indexed citations
11.
Chaiken, Seth, et al.. (1990). On the angle restricted nearest neighbor problem. Information Processing Letters. 34(2). 71–76. 1 indexed citations
12.
Chaiken, Seth. (1989). The Tutte polynomial of a ported matroid. Journal of Combinatorial Theory Series B. 46(1). 96–117. 6 indexed citations
13.
Chaiken, Seth, Neil V. Murray, & Erik Rosenthal. (1989). An Application of P4‐Free Graphs in Theorem‐Proving. Annals of the New York Academy of Sciences. 555(1). 106–121. 3 indexed citations
14.
Chaiken, Seth. (1987). Extremal Length and Width of Blocking Polyhedra, Kirchhoff Spaces and Multiport Networks. SIAM Journal on Algebraic and Discrete Methods. 8(4). 635–645. 1 indexed citations
15.
Chaiken, Seth. (1983). A Matroid Abstraction of the Bott–Duffin Constrained Inverse. SIAM Journal on Algebraic and Discrete Methods. 4(4). 467–475. 1 indexed citations
16.
Chaiken, Seth, A. K. Dewdney, & Peter J. Slater. (1983). An Optimal Diagonal Tree Code. SIAM Journal on Algebraic and Discrete Methods. 4(1). 42–49. 16 indexed citations
17.
Chaiken, Seth. (1982). A Combinatorial Proof of the All Minors Matrix Tree Theorem. SIAM Journal on Algebraic and Discrete Methods. 3(3). 319–329. 171 indexed citations
18.
Chaiken, Seth, Daniel J. Kleitman, Michael Saks, & James B. Shearer. (1981). Covering Regions by Rectangles. SIAM Journal on Algebraic and Discrete Methods. 2(4). 394–410. 48 indexed citations
19.
Chaiken, Seth, et al.. (1979). POSSIBLE DEGREES OF STRONGLY 2‐CONNECTED GRAPHS. Annals of the New York Academy of Sciences. 319(1). 119–129. 1 indexed citations
20.
Chaiken, Seth & Daniel J. Kleitman. (1978). Matrix Tree Theorems. Journal of Combinatorial Theory Series A. 24(3). 377–381. 83 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

Rankless by CCL
2026