Tibor Szabó

Publication Activity (10 Years)

Years Active: 1995-2023
Publications (10 Years): 23

Top Topics

Maximally Stable

Connected Subgraphs

Top Venues

J. Comb. Theory, Ser. A

Electron. J. Comb.

Random Struct. Algorithms

J. Comb. Theory, Ser. B

Publications

Michael Anastos, David Fabian, Alp Müyesser, Tibor Szabó
Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets. Electron. J. Comb. 30 (3) (2023)
Olaf Parczyk, Sebastian Pokutta, Christoph Spiegel, Tibor Szabó
Fully Computer-Assisted Proofs in Extremal Combinatorics. AAAI (2023)
Penny Haxell, Tibor Szabó
Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole. SODA (2023)
Penny Haxell, Tibor Szabó
Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole. CoRR (2022)
Lior Gishboliner, Raphael Steiner, Tibor Szabó
Oriented Cycles in Digraphs of Large Outdegree. Comb. 42 (6) (2022)
Lior Gishboliner, Raphael Steiner, Tibor Szabó
Dichromatic number and forced subdivisions. J. Comb. Theory, Ser. B 153 (2022)
Michael Anastos, Ander Lamaison, Raphael Steiner, Tibor Szabó
Majority Colorings of Sparse Digraphs. Electron. J. Comb. 28 (2) (2021)
Anurag Bishnoi, Shagnik Das, Patrick Morris, Tibor Szabó
-intersecting hypergraphs. J. Comb. Theory, Ser. A 179 (2021)
Noga Alon, Matija Bucic, Tom Kalvari, Eden Kuperwasser, Tibor Szabó
List Ramsey numbers. J. Graph Theory 96 (1) (2021)
Simona Boyadzhiyska, Shagnik Das, Tibor Szabó
Enumerating extensions of mutually orthogonal Latin squares. Des. Codes Cryptogr. 88 (10) (2020)
Jan Corsten, Adva Mond, Alexey Pokrovskiy, Christoph Spiegel, Tibor Szabó
On the odd cycle game and connected rules. Eur. J. Comb. 89 (2020)
Christopher Kusch, Juanjo Rué, Christoph Spiegel, Tibor Szabó
On the optimality of the uniform random strategy. Random Struct. Algorithms 55 (2) (2019)
A. Abu-Khazneh, János Barát, Alexey Pokrovskiy, Tibor Szabó
A family of extremal hypergraphs for Ryser's conjecture. J. Comb. Theory, Ser. A 161 (2019)
Hiêp Hàn, Vojtech Rödl, Tibor Szabó
Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs. SIAM J. Discret. Math. 32 (2) (2018)
Penny Haxell, Lothar Narins, Tibor Szabó
Extremal hypergraphs for Ryser's Conjecture. J. Comb. Theory, Ser. A 158 (2018)
Jonas Groschwitz, Tibor Szabó
Sharp Thresholds for Half-Random Games II. Graphs Comb. 33 (2) (2017)
Lothar Narins, Alexey Pokrovskiy, Tibor Szabó
Graphs without proper subgraphs of minimum degree 3 and short cycles. Comb. 37 (3) (2017)
Christopher Kusch, Juanjo Rué, Christoph Spiegel, Tibor Szabó
Random Strategies are Nearly Optimal for Generalized van der Waerden Games. Electron. Notes Discret. Math. 61 (2017)
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. BMC Medical Imaging 16 (2016)
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. eHealth 360° (2016)
Heidi Gebauer, Tibor Szabó, Gábor Tardos
The Local Lemma Is Asymptotically Tight for SAT. J. ACM 63 (5) (2016)
Jonas Groschwitz, Tibor Szabó
Sharp thresholds for half-random games I. Random Struct. Algorithms 49 (4) (2016)
Jacob Fox, Andrey Grinshpun, Anita Liebenau, Yury Person, Tibor Szabó
On the minimum degree of minimal Ramsey graphs for multiple colours. J. Comb. Theory, Ser. B 120 (2016)
Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Moric, Yoshio Okamoto, Tibor Szabó, Csaba D. Tóth
Free Edge Lengths in Plane Graphs. Discret. Comput. Geom. 54 (1) (2015)
Roman Glebov, Anita Liebenau, Tibor Szabó
On the Concentration of the Domination Number of the Random Graph. SIAM J. Discret. Math. 29 (3) (2015)
Roman Glebov, Michael Krivelevich, Tibor Szabó
On covering expander graphs by hamilton cycles. Random Struct. Algorithms 44 (2) (2014)
Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Moric, Yoshio Okamoto, Tibor Szabó, Csaba D. Tóth
Free Edge Lengths in Plane Graphs. SoCG (2014)
Jacob Fox, Andrey Grinshpun, Anita Liebenau, Yury Person, Tibor Szabó
What is Ramsey-equivalent to a clique? J. Comb. Theory, Ser. B 109 (2014)
Roman Glebov, Tibor Szabó, Gábor Tardos
Conflict-Free Colouring of Graphs. Comb. Probab. Comput. 23 (3) (2014)
Codrut Grosu, Yury Person, Tibor Szabó
On the rank of higher inclusion matrices. J. Lond. Math. Soc. 90 (2) (2014)
Roman Glebov, Benny Sudakov, Tibor Szabó
How Many Colors Guarantee a Rainbow Matching? Electron. J. Comb. 21 (1) (2014)
Dan Hefetz, Michael Krivelevich, Tibor Szabó
Sharp threshold for the appearance of certain spanning trees in random graphs. Random Struct. Algorithms 41 (4) (2012)
Robert Berke, Penny E. Haxell, Tibor Szabó
Bounded transversals in multipartite graphs. J. Graph Theory 70 (3) (2012)
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
Global Maker-Breaker games on sparse graphs. Eur. J. Comb. 32 (2) (2011)
Heidi Gebauer, Tibor Szabó, Gábor Tardos
The Local Lemma is Tight for SAT. SODA (2011)
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
Avoider-Enforcer: The rules of the game. J. Comb. Theory, Ser. A 117 (2) (2010)
Tibor Szabó, Philipp Zumstein, Stefanie Zürcher
On the minimum degree of minimal Ramsey graphs. J. Graph Theory 64 (2) (2010)
Heidi Gebauer, Tibor Szabó, Gábor Tardos
The Local Lemma Is Tight for SAT CoRR (2010)
Heidi Gebauer, Tibor Szabó
Asymptotic random graph intuition for the biased connectivity game. Random Struct. Algorithms 35 (4) (2009)
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
A sharp threshold for the Hamilton cycle Maker-Breaker game. Random Struct. Algorithms 34 (1) (2009)
Ron Aharoni, Tibor Szabó
Vizing's conjecture for chordal graphs. Discret. Math. 309 (6) (2009)
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
Fast winning strategies in Maker-Breaker games. J. Comb. Theory, Ser. B 99 (1) (2009)
Dan Hefetz, Michael Krivelevich, Tibor Szabó
Hamilton cycles in highly connected and expanding graphs. Comb. 29 (5) (2009)
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
Avoider-Enforcer: The Rules of the Game. Electron. Notes Discret. Math. 34 (2009)
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
Fast Winning Strategies in Avoider-Enforcer Games. Graphs Comb. 25 (4) (2009)
Robert Berke, Tibor Szabó
Deciding Relaxed Two-Colourability: A Hardness Jump. Comb. Probab. Comput. 18 (1-2) (2009)
V. Anuradha, Chinmay Jain, Jack Snoeyink, Tibor Szabó
How Long Can a Graph be Kept Planar? Electron. J. Comb. 15 (1) (2008)
Michael Krivelevich, Tibor Szabó
Biased Positional Games and Small Hypergraphs with Large Covers. Electron. J. Comb. 15 (1) (2008)
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
Planarity, Colorability, and Minor Games. SIAM J. Discret. Math. 22 (1) (2008)
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
Fast winning strategies in positional games. Electron. Notes Discret. Math. 29 (2007)
Robert Berke, Tibor Szabó
Relaxed two-coloring of cubic graphs. J. Comb. Theory, Ser. B 97 (4) (2007)
Dan Hefetz, Michael Krivelevich, Tibor Szabó
Avoider-Enforcer games. J. Comb. Theory, Ser. A 114 (5) (2007)
Dan Hefetz, Michael Krivelevich, Tibor Szabó
Bart-Moe games, JumbleG and discrepancy. Eur. J. Comb. 28 (4) (2007)
Noga Alon, Anja Krech, Tibor Szabó
Tur[a-acute]n's Theorem in the Hypercube. SIAM J. Discret. Math. 21 (1) (2007)
Penny E. Haxell, Tibor Szabó
Odd Independent Transversals are Odd. Comb. Probab. Comput. 15 (1-2) (2006)
Robert Berke, Tibor Szabó
Deciding Relaxed Two-Colorability - A Hardness Jump. ESA (2006)
Tibor Szabó, Gábor Tardos
Extremal Problems For Transversals In Graphs With Bounded Degree. Comb. 26 (3) (2006)
Benny Sudakov, Tibor Szabó, Van H. Vu
A generalization of Turán's theorem. J. Graph Theory 49 (3) (2005)
Tibor Szabó, Van H. Vu
-Wise Intersection Theorems. Graphs Comb. 21 (2) (2005)
Milos Stojakovic, Tibor Szabó
Positional games on random graphs. Random Struct. Algorithms 26 (1-2) (2005)
Ingo Schurr, Tibor Szabó
Jumping Doesn't Help in Abstract Cubes. IPCO (2005)
Noga Alon, Michael Krivelevich, Joel Spencer, Tibor Szabó
Discrepancy Games. Electron. J. Comb. 12 (2005)
Sarolta Dibuz, Tibor Szabó, Zsolt Torpis
BCMP Performance Test with TTCN-3 Mobile Node Emulator. TestCom (2004)
Michael Krivelevich, Benny Sudakov, Tibor Szabó
Triangle Factors In Sparse Pseudo-Random Graphs. Comb. 24 (3) (2004)
Ingo Schurr, Tibor Szabó
Finding the Sink Takes Some Time: An Almost Quadratic Lower Bound for Finding the Sink of Unique Sink Oriented Cubes. Discret. Comput. Geom. 31 (4) (2004)
Jirí Matousek, Tibor Szabó
Random Edge Can Be Exponential on Abstract Cubes. FOCS (2004)
Tibor Szabó, Van H. Vu
Turán's theorem in sparse random graphs. Random Struct. Algorithms 23 (3) (2003)
Penny E. Haxell, Tibor Szabó, Gábor Tardos
Bounded size components--partitions and transversals. J. Comb. Theory, Ser. B 88 (2) (2003)
Tibor Szabó
On the spectrum of projective norm-graphs. Inf. Process. Lett. 86 (2) (2003)
Ingo Schurr, Tibor Szabó
Finding the Sink Takes Some Time. ESA (2002)
Tibor Szabó, Emo Welzl
Unique Sink Orientations of Cubes. FOCS (2001)
Tibor Szabó, Gábor Tardos
A Multidimensional Generalization Of The Erdös-Szekeres Lemma On Monotone Subsequences. Comb. Probab. Comput. 10 (6) (2001)
Ákos Seress, Tibor Szabó
On Erdős's Eulerian Trail Game. Graphs Comb. 15 (2) (1999)
Noga Alon, Lajos Rónyai, Tibor Szabó
Norm-Graphs: Variations and Applications. J. Comb. Theory, Ser. B 76 (2) (1999)
Tibor Szabó
Intersection Properties of Subsets of Integers. Eur. J. Comb. 20 (5) (1999)
János Kollár, Lajos Rónyai, Tibor Szabó
Norm-Graphs and Bipartite Turán Numbers. Comb. 16 (3) (1996)
Tibor Szabó
On nearly regular co-critical graphs. Discret. Math. 160 (1-3) (1996)
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)
Ákos Seress, Tibor Szabó
Dense Graphs with Cycle Neighborhoods. J. Comb. Theory, Ser. B 63 (2) (1995)