Ákos Seress

Nishali Mehta, Ákos Seress: Bounded Degree, Triangle Avoidance Graph Games. Graphs and Combinatorics 29(3): 637-660 (2013)

Ákos Seress: Construction of 2-closed M-representations. ISSAC 2012: 311-318

Ákos Seress, Tsai-Lien Wong, Xuding Zhu: Distinguishing labeling of the actions of almost simple groups. Combinatorica 31(4): 489-506 (2011)

Nishali Mehta, Ákos Seress: Connected, Bounded Degree, Triangle Avoidance Games. Electr. J. Comb. 18(1) (2011)

Ákos Seress, Mario Szegedy: Combinatorics, Groups, Algorithms, and Complexity: Conference in honor of Laci Babai's 60th birthday. Discrete Mathematics & Theoretical Computer Science 13(4): 1-4 (2011)

Nurullah Ankaralioglu, Ákos Seress: Computing tensor decompositions of finite matrix groups. Discrete Mathematics & Theoretical Computer Science 13(4): 5-14 (2011)

Ákos Seress, Eric Swartz: A note on the girth-doubling construction for polygonal graphs. Journal of Graph Theory 68(3): 246-254 (2011)

Cai Heng Li, Liang Niu, Ákos Seress, Ronald Solomon: The vertex primitive and vertex bi-primitive s-arc regular graphs. J. Comb. Theory, Ser. B 100(4): 359-366 (2010)

László Babai, Robert Beals, Ákos Seress: Polynomial-time theory of matrix groups. STOC 2009: 55-64

J. Balogh, Sergei L. Bezrukov, L. H. Harper, Ákos Seress: On the bandwidth of 3-dimensional Hamming graphs. Theor. Comput. Sci. 407(1-3): 488-495 (2008)

Cai Heng Li, Ákos Seress: Symmetrical path-cycle covers of a graph and polygonal graphs. J. Comb. Theory, Ser. A 114(1): 35-51 (2007)

Michael Giudici, Cai Heng Li, Cheryl E. Praeger, Ákos Seress, Vladimir Ivanovich Trofimov: On limit graphs of finite vertex-primitive graphs. J. Comb. Theory, Ser. A 114(1): 110-134 (2007)

Max Neunhöffer, Ákos Seress: A data structure for a uniform approach to computations with finite groups. ISSAC 2006: 254-261

Ákos Seress: Square-Free Non-Cayley Numbers. On Vertex-Transitive Non-Cayley Graphs of Square-Free Order. Des. Codes Cryptography 34(2-3): 265-281 (2005)

Peter A. Brooksbank, Hongxun Qin, Edmund Robertson, Ákos Seress: On Dowling geometries of infinite groups. J. Comb. Theory, Ser. A 108(1): 155-158 (2004)

László Babai, Robert Beals, Ákos Seress: On the diameter of the symmetric group: polynomial bounds. SODA 2004: 1108-1112

Robert Beals, Charles R. Leedham-Green, Alice C. Niemeyer, Cheryl E. Praeger, Ákos Seress: Permutations With Restricted Cycle Structure And An Algorithmic Application. Combinatorics, Probability & Computing 11(5): 447-464 (2002)

Aart Blokhuis, Ákos Seress: The Number of Directions Determined by Points in the Three-Dimensional Euclidean Space. Discrete & Computational Geometry 28(4): 491-494 (2002)

Ákos Seress: All Lambda-Designs With are Type-1. Des. Codes Cryptography 22(1): 5-17 (2001)

Péter L. Erdös, Ákos Seress, László A. Székely: Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets. Combinatorica 20(1): 27-45 (2000)

Ákos Seress: Large Families of Cospectral Graphs. Des. Codes Cryptography 21(1/3): 205-208 (2000)

Ákos Seress, Tibor Szabó: On Erdős's Eulerian Trail Game. Graphs and Combinatorics 15(2): 233-237 (1999)

Ákos Seress: On vertex-transitive, non-Cayley graphs of order pqr. Discrete Mathematics 182(1-3): 279-292 (1998)

László Babai, Eugene M. Luks, Ákos Seress: Fast Management of Permutation Groups I. SIAM J. Comput. 26(5): 1310-1342 (1997)

László Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, Ákos Seress: Fast Monte Carlo Algorithms for Permutation Groups. J. Comput. Syst. Sci. 50(2): 296-308 (1995)

Ákos Seress, Tibor Szabó: Dense Graphs with Cycle Neighborhoods. J. Comb. Theory, Ser. B 63(2): 281-293 (1995)

Zoltán Füredi, Felix Lazebnik, Ákos Seress, Vasiliy A. Ustimenko, Andrew J. Woldar: Graphs of Prescribed Girth and Bi-Degree. J. Comb. Theory, Ser. B 64(2): 228-239 (1995)

Péter L. Erdös, Ákos Seress, László A. Székely: On Intersecting Chains in Boolean Algebras. Combinatorics, Probability & Computing 3: 57-62 (1994)

Martin Schönert, Ákos Seress: Finding Blocks of Imprimitivity in Small-Base Groups in Nearly Linear Time. ISSAC 1994: 154-157

Gyula O. H. Katona, Ákos Seress: Greedy Construction of Nearly Regular Graphs. Eur. J. Comb. 14(3): 213-229 (1993)

László Lovász, Ákos Seress: The Cocycle Lattice of Binary Matroids . Eur. J. Comb. 14(3): 241-250 (1993)

Aart Blokhuis, Ákos Seress, Henny A. Wilbrink: Characterization of complete exterior sets of conics. Combinatorica 12(2): 143-147 (1992)

Ákos Seress: On Hajnal's triangle-free game. Graphs and Combinatorics 8(1): 75-79 (1992)

Robert Beals, Ákos Seress: Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time. STOC 1992: 116-125

László Babai, Gene Cooperman, Larry Finkelstein, Ákos Seress: Nearly Linear Time Algorithms for Permutation Groups with a Small Base. ISSAC 1991: 200-209

László Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, Ákos Seress: Fast Monte Carlo Algorithms for Permutation Groups. STOC 1991: 90-100

László Babai, Gábor Hetyei, William M. Kantor, Alexander Lubotzky, Ákos Seress: On the Diameter of Finite Groups. FOCS 1990: 857-865

Ákos Seress: Some characterizations of type-1 lambda-designs. J. Comb. Theory, Ser. A 52(2): 288-300 (1989)

Dezsö Miklós, Mark J. Newman, Ákos Seress, Douglas B. West: The addition game: an abstraction of a communication problem. Discrete Mathematics 68(2-3): 265-272 (1988)

László Babai, Ákos Seress: On the diameter of cayley graphs of the symmetric group. J. Comb. Theory, Ser. A 49(1): 175-179 (1988)

Ákos Seress: Quick Gossiping by Conference Calls. SIAM J. Discrete Math. 1(1): 109-120 (1988)

László Babai, Eugene M. Luks, Ákos Seress: Fast Management of Permutation Groups. FOCS 1988: 272-282

László Babai, Ákos Seress: On the degree of transitivity of permutation groups: A short proof. J. Comb. Theory, Ser. A 45(2): 310-315 (1987)

László Babai, Eugene M. Luks, Ákos Seress: Permutation Groups in NC. STOC 1987: 409-420

Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress: Coloring graphs with locally few colors. Discrete Mathematics 59(1-2): 21-34 (1986)

Ákos Seress: Quick gossiping without duplicate transmissions. Graphs and Combinatorics 2(1): 363-381 (1986)

Ákos Seress: Gossiping old ladies. Discrete Mathematics 46(1): 75-81 (1983)