2013
Disconnected Colors in Generalized Gallai-Colorings.
J. Graph Theory, 2013
Bounded Degree, Triangle Avoidance Graph Games.
Graphs Comb., 2013
A Family of Half-Transitive Graphs.
Electron. J. Comb., 2013
2012
Construction of 2-closed M-representations.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012
2011
A note on the girth-doubling construction for polygonal graphs.
J. Graph Theory, 2011
Combinatorics, Groups, Algorithms, and Complexity: Conference in honor of Laci Babai's 60th birthday.
Discret. Math. Theor. Comput. Sci., 2011
Computing tensor decompositions of finite matrix groups.
Discret. Math. Theor. Comput. Sci., 2011
Connected, Bounded Degree, Triangle Avoidance Games.
Electron. J. Comb., 2011
Distinguishing labeling of the actions of almost simple groups.
Comb., 2011
2010
The vertex primitive and vertex bi-primitive s-arc regular graphs.
J. Comb. Theory B, 2010
2009
Polynomial-time theory of matrix groups.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009
2008
On the bandwidth of 3-dimensional Hamming graphs.
Theor. Comput. Sci., 2008
2007
Symmetrical path-cycle covers of a graph and polygonal graphs.
J. Comb. Theory A, 2007
On limit graphs of finite vertex-primitive graphs.
J. Comb. Theory A, 2007
2006
A Reduction Algorithm for Large-Base Primitive Permutation Groups.
LMS J. Comput. Math., 2006
A data structure for a uniform approach to computations with finite groups.
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.
Des. Codes Cryptogr., 2005
2004
On Dowling geometries of infinite groups.
J. Comb. Theory A, 2004
On the diameter of the symmetric group: polynomial bounds.
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.
Discret. Comput. Geom., 2002
Permutations With Restricted Cycle Structure And An Algorithmic Application.
Comb. Probab. Comput., 2002
2001
All Lambda-Designs With are Type-1.
Des. Codes Cryptogr., 2001
2000
Large Families of Cospectral Graphs.
Des. Codes Cryptogr., 2000
Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets.
Comb., 2000
1999
On Erdős's Eulerian Trail Game.
Graphs Comb., 1999
1998
On vertex-transitive, non-Cayley graphs of order pqr.
Discret. Math., 1998
1997
Fast Management of Permutation Groups I.
SIAM J. Comput., 1997
1995
Dense Graphs with Cycle Neighborhoods.
J. Comb. Theory B, 1995
Graphs of Prescribed Girth and Bi-Degree.
J. Comb. Theory B, 1995
Fast Monte Carlo Algorithms for Permutation Groups.
J. Comput. Syst. Sci., 1995
Computing the Fitting subgroup and solvable radical for small-base permutation groups in nearly linear time.
Proceedings of the Groups and Computation, 1995
1994
On Intersecting Chains in Boolean Algebras.
Comb. Probab. Comput., 1994
Finding Blocks of Imprimitivity in Small-Base 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 triangle-free game.
Graphs Comb., 1992
On the diameter of permutation groups.
Eur. J. Comb., 1992
Characterization of complete exterior sets of conics.
Comb., 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
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 type-1 lambda-designs.
J. Comb. Theory A, 1989
1988
Quick Gossiping by Conference Calls.
SIAM J. Discret. Math., 1988
On the diameter of cayley graphs of the symmetric group.
J. Comb. Theory A, 1988
The addition game: an abstraction of a communication problem.
Discret. Math., 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 A, 1987
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987
1986
Quick gossiping without duplicate transmissions.
Graphs Comb., 1986
Coloring graphs with locally few colors.
Discret. Math., 1986
1983