Ákos Seress
According to our database^{1},
Ákos Seress
authored at least 53 papers
between 1983 and 2013.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at zbmath.org

at id.loc.gov

at dnb.info
On csauthors.net:
Bibliography
2013
Disconnected Colors in Generalized GallaiColorings.
Journal of Graph Theory, 2013
Bounded Degree, Triangle Avoidance Graph Games.
Graphs and Combinatorics, 2013
A Family of HalfTransitive Graphs.
Electr. J. Comb., 2013
2012
Construction of 2closed Mrepresentations.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012
2011
A note on the girthdoubling construction for polygonal graphs.
Journal of Graph Theory, 2011
Combinatorics, Groups, Algorithms, and Complexity: Conference in honor of Laci Babai's 60th birthday.
Discrete Mathematics & Theoretical Computer Science, 2011
Computing tensor decompositions of finite matrix groups.
Discrete Mathematics & Theoretical Computer Science, 2011
Connected, Bounded Degree, Triangle Avoidance Games.
Electr. J. Comb., 2011
Distinguishing labeling of the actions of almost simple groups.
Combinatorica, 2011
2010
The vertex primitive and vertex biprimitive sarc regular graphs.
J. Comb. Theory, Ser. B, 2010
2009
Polynomialtime theory of matrix groups.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009
2008
On the bandwidth of 3dimensional Hamming graphs.
Theor. Comput. Sci., 2008
2007
Symmetrical pathcycle covers of a graph and polygonal graphs.
J. Comb. Theory, Ser. A, 2007
On limit graphs of finite vertexprimitive graphs.
J. Comb. Theory, Ser. A, 2007
2006
A data structure for a uniform approach to computations with finite groups.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006
2005
SquareFree NonCayley Numbers. On VertexTransitive NonCayley Graphs of SquareFree Order.
Des. Codes Cryptogr., 2005
2004
On Dowling geometries of infinite groups.
J. Comb. Theory, Ser. A, 2004
On the diameter of the symmetric group: polynomial bounds.
Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2004
2002
The Number of Directions Determined by Points in the ThreeDimensional Euclidean Space.
Discrete & Computational Geometry, 2002
Permutations With Restricted Cycle Structure And An Algorithmic Application.
Combinatorics, Probability & Computing, 2002
2001
All LambdaDesigns With are Type1.
Des. Codes Cryptogr., 2001
2000
Large Families of Cospectral Graphs.
Des. Codes Cryptogr., 2000
ErdösKoRado and HiltonMilner Type Theorems for Intersecting Chains in Posets.
Combinatorica, 2000
1999
On Erdős's Eulerian Trail Game.
Graphs and Combinatorics, 1999
1998
On vertextransitive, nonCayley graphs of order pqr.
Discrete Mathematics, 1998
1997
Fast Management of Permutation Groups I.
SIAM J. Comput., 1997
1995
Dense Graphs with Cycle Neighborhoods.
J. Comb. Theory, Ser. B, 1995
Graphs of Prescribed Girth and BiDegree.
J. Comb. Theory, Ser. B, 1995
Fast Monte Carlo Algorithms for Permutation Groups.
J. Comput. Syst. Sci., 1995
Computing the Fitting subgoup and solvable radical for smallbasepermutation groups in nearly linear time.
Proceedings of the Groups and Computation, 1995
1994
On Intersecting Chains in Boolean Algebras.
Combinatorics, Probability & Computing, 1994
Finding Blocks of Imprimitivity in SmallBase Groups in Nearly Linear Time.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994
1993
The Cocycle Lattice of Binary Matroids .
Eur. J. Comb., 1993
Greedy Construction of Nearly Regular Graphs.
Eur. J. Comb., 1993
1992
On Hajnal's trianglefree game.
Graphs and Combinatorics, 1992
On the diameter of permutation groups.
Eur. J. Comb., 1992
Characterization of complete exterior sets of conics.
Combinatorica, 1992
Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992
1991
Fast Monte Carlo Algorithms for Permutation Groups
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991
Nearly Linear Time Algorithms for Permutation Groups with a Small Base.
Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991
PERM: A Program Computing Strong Generating Sets.
Proceedings of the Groups And Computation, 1991
Computing Composition Series in Primitive Groups.
Proceedings of the Groups And Computation, 1991
1990
On the Diameter of Finite Groups
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
1989
Some characterizations of type1 lambdadesigns.
J. Comb. Theory, Ser. A, 1989
1988
Quick Gossiping by Conference Calls.
SIAM J. Discrete Math., 1988
On the diameter of cayley graphs of the symmetric group.
J. Comb. Theory, Ser. A, 1988
The addition game: an abstraction of a communication problem.
Discrete Mathematics, 1988
Fast Management of Permutation Groups
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988
1987
On the degree of transitivity of permutation groups: A short proof.
J. Comb. Theory, Ser. A, 1987
Permutation Groups in NC
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987
1986
Quick gossiping without duplicate transmissions.
Graphs and Combinatorics, 1986
Coloring graphs with locally few colors.
Discrete Mathematics, 1986
1983
Gossiping old ladies.
Discrete Mathematics, 1983