Ákos Seress

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