Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Seress, {\'A}kos"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Disconnected colors in generalized Gallai-Colorings
Shinya Fujita
,
András Gyárfás
,
Colton Magnant
,
Ákos Seress
Journal of Graph Theory
74
(1), 2013, pp. 104-114
Bounded degree, triangle avoidance graph games
Nishali Mehta
,
Ákos Seress
Graphs and Combinatorics
29
(3), 2013, pp. 637-660
Construction of 2-closed M-representations
Ákoss Seress
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC'2012 (Grenoble, France, July 22-25, 2012)
, 2012, pp. 311-318
A note on the girth-doubling construction for polygonal graphs
Ákos Seress
,
Eric Swartz
Journal of Graph Theory
68
(3), 2011, pp. 246-254
Distinguishing labeling of the actions of almost simple groups
Ákos Seress
,
Tsai-Lien Wong
,
Xuding Zhu
Combinatorica
31
(4), 2011, pp. 489-506
The vertex primitive and vertex bi-primitive
s
-arc regular graphs
Cai Heng Li
,
Liang Niu
,
Ákos Seress
,
Ronald Solomon
Journal of Combinatorial Theory Series B
100
(4), 2010, pp. 359-366
Polynomial-time theory of matrix groups
László Babai
,
Robert Beals
,
Ákos Seress
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 55-64
On limit graphs of finite vertex-primitive graphs
Michael Giudici
,
Cai Heng Li
,
Cheryl E. Praeger
,
Ákos Seress
,
Vladimir I. Trofimov
Journal of Combinatorial Theory Series A
114
(1), 2007, pp. 110-134
Symmetrical path-cycle covers of a graph and polygonal graphs
Cai Heng Li
,
Ákos Seress
Journal of Combinatorial Theory Series A
114
(1), 2007, pp. 35-51
A data structure for a uniform approach to computations with finite groups
Max Neunhöffer
,
Ákos Seress
Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, ISSAC'2006 (Università degli Studi di Genova, Genova, Italy, July 9-12, 2006)
, 2006, pp. 254-261
On Dowling geometries of infinite groups
Peter Brooksbank
,
Hongxun Qin
,
Edmund Robertson
,
Ákos Seress
Journal of Combinatorial Theory Series A
108
(1), 2004, pp. 155-158
Erd\Hos-Ko-Rado and Hilton-Milner type theorems for intersecting chains in posets
Péter L. Erdŏs
,
Ákos Seress
,
László A. Székely
Combinatorica
20
(1), 2000, pp. 27-45
On Erd\Hos's Eulerian trail game
Ákos Seress
,
Tibor Szabó
Graphs and Combinatorics
15
(2), 1999, pp. 233-237
Fast management of permutation groups I
László Babai
,
Eugene M. Luks
,
Ákos Seress
SIAM Journal on Computing
26
(5), 1997, pp. 1310-1342
Fast Monte Carlo algorithms for permutation groups
László Babai
,
Gene Cooperman
,
Larry Finkelstein
,
Eugene Luks
,
Ákos Seress
Journal of Computer and System Sciences
50
(2), 1995, pp. 296-308
Dense graphs with cycle neighborhoods
Ákos Seress
,
Tibor Szabó
Journal of Combinatorial Theory Series B
63
(2), 1995, pp. 281-293
Maximal triangle-free graphs with restrictions on the degrees
Zoltán Füredi
,
Ákos Seress
Journal of Graph Theory
18
(1), 1994, pp. 11-24
Finding blocks of imprimitivity in small-base groups in nearly linear time
Martin Schönert
,
Ákos Seress
Proceedings of the 1994 International Symposium on Symbolic and Algebraic Computation, ISSAC'94 (Oxford, England, United Kingdom, July 20-22, 1994)
, 1994, pp. 154-157
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, STOC'92 (Victoria, British Columbia, Canada, May 4-6, 1992)
, 1992, pp. 116-125
On Hajnal's triangle-free game
Ákoss Seress
Graphs and Combinatorics
8
, 1992, pp. 75-79
Some characterizations of type-1
\lambda
-designs
Ákos Seress
Journal of Combinatorial Theory Series A
52
, 1989, pp. 288-300
On the diameter of Cayley graphs of the symmetric group
László Babai
,
Ákos Seress
Journal of Combinatorial Theory Series A
49
, 1988, pp. 175-179
Quick gossiping by conference calls
Ákos Seress
SIAM Journal on Discrete Mathematics
1
, 1988, pp. 109-120
On the degree of transitivity of permutation groups: A short proof
László Babai
,
Ákos Seress
Journal of Combinatorial Theory Series A
45
, 1987, pp. 310-315
Quick gossiping without duplicate transmissions
Ákos Seress
Graphs and Combinatorics
2
, 1986, pp. 363-381