Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
FELDHEIM, OHAD N.
and
KRIVELEVICH, MICHAEL
2008.
Winning Fast in Sparse Graph Construction Games.
Combinatorics, Probability and Computing,
Vol. 17,
Issue. 6,
p.
781.
Beck, József
2008.
Building Bridges.
Vol. 19,
Issue. ,
p.
47.
Hefetz, Dan
Krivelevich, Michael
Stojaković, Miloš
and
Szabó, Tibor
2009.
A sharp threshold for the Hamilton cycle Maker–Breaker game.
Random Structures & Algorithms,
Vol. 34,
Issue. 1,
p.
112.
Gebauer, Heidi
Moser, Robin A.
Scheder, Dominik
and
Welzl, Emo
2009.
Efficient Algorithms.
Vol. 5760,
Issue. ,
p.
30.
Gebauer, Heidi
2009.
Algorithms - ESA 2009.
Vol. 5757,
Issue. ,
p.
764.
Hefetz, Dan
Krivelevich, Michael
and
Szabó, Tibor
2009.
Hamilton cycles in highly connected and expanding graphs.
Combinatorica,
Vol. 29,
Issue. 5,
p.
547.
Krivelevich, Michael
2010.
The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛.
Journal of the American Mathematical Society,
Vol. 24,
Issue. 1,
p.
125.
NeŠetŘil, Jaroslav
and
Ossona De Mendez, Patrice
2010.
An Irregular Mind.
Vol. 21,
Issue. ,
p.
447.
Polymath, D. H. J.
2010.
An Irregular Mind.
Vol. 21,
Issue. ,
p.
689.
Nešetřil, Jaroslav
and
Valla, Tomáš
2010.
On Ramsey‐type positional games.
Journal of Graph Theory,
Vol. 64,
Issue. 4,
p.
343.
BEN-SHIMON, SONNY
KRIVELEVICH, MICHAEL
and
SUDAKOV, BENNY
2011.
Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs.
Combinatorics, Probability and Computing,
Vol. 20,
Issue. 2,
p.
173.
Gebauer, Heidi
2012.
Disproof of the neighborhood conjecture with implications to SAT.
Combinatorica,
Vol. 32,
Issue. 5,
p.
573.
CLEMENS, DENNIS
FERBER, ASAF
KRIVELEVICH, MICHAEL
and
LIEBENAU, ANITA
2012.
Fast Strategies In Maker–Breaker Games Played on Random Boards.
Combinatorics, Probability and Computing,
Vol. 21,
Issue. 6,
p.
897.
Ben‐Shimon, Sonny
Ferber, Asaf
Hefetz, Dan
and
Krivelevich, Michael
2012.
Hitting time results for Maker‐Breaker games.
Random Structures & Algorithms,
Vol. 41,
Issue. 1,
p.
23.
Bowler, Nathan
2012.
WINNING AN INFINITE COMBINATION OF GAMES.
Mathematika,
Vol. 58,
Issue. 2,
p.
419.
Grzesik, Andrzej
Mikalački, Mirjana
Nagy, Zoltán Lóránt
Naor, Alon
Patkós, Balázs
and
Skerman, Fiona
2013.
The Seventh European Conference on Combinatorics, Graph Theory and Applications.
p.
375.
Cardinal, Jean
Ito, Hiro
Korman, Matias
and
Langerman, Stefan
2013.
Helly Numbers of Polyominoes.
Graphs and Combinatorics,
Vol. 29,
Issue. 5,
p.
1221.
Clemens, Dennis
Ferber, Asaf
Glebov, Roman
Hefetz, Dan
and
Liebenau, Anita
2013.
The Seventh European Conference on Combinatorics, Graph Theory and Applications.
p.
365.
Beveridge, Andrew
Dudek, Andrzej
Frieze, Alan
Müller, Tobias
and
Stojaković, Miloš
2014.
Maker‐breaker games on random geometric graphs.
Random Structures & Algorithms,
Vol. 45,
Issue. 4,
p.
553.
Stojaković, Miloš
2014.
Graph-Based Representation and Reasoning.
Vol. 8577,
Issue. ,
p.
31.