Ákos Seress

2.3k total citations
85 papers, 1.2k citations indexed

About

Ákos Seress is a scholar working on Discrete Mathematics and Combinatorics, Artificial Intelligence and Electrical and Electronic Engineering. According to data from OpenAlex, Ákos Seress has authored 85 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 59 papers in Discrete Mathematics and Combinatorics, 43 papers in Artificial Intelligence and 43 papers in Electrical and Electronic Engineering. Recurrent topics in Ákos Seress's work include Finite Group Theory Research (50 papers), graph theory and CDMA systems (43 papers) and Coding theory and cryptography (39 papers). Ákos Seress is often cited by papers focused on Finite Group Theory Research (50 papers), graph theory and CDMA systems (43 papers) and Coding theory and cryptography (39 papers). Ákos Seress collaborates with scholars based in United States, Australia and Hungary. Ákos Seress's co-authors include László Babai, William M. Kantor, Eugene M. Luks, Robert Beals, Gene Cooperman, Cheryl E. Praeger, Zoltán Füredi, Cai Heng Li, Larry Finkelstein and H. A. Helfgott and has published in prestigious journals such as Annals of Mathematics, Transactions of the American Mathematical Society and SIAM Journal on Computing.

In The Last Decade

Ákos Seress

83 papers receiving 1.1k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Ákos Seress United States 20 913 650 465 361 358 85 1.2k
Mark E. Watkins United States 20 658 0.7× 245 0.4× 414 0.9× 669 1.9× 486 1.4× 70 1.3k
Jozef Širáň Slovakia 21 885 1.0× 237 0.4× 635 1.4× 704 2.0× 532 1.5× 142 1.5k
A. Ballester‐Bolinches Spain 21 1.7k 1.9× 1.3k 2.0× 1.1k 2.3× 144 0.4× 387 1.1× 232 1.8k
James Wiegold United Kingdom 18 649 0.7× 323 0.5× 258 0.6× 183 0.5× 322 0.9× 105 962
Thomas W. Tucker United States 14 482 0.5× 130 0.2× 205 0.4× 290 0.8× 359 1.0× 64 793
Aiden A. Bruen Canada 19 499 0.5× 493 0.8× 542 1.2× 163 0.5× 178 0.5× 65 953
Brian Mortimer Canada 6 1.1k 1.2× 778 1.2× 686 1.5× 331 0.9× 405 1.1× 11 1.4k
J. A. Thas Belgium 25 2.0k 2.2× 1.7k 2.6× 1.6k 3.3× 179 0.5× 392 1.1× 177 2.4k
Tamás Szőnyi Hungary 16 635 0.7× 525 0.8× 447 1.0× 193 0.5× 191 0.5× 75 945
Daqing Wan United States 19 299 0.3× 768 1.2× 346 0.7× 271 0.8× 481 1.3× 102 1.1k

Countries citing papers authored by Ákos Seress

Since Specialization
Citations

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

Fields of papers citing papers by Ákos Seress

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Ákos Seress

This figure shows the co-authorship network connecting the top 25 collaborators of Ákos Seress. A scholar is included among the top collaborators of Ákos Seress 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 Ákos Seress. Ákos Seress 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.
Li, Cai Heng, et al.. (2014). s-Arc-transitive graphs and normal subgroups. Journal of Algebra. 421. 331–348. 11 indexed citations
2.
Burness, Timothy C., Cheryl E. Praeger, & Ákos Seress. (2011). Extremely primitive classical groups. Journal of Pure and Applied Algebra. 216(7). 1580–1610. 6 indexed citations
3.
Balogh, János, et al.. (2008). On the bandwidth of 3-dimensional Hamming graphs. Theoretical Computer Science. 407(1-3). 488–495. 5 indexed citations
4.
Li, Cai Heng & Ákos Seress. (2006). Symmetrical path-cycle covers of a graph and polygonal graphs. Journal of Combinatorial Theory Series A. 114(1). 35–51. 4 indexed citations
5.
Babai, László, Robert Beals, & Ákos Seress. (2004). On the diameter of the symmetric group: polynomial bounds. Symposium on Discrete Algorithms. 1108–1112. 10 indexed citations
6.
Kantor, William M. & Ákos Seress. (2002). Prime Power Graphs for Groups of Lie Type. Journal of Algebra. 247(2). 370–434. 38 indexed citations
7.
Hulpke, Alexander & Ákos Seress. (2001). Short Presentations for Three-Dimensional Unitary Groups. Journal of Algebra. 245(2). 719–729. 14 indexed citations
8.
Seress, Ákos. (1998). On vertex-transitive, non-Cayley graphs of order pqr. Discrete Mathematics. 182(1-3). 279–292. 19 indexed citations
9.
Babai, László, Gene Cooperman, Leonard H. Finkelstein, Eugene M. Luks, & Ákos Seress. (1995). Fast Monte Carlo Algorithms for Permutation Groups. Journal of Computer and System Sciences. 50(2). 296–308. 27 indexed citations
10.
Seress, Ákos & Tibor Szabó. (1995). Dense Graphs with Cycle Neighborhoods. Journal of Combinatorial Theory Series B. 63(2). 281–293. 4 indexed citations
11.
Füredi, Zoltán, Felix Lazebnik, Ákos Seress, V. A. Ustimenko, & Andrew J. Woldar. (1995). Graphs of Prescribed Girth and Bi-Degree. Journal of Combinatorial Theory Series B. 64(2). 228–239. 25 indexed citations
12.
Lovász, László & Ákos Seress. (1993). The Cocycle Lattice of Binary Matroids. European Journal of Combinatorics. 14(3). 241–250. 8 indexed citations
13.
Katona, Gyula O. H. & Ákos Seress. (1993). Greedy Construction of Nearly Regular Graphs. European Journal of Combinatorics. 14(3). 213–229. 6 indexed citations
14.
Babai, László & Ákos Seress. (1992). On the diameter of permutation groups. European Journal of Combinatorics. 13(4). 231–243. 49 indexed citations
15.
Friedman, Harvey M. & Ákos Seress. (1989). Decidability in elementary analysis, I. Advances in Mathematics. 76(1). 94–115. 2 indexed citations
16.
Babai, László & Ákos Seress. (1988). On the diameter of cayley graphs of the symmetric group. Journal of Combinatorial Theory Series A. 49(1). 175–179. 32 indexed citations
17.
Newman, Mark, et al.. (1988). The addition game: an abstraction of a communication problem. Discrete Mathematics. 68(2-3). 265–272. 2 indexed citations
18.
Babai, László & Ákos Seress. (1987). On the degree of transitivity of permutation groups: A short proof. Journal of Combinatorial Theory Series A. 45(2). 310–315. 15 indexed citations
19.
Erdös, P., Zoltán Füredi, A. Hajnal, et al.. (1986). Coloring graphs with locally few colors. Discrete Mathematics. 59(1-2). 21–34. 37 indexed citations
20.
Seress, Ákos. (1983). Gossiping old ladies. Discrete Mathematics. 46(1). 75–81. 6 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