default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTibor Szabó
Person information
- affiliation: Free University of Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j67]David Fabian, Patrick Morris
, Tibor Szabó:
Slow graph bootstrap percolation II: Accelerating properties. J. Comb. Theory B 172: 44-79 (2025)- 2024
- [j66]Tomas Bayer, Tamás Mészáros, Lajos Rónyai, Tibor Szabó:
The automorphism group of projective norm graphs. Appl. Algebra Eng. Commun. Comput. 35(6): 875-886 (2024) - 2023
- [j65]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) - [c12]Olaf Parczyk, Sebastian Pokutta, Christoph Spiegel, Tibor Szabó:
Fully Computer-Assisted Proofs in Extremal Combinatorics. AAAI 2023: 12482-12490 - [c11]Penny Haxell, Tibor Szabó:
Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole. SODA 2023: 2875-2897 - 2022
- [j64]Lior Gishboliner, Raphael Steiner, Tibor Szabó:
Oriented Cycles in Digraphs of Large Outdegree. Comb. 42(6): 1145-1187 (2022) - [j63]Lior Gishboliner, Raphael Steiner, Tibor Szabó:
Dichromatic number and forced subdivisions. J. Comb. Theory B 153: 1-30 (2022) - [i2]Penny Haxell, Tibor Szabó:
Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole. CoRR abs/2202.01143 (2022) - 2021
- [j62]Michael Anastos, Ander Lamaison, Raphael Steiner, Tibor Szabó:
Majority Colorings of Sparse Digraphs. Electron. J. Comb. 28(2): 2 (2021) - [j61]Anurag Bishnoi, Shagnik Das, Patrick Morris, Tibor Szabó:
Ryser's Conjecture for t-intersecting hypergraphs. J. Comb. Theory A 179: 105366 (2021) - [j60]Noga Alon, Matija Bucic, Tom Kalvari, Eden Kuperwasser, Tibor Szabó:
List Ramsey numbers. J. Graph Theory 96(1): 109-128 (2021) - 2020
- [j59]Simona Boyadzhiyska, Shagnik Das, Tibor Szabó:
Enumerating extensions of mutually orthogonal Latin squares. Des. Codes Cryptogr. 88(10): 2187-2206 (2020) - [j58]Jan Corsten, Adva Mond, Alexey Pokrovskiy, Christoph Spiegel, Tibor Szabó:
On the odd cycle game and connected rules. Eur. J. Comb. 89: 103140 (2020)
2010 – 2019
- 2019
- [j57]A. Abu-Khazneh, János Barát, Alexey Pokrovskiy, Tibor Szabó:
A family of extremal hypergraphs for Ryser's conjecture. J. Comb. Theory A 161: 164-177 (2019) - [j56]Christopher Kusch, Juanjo Rué, Christoph Spiegel, Tibor Szabó:
On the optimality of the uniform random strategy. Random Struct. Algorithms 55(2): 371-401 (2019) - 2018
- [j55]Penny Haxell, Lothar Narins, Tibor Szabó:
Extremal hypergraphs for Ryser's Conjecture. J. Comb. Theory A 158: 492-547 (2018) - [j54]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): 826-838 (2018) - 2017
- [j53]Lothar Narins, Alexey Pokrovskiy, Tibor Szabó:
Graphs without proper subgraphs of minimum degree 3 and short cycles. Comb. 37(3): 495-519 (2017) - [j52]Christopher Kusch, Juanjo Rué, Christoph Spiegel, Tibor Szabó:
Random Strategies are Nearly Optimal for Generalized van der Waerden Games. Electron. Notes Discret. Math. 61: 789-795 (2017) - [j51]Jonas Groschwitz, Tibor Szabó:
Sharp Thresholds for Half-Random Games II. Graphs Comb. 33(2): 387-401 (2017) - 2016
- [j50]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: 14 (2016) - [j49]Heidi Gebauer, Tibor Szabó, Gábor Tardos:
The Local Lemma Is Asymptotically Tight for SAT. J. ACM 63(5): 43:1-43:32 (2016) - [j48]Jacob Fox, Andrey Grinshpun, Anita Liebenau, Yury Person, Tibor Szabó:
On the minimum degree of minimal Ramsey graphs for multiple colours. J. Comb. Theory B 120: 64-82 (2016) - [j47]Jonas Groschwitz, Tibor Szabó:
Sharp thresholds for half-random games I. Random Struct. Algorithms 49(4): 766-794 (2016) - [c10]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: 492-496 - 2015
- [j46]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): 259-289 (2015) - [j45]Roman Glebov, Anita Liebenau, Tibor Szabó:
On the Concentration of the Domination Number of the Random Graph. SIAM J. Discret. Math. 29(3): 1186-1206 (2015) - 2014
- [j44]Roman Glebov, Benny Sudakov, Tibor Szabó:
How Many Colors Guarantee a Rainbow Matching? Electron. J. Comb. 21(1): 1 (2014) - [j43]Roman Glebov, Tibor Szabó, Gábor Tardos:
Conflict-Free Colouring of Graphs. Comb. Probab. Comput. 23(3): 434-448 (2014) - [j42]Jacob Fox, Andrey Grinshpun, Anita Liebenau, Yury Person, Tibor Szabó:
What is Ramsey-equivalent to a clique? J. Comb. Theory B 109: 120-133 (2014) - [j41]Codrut Grosu, Yury Person, Tibor Szabó:
On the rank of higher inclusion matrices. J. Lond. Math. Soc. 90(2): 333-349 (2014) - [j40]Roman Glebov, Michael Krivelevich, Tibor Szabó:
On covering expander graphs by hamilton cycles. Random Struct. Algorithms 44(2): 183-200 (2014) - [c9]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: 426 - 2012
- [j39]Robert Berke, Penny E. Haxell, Tibor Szabó:
Bounded transversals in multipartite graphs. J. 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 A 117(2): 152-163 (2010) - [j35]Tibor Szabó, Philipp Zumstein, Stefanie Zürcher:
On the minimum degree of minimal Ramsey graphs. J. 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)
2000 – 2009
- 2009
- [j34]Dan Hefetz, Michael Krivelevich, Tibor Szabó:
Hamilton cycles in highly connected and expanding graphs. Comb. 29(5): 547-568 (2009) - [j33]Robert Berke, Tibor Szabó:
Deciding Relaxed Two-Colourability: A Hardness Jump. Comb. Probab. Comput. 18(1-2): 53-81 (2009) - [j32]Ron Aharoni, Tibor Szabó:
Vizing's conjecture for chordal graphs. Discret. Math. 309(6): 1766-1768 (2009) - [j31]Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Avoider-Enforcer: The Rules of the Game. Electron. Notes Discret. Math. 34: 261-265 (2009) - [j30]Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Fast Winning Strategies in Avoider-Enforcer Games. Graphs Comb. 25(4): 533-544 (2009) - [j29]Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Fast winning strategies in Maker-Breaker games. J. Comb. Theory 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? Electron. J. Comb. 15(1) (2008) - [j25]Michael Krivelevich, Tibor Szabó:
Biased Positional Games and Small Hypergraphs with Large Covers. Electron. J. Comb. 15(1) (2008) - [j24]Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Planarity, Colorability, and Minor Games. SIAM J. Discret. 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. Electron. Notes Discret. Math. 29: 213-217 (2007) - [j21]Robert Berke, Tibor Szabó:
Relaxed two-coloring of cubic graphs. J. Comb. Theory B 97(4): 652-668 (2007) - [j20]Dan Hefetz, Michael Krivelevich, Tibor Szabó:
Avoider-Enforcer games. J. Comb. Theory A 114(5): 840-853 (2007) - [j19]Noga Alon, Anja Krech, Tibor Szabó:
Turán's Theorem in the Hypercube. SIAM J. Discret. Math. 21(1): 66-72 (2007) - 2006
- [j18]Tibor Szabó, Gábor Tardos:
Extremal Problems For Transversals In Graphs With Bounded Degree. Comb. 26(3): 333-351 (2006) - [j17]Penny E. Haxell, Tibor Szabó:
Odd Independent Transversals are Odd. Comb. Probab. Comput. 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. Electron. J. Comb. 12 (2005) - [j15]Tibor Szabó, Van H. Vu:
Exact k-Wise Intersection Theorems. Graphs Comb. 21(2): 247-261 (2005) - [j14]Benny Sudakov, Tibor Szabó, Van H. Vu:
A generalization of Turán's theorem. J. 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. Comb. 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. Discret. Comput. Geom. 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 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. Comb. Probab. Comput. 10(6): 557-565 (2001) - [c2]Tibor Szabó, Emo Welzl:
Unique Sink Orientations of Cubes. FOCS 2001: 547-555
1990 – 1999
- 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 Comb. 15(2): 233-237 (1999) - [j4]Noga Alon, Lajos Rónyai, Tibor Szabó:
Norm-Graphs: Variations and Applications. J. Comb. Theory B 76(2): 280-290 (1999) - 1996
- [j3]János Kollár, Lajos Rónyai, Tibor Szabó:
Norm-Graphs and Bipartite Turán Numbers. Comb. 16(3): 399-406 (1996) - [j2]Tibor Szabó:
On nearly regular co-critical graphs. Discret. Math. 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 B 63(2): 281-293 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-18 02:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
