Clemens, Dennis; Ferber, Asaf; Glebov, Roman; Hefetz, Dan; Liebenau, Anita Building spanning trees quickly in maker-breaker games. (English) Zbl 1331.91048 SIAM J. Discrete Math. 29, No. 3, 1683-1705 (2015). MSC: 91A43 91A24 05C57 05C05 PDFBibTeX XMLCite \textit{D. Clemens} et al., SIAM J. Discrete Math. 29, No. 3, 1683--1705 (2015; Zbl 1331.91048) Full Text: DOI arXiv Link
Ferber, Asaf; Hefetz, Dan Weak and strong \(k\)-connectivity games. (English) Zbl 1296.05129 Eur. J. Comb. 35, 169-183 (2014). MSC: 05C57 05C40 05C55 91A43 91A05 PDFBibTeX XMLCite \textit{A. Ferber} and \textit{D. Hefetz}, Eur. J. Comb. 35, 169--183 (2014; Zbl 1296.05129) Full Text: DOI arXiv
Clemens, Dennis; Ferber, Asaf; Glebov, Roman; Hefetz, Dan; Liebenau, Anita Building spanning trees quickly in maker-breaker games. (English) Zbl 1294.05114 Nešetřil, Jaroslav (ed.) et al., The seventh European conference on combinatorics, graph theory and applications. Extended abstracts of EuroComb 2013, Pisa, Italy, September 9–13, 2013. Pisa: Edizioni della Normale (ISBN 978-88-7642-474-8/pbk; 978-88-7642-475-5/ebook). Centro di Ricerca Matematica Ennio De Giorgi (CRM) Series 16, 365-370 (2013). MSC: 05C57 91A43 91A24 05C05 PDFBibTeX XMLCite \textit{D. Clemens} et al., CRM Ser. 16, 365--370 (2013; Zbl 1294.05114)
Ben-Shimon, Sonny; Ferber, Asaf; Hefetz, Dan; Krivelevich, Michael Hitting time results for maker-breaker games. (English) Zbl 1247.91036 Random Struct. Algorithms 41, No. 1, 23-46 (2012). MSC: 91A43 05C57 05C80 PDFBibTeX XMLCite \textit{S. Ben-Shimon} et al., Random Struct. Algorithms 41, No. 1, 23--46 (2012; Zbl 1247.91036) Full Text: DOI arXiv
Ferber, Asaf; Hefetz, Dan; Krivelevich, Michael Fast embedding of spanning trees in biased maker-breaker games. (English) Zbl 1242.05179 Eur. J. Comb. 33, No. 6, 1086-1099 (2012). MSC: 05C57 05C05 PDFBibTeX XMLCite \textit{A. Ferber} et al., Eur. J. Comb. 33, No. 6, 1086--1099 (2012; Zbl 1242.05179) Full Text: DOI
Ben-Shimon, Sonny; Ferber, Asaf; Hefetz, Dan; Krivelevich, Michael Hitting time results for maker-breaker games (extended abstract). (English) Zbl 1377.91042 Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 900-912 (2011). MSC: 91A43 05C57 05C80 PDFBibTeX XMLCite \textit{S. Ben-Shimon} et al., in: Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23--25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 900--912 (2011; Zbl 1377.91042) Full Text: Link
Hefetz, Dan; Ferber, Asaf; Krivelevich, Michael Fast embedding of spanning trees in biased maker-breaker games. (English) Zbl 1274.05320 Nešetřil, Jarik (ed.) et al., Extended abstracts of the sixth European conference on combinatorics, graph theory and applications, EuroComb 2011, Budapest, Hungary, August 29 – September 2, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 38, 331-336 (2011). MSC: 05C57 05C05 PDFBibTeX XMLCite \textit{D. Hefetz} et al., Electron. Notes Discrete Math. 38, 331--336 (2011; Zbl 1274.05320) Full Text: arXiv Link
Ferber, Asaf; Hefetz, Dan Winning strong games through fast strategies for weak games. (English) Zbl 1222.05187 Electron. J. Comb. 18, No. 1, Research Paper P144, 13 p. (2011). MSC: 05C57 05C45 05C70 91A43 PDFBibTeX XMLCite \textit{A. Ferber} and \textit{D. Hefetz}, Electron. J. Comb. 18, No. 1, Research Paper P144, 13 p. (2011; Zbl 1222.05187) Full Text: EuDML EMIS