Tibor Szabó
Free University of Berlin, Germany
http://page.mi.fu-berlin.de/szabo/
https://zbmath.org/authors/?q=ai:szabo.tibor
https://mathscinet.ams.org/mathscinet/MRAuthorID/360183
https://mathgenealogy.org/id.php?id=10540
https://www.wikidata.org/entity/Q56599446
Michael Anastos
David Fabian
Alp Müyesser
Tibor Szabó
Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.
2023
30
Electron. J. Comb.
3
https://doi.org/10.37236/11714
db/journals/combinatorics/combinatorics30.html#AnastosFMS23
Olaf Parczyk
Sebastian Pokutta
Christoph Spiegel 0002
Tibor Szabó
Fully Computer-Assisted Proofs in Extremal Combinatorics.
12482-12490
2023
AAAI
https://doi.org/10.1609/aaai.v37i10.26470
conf/aaai/2023
db/conf/aaai/aaai2023.html#ParczykP0S23
Penny Haxell
Tibor Szabó
Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole.
2875-2897
2023
SODA
https://doi.org/10.1137/1.9781611977554.ch109
conf/soda/2023
db/conf/soda/soda2023.html#HaxellS23
Lior Gishboliner
Raphael Steiner
Tibor Szabó
Oriented Cycles in Digraphs of Large Outdegree.
1145-1187
2022
December
42
Comb.
6
https://doi.org/10.1007/s00493-021-4750-z
db/journals/combinatorica/combinatorica42.html#GishbolinerSS22
Lior Gishboliner
Raphael Steiner
Tibor Szabó
Dichromatic number and forced subdivisions.
1-30
2022
153
J. Comb. Theory, Ser. B
https://doi.org/10.1016/j.jctb.2021.10.002
db/journals/jctb/jctb153.html#GishbolinerSS22
Penny Haxell
Tibor Szabó
Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole.
2022
abs/2202.01143
CoRR
https://arxiv.org/abs/2202.01143
db/journals/corr/corr2202.html#abs-2202-01143
Michael Anastos
Ander Lamaison
Raphael Steiner
Tibor Szabó
Majority Colorings of Sparse Digraphs.
2
2021
28
Electron. J. Comb.
2
https://doi.org/10.37236/10067
db/journals/combinatorics/combinatorics28.html#AnastosLSS21
Anurag Bishnoi
Shagnik Das
Patrick Morris 0001
Tibor Szabó
Ryser's Conjecture for t-intersecting hypergraphs.
105366
2021
179
J. Comb. Theory, Ser. A
https://doi.org/10.1016/j.jcta.2020.105366
https://www.wikidata.org/entity/Q113871630
db/journals/jcta/jcta179.html#BishnoiDMS21
Noga Alon
Matija Bucic
Tom Kalvari
Eden Kuperwasser
Tibor Szabó
List Ramsey numbers.
109-128
2021
96
J. Graph Theory
1
https://doi.org/10.1002/jgt.22610
https://www.wikidata.org/entity/Q114236154
db/journals/jgt/jgt96.html#AlonBKKS21
Simona Boyadzhiyska
Shagnik Das
Tibor Szabó
Enumerating extensions of mutually orthogonal Latin squares.
2187-2206
2020
88
Des. Codes Cryptogr.
10
https://doi.org/10.1007/s10623-020-00771-6
db/journals/dcc/dcc88.html#BoyadzhiyskaDS20
Jan Corsten
Adva Mond
Alexey Pokrovskiy
Christoph Spiegel 0002
Tibor Szabó
On the odd cycle game and connected rules.
103140
2020
89
Eur. J. Comb.
https://doi.org/10.1016/j.ejc.2020.103140
db/journals/ejc/ejc89.html#CorstenMPSS20
A. Abu-Khazneh
János Barát
Alexey Pokrovskiy
Tibor Szabó
A family of extremal hypergraphs for Ryser's conjecture.
164-177
2019
161
J. Comb. Theory, Ser. A
https://doi.org/10.1016/j.jcta.2018.07.011
db/journals/jct/jcta161.html#Abu-KhaznehBPS19
Christopher Kusch
Juanjo Rué
Christoph Spiegel 0002
Tibor Szabó
On the optimality of the uniform random strategy.
371-401
2019
55
Random Struct. Algorithms
2
https://doi.org/10.1002/rsa.20829
db/journals/rsa/rsa55.html#KuschRSS19
Penny Haxell
Lothar Narins
Tibor Szabó
Extremal hypergraphs for Ryser's Conjecture.
492-547
2018
158
J. Comb. Theory, Ser. A
https://doi.org/10.1016/j.jcta.2018.04.004
db/journals/jct/jcta158.html#HaxellNS18
Hiêp Hàn
Vojtech Rödl
Tibor Szabó
Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs.
826-838
2018
32
SIAM J. Discret. Math.
2
https://doi.org/10.1137/17M1116696
db/journals/siamdm/siamdm32.html#HanRS18
Lothar Narins
Alexey Pokrovskiy
Tibor Szabó
Graphs without proper subgraphs of minimum degree 3 and short cycles.
495-519
2017
37
Comb.
3
https://doi.org/10.1007/s00493-015-3310-9
db/journals/combinatorica/combinatorica37.html#NarinsPS17
Christopher Kusch
Juanjo Rué
Christoph Spiegel 0002
Tibor Szabó
Random Strategies are Nearly Optimal for Generalized van der Waerden Games.
789-795
2017
61
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2017.07.037
db/journals/endm/endm61.html#KuschRSS17
Jonas Groschwitz
Tibor Szabó
Sharp Thresholds for Half-Random Games II.
387-401
2017
33
Graphs Comb.
2
https://doi.org/10.1007/s00373-016-1753-4
db/journals/gc/gc33.html#GroschwitzS17
Krisztián Szigeti
Tibor Szabó
Csaba Korom
Ilona Czibak
Ildikó Horváth
Dániel S. Veres
Zoltán Gyöngyi
Kinga Karlinger
Ralf Bergmann
Márta Pócsik
Ferenc Budán
Domokos Máthé
Radiomics-based differentiation of lung disease models generated by polluted air based on X-ray computed tomography data.
14
2016
16
BMC Medical Imaging
https://doi.org/10.1186/s12880-016-0118-z
https://www.wikidata.org/entity/Q31044184
db/journals/bmcmi/bmcmi16.html#SzigetiSKCHVGKB16
Heidi Gebauer
Tibor Szabó
Gábor Tardos
The Local Lemma Is Asymptotically Tight for SAT.
43:1-43:32
2016
63
J. ACM
5
https://doi.org/10.1145/2975386
db/journals/jacm/jacm63.html#GebauerST16
Jacob Fox
Andrey Grinshpun
Anita Liebenau
Yury Person
Tibor Szabó
On the minimum degree of minimal Ramsey graphs for multiple colours.
64-82
2016
120
J. Comb. Theory, Ser. B
https://doi.org/10.1016/j.jctb.2016.03.006
db/journals/jct/jctb120.html#FoxGLPS16
Jonas Groschwitz
Tibor Szabó
Sharp thresholds for half-random games I.
766-794
2016
49
Random Struct. Algorithms
4
https://doi.org/10.1002/rsa.20681
db/journals/rsa/rsa49.html#GroschwitzS16
Gábor Sipka
Tibor Szabó
Ráhel Zölei-Szénási
Melinda Vanya
Mária Jakó
Tamás Dániel Nagy
Márta Fidrich
Vilmos Bilicki
János Borbás
Tamás Bitó
György Bártfai
Monitoring of Fetal Heart Rate via iPhone.
492-496
2016
eHealth 360°
https://doi.org/10.1007/978-3-319-49655-9_60
conf/ehealth360/2016
db/conf/ehealth360/ehealth2016.html#SipkaSZVJNFBBBB16
Zachary Abel
Robert Connelly
Sarah Eisenstat
Radoslav Fulek
Filip Moric
Yoshio Okamoto
Tibor Szabó
Csaba D. Tóth
Free Edge Lengths in Plane Graphs.
259-289
2015
54
Discret. Comput. Geom.
1
https://doi.org/10.1007/s00454-015-9704-z
db/journals/dcg/dcg54.html#AbelCEFMOST15
Roman Glebov
Anita Liebenau
Tibor Szabó
On the Concentration of the Domination Number of the Random Graph.
1186-1206
2015
29
SIAM J. Discret. Math.
3
https://doi.org/10.1137/12090054X
db/journals/siamdm/siamdm29.html#GlebovLS15
Roman Glebov
Benny Sudakov
Tibor Szabó
How Many Colors Guarantee a Rainbow Matching?
1
2014
21
Electron. J. Comb.
1
https://doi.org/10.37236/3742
db/journals/combinatorics/combinatorics21.html#GlebovSS14
Roman Glebov
Tibor Szabó
Gábor Tardos
Conflict-Free Colouring of Graphs.
434-448
2014
23
Comb. Probab. Comput.
3
https://doi.org/10.1017/S0963548313000540
db/journals/cpc/cpc23.html#GlebovST14
Jacob Fox
Andrey Grinshpun
Anita Liebenau
Yury Person
Tibor Szabó
What is Ramsey-equivalent to a clique?
120-133
2014
109
J. Comb. Theory, Ser. B
https://doi.org/10.1016/j.jctb.2014.06.003
db/journals/jct/jctb109.html#FoxGLPS14
Codrut Grosu
Yury Person
Tibor Szabó
On the rank of higher inclusion matrices.
333-349
2014
90
J. Lond. Math. Soc.
2
https://doi.org/10.1112/jlms/jdu029
db/journals/jlms/jlms90.html#GrosuPS14
Roman Glebov
Michael Krivelevich
Tibor Szabó
On covering expander graphs by hamilton cycles.
183-200
2014
44
Random Struct. Algorithms
2
https://doi.org/10.1002/rsa.20455
db/journals/rsa/rsa44.html#GlebovKS14
Zachary Abel
Robert Connelly
Sarah Eisenstat
Radoslav Fulek
Filip Moric
Yoshio Okamoto
Tibor Szabó
Csaba D. Tóth
Free Edge Lengths in Plane Graphs.
426
2014
SoCG
https://doi.org/10.1145/2582112.2582172
conf/compgeom/2014
db/conf/compgeom/compgeom2014.html#AbelCEFMOST14
Robert Berke
Penny E. Haxell
Tibor Szabó
Bounded transversals in multipartite graphs.
318-331
2012
70
J. Graph Theory
3
https://doi.org/10.1002/jgt.20618
db/journals/jgt/jgt70.html#BerkeHS12
Dan Hefetz
Michael Krivelevich
Tibor Szabó
Sharp threshold for the appearance of certain spanning trees in random graphs.
391-412
2012
41
Random Struct. Algorithms
4
https://doi.org/10.1002/rsa.20472
db/journals/rsa/rsa41.html#HefetzKS12
Dan Hefetz
Michael Krivelevich
Milos Stojakovic
Tibor Szabó
Global Maker-Breaker games on sparse graphs.
162-177
2011
32
Eur. J. Comb.
2
https://doi.org/10.1016/j.ejc.2010.09.005
db/journals/ejc/ejc32.html#HefetzKSS11
Heidi Gebauer
Tibor Szabó
Gábor Tardos
The Local Lemma is Tight for SAT.
664-674
2011
SODA
https://doi.org/10.1137/1.9781611973082.52
http://dl.acm.org/citation.cfm?id=2133088
conf/soda/2011
db/conf/soda/soda2011.html#GebauerST11
Dan Hefetz
Michael Krivelevich
Milos Stojakovic
Tibor Szabó
Avoider-Enforcer: The rules of the game.
152-163
2010
117
J. Comb. Theory, Ser. A
2
https://doi.org/10.1016/j.jcta.2009.05.001
db/journals/jct/jcta117.html#HefetzKSS10
Tibor Szabó
Philipp Zumstein
Stefanie Zürcher
On the minimum degree of minimal Ramsey graphs.
150-164
2010
64
J. Graph Theory
2
https://doi.org/10.1002/jgt.20445
https://www.wikidata.org/entity/Q56475798
db/journals/jgt/jgt64.html#SzaboZZ10
Heidi Gebauer
Tibor Szabó
Gábor Tardos
The Local Lemma Is Tight for SAT
http://arxiv.org/abs/1006.0744
2010
CoRR
abs/1006.0744
db/journals/corr/corr1006.html#abs-1006-0744
Dan Hefetz
Michael Krivelevich
Tibor Szabó
Hamilton cycles in highly connected and expanding graphs.
547-568
2009
29
Comb.
5
https://doi.org/10.1007/s00493-009-2362-0
db/journals/combinatorica/combinatorica29.html#HefetzKS09
Robert Berke
Tibor Szabó
Deciding Relaxed Two-Colourability: A Hardness Jump.
53-81
2009
18
Comb. Probab. Comput.
1-2
https://doi.org/10.1017/S0963548309009663
db/journals/cpc/cpc18.html#BerkeS09
Ron Aharoni
Tibor Szabó
Vizing's conjecture for chordal graphs.
1766-1768
2009
309
Discret. Math.
6
https://doi.org/10.1016/j.disc.2008.02.025
db/journals/dm/dm309.html#AharoniS09
Dan Hefetz
Michael Krivelevich
Milos Stojakovic
Tibor Szabó
Avoider-Enforcer: The Rules of the Game.
261-265
2009
34
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2009.07.100
db/journals/endm/endm34.html#HefetzKSS09
Dan Hefetz
Michael Krivelevich
Milos Stojakovic
Tibor Szabó
Fast Winning Strategies in Avoider-Enforcer Games.
533-544
2009
25
Graphs Comb.
4
https://doi.org/10.1007/s00373-009-0870-8
db/journals/gc/gc25.html#HefetzKSS09
Dan Hefetz
Michael Krivelevich
Milos Stojakovic
Tibor Szabó
Fast winning strategies in Maker-Breaker games.
39-47
2009
99
J. Comb. Theory, Ser. B
1
https://doi.org/10.1016/j.jctb.2008.04.001
db/journals/jct/jctb99.html#HefetzKSS09
Dan Hefetz
Michael Krivelevich
Milos Stojakovic
Tibor Szabó
A sharp threshold for the Hamilton cycle Maker-Breaker game.
112-122
2009
34
Random Struct. Algorithms
1
https://doi.org/10.1002/rsa.20252
db/journals/rsa/rsa34.html#HefetzKSS09
Heidi Gebauer
Tibor Szabó
Asymptotic random graph intuition for the biased connectivity game.
431-443
2009
35
Random Struct. Algorithms
4
https://doi.org/10.1002/rsa.20279
db/journals/rsa/rsa35.html#GebauerS09
V. Anuradha
Chinmay Jain
Jack Snoeyink
Tibor Szabó
How Long Can a Graph be Kept Planar?
2008
15
Electron. J. Comb.
1
http://www.combinatorics.org/Volume_15/Abstracts/v15i1n14.html
db/journals/combinatorics/combinatorics15.html#AnuradhaJSS08
Michael Krivelevich
Tibor Szabó
Biased Positional Games and Small Hypergraphs with Large Covers.
2008
15
Electron. J. Comb.
1
http://www.combinatorics.org/Volume_15/Abstracts/v15i1r70.html
db/journals/combinatorics/combinatorics15.html#KrivelevichS08
Dan Hefetz
Michael Krivelevich
Milos Stojakovic
Tibor Szabó
Planarity, Colorability, and Minor Games.
194-212
2008
22
SIAM J. Discret. Math.
1
https://doi.org/10.1137/060654414
db/journals/siamdm/siamdm22.html#HefetzKSS08
Dan Hefetz
Michael Krivelevich
Tibor Szabó
Bart-Moe games, JumbleG and discrepancy.
1131-1143
2007
28
Eur. J. Comb.
4
https://doi.org/10.1016/j.ejc.2006.03.004
db/journals/ejc/ejc28.html#HefetzKS07
Dan Hefetz
Michael Krivelevich
Milos Stojakovic
Tibor Szabó
Fast winning strategies in positional games.
213-217
2007
29
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2007.07.046
db/journals/endm/endm29.html#HefetzKSS07
Robert Berke
Tibor Szabó
Relaxed two-coloring of cubic graphs.
652-668
2007
97
J. Comb. Theory, Ser. B
4
https://doi.org/10.1016/j.jctb.2006.12.001
db/journals/jct/jctb97.html#BerkeS07
Dan Hefetz
Michael Krivelevich
Tibor Szabó
Avoider-Enforcer games.
840-853
2007
114
J. Comb. Theory, Ser. A
5
https://doi.org/10.1016/j.jcta.2006.10.001
db/journals/jct/jcta114.html#HefetzKS07
Noga Alon
Anja Krech
Tibor Szabó
Tur[a-acute]n's Theorem in the Hypercube.
66-72
2007
21
SIAM J. Discret. Math.
1
https://doi.org/10.1137/060649422
db/journals/siamdm/siamdm21.html#AlonKS07
Tibor Szabó
Gábor Tardos
Extremal Problems For Transversals In Graphs With Bounded Degree.
333-351
2006
26
Comb.
3
https://doi.org/10.1007/s00493-006-0019-9
db/journals/combinatorica/combinatorica26.html#SzaboT06
Penny E. Haxell
Tibor Szabó
Odd Independent Transversals are Odd.
193-211
2006
15
Comb. Probab. Comput.
1-2
https://doi.org/10.1017/S0963548305007157
db/journals/cpc/cpc15.html#HaxellS06
Robert Berke
Tibor Szabó
Deciding Relaxed Two-Colorability - A Hardness Jump.
124-135
2006
conf/esa/2006
ESA
https://doi.org/10.1007/11841036_14
db/conf/esa/esa2006.html#BerkeS06
Noga Alon
Michael Krivelevich
Joel Spencer
Tibor Szabó
Discrepancy Games.
2005
12
Electron. J. Comb.
https://doi.org/10.37236/1948
db/journals/combinatorics/combinatorics12.html#AlonKSS05
Tibor Szabó
Van H. Vu
Exact k-Wise Intersection Theorems.
247-261
2005
21
Graphs Comb.
2
https://doi.org/10.1007/s00373-005-0609-0
db/journals/gc/gc21.html#SzaboV05
Benny Sudakov
Tibor Szabó
Van H. Vu
A generalization of Turán's theorem.
187-195
2005
49
J. Graph Theory
3
https://doi.org/10.1002/jgt.20074
db/journals/jgt/jgt49.html#SudakovSV05
Milos Stojakovic
Tibor Szabó
Positional games on random graphs.
204-223
2005
26
Random Struct. Algorithms
1-2
https://doi.org/10.1002/rsa.20059
db/journals/rsa/rsa26.html#StojakovicS05
Ingo Schurr
Tibor Szabó
Jumping Doesn't Help in Abstract Cubes.
225-235
2005
conf/ipco/2005
IPCO
https://doi.org/10.1007/11496915_17
db/conf/ipco/ipco2005.html#SchurrS05
Michael Krivelevich
Benny Sudakov
Tibor Szabó
Triangle Factors In Sparse Pseudo-Random Graphs.
403-426
2004
24
Comb.
3
https://doi.org/10.1007/s00493-004-0025-8
https://www.wikidata.org/entity/Q105583373
db/journals/combinatorica/combinatorica24.html#KrivelevichSS04
Ingo Schurr
Tibor Szabó
Finding the Sink Takes Some Time: An Almost Quadratic Lower Bound for Finding the Sink of Unique Sink Oriented Cubes.
627-642
2004
31
Discret. Comput. Geom.
4
https://doi.org/10.1007/s00454-003-0813-8
db/journals/dcg/dcg31.html#SchurrS04
Jirí Matousek 0001
Tibor Szabó
Random Edge Can Be Exponential on Abstract Cubes.
92-100
2004
conf/focs/2004
FOCS
https://doi.org/10.1109/FOCS.2004.56
https://doi.ieeecomputersociety.org/10.1109/FOCS.2004.56
db/conf/focs/focs2004.html#MatousekS04
Sarolta Dibuz
Tibor Szabó
Zsolt Torpis
BCMP Performance Test with TTCN-3 Mobile Node Emulator.
50-59
https://doi.org/10.1007/978-3-540-24704-3_4
2004
conf/pts/2004
TestCom
db/conf/pts/testcom2004.html#DibuzST04
Tibor Szabó
On the spectrum of projective norm-graphs.
71-74
2003
86
Inf. Process. Lett.
2
https://doi.org/10.1016/S0020-0190(02)00482-9
db/journals/ipl/ipl86.html#Szabo03
Penny E. Haxell
Tibor Szabó
Gábor Tardos
Bounded size components--partitions and transversals.
281-297
2003
88
J. Comb. Theory, Ser. B
2
https://doi.org/10.1016/S0095-8956(03)00031-5
db/journals/jct/jctb88.html#HaxellST03
Tibor Szabó
Van H. Vu
Turán's theorem in sparse random graphs.
225-234
2003
23
Random Struct. Algorithms
3
https://doi.org/10.1002/rsa.10088
https://www.wikidata.org/entity/Q97694876
db/journals/rsa/rsa23.html#SzaboV03
Ingo Schurr
Tibor Szabó
Finding the Sink Takes Some Time.
833-844
2002
conf/esa/2002
ESA
https://doi.org/10.1007/3-540-45749-6_72
db/conf/esa/esa2002.html#SchurrS02
Tibor Szabó
Gábor Tardos
A Multidimensional Generalization Of The Erdös-Szekeres Lemma On Monotone Subsequences.
2001
10
Comb. Probab. Comput.
6
db/journals/cpc/cpc10.html#SzaboT01
https://doi.org/10.1017/S0963548301004862
557-565
Tibor Szabó
Emo Welzl
Unique Sink Orientations of Cubes.
547-555
2001
conf/focs/2001
FOCS
db/conf/focs/focs2001.html#SzaboW01
https://doi.org/10.1109/SFCS.2001.959931
https://doi.ieeecomputersociety.org/10.1109/SFCS.2001.959931
Tibor Szabó
Intersection Properties of Subsets of Integers.
429-444
1999
20
Eur. J. Comb.
5
https://doi.org/10.1006/eujc.1997.0176
db/journals/ejc/ejc20.html#Szabo99
Á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
Noga Alon
Lajos Rónyai
Tibor Szabó
Norm-Graphs: Variations and Applications.
280-290
1999
76
J. Comb. Theory, Ser. B
2
https://doi.org/10.1006/jctb.1999.1906
https://www.wikidata.org/entity/Q29039716
db/journals/jct/jctb76.html#AlonRS99
János Kollár
Lajos Rónyai
Tibor Szabó
Norm-Graphs and Bipartite Turán Numbers.
399-406
1996
16
Comb.
3
db/journals/combinatorica/combinatorica16.html#KollarRS96
https://doi.org/10.1007/BF01261323
Tibor Szabó
On nearly regular co-critical graphs.
279-281
1996
160
Discret. Math.
1-3
https://doi.org/10.1016/0012-365X(95)00121-C
db/journals/dm/dm160.html#Szabo96
László Babai
Anna Gál
János Kollár
Lajos Rónyai
Tibor Szabó
Avi Wigderson
Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs.
603-611
1996
conf/stoc/1996
STOC
https://doi.org/10.1145/237814.238010
db/conf/stoc/stoc1996.html#BabaiGKRSW96
Ákos Seress
Tibor Szabó
Dense Graphs with Cycle Neighborhoods.
281-293
1995
63
J. Comb. Theory, Ser. B
2
https://doi.org/10.1006/jctb.1995.1020
db/journals/jct/jctb63.html#SeressS95
Zachary Abel
A. Abu-Khazneh
Ron Aharoni
Noga Alon
Michael Anastos
V. Anuradha
László Babai
János Barát
György Bártfai
Ralf Bergmann
Robert Berke
Vilmos Bilicki
Anurag Bishnoi
Tamás Bitó
János Borbás
Simona Boyadzhiyska
Matija Bucic
Ferenc Budán
Robert Connelly
Jan Corsten
Ilona Czibak
Shagnik Das
Sarolta Dibuz
Sarah Eisenstat
David Fabian
Márta Fidrich
Jacob Fox
Radoslav Fulek
Anna Gál
Heidi Gebauer
Lior Gishboliner
Roman Glebov
Andrey Grinshpun
Jonas Groschwitz
Codrut Grosu
Zoltán Gyöngyi
Hiêp Hàn
Penny E. HaxellPenny Haxell
Dan Hefetz
Ildikó Horváth
Chinmay Jain
Mária Jakó
Tom Kalvari
Kinga Karlinger
János Kollár
Csaba Korom
Anja Krech
Michael Krivelevich
Eden Kuperwasser
Christopher Kusch
Ander Lamaison
Anita Liebenau
Domokos Máthé
Jirí Matousek 0001
Adva Mond
Filip Moric
Patrick Morris 0001
Alp Müyesser
Tamás D. NagyTamás Dániel Nagy
Lothar Narins
Yoshio Okamoto
Olaf Parczyk
Yury Person
Márta Pócsik
Alexey Pokrovskiy
Sebastian Pokutta
Vojtech Rödl
Lajos Rónyai
Juanjo Rué
Ingo Schurr
Ákos Seress
Gábor Sipka
Jack Snoeyink
Joel H. SpencerJoel Spencer
Christoph Spiegel 0002
Raphael Steiner
Milos Stojakovic
Benny Sudakov
Krisztián Szigeti
Gábor Tardos
Zsolt Torpis
Csaba D. Tóth
Melinda Vanya
Dániel S. Veres
Van H. Vu
Emo Welzl
Avi Wigderson
Ráhel Zölei-Szénási
Philipp Zumstein
Stefanie Zürcher