Aaron Williams
Impact in
-
- Advanced Combinatorial Mathematics
- Finite Group Theory Research
-
- semigroups and automata theory
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Papers in
-
- Advanced Combinatorial Mathematics 48
- Finite Group Theory Research 3
-
- semigroups and automata theory 16
- Complexity and Algorithms in Graphs 13
- Advanced Graph Theory Research 10
- Co-authors
- Joe Sawada (28 shared papers)Frank Ruskey (12 shared papers)Brett Stevens (5 shared papers)Alexander E. Holroyd (2 shared papers)Torsten Mütze (3 shared papers)Jack E. Graver (1 shared paper)Debajyoti Mondal (2 shared papers)Stéphane Durocher (2 shared papers)
- Journals
- Discrete Mathematics (4 papers)Theoretical Computer Science (3 papers)Algorithmica (3 papers)Lecture notes in computer science (20 papers)Theory of Computing Systems (2 papers)
- Partner nations
- CanadaUnited StatesUnited Kingdom
In The Last Decade
Aaron Williams
58 papers receiving 586 citations
Peers
Comparison fields: 5 of 36
- Discrete Mathematics and Combinatorics 393
- Computational Theory and Mathematics 241
- Artificial Intelligence 204
- Computer Graphics and Computer-Aided Design 8
- Genetics 33
Countries citing papers authored by Aaron Williams
This map shows the geographic impact of Aaron Williams'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 Aaron Williams with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Aaron Williams more than expected).
Fields of papers citing papers by Aaron Williams
This network shows the impact of papers produced by Aaron Williams. 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 Aaron Williams. The network helps show where Aaron Williams may publish in the future.
Co-authors
The 22 scholars most cited alongside Aaron Williams, 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 63 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2008 | 43 | |
| 2 | 2011 | 33 | |
| 3 | 2011 | 31 | |
| 4 | 2010 | 28 | |
| 5 | 2012 | 28 | |
| 6 | 2015 | 27 | |
| 7 | 2013 | 26 | |
| 8 | 2012 | 23 | |
| 9 | 2009 | 20 | |
| 10 | 2019 | 20 | |
| 11 | 2018 | 19 | |
| 12 | 2009 | 17 | |
| 13 | 2012 | 15 | |
| 14 | 2013 | 15 | |
| 15 | 2018 | 15 | |
| 16 | 2019 | 15 | |
| 17 | 2022 | 13 | |
| 18 | 2013 | 12 | |
| 19 | 2016 | 11 | |
| 20 | Generating balanced parentheses and binary trees by prefix shifts | 2008 | 10 |
About Aaron Williams
Aaron Williams is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Artificial Intelligence, Computer Graphics and Computer-Aided Design and Genetics, having authored 63 papers that have together received 616 indexed citations. Recurring topics across this work include Advanced Combinatorial Mathematics (48 papers), semigroups and automata theory (16 papers), Complexity and Algorithms in Graphs (13 papers), Algorithms and Data Compression (13 papers), Advanced Graph Theory Research (10 papers), Genome Rearrangement Algorithms (3 papers), Finite Group Theory Research (3 papers) and Computational Geometry and Mesh Generation (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (393 citations), Computational Theory and Mathematics (241 citations), Artificial Intelligence (204 citations), Computer Graphics and Computer-Aided Design (8 citations) and Genetics (33 citations). Aaron Williams has collaborated with scholars based in Canada, United States and United Kingdom. Frequent co-authors include Joe Sawada, Frank Ruskey, Brett Stevens, Alexander E. Holroyd, Torsten Mütze, Jack E. Graver, Debajyoti Mondal, Stéphane Durocher, Erik D. Demaine and Giovanni Viglietta. Their work appears in journals such as Discrete Mathematics, Theoretical Computer Science, Algorithmica, Lecture notes in computer science and Theory of Computing Systems.
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.