Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Tibor Szabó
@article{DBLP:journals/combinatorics/AnastosFMS23,
author = {Michael Anastos and
David Fabian and
Alp M{\"{u}}yesser and
Tibor Szab{\'{o}}},
title = {Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets},
journal = {Electron. J. Comb.},
volume = {30},
number = {3},
year = {2023},
url = {https://doi.org/10.37236/11714},
doi = {10.37236/11714},
timestamp = {Fri, 18 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/AnastosFMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/ParczykP0S23,
author = {Olaf Parczyk and
Sebastian Pokutta and
Christoph Spiegel and
Tibor Szab{\'{o}}},
editor = {Brian Williams and
Yiling Chen and
Jennifer Neville},
title = {Fully Computer-Assisted Proofs in Extremal Combinatorics},
booktitle = {Thirty-Seventh {AAAI} Conference on Artificial Intelligence, {AAAI}
2023, Thirty-Fifth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2023, Thirteenth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2023, Washington, DC, USA, February
7-14, 2023},
pages = {12482--12490},
publisher = {{AAAI} Press},
year = {2023},
url = {https://doi.org/10.1609/aaai.v37i10.26470},
doi = {10.1609/AAAI.V37I10.26470},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/ParczykP0S23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HaxellS23,
author = {Penny Haxell and
Tibor Szab{\'{o}}},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Improved Integrality Gap in Max-Min Allocation: or Topology at the
North Pole},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {2875--2897},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch109},
doi = {10.1137/1.9781611977554.CH109},
timestamp = {Fri, 17 Feb 2023 09:28:57 +0100},
biburl = {https://dblp.org/rec/conf/soda/HaxellS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GishbolinerSS22,
author = {Lior Gishboliner and
Raphael Steiner and
Tibor Szab{\'{o}}},
title = {Oriented Cycles in Digraphs of Large Outdegree},
journal = {Comb.},
volume = {42},
number = {6},
pages = {1145--1187},
year = {2022},
url = {https://doi.org/10.1007/s00493-021-4750-z},
doi = {10.1007/S00493-021-4750-Z},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/GishbolinerSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/GishbolinerSS22,
author = {Lior Gishboliner and
Raphael Steiner and
Tibor Szab{\'{o}}},
title = {Dichromatic number and forced subdivisions},
journal = {J. Comb. Theory, Ser. {B}},
volume = {153},
pages = {1--30},
year = {2022},
url = {https://doi.org/10.1016/j.jctb.2021.10.002},
doi = {10.1016/J.JCTB.2021.10.002},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jctb/GishbolinerSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-01143,
author = {Penny Haxell and
Tibor Szab{\'{o}}},
title = {Improved Integrality Gap in Max-Min Allocation: or Topology at the
North Pole},
journal = {CoRR},
volume = {abs/2202.01143},
year = {2022},
url = {https://arxiv.org/abs/2202.01143},
eprinttype = {arXiv},
eprint = {2202.01143},
timestamp = {Wed, 09 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-01143.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/AnastosLSS21,
author = {Michael Anastos and
Ander Lamaison and
Raphael Steiner and
Tibor Szab{\'{o}}},
title = {Majority Colorings of Sparse Digraphs},
journal = {Electron. J. Comb.},
volume = {28},
number = {2},
pages = {2},
year = {2021},
url = {https://doi.org/10.37236/10067},
doi = {10.37236/10067},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/AnastosLSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcta/BishnoiDMS21,
author = {Anurag Bishnoi and
Shagnik Das and
Patrick Morris and
Tibor Szab{\'{o}}},
title = {Ryser's Conjecture for \emph{t}-intersecting hypergraphs},
journal = {J. Comb. Theory, Ser. {A}},
volume = {179},
pages = {105366},
year = {2021},
url = {https://doi.org/10.1016/j.jcta.2020.105366},
doi = {10.1016/J.JCTA.2020.105366},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcta/BishnoiDMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AlonBKKS21,
author = {Noga Alon and
Matija Bucic and
Tom Kalvari and
Eden Kuperwasser and
Tibor Szab{\'{o}}},
title = {List Ramsey numbers},
journal = {J. Graph Theory},
volume = {96},
number = {1},
pages = {109--128},
year = {2021},
url = {https://doi.org/10.1002/jgt.22610},
doi = {10.1002/JGT.22610},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AlonBKKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcc/BoyadzhiyskaDS20,
author = {Simona Boyadzhiyska and
Shagnik Das and
Tibor Szab{\'{o}}},
title = {Enumerating extensions of mutually orthogonal Latin squares},
journal = {Des. Codes Cryptogr.},
volume = {88},
number = {10},
pages = {2187--2206},
year = {2020},
url = {https://doi.org/10.1007/s10623-020-00771-6},
doi = {10.1007/S10623-020-00771-6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcc/BoyadzhiyskaDS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/CorstenMPSS20,
author = {Jan Corsten and
Adva Mond and
Alexey Pokrovskiy and
Christoph Spiegel and
Tibor Szab{\'{o}}},
title = {On the odd cycle game and connected rules},
journal = {Eur. J. Comb.},
volume = {89},
pages = {103140},
year = {2020},
url = {https://doi.org/10.1016/j.ejc.2020.103140},
doi = {10.1016/J.EJC.2020.103140},
timestamp = {Fri, 12 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/CorstenMPSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Abu-KhaznehBPS19,
author = {A. Abu{-}Khazneh and
J{\'{a}}nos Bar{\'{a}}t and
Alexey Pokrovskiy and
Tibor Szab{\'{o}}},
title = {A family of extremal hypergraphs for Ryser's conjecture},
journal = {J. Comb. Theory, Ser. {A}},
volume = {161},
pages = {164--177},
year = {2019},
url = {https://doi.org/10.1016/j.jcta.2018.07.011},
doi = {10.1016/J.JCTA.2018.07.011},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Abu-KhaznehBPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KuschRSS19,
author = {Christopher Kusch and
Juanjo Ru{\'{e}} and
Christoph Spiegel and
Tibor Szab{\'{o}}},
title = {On the optimality of the uniform random strategy},
journal = {Random Struct. Algorithms},
volume = {55},
number = {2},
pages = {371--401},
year = {2019},
url = {https://doi.org/10.1002/rsa.20829},
doi = {10.1002/RSA.20829},
timestamp = {Fri, 12 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KuschRSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/HaxellNS18,
author = {Penny Haxell and
Lothar Narins and
Tibor Szab{\'{o}}},
title = {Extremal hypergraphs for Ryser's Conjecture},
journal = {J. Comb. Theory, Ser. {A}},
volume = {158},
pages = {492--547},
year = {2018},
url = {https://doi.org/10.1016/j.jcta.2018.04.004},
doi = {10.1016/J.JCTA.2018.04.004},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/HaxellNS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HanRS18,
author = {Hi{\^{e}}p H{\`{a}}n and
Vojtech R{\"{o}}dl and
Tibor Szab{\'{o}}},
title = {Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {2},
pages = {826--838},
year = {2018},
url = {https://doi.org/10.1137/17M1116696},
doi = {10.1137/17M1116696},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HanRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/NarinsPS17,
author = {Lothar Narins and
Alexey Pokrovskiy and
Tibor Szab{\'{o}}},
title = {Graphs without proper subgraphs of minimum degree 3 and short cycles},
journal = {Comb.},
volume = {37},
number = {3},
pages = {495--519},
year = {2017},
url = {https://doi.org/10.1007/s00493-015-3310-9},
doi = {10.1007/S00493-015-3310-9},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/NarinsPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KuschRSS17,
author = {Christopher Kusch and
Juanjo Ru{\'{e}} and
Christoph Spiegel and
Tibor Szab{\'{o}}},
title = {Random Strategies are Nearly Optimal for Generalized van der Waerden
Games},
journal = {Electron. Notes Discret. Math.},
volume = {61},
pages = {789--795},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.07.037},
doi = {10.1016/J.ENDM.2017.07.037},
timestamp = {Fri, 12 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/KuschRSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/GroschwitzS17,
author = {Jonas Groschwitz and
Tibor Szab{\'{o}}},
title = {Sharp Thresholds for Half-Random Games {II}},
journal = {Graphs Comb.},
volume = {33},
number = {2},
pages = {387--401},
year = {2017},
url = {https://doi.org/10.1007/s00373-016-1753-4},
doi = {10.1007/S00373-016-1753-4},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/GroschwitzS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcmi/SzigetiSKCHVGKB16,
author = {Kriszti{\'{a}}n Szigeti and
Tibor Szab{\'{o}} and
Csaba Korom and
Ilona Czibak and
Ildik{\'{o}} Horv{\'{a}}th and
D{\'{a}}niel S. Veres and
Zolt{\'{a}}n Gy{\"{o}}ngyi and
Kinga Karlinger and
Ralf Bergmann and
M{\'{a}}rta P{\'{o}}csik and
Ferenc Bud{\'{a}}n and
Domokos M{\'{a}}th{\'{e}}},
title = {Radiomics-based differentiation of lung disease models generated by
polluted air based on X-ray computed tomography data},
journal = {{BMC} Medical Imaging},
volume = {16},
pages = {14},
year = {2016},
url = {https://doi.org/10.1186/s12880-016-0118-z},
doi = {10.1186/S12880-016-0118-Z},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bmcmi/SzigetiSKCHVGKB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GebauerST16,
author = {Heidi Gebauer and
Tibor Szab{\'{o}} and
G{\'{a}}bor Tardos},
title = {The Local Lemma Is Asymptotically Tight for {SAT}},
journal = {J. {ACM}},
volume = {63},
number = {5},
pages = {43:1--43:32},
year = {2016},
url = {https://doi.org/10.1145/2975386},
doi = {10.1145/2975386},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GebauerST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FoxGLPS16,
author = {Jacob Fox and
Andrey Grinshpun and
Anita Liebenau and
Yury Person and
Tibor Szab{\'{o}}},
title = {On the minimum degree of minimal Ramsey graphs for multiple colours},
journal = {J. Comb. Theory, Ser. {B}},
volume = {120},
pages = {64--82},
year = {2016},
url = {https://doi.org/10.1016/j.jctb.2016.03.006},
doi = {10.1016/J.JCTB.2016.03.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FoxGLPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GroschwitzS16,
author = {Jonas Groschwitz and
Tibor Szab{\'{o}}},
title = {Sharp thresholds for half-random games {I}},
journal = {Random Struct. Algorithms},
volume = {49},
number = {4},
pages = {766--794},
year = {2016},
url = {https://doi.org/10.1002/rsa.20681},
doi = {10.1002/RSA.20681},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GroschwitzS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ehealth360/SipkaSZVJNFBBBB16,
author = {G{\'{a}}bor Sipka and
Tibor Szab{\'{o}} and
R{\'{a}}hel Z{\"{o}}lei{-}Sz{\'{e}}n{\'{a}}si and
Melinda Vanya and
M{\'{a}}ria Jak{\'{o}} and
Tam{\'{a}}s D{\'{a}}niel Nagy and
M{\'{a}}rta Fidrich and
Vilmos Bilicki and
J{\'{a}}nos Borb{\'{a}}s and
Tam{\'{a}}s Bit{\'{o}} and
Gy{\"{o}}rgy B{\'{a}}rtfai},
editor = {Kostas Giokas and
L{\'{a}}szl{\'{o}} Bokor and
Frank Hopfgartner},
title = {Monitoring of Fetal Heart Rate via iPhone},
booktitle = {eHealth 360{\textdegree} - International Summit on eHealth, Budapest,
Hungary, June 14-16, 2016, Revised Selected Papers},
series = {Lecture Notes of the Institute for Computer Sciences, Social Informatics
and Telecommunications Engineering},
volume = {181},
pages = {492--496},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-49655-9\_60},
doi = {10.1007/978-3-319-49655-9\_60},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ehealth360/SipkaSZVJNFBBBB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AbelCEFMOST15,
author = {Zachary Abel and
Robert Connelly and
Sarah Eisenstat and
Radoslav Fulek and
Filip Moric and
Yoshio Okamoto and
Tibor Szab{\'{o}} and
Csaba D. T{\'{o}}th},
title = {Free Edge Lengths in Plane Graphs},
journal = {Discret. Comput. Geom.},
volume = {54},
number = {1},
pages = {259--289},
year = {2015},
url = {https://doi.org/10.1007/s00454-015-9704-z},
doi = {10.1007/S00454-015-9704-Z},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/AbelCEFMOST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GlebovLS15,
author = {Roman Glebov and
Anita Liebenau and
Tibor Szab{\'{o}}},
title = {On the Concentration of the Domination Number of the Random Graph},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {3},
pages = {1186--1206},
year = {2015},
url = {https://doi.org/10.1137/12090054X},
doi = {10.1137/12090054X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GlebovLS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/GlebovSS14,
author = {Roman Glebov and
Benny Sudakov and
Tibor Szab{\'{o}}},
title = {How Many Colors Guarantee a Rainbow Matching?},
journal = {Electron. J. Comb.},
volume = {21},
number = {1},
pages = {1},
year = {2014},
url = {https://doi.org/10.37236/3742},
doi = {10.37236/3742},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/GlebovSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GlebovST14,
author = {Roman Glebov and
Tibor Szab{\'{o}} and
G{\'{a}}bor Tardos},
title = {Conflict-Free Colouring of Graphs},
journal = {Comb. Probab. Comput.},
volume = {23},
number = {3},
pages = {434--448},
year = {2014},
url = {https://doi.org/10.1017/S0963548313000540},
doi = {10.1017/S0963548313000540},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GlebovST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FoxGLPS14,
author = {Jacob Fox and
Andrey Grinshpun and
Anita Liebenau and
Yury Person and
Tibor Szab{\'{o}}},
title = {What is Ramsey-equivalent to a clique?},
journal = {J. Comb. Theory, Ser. {B}},
volume = {109},
pages = {120--133},
year = {2014},
url = {https://doi.org/10.1016/j.jctb.2014.06.003},
doi = {10.1016/J.JCTB.2014.06.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FoxGLPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jlms/GrosuPS14,
author = {Codrut Grosu and
Yury Person and
Tibor Szab{\'{o}}},
title = {On the rank of higher inclusion matrices},
journal = {J. Lond. Math. Soc.},
volume = {90},
number = {2},
pages = {333--349},
year = {2014},
url = {https://doi.org/10.1112/jlms/jdu029},
doi = {10.1112/JLMS/JDU029},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jlms/GrosuPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GlebovKS14,
author = {Roman Glebov and
Michael Krivelevich and
Tibor Szab{\'{o}}},
title = {On covering expander graphs by hamilton cycles},
journal = {Random Struct. Algorithms},
volume = {44},
number = {2},
pages = {183--200},
year = {2014},
url = {https://doi.org/10.1002/rsa.20455},
doi = {10.1002/RSA.20455},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GlebovKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AbelCEFMOST14,
author = {Zachary Abel and
Robert Connelly and
Sarah Eisenstat and
Radoslav Fulek and
Filip Moric and
Yoshio Okamoto and
Tibor Szab{\'{o}} and
Csaba D. T{\'{o}}th},
editor = {Siu{-}Wing Cheng and
Olivier Devillers},
title = {Free Edge Lengths in Plane Graphs},
booktitle = {30th Annual Symposium on Computational Geometry, SoCG'14, Kyoto, Japan,
June 08 - 11, 2014},
pages = {426},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2582112.2582172},
doi = {10.1145/2582112.2582172},
timestamp = {Mon, 14 Jun 2021 16:39:30 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AbelCEFMOST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BerkeHS12,
author = {Robert Berke and
Penny E. Haxell and
Tibor Szab{\'{o}}},
title = {Bounded transversals in multipartite graphs},
journal = {J. Graph Theory},
volume = {70},
number = {3},
pages = {318--331},
year = {2012},
url = {https://doi.org/10.1002/jgt.20618},
doi = {10.1002/JGT.20618},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BerkeHS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HefetzKS12,
author = {Dan Hefetz and
Michael Krivelevich and
Tibor Szab{\'{o}}},
title = {Sharp threshold for the appearance of certain spanning trees in random
graphs},
journal = {Random Struct. Algorithms},
volume = {41},
number = {4},
pages = {391--412},
year = {2012},
url = {https://doi.org/10.1002/rsa.20472},
doi = {10.1002/RSA.20472},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HefetzKS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/HefetzKSS11,
author = {Dan Hefetz and
Michael Krivelevich and
Milos Stojakovic and
Tibor Szab{\'{o}}},
title = {Global Maker-Breaker games on sparse graphs},
journal = {Eur. J. Comb.},
volume = {32},
number = {2},
pages = {162--177},
year = {2011},
url = {https://doi.org/10.1016/j.ejc.2010.09.005},
doi = {10.1016/J.EJC.2010.09.005},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/HefetzKSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GebauerST11,
author = {Heidi Gebauer and
Tibor Szab{\'{o}} and
G{\'{a}}bor Tardos},
editor = {Dana Randall},
title = {The Local Lemma is Tight for {SAT}},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {664--674},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.52},
doi = {10.1137/1.9781611973082.52},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/GebauerST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/HefetzKSS10,
author = {Dan Hefetz and
Michael Krivelevich and
Milos Stojakovic and
Tibor Szab{\'{o}}},
title = {Avoider-Enforcer: The rules of the game},
journal = {J. Comb. Theory, Ser. {A}},
volume = {117},
number = {2},
pages = {152--163},
year = {2010},
url = {https://doi.org/10.1016/j.jcta.2009.05.001},
doi = {10.1016/J.JCTA.2009.05.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/HefetzKSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/SzaboZZ10,
author = {Tibor Szab{\'{o}} and
Philipp Zumstein and
Stefanie Z{\"{u}}rcher},
title = {On the minimum degree of minimal Ramsey graphs},
journal = {J. Graph Theory},
volume = {64},
number = {2},
pages = {150--164},
year = {2010},
url = {https://doi.org/10.1002/jgt.20445},
doi = {10.1002/JGT.20445},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/SzaboZZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1006-0744,
author = {Heidi Gebauer and
Tibor Szab{\'{o}} and
G{\'{a}}bor Tardos},
title = {The Local Lemma Is Tight for {SAT}},
journal = {CoRR},
volume = {abs/1006.0744},
year = {2010},
url = {http://arxiv.org/abs/1006.0744},
eprinttype = {arXiv},
eprint = {1006.0744},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1006-0744.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HefetzKS09,
author = {Dan Hefetz and
Michael Krivelevich and
Tibor Szab{\'{o}}},
title = {Hamilton cycles in highly connected and expanding graphs},
journal = {Comb.},
volume = {29},
number = {5},
pages = {547--568},
year = {2009},
url = {https://doi.org/10.1007/s00493-009-2362-0},
doi = {10.1007/S00493-009-2362-0},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/HefetzKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BerkeS09,
author = {Robert Berke and
Tibor Szab{\'{o}}},
title = {Deciding Relaxed Two-Colourability: {A} Hardness Jump},
journal = {Comb. Probab. Comput.},
volume = {18},
number = {1-2},
pages = {53--81},
year = {2009},
url = {https://doi.org/10.1017/S0963548309009663},
doi = {10.1017/S0963548309009663},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BerkeS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AharoniS09,
author = {Ron Aharoni and
Tibor Szab{\'{o}}},
title = {Vizing's conjecture for chordal graphs},
journal = {Discret. Math.},
volume = {309},
number = {6},
pages = {1766--1768},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.02.025},
doi = {10.1016/J.DISC.2008.02.025},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AharoniS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/HefetzKSS09,
author = {Dan Hefetz and
Michael Krivelevich and
Milos Stojakovic and
Tibor Szab{\'{o}}},
title = {Avoider-Enforcer: The Rules of the Game},
journal = {Electron. Notes Discret. Math.},
volume = {34},
pages = {261--265},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.07.100},
doi = {10.1016/J.ENDM.2009.07.100},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/HefetzKSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/HefetzKSS09,
author = {Dan Hefetz and
Michael Krivelevich and
Milos Stojakovic and
Tibor Szab{\'{o}}},
title = {Fast Winning Strategies in Avoider-Enforcer Games},
journal = {Graphs Comb.},
volume = {25},
number = {4},
pages = {533--544},
year = {2009},
url = {https://doi.org/10.1007/s00373-009-0870-8},
doi = {10.1007/S00373-009-0870-8},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/gc/HefetzKSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/HefetzKSS09,
author = {Dan Hefetz and
Michael Krivelevich and
Milos Stojakovic and
Tibor Szab{\'{o}}},
title = {Fast winning strategies in Maker-Breaker games},
journal = {J. Comb. Theory, Ser. {B}},
volume = {99},
number = {1},
pages = {39--47},
year = {2009},
url = {https://doi.org/10.1016/j.jctb.2008.04.001},
doi = {10.1016/J.JCTB.2008.04.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/HefetzKSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HefetzKSS09,
author = {Dan Hefetz and
Michael Krivelevich and
Milos Stojakovic and
Tibor Szab{\'{o}}},
title = {A sharp threshold for the Hamilton cycle Maker-Breaker game},
journal = {Random Struct. Algorithms},
volume = {34},
number = {1},
pages = {112--122},
year = {2009},
url = {https://doi.org/10.1002/rsa.20252},
doi = {10.1002/RSA.20252},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HefetzKSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GebauerS09,
author = {Heidi Gebauer and
Tibor Szab{\'{o}}},
title = {Asymptotic random graph intuition for the biased connectivity game},
journal = {Random Struct. Algorithms},
volume = {35},
number = {4},
pages = {431--443},
year = {2009},
url = {https://doi.org/10.1002/rsa.20279},
doi = {10.1002/RSA.20279},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GebauerS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/AnuradhaJSS08,
author = {V. Anuradha and
Chinmay Jain and
Jack Snoeyink and
Tibor Szab{\'{o}}},
title = {How Long Can a Graph be Kept Planar?},
journal = {Electron. J. Comb.},
volume = {15},
number = {1},
year = {2008},
url = {http://www.combinatorics.org/Volume\_15/Abstracts/v15i1n14.html},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/AnuradhaJSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/KrivelevichS08,
author = {Michael Krivelevich and
Tibor Szab{\'{o}}},
title = {Biased Positional Games and Small Hypergraphs with Large Covers},
journal = {Electron. J. Comb.},
volume = {15},
number = {1},
year = {2008},
url = {http://www.combinatorics.org/Volume\_15/Abstracts/v15i1r70.html},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/KrivelevichS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HefetzKSS08,
author = {Dan Hefetz and
Michael Krivelevich and
Milos Stojakovic and
Tibor Szab{\'{o}}},
title = {Planarity, Colorability, and Minor Games},
journal = {{SIAM} J. Discret. Math.},
volume = {22},
number = {1},
pages = {194--212},
year = {2008},
url = {https://doi.org/10.1137/060654414},
doi = {10.1137/060654414},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/HefetzKSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/HefetzKS07,
author = {Dan Hefetz and
Michael Krivelevich and
Tibor Szab{\'{o}}},
title = {Bart-Moe games, JumbleG and discrepancy},
journal = {Eur. J. Comb.},
volume = {28},
number = {4},
pages = {1131--1143},
year = {2007},
url = {https://doi.org/10.1016/j.ejc.2006.03.004},
doi = {10.1016/J.EJC.2006.03.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/HefetzKS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/HefetzKSS07,
author = {Dan Hefetz and
Michael Krivelevich and
Milos Stojakovic and
Tibor Szab{\'{o}}},
title = {Fast winning strategies in positional games},
journal = {Electron. Notes Discret. Math.},
volume = {29},
pages = {213--217},
year = {2007},
url = {https://doi.org/10.1016/j.endm.2007.07.046},
doi = {10.1016/J.ENDM.2007.07.046},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/HefetzKSS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BerkeS07,
author = {Robert Berke and
Tibor Szab{\'{o}}},
title = {Relaxed two-coloring of cubic graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {97},
number = {4},
pages = {652--668},
year = {2007},
url = {https://doi.org/10.1016/j.jctb.2006.12.001},
doi = {10.1016/J.JCTB.2006.12.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/BerkeS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/HefetzKS07,
author = {Dan Hefetz and
Michael Krivelevich and
Tibor Szab{\'{o}}},
title = {Avoider-Enforcer games},
journal = {J. Comb. Theory, Ser. {A}},
volume = {114},
number = {5},
pages = {840--853},
year = {2007},
url = {https://doi.org/10.1016/j.jcta.2006.10.001},
doi = {10.1016/J.JCTA.2006.10.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/HefetzKS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AlonKS07,
author = {Noga Alon and
Anja Krech and
Tibor Szab{\'{o}}},
title = {Tur[a-acute]n's Theorem in the Hypercube},
journal = {{SIAM} J. Discret. Math.},
volume = {21},
number = {1},
pages = {66--72},
year = {2007},
url = {https://doi.org/10.1137/060649422},
doi = {10.1137/060649422},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AlonKS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/SzaboT06,
author = {Tibor Szab{\'{o}} and
G{\'{a}}bor Tardos},
title = {Extremal Problems For Transversals In Graphs With Bounded Degree},
journal = {Comb.},
volume = {26},
number = {3},
pages = {333--351},
year = {2006},
url = {https://doi.org/10.1007/s00493-006-0019-9},
doi = {10.1007/S00493-006-0019-9},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/SzaboT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/HaxellS06,
author = {Penny E. Haxell and
Tibor Szab{\'{o}}},
title = {Odd Independent Transversals are Odd},
journal = {Comb. Probab. Comput.},
volume = {15},
number = {1-2},
pages = {193--211},
year = {2006},
url = {https://doi.org/10.1017/S0963548305007157},
doi = {10.1017/S0963548305007157},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/HaxellS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BerkeS06,
author = {Robert Berke and
Tibor Szab{\'{o}}},
editor = {Yossi Azar and
Thomas Erlebach},
title = {Deciding Relaxed Two-Colorability - {A} Hardness Jump},
booktitle = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland,
September 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4168},
pages = {124--135},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11841036\_14},
doi = {10.1007/11841036\_14},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/BerkeS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/AlonKSS05,
author = {Noga Alon and
Michael Krivelevich and
Joel Spencer and
Tibor Szab{\'{o}}},
title = {Discrepancy Games},
journal = {Electron. J. Comb.},
volume = {12},
year = {2005},
url = {https://doi.org/10.37236/1948},
doi = {10.37236/1948},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/AlonKSS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/SzaboV05,
author = {Tibor Szab{\'{o}} and
Van H. Vu},
title = {Exact \emph{k}-Wise Intersection Theorems},
journal = {Graphs Comb.},
volume = {21},
number = {2},
pages = {247--261},
year = {2005},
url = {https://doi.org/10.1007/s00373-005-0609-0},
doi = {10.1007/S00373-005-0609-0},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/SzaboV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/SudakovSV05,
author = {Benny Sudakov and
Tibor Szab{\'{o}} and
Van H. Vu},
title = {A generalization of Tur{\'{a}}n's theorem},
journal = {J. Graph Theory},
volume = {49},
number = {3},
pages = {187--195},
year = {2005},
url = {https://doi.org/10.1002/jgt.20074},
doi = {10.1002/JGT.20074},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/SudakovSV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/StojakovicS05,
author = {Milos Stojakovic and
Tibor Szab{\'{o}}},
title = {Positional games on random graphs},
journal = {Random Struct. Algorithms},
volume = {26},
number = {1-2},
pages = {204--223},
year = {2005},
url = {https://doi.org/10.1002/rsa.20059},
doi = {10.1002/RSA.20059},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/StojakovicS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/SchurrS05,
author = {Ingo Schurr and
Tibor Szab{\'{o}}},
editor = {Michael J{\"{u}}nger and
Volker Kaibel},
title = {Jumping Doesn't Help in Abstract Cubes},
booktitle = {Integer Programming and Combinatorial Optimization, 11th International
{IPCO} Conference, Berlin, Germany, June 8-10, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3509},
pages = {225--235},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11496915\_17},
doi = {10.1007/11496915\_17},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/SchurrS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KrivelevichSS04,
author = {Michael Krivelevich and
Benny Sudakov and
Tibor Szab{\'{o}}},
title = {Triangle Factors In Sparse Pseudo-Random Graphs},
journal = {Comb.},
volume = {24},
number = {3},
pages = {403--426},
year = {2004},
url = {https://doi.org/10.1007/s00493-004-0025-8},
doi = {10.1007/S00493-004-0025-8},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/KrivelevichSS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/SchurrS04,
author = {Ingo Schurr and
Tibor Szab{\'{o}}},
title = {Finding the Sink Takes Some Time: An Almost Quadratic Lower Bound
for Finding the Sink of Unique Sink Oriented Cubes},
journal = {Discret. Comput. Geom.},
volume = {31},
number = {4},
pages = {627--642},
year = {2004},
url = {https://doi.org/10.1007/s00454-003-0813-8},
doi = {10.1007/S00454-003-0813-8},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/SchurrS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MatousekS04,
author = {Jir{\'{\i}} Matousek and
Tibor Szab{\'{o}}},
title = {Random Edge Can Be Exponential on Abstract Cubes},
booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
October 2004, Rome, Italy, Proceedings},
pages = {92--100},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/FOCS.2004.56},
doi = {10.1109/FOCS.2004.56},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MatousekS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pts/DibuzST04,
author = {Sarolta Dibuz and
Tibor Szab{\'{o}} and
Zsolt Torpis},
editor = {Roland Groz and
Robert M. Hierons},
title = {{BCMP} Performance Test with {TTCN-3} Mobile Node Emulator},
booktitle = {Testing of Communicating Systems, 16th {IFIP} International Conerence,
TestCom 2004, Oxford, UK, March 17-19, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2978},
pages = {50--59},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24704-3\_4},
doi = {10.1007/978-3-540-24704-3\_4},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/pts/DibuzST04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Szabo03,
author = {Tibor Szab{\'{o}}},
title = {On the spectrum of projective norm-graphs},
journal = {Inf. Process. Lett.},
volume = {86},
number = {2},
pages = {71--74},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00482-9},
doi = {10.1016/S0020-0190(02)00482-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Szabo03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/HaxellST03,
author = {Penny E. Haxell and
Tibor Szab{\'{o}} and
G{\'{a}}bor Tardos},
title = {Bounded size components--partitions and transversals},
journal = {J. Comb. Theory, Ser. {B}},
volume = {88},
number = {2},
pages = {281--297},
year = {2003},
url = {https://doi.org/10.1016/S0095-8956(03)00031-5},
doi = {10.1016/S0095-8956(03)00031-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/HaxellST03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/SzaboV03,
author = {Tibor Szab{\'{o}} and
Van H. Vu},
title = {Tur{\'{a}}n's theorem in sparse random graphs},
journal = {Random Struct. Algorithms},
volume = {23},
number = {3},
pages = {225--234},
year = {2003},
url = {https://doi.org/10.1002/rsa.10088},
doi = {10.1002/RSA.10088},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/SzaboV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/SchurrS02,
author = {Ingo Schurr and
Tibor Szab{\'{o}}},
editor = {Rolf H. M{\"{o}}hring and
Rajeev Raman},
title = {Finding the Sink Takes Some Time},
booktitle = {Algorithms - {ESA} 2002, 10th Annual European Symposium, Rome, Italy,
September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2461},
pages = {833--844},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45749-6\_72},
doi = {10.1007/3-540-45749-6\_72},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/SchurrS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/SzaboT01,
author = {Tibor Szab{\'{o}} and
G{\'{a}}bor Tardos},
title = {A Multidimensional Generalization Of The Erd{\"{o}}s-Szekeres
Lemma On Monotone Subsequences},
journal = {Comb. Probab. Comput.},
volume = {10},
number = {6},
pages = {557--565},
year = {2001},
url = {https://doi.org/10.1017/S0963548301004862},
doi = {10.1017/S0963548301004862},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/SzaboT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SzaboW01,
author = {Tibor Szab{\'{o}} and
Emo Welzl},
title = {Unique Sink Orientations of Cubes},
booktitle = {42nd Annual Symposium on Foundations of Computer Science, {FOCS} 2001,
14-17 October 2001, Las Vegas, Nevada, {USA}},
pages = {547--555},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/SFCS.2001.959931},
doi = {10.1109/SFCS.2001.959931},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SzaboW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Szabo99,
author = {Tibor Szab{\'{o}}},
title = {Intersection Properties of Subsets of Integers},
journal = {Eur. J. Comb.},
volume = {20},
number = {5},
pages = {429--444},
year = {1999},
url = {https://doi.org/10.1006/eujc.1997.0176},
doi = {10.1006/EUJC.1997.0176},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Szabo99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/SeressS99,
author = {{\'{A}}kos Seress and
Tibor Szab{\'{o}}},
title = {On Erd{\H{o}}s's Eulerian Trail Game},
journal = {Graphs Comb.},
volume = {15},
number = {2},
pages = {233--237},
year = {1999},
url = {https://doi.org/10.1007/s003730050043},
doi = {10.1007/S003730050043},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/SeressS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/AlonRS99,
author = {Noga Alon and
Lajos R{\'{o}}nyai and
Tibor Szab{\'{o}}},
title = {Norm-Graphs: Variations and Applications},
journal = {J. Comb. Theory, Ser. {B}},
volume = {76},
number = {2},
pages = {280--290},
year = {1999},
url = {https://doi.org/10.1006/jctb.1999.1906},
doi = {10.1006/JCTB.1999.1906},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/AlonRS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KollarRS96,
author = {J{\'{a}}nos Koll{\'{a}}r and
Lajos R{\'{o}}nyai and
Tibor Szab{\'{o}}},
title = {Norm-Graphs and Bipartite Tur{\'{a}}n Numbers},
journal = {Comb.},
volume = {16},
number = {3},
pages = {399--406},
year = {1996},
url = {https://doi.org/10.1007/BF01261323},
doi = {10.1007/BF01261323},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/KollarRS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Szabo96,
author = {Tibor Szab{\'{o}}},
title = {On nearly regular co-critical graphs},
journal = {Discret. Math.},
volume = {160},
number = {1-3},
pages = {279--281},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(95)00121-C},
doi = {10.1016/0012-365X(95)00121-C},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Szabo96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BabaiGKRSW96,
author = {L{\'{a}}szl{\'{o}} Babai and
Anna G{\'{a}}l and
J{\'{a}}nos Koll{\'{a}}r and
Lajos R{\'{o}}nyai and
Tibor Szab{\'{o}} and
Avi Wigderson},
editor = {Gary L. Miller},
title = {Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone
Span Programs},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM} Symposium on the Theory
of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996},
pages = {603--611},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/237814.238010},
doi = {10.1145/237814.238010},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BabaiGKRSW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/SeressS95,
author = {{\'{A}}kos Seress and
Tibor Szab{\'{o}}},
title = {Dense Graphs with Cycle Neighborhoods},
journal = {J. Comb. Theory, Ser. {B}},
volume = {63},
number = {2},
pages = {281--293},
year = {1995},
url = {https://doi.org/10.1006/jctb.1995.1020},
doi = {10.1006/JCTB.1995.1020},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/SeressS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:56 CEST 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:
