A Family of Half-Transitive Graphs.

Ákos Seress https://zbmath.org/authors/?q=ai:seress.akos https://mathscinet.ams.org/mathscinet/MRAuthorID/158845 https://mathgenealogy.org/id.php?id=10687 https://www.wikidata.org/entity/Q15057218 https://id.loc.gov/authorities/names/n00006356 https://d-nb.info/gnd/1103463705

Jing Chen Cai Heng Li Ákos Seress A Family of Half-Transitive Graphs. 56 2013 20 Electron. J. Comb. 1 https://doi.org/10.37236/3140 db/journals/combinatorics/combinatorics20.html#ChenLS13

Nishali Mehta Ákos Seress Bounded Degree, Triangle Avoidance Graph Games. 637-660 2013 29 Graphs Comb. 3 https://doi.org/10.1007/s00373-011-1121-3 db/journals/gc/gc29.html#MehtaS13

Shinya Fujita 0001 András Gyárfás Colton Magnant Ákos Seress Disconnected Colors in Generalized Gallai-Colorings. 104-114 2013 74 J. Graph Theory 1 https://doi.org/10.1002/jgt.21694 db/journals/jgt/jgt74.html#FujitaGMS13

Ákos Seress Construction of 2-closed M-representations. 311-318 2012 ISSAC https://doi.org/10.1145/2442829.2442874 conf/issac/2012 db/conf/issac/issac2012.html#Seress12

Ákos Seress Tsai-Lien Wong Xuding Zhu Distinguishing labeling of the actions of almost simple groups. 489-506 2011 31 Comb. 4 https://doi.org/10.1007/s00493-011-2221-7 db/journals/combinatorica/combinatorica31.html#SeressWZ11

Nishali Mehta Ákos Seress Connected, Bounded Degree, Triangle Avoidance Games. 2011 18 Electron. J. Comb. 1 https://doi.org/10.37236/680 db/journals/combinatorics/combinatorics18.html#MehtaS11

Ákos Seress Mario Szegedy Combinatorics, Groups, Algorithms, and Complexity: Conference in honor of Laci Babai's 60th birthday. 1-4 2011 13 Discret. Math. Theor. Comput. Sci. 4 https://doi.org/10.46298/dmtcs.529 https://www.wikidata.org/entity/Q120776710 db/journals/dmtcs/dmtcs13.html#SeressS11

Nurullah Ankaralioglu Ákos Seress Computing tensor decompositions of finite matrix groups. 5-14 2011 13 Discret. Math. Theor. Comput. Sci. 4 https://doi.org/10.46298/dmtcs.562 db/journals/dmtcs/dmtcs13.html#AnkaraliogluS11

Ákos Seress Eric Swartz A note on the girth-doubling construction for polygonal graphs. 246-254 2011 68 J. Graph Theory 3 https://doi.org/10.1002/jgt.20555 db/journals/jgt/jgt68.html#SeressS11

Cai Heng Li Liang Niu Ákos Seress Ronald Solomon The vertex primitive and vertex bi-primitive s-arc regular graphs. 359-366 2010 100 J. Comb. Theory B 4 https://doi.org/10.1016/j.jctb.2009.11.001 db/journals/jct/jctb100.html#LiNSS10

László Babai Robert Beals Ákos Seress Polynomial-time theory of matrix groups. 55-64 2009 STOC https://doi.org/10.1145/1536414.1536425 https://www.wikidata.org/entity/Q60587912 conf/stoc/2009 db/conf/stoc/stoc2009.html#BabaiBS09

József Balogh Sergei L. Bezrukov L. H. Harper Ákos Seress On the bandwidth of 3-dimensional Hamming graphs. 488-495 2008 407 Theor. Comput. Sci. 1-3 https://doi.org/10.1016/j.tcs.2008.07.029 db/journals/tcs/tcs407.html#BaloghBHS08

Cai Heng Li Ákos Seress Symmetrical path-cycle covers of a graph and polygonal graphs. 35-51 2007 114 J. Comb. Theory A 1 https://doi.org/10.1016/j.jcta.2006.01.008 db/journals/jct/jcta114.html#LiS07

