Tibor Szabó

2009
32	EE	Robert Berke, Tibor Szabó: Deciding Relaxed Two-Colourability: A Hardness Jump. Combinatorics, Probability & Computing 18(1-2): 53-81 (2009)
31	EE	Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó: Fast winning strategies in Maker-Breaker games. J. Comb. Theory, Ser. B 99(1): 39-47 (2009)
30	EE	Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó: A sharp threshold for the Hamilton cycle Maker-Breaker game. Random Struct. Algorithms 34(1): 112-122 (2009)
2008
29	EE	Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó: Planarity, Colorability, and Minor Games. SIAM J. Discrete Math. 22(1): 194-212 (2008)
2007
28	EE	Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó: Fast winning strategies in positional games. Electronic Notes in Discrete Mathematics 29: 213-217 (2007)
27	EE	Dan Hefetz, Michael Krivelevich, Tibor Szabó: Bart-Moe games, JumbleG and discrepancy. Eur. J. Comb. 28(4): 1131-1143 (2007)
26	EE	Dan Hefetz, Michael Krivelevich, Tibor Szabó: Avoider-Enforcer games. J. Comb. Theory, Ser. A 114(5): 840-853 (2007)
25	EE	Robert Berke, Tibor Szabó: Relaxed two-coloring of cubic graphs. J. Comb. Theory, Ser. B 97(4): 652-668 (2007)
24	EE	Noga Alon, Anja Krech, Tibor Szabó: Tur[a-acute]n's Theorem in the Hypercube. SIAM J. Discrete Math. 21(1): 66-72 (2007)
2006
23	EE	Robert Berke, Tibor Szabó: Deciding Relaxed Two-Colorability - A Hardness Jump. ESA 2006: 124-135
22	EE	Tibor Szabó, Gábor Tardos: Extremal Problems For Transversals In Graphs With Bounded Degree. Combinatorica 26(3): 333-351 (2006)
21	EE	Penny E. Haxell, Tibor Szabó: Odd Independent Transversals are Odd. Combinatorics, Probability & Computing 15(1-2): 193-211 (2006)
2005
20	EE	Ingo Schurr, Tibor Szabó: Jumping Doesn't Help in Abstract Cubes. IPCO 2005: 225-235
19	EE	Noga Alon, Michael Krivelevich, Joel Spencer, Tibor Szabó: Discrepancy Games. Electr. J. Comb. 12: (2005)
18	EE	Tibor Szabó, Van H. Vu: Exact k-Wise Intersection Theorems. Graphs and Combinatorics 21(2): 247-261 (2005)
17	EE	Benny Sudakov, Tibor Szabó, Van H. Vu: A generalization of Turán's theorem. Journal of Graph Theory 49(3): 187-195 (2005)
16	EE	Milos Stojakovic, Tibor Szabó: Positional games on random graphs. Random Struct. Algorithms 26(1-2): 204-223 (2005)
2004
15	EE	Jirí Matousek, Tibor Szabó: Random Edge Can Be Exponential on Abstract Cubes. FOCS 2004: 92-100
14	EE	Sarolta Dibuz, Tibor Szabó, Zsolt Torpis: BCMP Performance Test with TTCN-3 Mobile Node Emulator. TestCom 2004: 50-59
13	EE	Michael Krivelevich, Benny Sudakov, Tibor Szabó: Triangle Factors In Sparse Pseudo-Random Graphs. Combinatorica 24(3): 403-426 (2004)
12	EE	Ingo Schurr, Tibor Szabó: Finding the Sink Takes Some Time: An Almost Quadratic Lower Bound for Finding the Sink of Unique Sink Oriented Cubes. Discrete & Computational Geometry 31(4): 627-642 (2004)
2003
11	EE	Tibor Szabó: On the spectrum of projective norm-graphs. Inf. Process. Lett. 86(2): 71-74 (2003)
10	EE	Penny E. Haxell, Tibor Szabó, Gábor Tardos: Bounded size components--partitions and transversals. J. Comb. Theory, Ser. B 88(2): 281-297 (2003)
9	EE	Tibor Szabó, Van H. Vu: Turán's theorem in sparse random graphs. Random Struct. Algorithms 23(3): 225-234 (2003)
2002
8	EE	Ingo Schurr, Tibor Szabó: Finding the Sink Takes Some Time. ESA 2002: 833-844
2001
7		Tibor Szabó, Emo Welzl: Unique Sink Orientations of Cubes. FOCS 2001: 547-555
6		Tibor Szabó, Gábor Tardos: A Multidimensional Generalization Of The Erdös-Szekeres Lemma On Monotone Subsequences. Combinatorics, Probability & Computing 10(6): (2001)
1999
5	EE	Noga Alon, Lajos Rónyai, Tibor Szabó: Norm-Graphs: Variations and Applications. J. Comb. Theory, Ser. B 76(2): 280-290 (1999)
1996
4	EE	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. STOC 1996: 603-611
3		János Kollár, Lajos Rónyai, Tibor Szabó: Norm-Graphs and Bipartite Turán Numbers. Combinatorica 16(3): 399-406 (1996)
2	EE	Tibor Szabó: On nearly regular co-critical graphs. Discrete Mathematics 160(1-3): 279-281 (1996)
1995
1	EE	Ákos Seress, Tibor Szabó: Dense Graphs with Cycle Neighborhoods. J. Comb. Theory, Ser. B 63(2): 281-293 (1995)

Coauthor Index

1	Noga Alon	[5] [19] [24]
2	László Babai	[4]
3	Robert Berke	[23] [25] [32]
4	Sarolta Dibuz	[14]
5	Anna Gál	[4]
6	Penny E. Haxell	[10] [21]
7	Dan Hefetz	[26] [27] [28] [29] [30] [31]
8	János Kollár	[3] [4]
9	Anja Krech	[24]
10	Michael Krivelevich	[13] [19] [26] [27] [28] [29] [30] [31]
11	Jirí Matousek	[15]
12	Lajos Rónyai	[3] [4] [5]
13	Ingo Schurr	[8] [12] [20]
14	Ákos Seress	[1]
15	Joel H. Spencer (Joel Spencer)	[19]
16	Milos Stojakovic	[16] [28] [29] [30] [31]
17	Benny Sudakov	[13] [17]
18	Gábor Tardos	[6] [10] [22]
19	Zsolt Torpis	[14]
20	Van H. Vu	[9] [17] [18]
21	Emo Welzl	[7]
22	Avi Wigderson	[4]

Colors in the list of coauthors