Seth Chaiken
Impact in
-
- Advanced Combinatorial Mathematics
- Geometry and Topology top 5%
- Graph theory and applications
Papers in
-
- Advanced Graph Theory Research 6
- Matrix Theory and Algorithms 2
-
- Advanced Combinatorial Mathematics 7
- Co-authors
- Daniel J. Kleitman (3 shared papers)James B. Shearer (1 shared paper)Michael Saks (1 shared paper)A. K. Dewdney (1 shared paper)Peter J. Slater (1 shared paper)Thomas Zasĺavsky (6 shared papers)Neil V. Murray (1 shared paper)S. S. Ravi (1 shared paper)
- Journals
- Annals of the New York Academy of Sciences (2 papers)Algorithmica (1 paper)Annals of Combinatorics (1 paper)Journal of Combinatorial Theory Series B (1 paper)The Electronic Journal of Combinatorics (1 paper)
- Partner nations
- United States
In The Last Decade
Seth Chaiken
18 papers receiving 326 citations
Peers
Comparison fields: 5 of 66
- Discrete Mathematics and Combinatorics 78
- Geometry and Topology 130
- Computer Graphics and Computer-Aided Design 37
- Computational Theory and Mathematics 162
- Statistical and Nonlinear Physics 49
Countries citing papers authored by Seth Chaiken
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
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-authors
The 10 scholars most cited alongside Seth Chaiken, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 21 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1982 | 172 | |
| 2 | 1978 | 87 | |
| 3 | 1981 | 48 | |
| 4 | 1983 | 16 | |
| 5 | 1989 | 6 | |
| 6 | 1994 | 4 | |
| 7 | 2014 | 3 | |
| 8 | 2004 | 3 | |
| 9 | 2014 | 3 | |
| 10 | 1989 | 3 | |
| 11 | A $q$-Queens Problem | 2013 | 2 |
| 12 | 2010 | 2 | |
| 13 | 2004 | 2 | |
| 14 | 1990 | 1 | |
| 15 | 1983 | 1 | |
| 16 | Source Code Instrumentation and its Perturbation Analysis in Pentium II | 2000 | 1 |
| 17 | 1979 | 1 | |
| 18 | 2005 | 1 | |
| 19 | 1987 | 1 | |
| 20 | A q -queens problem III. Nonattacking partial queens. | 2019 | 0 |
About Seth Chaiken
Seth Chaiken is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design, Computer Networks and Communications and Electrical and Electronic Engineering, having authored 21 papers that have together received 357 indexed citations. Recurring topics across this work include Advanced Combinatorial Mathematics (7 papers), Computational Geometry and Mesh Generation (6 papers), Advanced Graph Theory Research (6 papers), graph theory and CDMA systems (4 papers), Graph theory and applications (3 papers), Data Management and Algorithms (3 papers), Parallel Computing and Optimization Techniques (3 papers) and Matrix Theory and Algorithms (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (78 citations), Geometry and Topology (130 citations), Computer Graphics and Computer-Aided Design (37 citations), Computational Theory and Mathematics (162 citations) and Statistical and Nonlinear Physics (49 citations). Seth Chaiken has collaborated with scholars based in United States. Frequent co-authors include Daniel J. Kleitman, James B. Shearer, Michael Saks, A. K. Dewdney, Peter J. Slater, Thomas Zasĺavsky, Neil V. Murray, S. S. Ravi, Erik Rosenthal and Dan E. Willard. Their work appears in journals such as Annals of the New York Academy of Sciences, Algorithmica, Annals of Combinatorics, Journal of Combinatorial Theory Series B and The Electronic Journal of Combinatorics.
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.