Michael Giudici Cai Heng Li Cheryl E. Praeger Ákos Seress Vladimir Ivanovich Trofimov On limit graphs of finite vertex-primitive graphs. 110-134 2007 114 J. Comb. Theory A 1 https://doi.org/10.1016/j.jcta.2006.03.005 https://www.wikidata.org/entity/Q56987784 db/journals/jct/jcta114.html#GiudiciLPST07

Maska Law Alice C. Niemeyer Cheryl E. Praeger Ákos Seress A Reduction Algorithm for Large-Base Primitive Permutation Groups. 159-173 2006 9 LMS J. Comput. Math. https://doi.org/10.1112/s1461157000001236 https://www.wikidata.org/entity/Q114980721 db/journals/lmsjcm/lmsjcm9.html#LawNPS06

Max Neunhöffer Ákos Seress A data structure for a uniform approach to computations with finite groups. 254-261 2006 conf/issac/2006 ISSAC https://doi.org/10.1145/1145768.1145811 db/conf/issac/issac2006.html#NeunhofferS06

Ákos Seress Square-Free Non-Cayley Numbers. On Vertex-Transitive Non-Cayley Graphs of Square-Free Order. 265-281 2005 34 Des. Codes Cryptogr. 2-3 https://doi.org/10.1007/s10623-004-4859-2 db/journals/dcc/dcc34.html#Seress05

Peter A. Brooksbank Hongxun Qin Edmund Robertson Ákos Seress On Dowling geometries of infinite groups. 155-158 2004 108 J. Comb. Theory A 1 https://doi.org/10.1016/j.jcta.2004.06.001 db/journals/jct/jcta108.html#BrooksbankQRS04

László Babai Robert Beals Ákos Seress On the diameter of the symmetric group: polynomial bounds. 1108-1112 2004 conf/soda/2004 SODA http://dl.acm.org/citation.cfm?id=982792.982956 db/conf/soda/soda2004.html#BabaiBS04

Robert Beals Charles R. Leedham-Green Alice C. Niemeyer Cheryl E. Praeger Ákos Seress Permutations With Restricted Cycle Structure And An Algorithmic Application. 2002 11 Comb. Probab. Comput. 5 db/journals/cpc/cpc11.html#BealsLNPS02 https://doi.org/10.1017/S0963548302005217 https://www.wikidata.org/entity/Q56987960 447-464

Aart Blokhuis Ákos Seress The Number of Directions Determined by Points in the Three-Dimensional Euclidean Space. 491-494 2002 28 Discret. Comput. Geom. 4 https://doi.org/10.1007/s00454-002-2895-0 db/journals/dcg/dcg28.html#BlokhuisS02

Ákos Seress All Lambda-Designs With are Type-1. 5-17 2001 22 Des. Codes Cryptogr. 1 db/journals/dcc/dcc22.html#Seress01

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. 27-45 2000 20 Comb. 1 https://doi.org/10.1007/s004930070029 db/journals/combinatorica/combinatorica20.html#ErdosSS00

Ákos Seress Large Families of Cospectral Graphs. 205-208 2000 21 Des. Codes Cryptogr. 1/3 db/journals/dcc/dcc21.html#Seress00

Ákos Seress Tibor Szabó On Erdős's Eulerian Trail Game. 233-237 1999 15 Graphs Comb. 2 https://doi.org/10.1007/s003730050043 db/journals/gc/gc15.html#SeressS99

Ákos Seress On vertex-transitive, non-Cayley graphs of order pqr. 279-292 1998 182 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(97)00149-0 db/journals/dm/dm182.html#Seress98

László Babai Eugene M. Luks Ákos Seress Fast Management of Permutation Groups I. 1310-1342 1997 26 SIAM J. Comput. 5 db/journals/siamcomp/siamcomp26.html#BabaiLS97 https://doi.org/10.1137/S0097539794229417

László Babai Gene Cooperman Larry Finkelstein Eugene M. Luks Ákos Seress Fast Monte Carlo Algorithms for Permutation Groups. 296-308 1995 50 J. Comput. Syst. Sci. 2 db/journals/jcss/jcss50.html#BabaiCFLS95 https://doi.org/10.1006/jcss.1995.1024

