Ákos Seress

According to our database, Ákos Seress authored at least 53 papers between 1983 and 2013.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of one.

2013

Disconnected Colors in Generalized Gallai-Colorings.

Shinya Fujita, András Gyárfás, Colton Magnant, Ákos Seress

J. Graph Theory, 2013

Bounded Degree, Triangle Avoidance Graph Games.

Nishali Mehta, Ákos Seress

Graphs Comb., 2013

A Family of Half-Transitive Graphs.

Jing Chen, Cai Heng Li, Ákos Seress

Electron. J. Comb., 2013

2012

Construction of 2-closed M-representations.

Ákos Seress

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011

A note on the girth-doubling construction for polygonal graphs.

Ákos Seress, Eric Swartz

J. Graph Theory, 2011

Combinatorics, Groups, Algorithms, and Complexity: Conference in honor of Laci Babai's 60th birthday.

Ákos Seress, Mario Szegedy

Discret. Math. Theor. Comput. Sci., 2011

Computing tensor decompositions of finite matrix groups.

Nurullah Ankaralioglu, Ákos Seress

Discret. Math. Theor. Comput. Sci., 2011

Connected, Bounded Degree, Triangle Avoidance Games.

Nishali Mehta, Ákos Seress

Electron. J. Comb., 2011

Distinguishing labeling of the actions of almost simple groups.

Ákos Seress, Tsai-Lien Wong, Xuding Zhu

Comb., 2011

2010

The vertex primitive and vertex bi-primitive s-arc regular graphs.

Cai Heng Li, Liang Niu, Ákos Seress, Ronald Solomon

J. Comb. Theory, Ser. B, 2010

2009

Polynomial-time theory of matrix groups.

László Babai, Robert Beals, Ákos Seress

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008

On the bandwidth of 3-dimensional Hamming graphs.

József Balogh, Sergei L. Bezrukov, L. H. Harper, Ákos Seress

Theor. Comput. Sci., 2008

2007

Symmetrical path-cycle covers of a graph and polygonal graphs.

Cai Heng Li, Ákos Seress

J. Comb. Theory, Ser. A, 2007

On limit graphs of finite vertex-primitive graphs.

Michael Giudici, Cai Heng Li, Cheryl E. Praeger, Ákos Seress, Vladimir Ivanovich Trofimov

J. Comb. Theory, Ser. A, 2007

2006

A Reduction Algorithm for Large-Base Primitive Permutation Groups.

Maska Law, Alice C. Niemeyer, Cheryl E. Praeger, Ákos Seress

LMS J. Comput. Math., 2006

A data structure for a uniform approach to computations with finite groups.

Max Neunhöffer, Ákos Seress

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

2005

Square-Free Non-Cayley Numbers. On Vertex-Transitive Non-Cayley Graphs of Square-Free Order.

Ákos Seress

Des. Codes Cryptogr., 2005

2004

On Dowling geometries of infinite groups.

Peter A. Brooksbank, Hongxun Qin, Edmund Robertson, Ákos Seress

J. Comb. Theory, Ser. A, 2004

On the diameter of the symmetric group: polynomial bounds.

László Babai, Robert Beals, Ákos Seress

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2002

The Number of Directions Determined by Points in the Three-Dimensional Euclidean Space.

Aart Blokhuis, Ákos Seress

Discret. Comput. Geom., 2002

Permutations With Restricted Cycle Structure And An Algorithmic Application.

Robert Beals, Charles R. Leedham-Green, Alice C. Niemeyer, Cheryl E. Praeger, Ákos Seress

Comb. Probab. Comput., 2002

2001

All Lambda-Designs With are Type-1.

Ákos Seress

Des. Codes Cryptogr., 2001

2000

Large Families of Cospectral Graphs.

Ákos Seress

Des. Codes Cryptogr., 2000

Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets.

Péter L. Erdös, Ákos Seress, László A. Székely

Comb., 2000

1999

On Erdős's Eulerian Trail Game.

Ákos Seress, Tibor Szabó

Graphs Comb., 1999

1998

On vertex-transitive, non-Cayley graphs of order pqr.

Ákos Seress

Discret. Math., 1998

1997

Fast Management of Permutation Groups I.

László Babai, Eugene M. Luks, Ákos Seress

SIAM J. Comput., 1997

1995

Dense Graphs with Cycle Neighborhoods.

Ákos Seress, Tibor Szabó

J. Comb. Theory, Ser. B, 1995

Graphs of Prescribed Girth and Bi-Degree.

Zoltán Füredi, Felix Lazebnik, Ákos Seress, Vasiliy A. Ustimenko, Andrew J. Woldar

J. Comb. Theory, Ser. B, 1995

Fast Monte Carlo Algorithms for Permutation Groups.

László Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, Ákos Seress

J. Comput. Syst. Sci., 1995

Computing the Fitting subgroup and solvable radical for small-base permutation groups in nearly linear time.

Eugene M. Luks, Ákos Seress

Proceedings of the Groups and Computation, 1995

1994

On Intersecting Chains in Boolean Algebras.

Péter L. Erdös, Ákos Seress, László A. Székely

Comb. Probab. Comput., 1994

Finding Blocks of Imprimitivity in Small-Base Groups in Nearly Linear Time.

Martin Schönert, Ákos Seress

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

1993

The Cocycle Lattice of Binary Matroids .

László Lovász, Ákos Seress

Eur. J. Comb., 1993

Greedy Construction of Nearly Regular Graphs.

Gyula O. H. Katona, Ákos Seress

Eur. J. Comb., 1993

1992

On Hajnal's triangle-free game.

Ákos Seress

Graphs Comb., 1992

On the diameter of permutation groups.

László Babai, Ákos Seress

Eur. J. Comb., 1992

Characterization of complete exterior sets of conics.

Aart Blokhuis, Ákos Seress, Henny A. Wilbrink

Comb., 1992

Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time

Robert Beals, Ákos Seress

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1991

Nearly Linear Time Algorithms for Permutation Groups with a Small Base.

László Babai, Gene Cooperman, Larry Finkelstein, Ákos Seress

Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

PERM: A Program Computing Strong Generating Sets.

Ákos Seress, Iván Weisz

Proceedings of the Groups And Computation, 1991

Computing Composition Series in Primitive Groups.

László Babai, Eugene M. Luks, Ákos Seress

Proceedings of the Groups And Computation, 1991

1990

On the Diameter of Finite Groups

László Babai, Gábor Hetyei, William M. Kantor, Alexander Lubotzky, Ákos Seress

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

Some characterizations of type-1 lambda-designs.

Ákos Seress

J. Comb. Theory, Ser. A, 1989

1988

Quick Gossiping by Conference Calls.

Ákos Seress

SIAM J. Discret. Math., 1988

On the diameter of cayley graphs of the symmetric group.

László Babai, Ákos Seress

J. Comb. Theory, Ser. A, 1988

The addition game: an abstraction of a communication problem.

Dezsö Miklós, Mark J. Newman, Ákos Seress, Douglas B. West

Discret. Math., 1988

Fast Management of Permutation Groups

László Babai, Eugene M. Luks, Ákos Seress

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1987

On the degree of transitivity of permutation groups: A short proof.

László Babai, Ákos Seress

J. Comb. Theory, Ser. A, 1987

Permutation Groups in NC

László Babai, Eugene M. Luks, Ákos Seress

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1986

Quick gossiping without duplicate transmissions.

Ákos Seress

Graphs Comb., 1986

Coloring graphs with locally few colors.

Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress

Discret. Math., 1986

1983

Gossiping old ladies.

Ákos Seress

Discret. Math., 1983