default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDÁkos Seress
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j40]Jing Chen, Cai Heng Li, Ákos Seress:
A Family of Half-Transitive Graphs. Electron. J. Comb. 20(1): 56 (2013)- [j39]Nishali Mehta, Ákos Seress:
Bounded Degree, Triangle Avoidance Graph Games. Graphs Comb. 29(3): 637-660 (2013) - [j38]Shinya Fujita, András Gyárfás, Colton Magnant, Ákos Seress:
Disconnected Colors in Generalized Gallai-Colorings. J. Graph Theory 74(1): 104-114 (2013) - 2012
- [c14]Ákos Seress:
Construction of 2-closed M-representations. ISSAC 2012: 311-318 - 2011
- [j37]Ákos Seress, Tsai-Lien Wong, Xuding Zhu:
Distinguishing labeling of the actions of almost simple groups. Comb. 31(4): 489-506 (2011) - [j36]Nishali Mehta, Ákos Seress:
Connected, Bounded Degree, Triangle Avoidance Games. Electron. J. Comb. 18(1) (2011) - [j35]Á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): 1-4 (2011) - [j34]Nurullah Ankaralioglu, Ákos Seress:
Computing tensor decompositions of finite matrix groups. Discret. Math. Theor. Comput. Sci. 13(4): 5-14 (2011) - [j33]Ákos Seress, Eric Swartz
:
A note on the girth-doubling construction for polygonal graphs. J. Graph Theory 68(3): 246-254 (2011) - 2010
- [j32]Cai Heng Li, Liang Niu, Ákos Seress, Ronald Solomon:
The vertex primitive and vertex bi-primitive s-arc regular graphs. J. Comb. Theory B 100(4): 359-366 (2010)
2000 – 2009
- 2009
- [c13]László Babai, Robert Beals, Ákos Seress:
Polynomial-time theory of matrix groups. STOC 2009: 55-64 - 2008
- [j31]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): 488-495 (2008) - 2007
- [j30]Cai Heng Li, Ákos Seress:
Symmetrical path-cycle covers of a graph and polygonal graphs. J. Comb. Theory A 114(1): 35-51 (2007) - [j29]Michael Giudici, Cai Heng Li, Cheryl E. Praeger, Ákos Seress, Vladimir Ivanovich Trofimov:
On limit graphs of finite vertex-primitive graphs. J. Comb. Theory A 114(1): 110-134 (2007) - 2006
- [j28]Maska Law, Alice C. Niemeyer, Cheryl E. Praeger, Ákos Seress:
A Reduction Algorithm for Large-Base Primitive Permutation Groups. LMS J. Comput. Math. 9: 159-173 (2006) - [c12]Max Neunhöffer, Ákos Seress:
A data structure for a uniform approach to computations with finite groups. ISSAC 2006: 254-261 - 2005
- [j27]Ákos Seress:
Square-Free Non-Cayley Numbers. On Vertex-Transitive Non-Cayley Graphs of Square-Free Order. Des. Codes Cryptogr. 34(2-3): 265-281 (2005) - 2004
- [j26]Peter A. Brooksbank, Hongxun Qin, Edmund Robertson, Ákos Seress:
On Dowling geometries of infinite groups. J. Comb. Theory A 108(1): 155-158 (2004) - [c11]László Babai, Robert Beals, Ákos Seress:
On the diameter of the symmetric group: polynomial bounds. SODA 2004: 1108-1112 - 2002
- [j25]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): 447-464 (2002) - [j24]Aart Blokhuis, Ákos Seress:
The Number of Directions Determined by Points in the Three-Dimensional Euclidean Space. Discret. Comput. Geom. 28(4): 491-494 (2002) - 2001
- [j23]Ákos Seress:
All Lambda-Designs With are Type-1. Des. Codes Cryptogr. 22(1): 5-17 (2001) - 2000
- [j22]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): 27-45 (2000) - [j21]Ákos Seress:
Large Families of Cospectral Graphs. Des. Codes Cryptogr. 21(1/3): 205-208 (2000)
1990 – 1999
- 1999
- [j20]Ákos Seress, Tibor Szabó:
On Erdős's Eulerian Trail Game. Graphs Comb. 15(2): 233-237 (1999) - 1998
- [j19]Ákos Seress:
On vertex-transitive, non-Cayley graphs of order pqr. Discret. Math. 182(1-3): 279-292 (1998) - 1997
- [j18]László Babai, Eugene M. Luks, Ákos Seress:
Fast Management of Permutation Groups I. SIAM J. Comput. 26(5): 1310-1342 (1997) - 1995
- [j17]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): 296-308 (1995) - [j16]Ákos Seress, Tibor Szabó:
Dense Graphs with Cycle Neighborhoods. J. Comb. Theory B 63(2): 281-293 (1995) - [j15]Zoltán Füredi, Felix Lazebnik, Ákos Seress, Vasiliy A. Ustimenko, Andrew J. Woldar:
Graphs of Prescribed Girth and Bi-Degree. J. Comb. Theory B 64(2): 228-239 (1995) - [c10]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: 169-181 - 1994
- [j14]Péter L. Erdös, Ákos Seress, László A. Székely:
On Intersecting Chains in Boolean Algebras. Comb. Probab. Comput. 3: 57-62 (1994) - [c9]Martin Schönert, Ákos Seress:
Finding Blocks of Imprimitivity in Small-Base Groups in Nearly Linear Time. ISSAC 1994: 154-157 - 1993
- [j13]Gyula O. H. Katona, Ákos Seress:
Greedy Construction of Nearly Regular Graphs. Eur. J. Comb. 14(3): 213-229 (1993) - [j12]László Lovász, Ákos Seress:
The Cocycle Lattice of Binary Matroids . Eur. J. Comb. 14(3): 241-250 (1993) - 1992
- [j11]Aart Blokhuis, Ákos Seress, Henny A. Wilbrink:
Characterization of complete exterior sets of conics. Comb. 12(2): 143-147 (1992) - [j10]László Babai, Ákos Seress:
On the diameter of permutation groups. Eur. J. Comb. 13(4): 231-243 (1992) - [j9]Ákos Seress:
On Hajnal's triangle-free game. Graphs Comb. 8(1): 75-79 (1992) - [c8]Robert Beals, Ákos Seress:
Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time. STOC 1992: 116-125 - 1991
- [c7]László Babai, Eugene M. Luks, Ákos Seress:
Computing Composition Series in Primitive Groups. Groups And Computation 1991: 1-16 - [c6]Ákos Seress, Iván Weisz:
PERM: A Program Computing Strong Generating Sets. Groups And Computation 1991: 269-276 - [c5]László Babai, Gene Cooperman, Larry Finkelstein, Ákos Seress:
Nearly Linear Time Algorithms for Permutation Groups with a Small Base. ISSAC 1991: 200-209 - [c4]László Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, Ákos Seress:
Fast Monte Carlo Algorithms for Permutation Groups. STOC 1991: 90-100 - 1990
- [c3]László Babai, Gábor Hetyei, William M. Kantor, Alexander Lubotzky, Ákos Seress:
On the Diameter of Finite Groups. FOCS 1990: 857-865
1980 – 1989
- 1989
- [j8]Ákos Seress:
Some characterizations of type-1 lambda-designs. J. Comb. Theory A 52(2): 288-300 (1989) - 1988
- [j7]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): 265-272 (1988) - [j6]László Babai, Ákos Seress:
On the diameter of cayley graphs of the symmetric group. J. Comb. Theory A 49(1): 175-179 (1988) - [j5]Ákos Seress:
Quick Gossiping by Conference Calls. SIAM J. Discret. Math. 1(1): 109-120 (1988) - [c2]László Babai, Eugene M. Luks, Ákos Seress:
Fast Management of Permutation Groups. FOCS 1988: 272-282 - 1987
- [j4]László Babai, Ákos Seress:
On the degree of transitivity of permutation groups: A short proof. J. Comb. Theory A 45(2): 310-315 (1987) - [c1]László Babai, Eugene M. Luks, Ákos Seress:
Permutation Groups in NC. STOC 1987: 409-420 - 1986
- [j3]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): 21-34 (1986) - [j2]Ákos Seress:
Quick gossiping without duplicate transmissions. Graphs Comb. 2(1): 363-381 (1986) - 1983
- [j1]Ákos Seress:
Gossiping old ladies. Discret. Math. 46(1): 75-81 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