Ákos Seress Tibor Szabó Dense Graphs with Cycle Neighborhoods. 281-293 1995 63 J. Comb. Theory B 2 https://doi.org/10.1006/jctb.1995.1020 db/journals/jct/jctb63.html#SeressS95

Zoltán Füredi Felix Lazebnik Ákos Seress Vasiliy A. Ustimenko Andrew J. Woldar Graphs of Prescribed Girth and Bi-Degree. 228-239 1995 64 J. Comb. Theory B 2 https://doi.org/10.1006/jctb.1995.1033 db/journals/jct/jctb64.html#FurediLSUW95

Eugene M. Luks Ákos Seress Computing the Fitting subgroup and solvable radical for small-base permutation groups in nearly linear time. 169-181 1995 Groups and Computation conf/dimacs/dimacs28 db/conf/dimacs/dimacs28.html#LuksS95 https://doi.org/10.1090/dimacs/028/12

Péter L. Erdös Ákos Seress László A. Székely On Intersecting Chains in Boolean Algebras. 57-62 1994 3 Comb. Probab. Comput. db/journals/cpc/cpc3.html#ErdosSS94 https://doi.org/10.1017/S0963548300000973

Martin Schönert Ákos Seress Finding Blocks of Imprimitivity in Small-Base Groups in Nearly Linear Time. 154-157 1994 conf/issac/1994 ISSAC https://doi.org/10.1145/190347.190400 db/conf/issac/issac94.html#SchonertS94

Gyula O. H. Katona Ákos Seress Greedy Construction of Nearly Regular Graphs. 213-229 1993 14 Eur. J. Comb. 3 https://doi.org/10.1006/eujc.1993.1025 db/journals/ejc/ejc14.html#KatonaS93

László Lovász 0001 Ákos Seress The Cocycle Lattice of Binary Matroids . 241-250 1993 14 Eur. J. Comb. 3 https://doi.org/10.1006/eujc.1993.1027 db/journals/ejc/ejc14.html#LovaszS93

Aart Blokhuis Ákos Seress Henny A. Wilbrink Characterization of complete exterior sets of conics. 143-147 1992 12 Comb. 2 db/journals/combinatorica/combinatorica12.html#BlokhuisSW92 https://doi.org/10.1007/BF01204717

László Babai Ákos Seress On the diameter of permutation groups. 231-243 1992 13 Eur. J. Comb. 4 https://doi.org/10.1016/S0195-6698(05)80029-0 db/journals/ejc/ejc13.html#BabaiS92

Ákos Seress On Hajnal's triangle-free game. 75-79 1992 8 Graphs Comb. 1 https://doi.org/10.1007/BF01271710 db/journals/gc/gc8.html#Seress92

Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time Robert Beals Ákos Seress 116-125 conf/stoc/STOC24 1992 STOC db/conf/stoc/stoc92.html#BealsS92 https://doi.org/10.1145/129712.129724 László Babai Eugene M. Luks Ákos Seress Computing Composition Series in Primitive Groups. 1-16 1991 Groups And Computation conf/dimacs/dimacs11 db/conf/dimacs/dimacs11.html#BabaiLS91 https://doi.org/10.1090/dimacs/011/01 Ákos Seress Iván Weisz PERM: A Program Computing Strong Generating Sets. 269-276 1991 Groups And Computation conf/dimacs/dimacs11 db/conf/dimacs/dimacs11.html#SeressW91 https://doi.org/10.1090/dimacs/011/18 László Babai Gene Cooperman Larry Finkelstein Ákos Seress Nearly Linear Time Algorithms for Permutation Groups with a Small Base. 200-209 1991 conf/issac/1991 ISSAC https://doi.org/10.1145/120694.120724 db/conf/issac/issac91.html#BabaiCFS91 Fast Monte Carlo Algorithms for Permutation Groups László Babai Gene Cooperman Larry Finkelstein Eugene M. Luks Ákos Seress 90-100 conf/stoc/STOC23 1991 STOC db/conf/stoc/stoc91.html#BabaiCFLS91 https://doi.org/10.1145/103418.103435 On the Diameter of Finite Groups László Babai Gábor Hetyei William M. Kantor Alexander Lubotzky Ákos Seress 857-865 conf/focs/FOCS31b 1990 FOCS db/conf/focs/focs90.html#BabaiHKLS90 https://doi.org/10.1109/FSCS.1990.89608 https://doi.ieeecomputersociety.org/10.1109/FSCS.1990.89608

