Tibor Szabó

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2012
j39		Robert Berke, Penny E. Haxell, Tibor Szabó: Bounded transversals in multipartite graphs. Journal of Graph Theory 70(3): 318-331 (2012)
j38		Dan Hefetz, Michael Krivelevich, Tibor Szabó: Sharp threshold for the appearance of certain spanning trees in random graphs. Random Struct. Algorithms 41(4): 391-412 (2012)
	2011
j37		Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó: Global Maker-Breaker games on sparse graphs. Eur. J. Comb. 32(2): 162-177 (2011)
c8		Heidi Gebauer, Tibor Szabó, Gábor Tardos: The Local Lemma is Tight for SAT. SODA 2011: 664-674
	2010
j36		Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó: Avoider-Enforcer: The rules of the game. J. Comb. Theory, Ser. A 117(2): 152-163 (2010)
j35		Tibor Szabó, Philipp Zumstein, Stefanie Zürcher: On the minimum degree of minimal Ramsey graphs. Journal of Graph Theory 64(2): 150-164 (2010)
i1		Heidi Gebauer, Tibor Szabó, Gábor Tardos: The Local Lemma Is Tight for SAT. CoRR abs/1006.0744 (2010)
	2009
j34		Dan Hefetz, Michael Krivelevich, Tibor Szabó: Hamilton cycles in highly connected and expanding graphs. Combinatorica 29(5): 547-568 (2009)
j33		Robert Berke, Tibor Szabó: Deciding Relaxed Two-Colourability: A Hardness Jump. Combinatorics, Probability & Computing 18(1-2): 53-81 (2009)
j32		Ron Aharoni, Tibor Szabó: Vizing's conjecture for chordal graphs. Discrete Mathematics 309(6): 1766-1768 (2009)
j31		Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó: Avoider-Enforcer: The Rules of the Game. Electronic Notes in Discrete Mathematics 34: 261-265 (2009)
j30		Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó: Fast Winning Strategies in Avoider-Enforcer Games. Graphs and Combinatorics 25(4): 533-544 (2009)
j29		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)
j28		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)
j27		Heidi Gebauer, Tibor Szabó: Asymptotic random graph intuition for the biased connectivity game. Random Struct. Algorithms 35(4): 431-443 (2009)
	2008
j26		V. Anuradha, Chinmay Jain, Jack Snoeyink, Tibor Szabó: How Long Can a Graph be Kept Planar? Electr. J. Comb. 15(1) (2008)
j25		Michael Krivelevich, Tibor Szabó: Biased Positional Games and Small Hypergraphs with Large Covers. Electr. J. Comb. 15(1) (2008)
j24		Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó: Planarity, Colorability, and Minor Games. SIAM J. Discrete Math. 22(1): 194-212 (2008)
	2007
j23		Dan Hefetz, Michael Krivelevich, Tibor Szabó: Bart-Moe games, JumbleG and discrepancy. Eur. J. Comb. 28(4): 1131-1143 (2007)
j22		Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó: Fast winning strategies in positional games. Electronic Notes in Discrete Mathematics 29: 213-217 (2007)
j21		Robert Berke, Tibor Szabó: Relaxed two-coloring of cubic graphs. J. Comb. Theory, Ser. B 97(4): 652-668 (2007)
j20		Dan Hefetz, Michael Krivelevich, Tibor Szabó: Avoider-Enforcer games. J. Comb. Theory, Ser. A 114(5): 840-853 (2007)
j19		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
j18		Tibor Szabó, Gábor Tardos: Extremal Problems For Transversals In Graphs With Bounded Degree. Combinatorica 26(3): 333-351 (2006)
j17		Penny E. Haxell, Tibor Szabó: Odd Independent Transversals are Odd. Combinatorics, Probability & Computing 15(1-2): 193-211 (2006)
c7		Robert Berke, Tibor Szabó: Deciding Relaxed Two-Colorability - A Hardness Jump. ESA 2006: 124-135
	2005
j16		Noga Alon, Michael Krivelevich, Joel Spencer, Tibor Szabó: Discrepancy Games. Electr. J. Comb. 12 (2005)
j15		Tibor Szabó, Van H. Vu: Exact k-Wise Intersection Theorems. Graphs and Combinatorics 21(2): 247-261 (2005)
j14		Benny Sudakov, Tibor Szabó, Van H. Vu: A generalization of Turán's theorem. Journal of Graph Theory 49(3): 187-195 (2005)
j13		Milos Stojakovic, Tibor Szabó: Positional games on random graphs. Random Struct. Algorithms 26(1-2): 204-223 (2005)
c6		Ingo Schurr, Tibor Szabó: Jumping Doesn't Help in Abstract Cubes. IPCO 2005: 225-235
	2004
