Ákos Seress

Publication Activity (10 Years)

Years Active: 1983-2013
Publications (10 Years): 0

Top Venues

Electron. J. Comb.

J. Graph Theory

Publications

Nishali Mehta, Ákos Seress
Bounded Degree, Triangle Avoidance Graph Games. Graphs Comb. 29 (3) (2013)
Shinya Fujita, András Gyárfás, Colton Magnant, Ákos Seress
Disconnected Colors in Generalized Gallai-Colorings. J. Graph Theory 74 (1) (2013)
Jing Chen, Cai Heng Li, Ákos Seress
A Family of Half-Transitive Graphs. Electron. J. Comb. 20 (1) (2013)
Ákos Seress
Construction of 2-closed M-representations. ISSAC (2012)
Ákos Seress, Tsai-Lien Wong, Xuding Zhu
Distinguishing labeling of the actions of almost simple groups. Comb. 31 (4) (2011)
Ákos Seress, Mario Szegedy
Combinatorics, Groups, Algorithms, and Complexity: Conference in honor of Laci Babai's 60th birthday. Discret. Math. Theor. Comput. Sci. 13 (4) (2011)
Nishali Mehta, Ákos Seress
Connected, Bounded Degree, Triangle Avoidance Games. Electron. J. Comb. 18 (1) (2011)
Nurullah Ankaralioglu, Ákos Seress
Computing tensor decompositions of finite matrix groups. Discret. Math. Theor. Comput. Sci. 13 (4) (2011)
Ákos Seress, Eric Swartz
A note on the girth-doubling construction for polygonal graphs. J. Graph Theory 68 (3) (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) (2010)
László Babai, Robert Beals, Ákos Seress
Polynomial-time theory of matrix groups. STOC (2009)
József Balogh, Sergei L. Bezrukov, L. H. Harper, Ákos Seress
On the bandwidth of 3-dimensional Hamming graphs. Theor. Comput. Sci. 407 (1-3) (2008)
Cai Heng Li, Ákos Seress
Symmetrical path-cycle covers of a graph and polygonal graphs. J. Comb. Theory, Ser. A 114 (1) (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) (2007)
Maska Law, Alice C. Niemeyer, Cheryl E. Praeger, Ákos Seress
A Reduction Algorithm for Large-Base Primitive Permutation Groups. LMS J. Comput. Math. 9 (2006)
Max Neunhöffer, Ákos Seress
A data structure for a uniform approach to computations with finite groups. ISSAC (2006)
Ákos Seress
Square-Free Non-Cayley Numbers. On Vertex-Transitive Non-Cayley Graphs of Square-Free Order. Des. Codes Cryptogr. 34 (2-3) (2005)
Peter A. Brooksbank, Hongxun Qin, Edmund Robertson, Ákos Seress
On Dowling geometries of infinite groups. J. Comb. Theory, Ser. A 108 (1) (2004)
László Babai, Robert Beals, Ákos Seress
On the diameter of the symmetric group: polynomial bounds. SODA (2004)
Aart Blokhuis, Ákos Seress
The Number of Directions Determined by Points in the Three-Dimensional Euclidean Space. Discret. Comput. Geom. 28 (4) (2002)
Robert Beals, Charles R. Leedham-Green, Alice C. Niemeyer, Cheryl E. Praeger, Ákos Seress
Permutations With Restricted Cycle Structure And An Algorithmic Application. Comb. Probab. Comput. 11 (5) (2002)
Ákos Seress
All Lambda-Designs With are Type-1. Des. Codes Cryptogr. 22 (1) (2001)
Ákos Seress
Large Families of Cospectral Graphs. Des. Codes Cryptogr. 21 (1/3) (2000)
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. Comb. 20 (1) (2000)
Ákos Seress, Tibor Szabó
On Erdős's Eulerian Trail Game. Graphs Comb. 15 (2) (1999)
Ákos Seress
On vertex-transitive, non-Cayley graphs of order pqr. Discret. Math. 182 (1-3) (1998)
László Babai, Eugene M. Luks, Ákos Seress
Fast Management of Permutation Groups I. SIAM J. Comput. 26 (5) (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) (1995)
Ákos Seress, Tibor Szabó
Dense Graphs with Cycle Neighborhoods. J. Comb. Theory, Ser. B 63 (2) (1995)
Eugene M. Luks, Ákos Seress
Computing the Fitting subgroup and solvable radical for small-base permutation groups in nearly linear time. Groups and Computation (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) (1995)
Martin Schönert, Ákos Seress
Finding Blocks of Imprimitivity in Small-Base Groups in Nearly Linear Time. ISSAC (1994)
Péter L. Erdös, Ákos Seress, László A. Székely
On Intersecting Chains in Boolean Algebras. Comb. Probab. Comput. 3 (1994)
Gyula O. H. Katona, Ákos Seress
Greedy Construction of Nearly Regular Graphs. Eur. J. Comb. 14 (3) (1993)
László Lovász, Ákos Seress
The Cocycle Lattice of Binary Matroids . Eur. J. Comb. 14 (3) (1993)
Aart Blokhuis, Ákos Seress, Henny A. Wilbrink
Characterization of complete exterior sets of conics. Comb. 12 (2) (1992)
Ákos Seress
On Hajnal's triangle-free game. Graphs Comb. 8 (1) (1992)
Robert Beals, Ákos Seress
Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time STOC (1992)
László Babai, Ákos Seress
On the diameter of permutation groups. Eur. J. Comb. 13 (4) (1992)
László Babai, Eugene M. Luks, Ákos Seress
Computing Composition Series in Primitive Groups. Groups And Computation (1991)
Ákos Seress, Iván Weisz
PERM: A Program Computing Strong Generating Sets. Groups And Computation (1991)
László Babai, Gene Cooperman, Larry Finkelstein, Ákos Seress
Nearly Linear Time Algorithms for Permutation Groups with a Small Base. ISSAC (1991)
László Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, Ákos Seress
Fast Monte Carlo Algorithms for Permutation Groups STOC (1991)
László Babai, Gábor Hetyei, William M. Kantor, Alexander Lubotzky, Ákos Seress
On the Diameter of Finite Groups FOCS (1990)
Ákos Seress
Some characterizations of type-1 lambda-designs. J. Comb. Theory, Ser. A 52 (2) (1989)
Ákos Seress
Quick Gossiping by Conference Calls. SIAM J. Discret. Math. 1 (1) (1988)
László Babai, Ákos Seress
On the diameter of cayley graphs of the symmetric group. J. Comb. Theory, Ser. A 49 (1) (1988)
László Babai, Eugene M. Luks, Ákos Seress
Fast Management of Permutation Groups FOCS (1988)
Dezsö Miklós, Mark J. Newman, Ákos Seress, Douglas B. West
The addition game: an abstraction of a communication problem. Discret. Math. 68 (2-3) (1988)
László Babai, Eugene M. Luks, Ákos Seress
Permutation Groups in NC STOC (1987)
László Babai, Ákos Seress
On the degree of transitivity of permutation groups: A short proof. J. Comb. Theory, Ser. A 45 (2) (1987)
Ákos Seress
Quick gossiping without duplicate transmissions. Graphs Comb. 2 (1) (1986)
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. Discret. Math. 59 (1-2) (1986)
Ákos Seress
Gossiping old ladies. Discret. Math. 46 (1) (1983)