Ákos Seress Some characterizations of type-1 lambda-designs. 288-300 1989 52 J. Comb. Theory A 2 https://doi.org/10.1016/0097-3165(89)90034-4 db/journals/jct/jcta52.html#Seress89

Dezsö Miklós Mark J. Newman Ákos Seress Douglas B. West The addition game: an abstraction of a communication problem. 265-272 1988 68 Discret. Math. 2-3 https://doi.org/10.1016/0012-365X(88)90118-5 db/journals/dm/dm68.html#MiklosNSW88

László Babai Ákos Seress On the diameter of cayley graphs of the symmetric group. 175-179 1988 49 J. Comb. Theory A 1 https://doi.org/10.1016/0097-3165(88)90033-7 db/journals/jct/jcta49.html#BabaiS88

Ákos Seress Quick Gossiping by Conference Calls. 109-120 1988 1 SIAM J. Discret. Math. 1 db/journals/siamdm/siamdm1.html#Seress88 https://doi.org/10.1137/0401013

Fast Management of Permutation Groups László Babai Eugene M. Luks Ákos Seress 272-282 conf/focs/FOCS29 1988 FOCS db/conf/focs/focs88.html#BabaiLS88 https://doi.org/10.1109/SFCS.1988.21943 https://doi.ieeecomputersociety.org/10.1109/SFCS.1988.21943

László Babai Ákos Seress On the degree of transitivity of permutation groups: A short proof. 310-315 1987 45 J. Comb. Theory A 2 https://doi.org/10.1016/0097-3165(87)90023-9 db/journals/jct/jcta45.html#BabaiS87

Permutation Groups in NC László Babai Eugene M. Luks Ákos Seress 409-420 conf/stoc/STOC19 1987 STOC db/conf/stoc/stoc87.html#BabaiLS87 https://doi.org/10.1145/28395.28439

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. 21-34 1986 59 Discret. Math. 1-2 https://doi.org/10.1016/0012-365X(86)90065-8 https://www.wikidata.org/entity/Q105741804 db/journals/dm/dm59.html#ErdosFHKRS86

Ákos Seress Quick gossiping without duplicate transmissions. 363-381 1986 2 Graphs Comb. 1 https://doi.org/10.1007/BF01788111 db/journals/gc/gc2.html#Seress86

Ákos Seress Gossiping old ladies. 75-81 1983 46 Discret. Math. 1 https://doi.org/10.1016/0012-365X(83)90272-8 db/journals/dm/dm46.html#Seress83

Nurullah Ankaralioglu László Babai József Balogh Robert Beals Sergei L. Bezrukov Aart Blokhuis Peter A. Brooksbank Jing Chen Gene Cooperman Paul Erdös Péter L. Erdös Larry Finkelstein Shinya Fujita 0001 Zoltán Füredi Michael Giudici András Gyárfás András Hajnal L. H. Harper Gábor Hetyei William M. Kantor Gyula O. H. Katona Péter Komjáth Maska Law Felix Lazebnik Charles R. Leedham-Green Cai Heng Li László Lovász 0001 Alexander Lubotzky Eugene M. Luks Colton Magnant Nishali Mehta Dezsö Miklós Max Neunhöffer Mark J. Newman Alice C. Niemeyer Liang Niu Cheryl E. Praeger Hongxun Qin Edmund Robertson Vojtech Rödl Martin Schönert Ronald Solomon Eric Swartz Tibor Szabó Mario Szegedy László A. Székely Vladimir Ivanovich Trofimov Vasyl UstimenkoVasiliy A. Ustimenko Iván Weisz Douglas B. West Henny A. Wilbrink Andrew J. Woldar Tsai-Lien Wong Xuding Zhu