j12		Michael Krivelevich, Benny Sudakov, Tibor Szabó: Triangle Factors In Sparse Pseudo-Random Graphs. Combinatorica 24(3): 403-426 (2004)
j11		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)
c5		Jirí Matousek, Tibor Szabó: Random Edge Can Be Exponential on Abstract Cubes. FOCS 2004: 92-100
c4		Sarolta Dibuz, Tibor Szabó, Zsolt Torpis: BCMP Performance Test with TTCN-3 Mobile Node Emulator. TestCom 2004: 50-59
	2003
j10		Tibor Szabó: On the spectrum of projective norm-graphs. Inf. Process. Lett. 86(2): 71-74 (2003)
j9		Penny E. Haxell, Tibor Szabó, Gábor Tardos: Bounded size components--partitions and transversals. J. Comb. Theory, Ser. B 88(2): 281-297 (2003)
j8		Tibor Szabó, Van H. Vu: Turán's theorem in sparse random graphs. Random Struct. Algorithms 23(3): 225-234 (2003)
	2002
c3		Ingo Schurr, Tibor Szabó: Finding the Sink Takes Some Time. ESA 2002: 833-844
	2001
j7		Tibor Szabó, Gábor Tardos: A Multidimensional Generalization Of The Erdös-Szekeres Lemma On Monotone Subsequences. Combinatorics, Probability & Computing 10(6): 557-565 (2001)
c2		Tibor Szabó, Emo Welzl: Unique Sink Orientations of Cubes. FOCS 2001: 547-555
	1999
j6		Tibor Szabó: Intersection Properties of Subsets of Integers. Eur. J. Comb. 20(5): 429-444 (1999)
j5		Ákos Seress, Tibor Szabó: On Erdős's Eulerian Trail Game. Graphs and Combinatorics 15(2): 233-237 (1999)
j4		Noga Alon, Lajos Rónyai, Tibor Szabó: Norm-Graphs: Variations and Applications. J. Comb. Theory, Ser. B 76(2): 280-290 (1999)
	1996
j3		János Kollár, Lajos Rónyai, Tibor Szabó: Norm-Graphs and Bipartite Turán Numbers. Combinatorica 16(3): 399-406 (1996)
j2		Tibor Szabó: On nearly regular co-critical graphs. Discrete Mathematics 160(1-3): 279-281 (1996)
c1		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
	1995
j1		Ákos Seress, Tibor Szabó: Dense Graphs with Cycle Neighborhoods. J. Comb. Theory, Ser. B 63(2): 281-293 (1995)

Coauthor Index

1	Ron Aharoni	[j32]
2	Noga Alon	[j19] [j16] [j4]
3	V. Anuradha	[j26]
4	László Babai	[c1]
5	Robert Berke	[j39] [j33] [j21] [c7]
6	Sarolta Dibuz	[c4]
7	Heidi Gebauer	[c8] [i1] [j27]
8	Anna Gál	[c1]
9	Penny E. Haxell	[j39] [j17] [j9]
10	Dan Hefetz	[j38] [j37] [j36] [j34] [j31] [j30] [j29] [j28] [j24] [j23] [j22] [j20]
11	Chinmay Jain	[j26]
12	János Kollár	[j3] [c1]
13	Anja Krech	[j19]
14	Michael Krivelevich	[j38] [j37] [j36] [j34] [j31] [j30] [j29] [j28] [j25] [j24] [j23] [j22] [j20] [j16] [j12]
15	Jirí Matousek	[c5]
16	Lajos Rónyai	[j4] [j3] [c1]
17	Ingo Schurr	[c6] [j11] [c3]
18	Ákos Seress	[j5] [j1]
19	Jack Snoeyink	[j26]
20	Joel H. Spencer (Joel Spencer)	[j16]
21	Milos Stojakovic	[j37] [j36] [j31] [j30] [j29] [j28] [j24] [j22] [j13]
22	Benny Sudakov	[j14] [j12]
23	Gábor Tardos	[c8] [i1] [j18] [j9] [j7]
24	Zsolt Torpis	[c4]
25	Van H. Vu	[j15] [j14] [j8]
26	Emo Welzl	[c2]
27	Avi Wigderson	[c1]
28	Philipp Zumstein	[j35]
29	Stefanie Zürcher	[j35]

Colors in the list of coauthors

Last update Thu May 23 13:56:33 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page