@article{AbYu1989,
  author = {B. Abramson and M. Yung},
  year = 1989,
  title = {Divide and conquer under global constraints:
a solution to the $n$-queens problem},
  journal = {J. Parallel Distrib. Comput.},
  volume = 6,
  pages = {649-662},
}

@inproceedings{AIK1981,
  author = {A. Adachi and S. Iwata and T. Kasai},
  year = 1981,
  title = {Low level complexity for combinatorial games},
  booktitle = {Proc. 13th Ann. ACM Symp. Theory of Computing (Milwaukee, WI, 1981)},
  organization = {Assoc. Comput. Mach., New York, NY},
  pages = {228-237},
}

@article{AIK1984,
  author = {A. Adachi and S. Iwata and T. Kasai},
  year = 1984,
  title = {Some combinatorial game problems require $\Omega (n^k)$ time},
  journal = {J. Assoc. Comput. Mach.},
  volume = 31,
  pages = {361-376},
}

@article{AKI1987,
  author = {H. Adachi and H. Kamekawa and S. Iwata},
  year = 1987,
  title = {Shogi on $n\times n$ board is complete in exponential time},
  journal = {Trans. IEICE},
  volume = {J70-D},
  pages = {1843-1852 {(in Japanese)}},
}

@inproceedings{AB1956,
  author = {E. W. Adams and D. C. Benson},
  year = 1956,
  title = {Nim-Type Games},
  booktitle = {Technical Report No. 31},
  number = {Department of Mathematics},
  pages = {},
  address = {Pittsburgh, PA},
}

@book{Ahr1910,
  author = {W. Ahrens},
  year = 1910,
  title = {Mathematische Unterhaltungen und Spiele},
  volume = {I},
  note = {Zweite vermehrte und verbesserte Auflage. (There are further
editions and related game-books of Ahrens)},
  publisher = {Teubner, Leipzig},
}

@article{ABDHKKRSU2005,
  author = {O. Aichholzer and D. Bremmer and E. D. Demaine and F. Hurtado
and E. Kranakis and H. Krasser and S. Ramaswami and S. Sethia and J. Urrutia},
  year = 2005,
  title = {Games on triangulations},
  journal = {Theoret. Comput. Sci.},
  volume = 259,
  note = {special issue: Game Theory Meets Theoretical Computer Science},
  mrnumber = {MR2168844 (2006d:91037)},
  pages = {42-71},
}

@article{Aig1995,
  author = {M. Aigner},
  year = 1995,
  title = {Ulams Millionenspiel},
  journal = {Math. Semesterber.},
  volume = 42,
  pages = {71--80},
}

@article{Aig1996,
  author = {M. Aigner},
  year = 1996,
  title = {Searching with lies},
  journal = {J. Combin. Theory \emph{(Ser.~A)}},
  volume = 74,
  pages = {43-56},
}

@article{AiFr1984,
  author = {M. Aigner and M. Fromme},
  year = 1984,
  title = {A game of cops and robbers},
  journal = {Discrete Appl. Math.},
  volume = 8,
  pages = {1-11},
}

@article{ACN1979,
  author = {M. Ajtai and L. Csirmaz and Zs. Nagy},
  year = 1979,
  title = {On a generalization of the game Go-Moku I},
  journal = {Studia Sci. Math. Hungar.},
  volume = 14,
  pages = {209-226},
}

@article {AkDa1985,
    AUTHOR = {Akin, Ethan and Davis, Morton},
     TITLE = {Bulgarian solitaire},
   JOURNAL = {Amer. Math. Monthly},
  FJOURNAL = {The American Mathematical Monthly},
    VOLUME = {92},
      YEAR = {1985},
     PAGES = {237--250},
      ISSN = {0002-9890},
     CODEN = {AMMYAE},
   MRCLASS = {05A17 (90D99)},
  MRNUMBER = {MR786523 (86m:05014)},
MRREVIEWER = {A. Pultr},
}
		
@article{AGNW2005,
  author = {M. H. Albert and J. P. Grossman and R. J. Nowakowski and D. Wolfe},
  year = 2005,
  title = {An introduction to Clobber},
  journal = {INTEGERS, Electr. J of Combinat. Number Theory},
  volume = {5(2)},
  pages = {\#A01, 12pp.},
  url = {http://www.integers-ejcnt.org/vol5(2).html},
  mrnumber = {MR2192079},
}

@article{AlNo2001,
  author = {M. H. Albert and R. J. Nowakowski},
  year = 2001,
  title = {The game of End-Nim},
  journal = {Electr. J. Combin.},
  volume = {8(2)},
  pages = {\#R1, 12pp.},
  url = {http://www.combinatorics.org/},
  note = {Volume in honor of Aviezri S. Fraenkel},
  mrnumber = {MR1853252 (2002g:91044)},
}

@article{AlNo2004,
  author = {M. H. Albert and R. J. Nowakowski},
  year = 2004,
  title = {Nim restrictions},
  journal = {INTEGERS, Electr. J of Combinat. Number Theory},
  volume = {4},
  pages = {\#G1, 10pp., Comb. Games Sect.},
  url = {http://www.integers-ejcnt.org/vol4.html},
  mrnumber = {MR2056015. There will be no review of this item},
}

@book{ANW2007,
  author = {M. Albert and R. J. Nowakowski and D. Wolfe},
  year = 2007,
  title = {Lessons in Play: An Introduction to Combinatorial Game Theory},
  publisher = {A K Peters},
}

@article{AlFr1884,
  author = {R. E. Allardice and A. Y. Fraser},
  year = 1884,
  title = {La tour d'Hano\" {\i}},
  journal = {Proc. Edinburgh Math. Soc.},
  volume = 2,
  pages = {50-53},
}

@mastersthesis{All1984,
  author = {D. T. Allemang},
  year = 1984,
  title = {Machine computation with finite games},
  school = {Cambridge University},
}

@article{All2001,
  author = {D. T. Allemang},
  year = 2001,
  title = {Generalized genus sequences for mis\`ere octal games},
  journal = {Intern. J. Game Theory,},
  volume = {30},
  pages = {539--556},
  mrnumber = {MR1907264 (2003h:91003)},
}

@inproceedings{All1989,
  author = {J. D. Allen},
  year = 1989,
  title = {A note on the computer solution of Connect-Four},
  booktitle = {Heuristic Programming in Artificial Intelligence \emph{1:}
The First Computer Olympiad},
  editor = {D. N. L. Levy and D. F. Beal},
  pages = {134-135},
  publisher = {Ellis Horwood, Chichester, England},
}

@article{Alli1985,
  author = {N. L. Alling},
  year = 1985,
  title = {Conway's field of surreal numbers},
  journal = {Trans. Amer. Math. Soc.},
  volume = {287},
  pages = {365-386},
}

@book{Alli1987,
author = {N. L. Alling},
  year = 1987,
  title = {Foundations of Analysis Over Surreal Number Fields},
  publisher = {North-Holland, Amsterdam},
}

@article{Alli1989,
  author = {N. L. Alling},
  year = 1989,
  title = {Fundamentals of analysis over surreal number fields},
  journal = {Rocky Mountain J. Math.},
  volume = {19},
  pages = {565-573},
}

@article{AlEh1986a,
  author = {N. L. Alling and P. Ehrlich},
  year = 1986,
  title = {An alternative construction of Conway's surreal numbers},
  journal = {C. R. Math. Rep. Acad. Sci.},
  volume = {8},
  pages = {241--246},
}

@article{AlEh1986b,
  author = {N. L. Alling and P. Ehrlich},
  year = 1986,
  title = {An abstract characterization of a full class of surreal numbers},
  journal = {C. R. Math. Rep. Acad. Sci.},
  volume = {8},
  pages = {303-308},
}

@phdthesis{All1994,
  author = {L. V. Allis},
  title = {Searching for solutions in games and artificial intelligence},
  school = {University of Limburg},
  year = 1994,
  url = {ftp://ftp.cs.vu.nl/pub/victor/PhDthesis/thesis.ps.Z}
}

@inproceedings{AlSc1992,
  author = {L. V. Allis and P. N. A. Schoo},
  year = 1992,
  title = {Qubic solved again},
  booktitle = {Heuristic Programming in Artificial Intelligence \emph{3:}
The Third Computer Olympiad},
  editor = {H. J. van den Herik and L. V. Allis},
  pages = {192-204},
  publisher = {Ellis Horwood, New York},
}

@inproceedings{AHH1993,
  author = {L. V. Allis and H. J. van den Herik and M. P. H. Huntjens},
  year = 1993,
  title = {Go-Moku solved by new search techniques},
  booktitle = {Proc. 1993 AAAI Fall Symp. on Games: Planning and Learning},
  number = {AAAI Press Tech. Report FS93--02},
  pages = {1-9},
  address = {Menlo Park, CA},
}

@article{AARS1994,
  author = {J.-P. Allouche and D. Astoorian and J. Randall and J. Shallit},
  year = 1994,
  title = {Morphisms, squarefree strings, and the tower of Hanoi puzzle},
  journal = {Amer. Math. Monthly},
  volume = 101,
  pages = {651-658},
  mrnumber = {MR1289274 (95g:68090)},
}

@incollection {AlSa2005,
    AUTHOR = {Allouche, Jean-Paul and Sapir, Amir},
     TITLE = {Restricted towers of {H}anoi and morphisms},
 BOOKTITLE = {Developments in Language Theory},
    SERIES = {Lecture Notes in Comput. Sci.},
    VOLUME = {3572},
     PAGES = {1--10},
 PUBLISHER = {Springer},
   ADDRESS = {Berlin},
      YEAR = {2005},
   MRCLASS = {68W01},
  MRNUMBER = {MR2187246 (2006g:68266)},
}

@article{ABBS2002,
  author = {N. Alon and J. Balogh and B. Bollob\'{a}s and T. Szab\'{o}},
  year = 2002,
  title = {Game domination number},
  journal = {Discrete Math.},
  volume = 256,
  pages = {23-33},
  mrnumber = {MR1927054 (2003f:05086)},
}

@article{AKSS2005,
  author = {N. Alon and M. Krivelevich and J. Spencer and T. Szab\'{o}},
  year = 2005,
  title = {Discrepancy games},
  journal = {Electr. J. Combin.},
  volume = {12(1)},
  pages = {\#R51, 9pp.},
  url = {http://www.combinatorics.org/},
  mrnumber = {MR2176527},
}

@article{AT1995,
  author = {N. Alon and Z. Tuza},
  year = 1995,
  title = {The acyclic orientation game on random graphs},
  journal = {Random Structures Algorithms},
  volume = 6,
  pages = {261-268},
}

@article{AlBe1991,
  author = {S. Alpern and A. Beck},
  year = 1991,
  title = {Hex games and twist maps on the annulus},
  journal = {Amer. Math. Monthly},
  volume = 98,
  pages = {803-811},
}

@article{Alt1988,
  author = {I. Alth\"ofer},
  year = 1988,
  title = {Nim games with arbitrary periodic moving orders},
  journal = {Internat. J. Game Theory},
  volume = 17,
  pages = {165-175},
}

@article{Alt1988a,
  author = {I. Alth\"ofer},
  year = 1988,
  title = {On the complexity of searching game trees and other recursion trees},
  journal = {J. Algorithms},
  volume = 9,
  pages = {538-567},
}

@incollection{Alt1989,
  author = {I. Alth\"ofer},
  year = 1989,
  title = {Generalized minimax algorithms are no better error
correctors than minimax is itself},
  booktitle = {Advances in Computer Chess},
  volume = 5,
  editor = {D. F. Beal},
  publisher = {Elsevier, Amsterdam},
  pages = {265-282},
}

@article{AlBu1995,
  author = {I. Alth\"ofer and J. B\"ultermann},
  year = 1995,
  title = {Superlinear period lengths in some subtraction games},
  journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
  volume = 148,
  pages = {111-119},
}

@article{AmBa2006,
  author = {G. Ambrus and J. Bar\'at},
  year = 2006,
  title = {A contribution to queens graphs: a substitution method},
  journal = {Discrete Math.},
  volume = 306,
  pages = {1105-1114},
  mrnumber = {MR**, pending},
}

@article{AnFe1998,
  author = {M. Anderson and T. Feil},
  year = 1998,
  title = {Turning lights out with linear algebra},
  journal = {Math. Mag.},
  volume = 71,
  pages = {300-303},
}

@article{AnHa1987,
  author = {M. Anderson and F. Harary},
  year = 1987,
  title = {Achievement and avoidance games for generating abelian groups},
  journal = {Internat. J. Game Theory},
  volume = 16,
  pages = {321-325},
}

@article{ALSSTW1989,
  author = {R. Anderson and L. Lov\'asz and P. Shor and J. Spencer
and \'E. Tard\'os and S. Winograd},
  year = 1989,
  title = {Disks, balls and walls: analysis of a combinatorial game},
  journal = {Amer. Math. Monthly},
  volume = 96,
  pages = {481-493},
}

@article{And1984,
  author = {T. Andreae},
  year = 1984,
  title = {Note on a pursuit game played on graphs},
  journal = {Discrete Appl. Math.},
  volume = 9,
  pages = {111-115},
}

@article{And1986,
  author = {T. Andreae},
  year = 1986,
  title = {On a pursuit game played on graphs for which a minor is excluded},
  journal = {J. Combin. Theory \emph{(Ser.~B)}},
  volume = 41,
  pages = {37-47},
}

@article{AHW1999,
  author = {T. Andreae and F. Hartenstein and A. Wolter},
  year = 1999,
  title = {A two-person game on graphs where each player tries to encircle
his opponent's men},
  journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
  volume = 215,
  pages = {305-323},
}

@article {MR2221551,
    AUTHOR = {Andres, Stephan Dominique},
     TITLE = {The game chromatic index of forests of maximum degree
              {$\Delta\geq 5$}},
   JOURNAL = {Discrete Appl. Math.},
  FJOURNAL = {Discrete Applied Mathematics. The Journal of Combinatorial
              Algorithms, Informatics and Computational Sciences},
    VOLUME = {154},
      YEAR = {2006},
     PAGES = {1317--1323},
      ISSN = {0166-218X},
     CODEN = {DAMADU},
   MRCLASS = {05C15},
  MRNUMBER = {MR2221551},
MRREVIEWER = {Guofei Zhou},
}
		
@inproceedings{Ans2000,
  author = {V. V. Anshelevich},
  year = 2000,
  title = {The Game of Hex: an automatic theorem proving approach to game
programming},
  booktitle = {Proc. 17-th National Conference on Artificial Intelligence
{\rm (}AAAI-2000{\rm )}},
  editor = {},
  organization = {AAAI Press, Menlo Park, CA},
  pages = {189-194},
  mrnumber = {MR1973011 (2004b:91039)},
}

@incollection{Ans2002,
  author = {V. V. Anshelevich},
  year = 2002,
  title = {The game of Hex: the hierarchical approach},
  pages = {151-165},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = {42},
  booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
}

@article{AnFa1988,
  author = {R. P. Anstee and M. Farber},
  year = 1988,
  title = {On bridged graphs and cop-win graphs},
  journal = {J. Combin. Theory \emph{(Ser.~B)}},
  volume = 44,
  pages = {22-28},
}

@article {MR1483752,
    AUTHOR = {Apartsin, A. and Ferapontova, E. and Gurvich, V.},
     TITLE = {A circular graph---counterexample to the {D}uchet kernel
              conjecture},
   JOURNAL = {Discrete Math.},
  FJOURNAL = {Discrete Mathematics},
    VOLUME = {178},
      YEAR = {1998},
     PAGES = {229--231},
      ISSN = {0012-365X},
     CODEN = {DSMHA4},
   MRCLASS = {05C75},
  MRNUMBER = {MR1483752 (98f:05122)},
}
		
@article{AJS1999,
  author = {D. Applegate and G. Jacobson and D. Sleator},
  year = 1999,
  title = {Computer analysis of Sprouts},
  journal = {{\rm in:} The Mathemagician and Pied Puzzler{\rm ,}},
  chapter = {},
  pages = {},
  note = {honoring Martin Gardner; E. Berlekamp and T. Rodgers, eds.,
A K Peters, Natick, MA, pp. 199-201},
  publisher = {},
}

@article{Ara1982,
  author = {A. A. Arakelyan},
  year = 1982,
  title = {$D$-products and compositions of Nim games},
  journal = {Akad. Nauk Armyan. SSR Dokl.},
  volume = 74,
  pages = {3-6},
  note = {(Russian)},
}

@article{Arc1999,
  author = {A. F. Archer},
  year = 1999,
  title = {A modern treatment of the $15$ puzzle},
  journal = {Amer. Math. Monthly},
  volume = 106,
  pages = {793-799},
}

@book{Arn1993,
  editor = {P. Arnold},
  title = {The Book of Games},
  publisher = {Hamlyn, Chancellor Press},
  year = 1993,
}

@article{AQS1997,
  author = {A. A. Arratia-Quesada and I. A. Stewart},
  year = 1997,
  title = {Generalized Hex and logical characterizations of polynomial space},
  journal = {Inform. Process. Lett.},
  volume = 63,
  pages = {147-152},
}

@article{ArSt2003,
  author = {A. A. Arratia and I. A. Stewart},
  year = 2003,
  title = {A note on first-order projections and games},
  journal = {Theoret. Comput. Sci.},
  volume = 290,
  pages = {2085-2093},
  mrnumber = {MR1937766 (2003i:68034)},
}

@article{Asc1987,
  author = {M. Ascher},
  year = 1987,
  title = {Mu Torere: An analysis of a Maori game},
  journal = {Math. Mag.},
  volume = 60,
  pages = {90-100},
}

@article{Ase1974,
  author = {I. M. Asel'derova},
  year = 1974,
  title = {On a certain discrete pursuit game on graphs},
  journal = {Cybernetics},
  volume = 10,
  pages = {859-864},
  note = {trans. of {\it Kibernetika} {\bf 10} (1974) 102--105},
}

@article{AsDh1993,
  author = {J. A. Aslam and A. Dhagat},
  year = 1993,
  title = {On-line algorithms for 2-coloring hypergraphs via chip games},
  journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
  volume = 112,
  pages = {355-369},
}

@article{Atk1981,
  author = {M. D. Atkinson},
  year = 1981,
  title = {The cyclic towers of Hanoi},
  journal = {Inform. Process. Lett.},
  volume = 13,
  pages = {118-119},
}

@article{Aug1991,
  author = {J. M. Auger},
  year = 1991,
  title = {An infiltration game on $k$ arcs},
  journal = {Naval Res. Logistics},
  volume = 38,
  pages = {511-529},
}

@inproceedings{ANP1992,
  author = {V. Auletta and A. Negro and G. Parlati},
  year = 1992,
  title = {Some results on searching with lies},
  booktitle = {Proc. 4th Italian Conf. on Theoretical Computer Science},
  editor = {},
  organization = {L'Aquila, Italy},
  pages = {24-37},
}

@article{ABW1993,
  author = {J. Auslander and A. T. Benjamin and D. S. Wilkerson},
  year = 1993,
  title = {Optimal leapfrogging},
  journal = {Math. Mag.},
  volume = 66,
  pages = {14-19},
}

@mastersthesis{Aus1976,
  author = {R. Austin},
  year = 1976,
  title = {Impartial and partisan games},
  school = {Univ. of Calgary},
}

@article{AyLo1985,
  author = {J. O. A. Ayeni and H. O. D. Longe},
  year = 1985,
  title = {Game people play: Ayo},
  journal = {Internat. J. Game Theory},
  volume = 14,
  pages = {207-218},
}

@article{AzBe2006,
  author = {D. Azriel and D. Berend},
  year = 2006,
  title = {On a question of Leiss regarding the Hanoi Tower problem},
  journal = {Theoret. Comput. Sci.},
  volume = 369,
  pages = {377-383},
  mrnumber = {**MR, pending},
}

@article{BaMo1988,
  author = {L. Babai and S. Moran},
  year = 1988,
  title = {Arthur--Merlin games: a randomized proof system, and a hierarchy of complexity classes},
  journal = {J. Comput. System Sci.},
  volume = 36,
  pages = {254-276},
}

@article{BaWr1995,
  author = {R. J. R. Back and J. von Wright},
  year = 1995,
  title = {Games and winning strategies},
  journal = {Inform. Process. Lett.},
  volume = 53,
  pages = {165-172},
}

@inbook{BaMi2004,
  author = {R. Backhouse and D. Michaelis},
  year = 2004,
  title = {{\rm Fixed-point characterisation of winning strategies in 
impartial games in:} Relational and Kleene-Algebraic Methods in 
Computer Science},
  publisher = {Lecture Notes in Computer Scienc, Springer Berlin, Heidelberg},
  chapter ={},
  volume = {3051/2004},
  pages = {34-47},
}

@article{BaKi1985,
  author = {C. K. Bailey and M. E. Kidwell},
  year = 1985,
  title = {A king's tour of the chessboard},
  journal = {Math. Mag.},
  volume = 58,
  pages = {285-286},
}

@book{BaCo1987,
  author = {W. W. R. Ball and H. S. M. Coxeter},
  year = 1987,
  title = {Mathematical Recreations and Essays},
  edition = {13th},
  publisher = {Dover, New York, NY},
}

@article{BaPu1990,
  author = {B. Banaschewski and A. Pultr},
  year = {1990/91},
  title = {Tarski's fixpoint lemma and combinatorial games},
  journal = {Order},
  volume = 7,
  pages = {375-386},
}

@inproceedings{Ban1971,
  author = {R. B. Banerji},
  year = 1971,
  title = {Similarities in games and their use in strategy construction},
  booktitle = {Proc. Symp. Computers and Automata},
  editor = {J. Fox},
  organization = {Polytechnic Press, Brooklyn, NY},
  pages = {337-357},
}

@book{Ban1980,
  author = {R. B. Banerji},
  year = 1980,
  title = {Artificial Intelligence, A Theoretical Approach},
  publisher = {Elsevier, North-Holland, New York, NY},
}

@article{BaDu1992,
  author = {R. B. Banerji and C. A. Dunning},
  year = 1992,
  title = {On misere games},
  journal = {Cybernetics and Systems},
  volume = 23,
  pages = {221-228},
}

@article{BaEr1972,
  author = {R. B. Banerji and G. W. Ernst},
  year = 1972,
  title = {Strategy construction using homomorphisms between games},
  journal = {Artificial Intelligence},
  volume = 3,
  pages = {223-249},
}

@article{YEM1993,
  author = {Bar Yehuda, R. and T. Etzion and S. Moran},
  year = 1993,
  title = {Rotating-table games and derivatives of words},
  journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
  volume = 108,
  pages = {311-329},
}

@article{Bar1979,
  author = {I. B\'ar\'any},
  year = 1979,
  title = {On a class of balancing games},
  journal = {J. Combin. Theory \emph{(Ser.~A)}},
  volume = 26,
  pages = {115-126},
}

@article{Bar1974,
  author = {J. G. Baron},
  year = 1974,
  title = {The game of nim --- a heuristic approach},
  journal = {Math. Mag.},
  volume = 47,
  pages = {23-28},
}

@article{BaRa1996,
  author = {R. Barua and S. Ramakrishnan},
  year = 1996,
  title = {$\sigma$-game, $\sigma^+$-game and two-dimen\-sional
additive cellular automata},
  journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
  volume = 154,
  pages = {349-366},
}

@article{BaBo1985,
  author = {V. J. D. Baston and F. A. Bostock},
  year = 1985,
  title = {A game locating a needle in a cirular haystack},
  journal = {J. Optimization Theory and Applications},
  volume = 47,
  pages = {383-391},
}

@article{BaBo1986,
  author = {V. J. D. Baston and F. A. Bostock},
  year = 1986,
  title = {A game locating a needle in a square haystack},
  journal = {J. Optimization Theory and Applications},
  volume = 51,
  pages = {405-419},
}

@article{BaBo1987,
  author = {V. J. D. Baston and F. A. Bostock},
  year = 1987,
  title = {Discrete hamstrung squad car games},
  journal = {Internat. J. Game Theory},
  volume = 16,
  pages = {253-261},
}

@article{BaBo1988,
  author = {V. J. D. Baston and F. A. Bostock},
  year = 1988,
  title = {A simple cover-up game},
  journal = {Amer. Math. Monthly},
  volume = 95,
  pages = {850-854},
}

@article{BaBo1989,
  author = {V. J. D. Baston and F. A. Bostock},
  year = 1989,
  title = {A one-dimensional helicopter-sub\-mar\-ine game},
  journal = {Naval Res. Logistics},
  volume = 36,
  pages = {479-490},
}

@article{BaBo1993,
  author = {V. J. D. Baston and F. A. Bostock},
  year = 1993,
  title = {Infinite deterministic graphical games},
  journal = {SIAM J. Control Optim.},
  volume = 31,
  pages = {1623-1629},
}

@incollection{BGLM1975,
  author = {J. Baumgartner and F. Galvin and R. Laver and R. McKenzie},
  year = 1975,
  title = {Game theoretic versions of partition relations},
  pages = {131-135},
  editor = {A. Hajnal and R. Rado and V. T. S\'os},
  booktitle = {Colloquia Mathematica Societatis J\'anos Bolyai
{\bf 10}, Proc. Internat. Colloq. on Infinite and Finite Sets,
\emph{Vol.~1, Keszthely, Hungary, 1973}},
  publisher = {North-Holland},
}

@book{Bea1985,
  author = {J. D. Beasley},
  year = 1985,
  title = {The Ins \& Outs of Peg Solitaire},
  publisher = {Oxford University Press, Oxford},
}

@book{Bea1989,
  author = {J. D. Beasley},
  year = 1989,
  title = {The Mathematics of Games},
  publisher = {Oxford University Press, Oxford},
}

@book{Bea1995,
  author = {P. Beaver},
  year = 1995,
  title = {Victorian Parlour Games},
  publisher = {Magna Books},
}

@incollection{Bec2000,
  author = {A. Beck},
  year = 1969,
  title = {Games},
  chapter = 5,
  pages = {317-387},
  editor = {A. Beck and M. N. Bleicher and D. W. Crowe},
  booktitle = {Excursions into Mathematics},
  EDITION = {millennium},
  NOTE = {With a foreword by Martin Gardner; first appeared in 1969, 
Worth Publ.},
  publisher = {A K Peters},
  ADDRESS = {Natick, MA},
  MRNUMBER = {MR1744676 (2000k:00002)},
}

@article{Bec1981,
  author = {J. Beck},
  year = 1981,
  title = {On positional games},
  journal = {J. Combin. Theory \emph{(Ser.~A)}},
  volume = 30,
  pages = {117-133},
}

@article{Bec1981a,
  author = {J. Beck},
  year = 1981,
  title = {Van der Waerden and Ramsey type games},
  journal = {Combinatorica},
  volume = 1,
  pages = {103-116},
}

@article{Bec1982,
  author = {J. Beck},
  year = 1982,
  title = {On a generalization of Kaplansky's game},
  journal = {Discrete Math.},
  volume = 42,
  pages = {27-35},
}

@article{Bec1982a,
  author = {J. Beck},
  year = 1982,
  title = {Remarks on positional games, I},
  journal = {Acta Math. Acad. Sci. Hungar.},
  volume = 40,
  number = {1--2},
  pages = {65-71},
}

@article{Bec1983,
  author = {J. Beck},
  title = {Biased {Ramsey} type games},
  journal = {Studia Sci. Math. Hung.},
  year = 1983,
  volume = 18,
  pages = {287-292},
}

@article{Bec1985,
  author = {J. Beck},
  year = 1985,
  title = {Random graphs and positional games on the complete graph},
  journal = {Ann. Discrete Math.},
  volume = 28,
  pages = {7-13},
}

@incollection{Bec1993,
  author = {J. Beck},
  year = 1993,
  title = {Achievement games and the probabilistic method},
  pages = {51--78},
  volume = {1},
  booktitle = {Combinatorics, Paul Erd\H os is Eighty},
  publisher = {Bolyai Soc. Math. Stud., J\'anos Bolyai Math. Soc.,
Budapest},
}

@article{Bec1994,
  author = {J. Beck},
  title = {Deterministic graph games and a probabilistic intuition},
  journal = {Combin. Probab. Comput.},
  year = 1994,
  volume = 3,
  pages = {13--26},
}

@article{Bec1996,
  author = {J. Beck},
  title = {Foundations of positional games},
  journal = {Random Structures Algorithms},
  year = 1996,
  volume = 9,
  pages = {15--47},
  note = {appeared first in: Proc. Seventh International Conference on
Random Structures and Algorithms, Atlanta, GA, 1995},
}

@incollection{Bec1997,
  author = {J. Beck},
  year = 1997,
  title = {Games, randomness and algorithms},
  editor = {R. L. Graham and J. Ne\v{s}et\v{r}il},
  pages = {280-310},
  volume = {I},
  booktitle = {The Mathematics of Paul Erd\H os},
  publisher = {Springer},
}

@inproceedings{Bec1997a,
  author = {J. Beck},
  title = {Graph games},
  booktitle = {Proc. Int. Coll. Extremal Graph Theory},
  year = 1997,
  address = {Balatonlelle, Hungary},
}

@article{Bec2002a,
  author = {J. Beck},
  year = 2002,
  title = {Positional games and the second moment method},
  journal = {Combinatorica},
  volume = 22,
  pages = {169-216},
  note = {special issue: Paul Erd\"{o}s and his mathematics},
  mrnumber = {MR1909083 (2003i:91027)},
}

@article{Bec2002b,
  author = {J. Beck},
  year = 2002,
  title = {Ramsey games},
  journal = {Discrete Math.},
  volume = 249,
  pages = {3-30},
  mrnumber = {MR1898254 (2003e:05084)},
}

@article{Bec2002c,
  author = {J. Beck},
  year = 2002,
  title = {The Erd\"{o}s-Selfridge theorem in positional game theory},
  journal = {Bolyai Soc. Math. Stud.},
  volume = 11,
  pages = {33-77},
  note = {Paul Erd\"{o}s and his mathematics, II, J\'{a}nos Bolyai Math.
Soc., Budapest},
  mrnumber = {MR1954724 (2004a:91028)},
}

@article{Bec2002d,
  author = {J. Beck},
  year = 2002,
  title = {Tic-Tac-Toe},
  journal = {Bolyai Soc. Math. Stud.},
  volume = 10,
  pages = {93-137},
  note = {J\'{a}nos Bolyai Math. Soc., Budapest},
  mrnumber = {MR1919569 (2003e:05137)},
}

@book{Bec2006,
author = {J. Beck},
  year = 2006,
  title = {Tic-Tac-Toe Theory},
  publisher = {Cambridge University Press, Cambridge},
  note = {to appear},
}

@article{BeCs1982,
  author = {J. Beck and L. Csirmaz},
  year = 1982,
  title = {Variations on a game},
  journal = {J. Combin. Theory \emph{(Ser.~A)}},
  volume = 33,
  pages = {297-315},
}

@article{BeGa1991,
  author = {R. Beigel and W. I. Gasarch},
  year = 1991,
  title = {The mapmaker's dilemma},
  journal = {Discrete Appl. Math.},
  volume = 34,
  pages = {37-48},
}

@article {BBH1999,
    AUTHOR = {L. W. Beineke and I. Broereand and M. A. Henning},
     TITLE = {Queens graphs},
      NOTE = {Combinatorics and number theory (Tiruchirappalli, 1996)},
   JOURNAL = {Discrete Math.},
    VOLUME = {206},
      YEAR = {1999},
     PAGES = {63--75},
   MRCLASS = {05C75},
  MRNUMBER = {MR1665386 (2000f:05066)},
}

@article{BBCH2003,
  author = {A. Bekmetjev and G. Brightwell and A. Czygrinow and G. Hurlbert},
  year = 2003,
  title = {Thresholds for families of multisets, with an application
to graph pebbling},
  journal = {Discrete Math.},
  volume = 269,
  pages = {21-34},
  mrnumber = {MR1989450 (2004i:05152)},
}

@book{Bel1960,
  author = {R. C. Bell},
  year = {1960, 1969},
  title = {Board and Table Games from Many Civilisations},
  volume = {I \& II},
  publisher = {Oxford University Press},
  note = {revised in 1979, Dover},
}

@book{Bel1988,
  author = {R. Bell and M. Cornelius},
  year = 1988,
  title = {Board Games Round the World: A Resource Book for Mathematical 
Investigations},
  publisher = {Cambridge University Press, Cambridge},
  note = {reprinted 1990},
}

@article{BFH2001,
  author = {A. J. Benjamin and M. T. Fluet and M. L. Huber},
  year = 2001,
  title = {Optimal Token Allocations in Solitaire Knock 'm Down},
  journal = {Electr. J. Combin.},
  volume = {8(2)},
  pages = {\#R2, 8pp.},
  url = {http://www.combinatorics.org/},
  note = {Volume in honor of Aviezri S. Fraenkel},
  mrnumber = {MR1853253 (2002g:91048)},
}

@article{BMW1991,
  author = {S. J. Benkoski and M. G. Monticino and J. R. Weisinger},
  year = 1991,
  title = {A survey of the search theory literature},
  journal = {Naval Res. Logistics},
  volume = 38,
  pages = {469-494},
}

@article{Ben1994,
  author = {G. Bennett},
  year = 1994,
  title = {Double dipping: the case of the missing binomial coefficient identities},
  journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
  volume = 123,
  pages = {351-375},
}

@article {Ben1987,
    AUTHOR = {Bentz, Hans-J.},
     TITLE = {Proof of the {B}ulgarian {S}olitaire conjectures},
   JOURNAL = {Ars Combin.},
  FJOURNAL = {Ars Combinatoria},
    VOLUME = {23},
      YEAR = {1987},
     PAGES = {151--170},
      ISSN = {0381-7032},
     CODEN = {ACOMDN},
   MRCLASS = {05A17 (90D42)},
  MRNUMBER = {MR886950 (88k:05018)},
MRREVIEWER = {D. A. Klarner},
}

@article {BeSa2006a,
    AUTHOR = {Berend, Daniel and Sapir, Amir},
     TITLE = {The cyclic multi-peg tower of {H}anoi},
   JOURNAL = {ACM Trans. Algorithms},
  FJOURNAL = {ACM Transactions on Algorithms},
    VOLUME = {2},
      YEAR = {2006},
     PAGES = {297--317},
      ISSN = {1549-6325},
   MRCLASS = {68Q25 (05A05 68W40)},
  MRNUMBER = {**MR2253783, pending},
}

@article {BeSa2006b,
    AUTHOR = {Berend, Daniel and Sapir, Amir},
     TITLE = {The diameter of {H}anoi graphs},
   JOURNAL = {Inform. Process. Lett.},
  FJOURNAL = {Information Processing Letters},
    VOLUME = {98},
      YEAR = {2006},
     PAGES = {79--85},
      ISSN = {0020-0190},
     CODEN = {IFPLAT},
   MRCLASS = {68W40 (05C85 68Q25)},
  MRNUMBER = {MR2207581 (2006m:68187)},
MRREVIEWER = {Jean-Paul Allouche},
}
		
@incollection{Ber1981,
  author = {D. Berengut},
  year = 1981,
  title = {A random hopscotch problem or how to make Johnny read more},
  pages = {51-59},
  editor = {D. A. Klarner},
  publisher = {Wadsworth Internat., Belmont, CA},
  booktitle = {The Mathematical Gardner},
}

@article{BeGn1984,
  author = {B. Berezovskiy and A. Gnedin},
  year = 1984,
  title = {The best choice problem},
  journal = {Akad. Nauk, USSR, Moscow \emph{(in Russian)}},
}

@article {Ber1956,
    AUTHOR = {Berge, Claude},
     TITLE = {La fonction de {G}rundy d'un graphe infini},
   JOURNAL = {C. R. Acad. Sci. Paris},
    VOLUME = {242},
      YEAR = {1956},
     PAGES = {1404--1407},
   MRCLASS = {90.0X},
  MRNUMBER = {MR0089115 (19,621d)},
}
		
@book {Ber1957,
    AUTHOR = {Berge, C.},
     TITLE = {Th\'eorie g\'en\'erale des jeux \`a {$n$} personnes},
    SERIES = {M\'emor. Sci. Math., no. 138},
 PUBLISHER = {Gauthier-Villars},
   ADDRESS = {Paris},
      YEAR = {1957},
     PAGES = {114},
   MRCLASS = {90.00},
  MRNUMBER = {MR0099259 (20 \#5700)},
MRREVIEWER = {I. Mann},
}
		
@article{Ber1976,
  author = {C. Berge},
  year = 1976,
  title = {Sur les jeux positionnels},
  journal = {Cahiers du Centre \'Etudes Rech. Op\'er.},
  volume = 18,
  pages = {91-107},
}

@incollection{Ber1977,
  author = {C. Berge},
  year = 1977,
  title = {Vers une th\'eorie g\'en\'erale des jeux positionnels},
  editor = {R. Henn and O. Moeschlin},
  pages = {13-24},
  publisher = {Springer Verlag, Berlin},
  volume = 141,
  booktitle = {Mathematical Economics and Game Theory, Essays in
Honor of Oskar Morgenstern, \emph{Lecture Notes in Economics}},
}

@incollection{Ber1981a,
  author = {C. Berge},
  year = 1981,
  title = {Some remarks about a Hex problem},
  pages = {25-27},
  editor = {D. A. Klarner},
  publisher = {Wadsworth Internat., Belmont, CA},
  booktitle = {The Mathematical Gardner},
}

@article {Ber1982,
    AUTHOR = {Berge, C.},
     TITLE = {Les jeux combinatoires},
   JOURNAL = {Cahiers Centre \'Etudes Rech. Op\'er.},
  FJOURNAL = {Cahiers du Centre d'\'Etudes de Recherche Op\'erationnelle},
    VOLUME = {24},
      YEAR = {1982},
     PAGES = {89--105},
      ISSN = {0008-9737},
     CODEN = {CCROAT},
   MRCLASS = {90D05 (05B30)},
  MRNUMBER = {MR687875 (84d:90112)},
}
		
@inbook{Ber1985,
  author = {C. Berge},
  year = 1985,
  title = {Graphs},
  chapter = 14,
  publisher = {North-Holland, Amsterdam},
}

@inbook{Ber1989,
  author = {C. Berge},
  year = 1989,
  title = {Hypergraphs},
  chapter = 4,
  publisher = {Elsevier (French: Gauthier Villars 1988)},
}

@article {Ber1992,
    AUTHOR = {Berge, Claude},
     TITLE = {Les jeux sur un graphe},
   JOURNAL = {Cahiers Centre \'Etudes Rech. Op\'er.},
  FJOURNAL = {Cahiers du Centre d'\'Etudes de Recherche Op\'erationnelle.
              Operations Research, Statistics and Applied Mathematics},
    VOLUME = {34},
      YEAR = {1992},
     PAGES = {95--101},
      ISSN = {0774-3068},
     CODEN = {CCROAT},
   MRCLASS = {05C99 (05C65 90D35)},
  MRNUMBER = {MR1226531 (94h:05089)},
MRREVIEWER = {Robin J. Wilson},
}

@article{Ber1996,
  author = {C. Berge},
  year = 1996,
  title = {Combinatorial games on a graph},
  journal = {Discrete Math.},
  volume = 151,
  pages = {59-65},
}

@article{BeDu1988,
  author = {C. Berge and P. Duchet},
  year = 1988,
  title = {Perfect graphs and kernels},
  journal = {Bull. Inst. Math. Acad. Sinica},
  volume = 16,
  pages = {263-274},
}

@article{BeDu1990,
  author = {C. Berge and P. Duchet},
  year = 1990,
  title = {Recent problems and results about kernels in directed graphs},
  journal = {Discrete Math.},
  volume = 86,
  pages = {27-31},
  note = {appeared first under the same title in  {\it Applications of 
Discrete Mathematics} (Clemson, SC, 1986),  200--204, SIAM, Philadelphia, 
PA, 1988},
}

@article{BeLa1976,
  author = {C. Berge and M. {Las Vergnas}},
  year = 1976,
  title = {Un nouveau jeu positionnel, le ``Match-It", ou une construction dialectique des couplages parfaits},
  journal = {Cahiers du Centre \'Etudes Rech. Op\'er.},
  volume = 18,
  pages = {83-89},
}

@article{BeSc1956,
  author = {C. Berge and M. P. Sch\"{u}tzenberger},
  year = 1956,
  title = {Jeux de Nim et solutions},
  journal = {Acad. Sci. Paris},
  volume = 242,
  pages = {1672-1674},
  note = {(French)}
}

@inproceedings{Ber1972,
  author = {E. R. Berlekamp},
  year = 1972,
  title = {Some recent results on the combinatorial game called Welter's Nim},
  booktitle = {Proc. 6th Ann. Princeton Conf. Information Science and
Systems},
  pages = {203-204},
}

@article{Ber1974,
  author = {E. R. Berlekamp},
  year = 1974,
  title = {The Hackenbush number system for compression of numerical data},
  journal = {Inform. and Control},
  volume = 26,
  pages = {134-140},
}

@article{Ber1988a,
  author = {E. R. Berlekamp},
  year = 1988,
  title = {Blockbusting and domineering},
  journal = {J. Combin. Theory \emph{(Ser.~A)}},
  volume = 49,
  pages = {67-116},
  note = {an earlier version, entitled Introduction to blockbusting and
domineering, appeared in: {\it The Lighter Side of Mathematics}, Proc. E.
Strens Memorial Conf. on Recr. Math. and its History, Calgary, 1986,
Spectrum Series (R. K. Guy and R. E. Woodrow, eds.), Math.
Assoc. of America, Washington, DC, 1994, pp. 137--148},
}

@incollection{Ber1990,
  author = {E. Berlekamp},
  year = 1990,
  title = {Two-person, perfect-information games},
  pages = {275-287},
  publisher = {Amer. Math. Soc., Providence, RI},
  volume = 50,
  booktitle = {The Le\-ga\-cy of John von Neumann \emph{(Hempstead NY,
1988)}, Proc. Sympos. Pure Math.},
}

@incollection{Ber1991,
  author = {E. R. Berlekamp},
  year = 1991,
  title = {Introductory overview of mathematical Go end\-games},
  pages = {73-100},
  editor = {R. K. Guy},
  publisher = {Amer. Math. Soc., Providence, RI},
  volume = 43,
  booktitle = {Combinatorial Games, \emph{Proc. Symp. Appl. Math.}},
}

@incollection{Ber1996a,
  author = {E. R. Berlekamp},
  year = 1996,
  title = {The economist's view of combinatorial games},
  pages = {365-405},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = 29,
  booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}

@incollection{Ber2000a,
author = {E. R. Berlekamp},
  year = 2000,
  title = {Sums of {$N \times 2$} Amazons},
  volume = {35},
  pages = {1-34},
  editor = {{F.T. Bruss} and {L.M. Le Cam}},
  publisher = {Beechwood, Ohio: Institute of Mathematical Statistics},
  booktitle = {Institute of Mathematical Statistics Lecture Notes--Monograph
Series},
  note = {Papers in honor of Thomas S. Ferguson},
  mrnumber = {MR1833848 (2002e:91033)},
}

@book{Ber2000b,
author = {E. R. Berlekamp},
  year = 2000,
  title = {The Dots-and-Boxes Game: Sophisticated Child's Play},
  volume = {},
  publisher = {A K Peters, Natick, MA},
  mrnumber = {MR1780088 (2001i:00005)},
}

@article{Ber2002,
  author = {E. R. Berlekamp},
  year = 2002,
  title = {Four games for Gardner},
  journal = {{\rm in:} Puzzler's Tribute: a Feast for the Mind{\rm ,}},
  chapter = {},
  pages = {383-386},
  note = {honoring Martin Gardner (D. Wolfe and T. Rodgers, eds.),
A K Peters, Natick, MA},
  publisher = {},
}

@incollection{Ber2002b,
  author = {E. R. Berlekamp},
  year = 2002,
  title = {Idempotents among partisan games},
  pages = {3-23},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = {42},
  booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
}

@incollection{Ber2002a,
  author = {E. R. Berlekamp},
  year = 2002,
  title = {The 4G4G4G4G4 problems and solutions},
  pages = {231-241},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = {42},
  booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
}

@book{BCG2001,
  author = {E. R. Berlekamp and J. H. Conway and R. K. Guy},
  year = {2001-2004},
  title = {Winning Ways for your Mathematical Plays},
  volume = {1-4},
  publisher = {A K Peters, Wellesley, MA},
  note = {2nd edition: vol. 1 (2001), vols. 2, 3 (2003), vol. 4 (2004);
translation of 1st edition (1982) into German: {\it Gewinnen, Strategien f\"ur
Mathematische Spiele} by G. Seiffert, Foreword by K. Jacobs, M.
Rem\'enyi and Seiffert, Friedr. Vieweg \& Sohn, Braunschweig (four
volumes), 1985},
}

@incollection{BeKi1996,
  author = {E. R. Berlekamp and Y. Kim},
  year = 1996,
  title = {Where is the ``Thousand-Dollar Ko?''},
  pages = {203-226},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = 29,
  booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}

@book{BeRo1999,
  editor = {E. Berlekamp and T. Rodgers},
  year = 1999,
  title = {The Mathemagician and Pied Puzzler},
  publisher = {A K Peters, Natick, MA},
  note = {A collection in tribute to Martin Gardner. Papers from
the Gathering for Gardner Meeting (G4G1) held in Atlanta, GA, January 1993},
}

@incollection{BeSc2002,
  author = {E. Berlekamp and K. Scott},
  year = 2002,
  title = {Forcing your opponent to stay in control of a loony
dots-and-boxes endgame},
  pages = {317-330},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = {42},
  booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
  mrnumber = {MR1973020},
}

@book{BeWo1994,
  author = {E. Berlekamp and D. Wolfe},
  year = 1994,
  title = {Mathematical Go --- Chilling Gets the Last Point},
  publisher = {A K Peters, Natick, MA},
}

@book{Ber1976a,
  author = {P. Berloquin},
  year = 1976,
  title = {100 Jeux de Table},
  publisher = {Flammarion, Paris},
}

@book{Ber1995,
  author = {P. Berloquin},
  year = 1995,
  title = {100 Games of Logic},
  publisher = {Barnes \& Noble},
}

@book{Ber1999,
  author = {{P. Berloquin and D. Dugas (Illustrator)}},
  year = 1999,
  title = {100 Perceptual Puzzles},
  publisher = {Barnes \& Noble},
}

@incollection{BDDFJM2002,
  author = {T. C. Biedl and E. D. Demaine and M. L. Demaine and R. Fleischer
and L. Jacobsen and I. Munro},
  year = 2002,
  title = {The complexity of Clickomania},
  pages = {389-404},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = {42},
  booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
  mrnumber = {MR1973107 (2004b:91041)},
}

@article{Big1999,
  author = {N. L. Biggs},
  year = 1999,
  title = {Chip-firing and the critical group of a graph},
  journal = {J. Algebr. Comb.},
  volume = 9,
  pages = {25-45},
}

@book{Bin1992,
  author = {K. Binmore},
  year = 1992,
  title = {Fun and Games: a Text on Game Theory},
  publisher = {D.C. Heath, Lexington},
}

@article{BiGo1992,
  author = {J. Bitar and E. Goles},
  year = 1992,
  title = {Parallel chip firing games on graphs},
  journal = {Theoret. Comput. Sci.},
  volume = 92,
  pages = {291-300},
}

@article{BjLo1992,
  author = {A. Bj\"orner and L. Lov\'asz},
  year = 1992,
  title = {Chip-firing games on directed graphs},
  journal = {J. Algebraic Combin.},
  volume = 1,
  pages = {305-328},
}

@article{BLC1991,
  author = {A. Bj\"orner and L. Lov\'asz and P. Chor},
  year = 1991,
  title = {Chip-firing games on graphs},
  journal = {European J. Combin.},
  volume = 12,
  pages = {283-291},
}

@article{BlKi2001,
  author = {N. M. Blachman and D. M. Kilgour},
  year = 2001,
  title = {Elusive optimality in the box problem},
  journal = {Math. Mag.},
  volume = 74,
  number = 3,
  pages = {171-181},
  mrnumber = {MR2104911. There will be no review of this item},
}

@book{BlGi1954,
  author = {D. Blackwell and M. A. Girshick},
  year = 1954,
  title = {Theory of Games and Statistical Decisions},
  publisher = {Wiley, New York, NY},
}

@article{BDG2006,
  author = {L. Blanc and E. Duch\^{e}ne and S. Gravier},
  year = 2006,
  title = {A deletion game on graphs: ๔le pic ar\^{e}te๖},
  journal = {INTEGERS, Electr. J. of Combinat. Number Theory},
  volume = 6,
  pages = {\#G02, 10pp., Comb. Games Sect.},
  url = {http://www.integers-ejcnt.org/vol5.html},
  MRNUMBER = {MR2215359. There will be no review of this item},
}

@article{BlFr1990,
  author = {U. Blass and A. S. Fraenkel},
  year = 1990,
  title = {The Sprague--Grundy function for Wyt\-hoff's game},
  journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
  volume = 75,
  pages = {311-333},
}

@article{BFG1998,
  author = {U. Blass and A. S. Fraenkel and R. Guelman},
  title = {How far can Nim in disguise be stretched?},
  journal = {J. Combin. Theory \emph{(Ser.~A)}},
  volume = 84,
  pages = {145-156},
  year = 1998,
  mrnumber = {MR1652900 (2000d:91029)},
}

@article{Bli1986,
  author = {M. Blidia},
  year = 1986,
  title = {A parity digraph has a kernel},
  journal = {Combinatorica},
  volume = 6,
  pages = {23-27},
}

@article{BDJMM1999,
  author = {M. Blidia and P. Duchet and H. Jacob and F. Maffray and
H.. Meyniel},
  year = 1999,
  title = {Some operations preserving the existence of kernels},
  journal = {Discrete Math.},
  volume = 205,
  pages = {211-216},
}

@article{BDM1993,
  author = {M. Blidia and P. Duchet and F. Maffray},
  year = 1993,
  title = {On kernels in perfect graphs},
  journal = {Combinatorica},
  volume = 13,
  pages = {231-233},
}

@article{BoHa1998,
  author = {J-P. Bode and H. Harborth},
  year = 1998,
  title = {Achievement games on Platonic solids},
  journal = {Bull. Inst. Combin. Appl.},
  volume = 23,
  pages = {23-32},
  mrnumber = {MR1621748 (99d:05020)},
}

@article{BoHa2000a,
  author = {J-P. Bode and H. Harborth},
  year = 2000,
  title = {Hexagonal polyomino achievement},
  journal = {Discrete Math.},
  volume = 212,
  pages = {5-18},
  mrnumber = {MR1748669 (2000k:05082)},
}

@article{BoHa2000b,
  author = {J-P. Bode and H. Harborth},
  year = 2000,
  title = {Independent chess pieces on Euclidean boards},
  journal = {J. Combin. Math. Combin. Comput.},
  volume = 33,
  pages = {209-223},
  mrnumber = {MR1772763 (2001c:05105)},
}

@article{BoHa2000c,
  author = {J-P. Bode and H. Harborth},
  year = 2000,
  title = {Triangular mosaic polyomino achievement},
  journal = {Congr. Numer.},
  volume = 144,
  pages = {143-152},
  note = {Proc. 31st Southeastern Internat. Conf. on Combinatorics,
Graph Theory and Computing (Boca Raton, FL, 2000)},
  mrnumber = {MR1817929 (2001m:05082)},
}

@article{BoHa2001,
  author = {J-P. Bode and H. Harborth},
  year = 2001,
  title = {Triangle polyomino set achievement},
  journal = {Congr. Numer.},
  volume = 148,
  pages = {97--101},
  note = {Proc.32nd Southeastern Internat. Conf. on Combinatorics,
Graph Theory and Computing (Boca Raton, FL, 2002)},
  mrnumber = {MR1887377 (2002k:05057)},
}

@article{BoHa2002,
  author = {J-P. Bode and H. Harborth},
  year = 2002,
  title = {Triangle and hexagon gameboard Ramsey numbers},
  journal = {Congr. Numer.},
  volume = 158,
  pages = {93-98},
  note = {Proc.33rd Southeastern Internat. Conf. on Combinatorics,
Graph Theory and Computing (Boca Raton, FL, 2002)},
  mrnumber = {MR1985149 (2004d:05129)},
}

@article{BoHa2003a,
  author = {J-P. Bode and H. Harborth},
  year = 2003,
  title = {Independence for knights on hexagon and triangle boards},
  journal = {Discrete Math.},
  volume = 272,
  pages = {27-35},
  mrnumber = {MR2019197 (2004i:05115)},
}

@article{BHH2003b,
  author = {J-P. Bode and H. Harborth and M. Harborth},
  year = 2003,
  title = {King independence on triangle boards},
  journal = {Discrete Math.},
  volume = 266,
  pages = {101-107},
  note = {Presented at 18th British Combinatorial Conference (Brighton, 2001)},
  mrnumber = {MR1991709 (2004f:05129)},
}

@article{BoHa2004,
  author = {J-P. Bode and H. Harborth and M. Harborth},
  year = 2004,
  title = {King graph Ramsey numbers},
  journal = {J. Combin. Math. Combin. Comput.},
  volume = 50,
  pages = {47-55},
  mrnumber = {MR2075855. There will be no review of this item},
}

@article{BoHa1999,
  author = {J-P. Bode and H. Harborth and H. Weiss},
  year = 1999,
  title = {Independent knights on hexagon boards},
  journal = {Congr. Numer.},
  volume = 141,
  pages = {31-35},
  note = {Proc. 30th Southeastern Internat. Conf. on Combinatorics,
Graph Theory, and Computing (Boca Raton, FL, 1999)},
  mrnumber = {MR1745222 (2000k:05201)},
}

@article{BoHi1999,
  author = {J-P. Bode and A. M. Hinz},
  year = 1999,
  title = {Results and open problems on the Tower of Hanoi},
  journal = {Congr. Numer.},
  volume = 139,
  pages = {113-122},
  note = {Proc.30th Southeastern Internat. Conf.
  on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1999)},
}

@article{Bod1991,
  author = {H. L. Bodlaender},
  year = 1991,
  title = {On the complexity of some coloring games},
  journal = {Internat. J. Found. Comput. Sci.},
  volume = 2,
  pages = {133-147},
  mrnumber = {MR1143920 (92j:68042)},
}

@article{Bod1993,
  author = {H. L. Bodlaender},
  year = 1993,
  title = {Complexity of path forming games},
  journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
  volume = 110,
  pages = {215-245},
}

@incollection{Bod1993a,
  author = {H. L. Bodlaender},
  year = 1993,
  title = {Kayles on special classes of graphs---an application of
Sprague-Grundy theory},
  pages = {90-102},
  publisher = {Springer, Berlin},
  volume = 657,
  booktitle = {Graph-Theoretic Concepts in Computer Science
\emph{(Wiesbaden-Naurod, 1992)}, \emph{Lecture Notes in Comput. Sci.}},
  mrnumber = {MR1244129 (94i:90189)},
}

@article{BoKr1992,
  author = {H. L. Bodlaender and D. Kratsch},
  year = 1992,
  title = {The complexity of coloring games on perfect graphs},
  journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
  volume = 106,
  pages = {309-326},
}

@article{BoKr2002,
  author = {H. L. Bodlaender and D. Kratsch},
  year = 2002,
  title = {Kayles and nimbers},
  journal = {J. Algorithms},
  volume = 43,
  pages = {106-119},
  mrnumber = {MR1900711 (2003d:05201)},
}

@article{BHK2001,
  author = {T. Bohman and R. Holzman and D. Kleitman},
  year = 2001,
  title = {Six Lonely Runners},
  journal = {Electr. J. Combin.},
  volume = {8(2)},
  pages = {\#R3, 49pp.},
  url = {http://www.combinatorics.org/},
  note = {Volume in honor of Aviezri S. Fraenkel},
  mrnumber = {MR1853254 (2002g:11095)},
}

@article{Bok1984,
  author = {K. D. Boklan},
  year = 1984,
  title = {The $n$-number game},
  journal = {Fibonacci Quart.},
  volume = 22,
  pages = {152-155},
}

@article{BoLe2005,
  author = {B. Bollob\'as and I. Leader},
  year = 2005,
  title = {The devil and the angel in three dimensions},
  journal = {J. Combin. Theory \emph{(Ser.~A)}},
  volume = {},
  pages = {},
  note = {to appear},
}

@article{BoSz1998,
  author = {B. Bollob\'as and T. Szab\'o},
  year = 1998,
  title = {The oriented cycle game},
  journal = {Discrete Math.},
  volume = 186,
  pages = {55-67},
}

@article{Boo1998,
  author = {D. L. Book},
  title = {What the Hex},
  journal = {The Washington Post},
  year = {1998, Sept. 9-th},
  volume = {},
  pages = {H02},
}

@article{Bor1921,
  author = {E. Borel},
  year = 1921,
  title = {La th\'eorie du jeu et les \'equations integrales \`a
noyau symmetrique gauche},
  journal = {C. R. Acad. Sci. Paris},
  volume = 173,
  pages = {1304-1308},
}

@article{BoGu1996,
  author = {E. Boros and V. Gurvich},
  year = 1996,
  title = {Perfect graphs are kernel solvable},
  journal = {Discrete Math.},
  volume = 159,
  pages = {35-55},
}

@article{BoGu1998,
  author = {E. Boros and V. Gurvich},
  year = 1998,
  title = {A corrected version of the Duchet kernel conjecture},
  journal = {Discrete Math.},
  volume = 179,
  pages = {231-233},
}

@article{BoGu2006,
  author = {E. Boros and V. Gurvich},
  year = 2006,
  title = {Perfect graphs, kernels, and cores of cooperative games},
  journal = {Discrete Math.},
note = {special issue: Creation and Recreation: A Tribute to the 
Memory of Claude Berge},
  volume = {306},
  pages = {2336-2354},
  mrnumber = {**MR, pending},
}

@article{Bou1902,
  author = {C. L. Bouton},
  year = 1902,
  title = {Nim, a game with a complete mathematical theory},
  journal = {Ann. of Math.},
  volume = 3,
  number = 2,
  pages = {35-39},
}

@incollection{Boy1981,
  author = {J. Boyce},
  year = 1981,
  title = {A Kriegspiel endgame},
  pages = {28-36},
  editor = {D. A. Klarner},
  publisher = {Wadsworth Internat., Belmont, CA},
  booktitle = {The Mathematical Gardner},
}

@article{BrKi1995,
  author = {S. J. Brams and D. M. Kilgour},
  year = 1995,
  title = {The box problem: to switch or not to switch},
  journal = {Math. Mag.},
  volume = 68,
  number = 1,
  pages = {27-34},
}

@book{Bra1981,
  author = {G. Brandreth},
  title = {The Bumper Book of Indoor Games},
  publisher = {Victorama, Chancellor Press},
  year = 1981,
}

@article{BUv2000,
  author = {D. M. Breuker and J. W. H. M. Uiterwijk and H. J. van den Herik},
  title = {Solving $8\times 8$ Domineering},
  journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
  volume = 230,
  year = 2000,
  pages = {195-206},
  mrnumber = {MR1725637 (2001i:68148)},
}

@article{BrLo1995,
  author = {D. M. Broline and D. E. Loeb},
  title = {The combinatorics of Mancala-type games: Ayo, Tchoukaillon,
and $1/\pi$},
  journal = {UMAP J.},
  volume = 16,
  number = 1,
  year = 1995,
  pages = {21-36},
}

@article{Bro1976,
  author = {A. Brousseau},
  year = 1976,
  title = {Tower of Hanoi with more pegs},
  journal = {J. Recr. Math.},
  volume = 8,
  pages = {169-176},
}

@article{BHMS2005,
  author = {A. E. Brouwer and G. Horv\'{a}th and I.
Moln\'{a}r-S\'{a}ska and C. Szab\'{o}},
  year = 2005,
  title = {On three-rowed chomp},
  journal = {INTEGERS, Electr. J. of Combinat. Number Theory},
  volume = 5,
  pages = {\#G07, 11pp., Comb. Games Sect.},
  url = {http://www.integers-ejcnt.org/vol5.html},
  mrnumber = {MR2192255 (2006g:11051)},
}

@book{Bro2000,
  author = {C. Browne},
  title = {HEX Strategy: Making the Right Connections},
  publisher = {A K Peters, Natick, MA},
  year = 2000,
}

@article{BrPl1993,
  author = {R. A. Brualdi and V. S. Pless},
  year = 1993,
  title = {Greedy codes},
  journal = {J. Combin. Theory \emph{(Ser.~A)}},
  volume = 64,
  pages = {10-30},
}

@article{BrDi1975,
  author = {A. A. Bruen and R. Dixon},
  year = 1975,
  title = {The $n$-queen problem},
  journal = {Discrete Math.},
  volume = 12,
  pages = {393-395},
}

@article{BrWe1970,
  author = {J. Bruno and L. Weinberg},
  year = 1970,
  title = {A constructive graph-theoretic solution of the Shannon
switching game},
  journal = {IEEE Trans. Circuit Theory},
  volume = {CT-17},
  pages = {74--81},
}

@incollection {BuVa1966,
    AUTHOR = {Bucan, G. P. and Varvak, L. P.},
     TITLE = {On the question of games on a graph},
 BOOKTITLE = {Algebra and Math. Logic: Studies in Algebra (Russian)},
     PAGES = {122--138},
 PUBLISHER = {Izdat. Kiev. Univ., Kiev},
      YEAR = {1966},
  MRNUMBER = {MR0207584 (34 \#7399)},
}

@article{BuLe1980,
  author = {P. Buneman and L. Levy},
  year = 1980,
  title = {The towers of Hanoi problem},
  journal = {Inform. Process. Lett.},
  volume = 10,
  pages = {243-244},
}

@article{BCM1997,
  author = {A. P. Burger and E. J. Cockayne and C. M. Mynhardt},
  year = 1997,
  title = {Domination and irredundance in the queen's graph},
  journal = {Discrete Math.},
  volume = 163,
  pages = {47-66},
  mrnumber = {MR1428557 (97m:05130)},
}

@article{BM1999,
  author = {A. P. Burger and C. M. Mynhardt},
  year = 1999,
  title = {Queens on hexagonal boards},
  journal = {J. Combin. Math. Combin. Comput.},
  volume = 31,
  pages = {97-111},
  note = {paper in honour of Stephen T. Hedetniemi},
  mrnumber = {MR1726950 (2000h:05158)},
}

@article{BM2000a,
  author = {A. P. Burger and C. M. Mynhardt},
  year = 2000,
  title = {Properties of dominating sets of the queens graph $Q\sb {4k+3}$},
  journal = {Util. Math.},
  volume = 57,
  pages = {237-253},
  mrnumber = {MR1760187 (2000m:05166)},
}

@article{BM2000b,
  author = {A. P. Burger and C. M. Mynhardt},
  year = 2000,
  title = {Small irredundance numbers for queens graphs},
  journal = {J. Combin. Math. Combin. Comput.},
  volume = 33,
  pages = {33-43},
  note = {paper in honour of Ernest J. Cockayne},
  mrnumber = {MR1772752 (2001c:05106)},
}

@article{BM2000c,
  author = {A. P. Burger and C. M. Mynhardt},
  year = 2000,
  title = {Symmetry and domination in queens graphs},
  journal = {Bull. Inst. Combin. Appl.},
  volume = 29,
  pages = {11-24},
}

@article{BM2002,
  author = {A. P. Burger and C. M. Mynhardt},
  year = 2002,
  title = {An upper bound for the minimum number of queens covering
  the $n\times n$ chessboard},
  journal = {Discrete Appl. Math.},
  volume = 121,
  pages = {51-60},
}

@article{BM2003,
  author = {A. P. Burger and C. M. Mynhardt},
  year = 2003,
  title = {An improved upper bound for queens domination numbers},
  journal = {Discrete Math.},
  volume = 266,
  pages = {119-131},
}

@article{BMC1994,
  author = {A. P. Burger and C. M. Mynhardt and E. J. Cockayne},
  year = 1994,
  title = {Domination numbers for the queen's graph},
  journal = {Bull. Inst. Combin. Appl.},
  volume = 10,
  pages = {73-82},
}

@article{BMC2001,
  author = {A. P. Burger and C. M. Mynhardt and E. J. Cockayne},
  year = 2001,
  title = {Queens graphs for chessboards on the torus},
  journal = {Australas. J. Combin.},
  volume = 24,
  pages = {231-246},
}

@inproceedings{Bur2001,
  author = {M. Buro},
  title = {Simple Amazon endgames and their connection to Hamilton
circuits in cubic subgrid graphs},
  booktitle = {Proc.\ 2nd Intern.\ Conference on Computers and
Games CG'2000},
  organization = {Hamamatsu, Japan, Oct.\ 2000, Lecture Notes in Computer
Science, Springer},
  year = 2001,
  volume= {2063},
  editor = {T. Marsland and I. Frank},
  pages = {251-261},
  mrnumber = {MR1909614},
}

@misc{Bus1967,
  author = {D. W. Bushaw},
  year = 1967,
  title = {On the name and history of Nim},
  howpublished = {\emph{Washington Math.} {\bf 11}, Oct. 1966. Reprinted in:
{\it NY State Math. Teachers J.}, {\bf 17}, pp. 52--55},
}

@article{ByHe1996,
  author = {P. J. Byrne and R. Hesse},
  year = 1996,
  title = {A Markov chain analysis of jai alai},
  journal = {Math. Mag.},
  volume = 69,
  pages = {279-283},
}

@article{Byr2003,
  author = {S. Byrnes},
  year = 2003,
  title = {Poset game periodicity},
  journal = {INTEGERS, Electr. J. of Combinat. Number Theory},
  volume = 3,
  pages = {\#G3, 16pp., Comb. Games Sect.},
  url = {http://www.integers-ejcnt.org/vol3.html},
  mrnumber = {MR2036487 (2005c:91031)},
}

@article{CaZh2001,
  author = {L. Cai and X. Zhu},
  year = 2001,
  title = {Game chromatic index of $k$-degenerate graphs},
  journal = {J. Graph Theory},
  volume = 36,
  pages = {144-155},
  mrnumber = {MR1814531 (2002b:05058)},
}

@article{CCL1992,
  author = {J.-Y. Cai and A. Condon and R. J. Lipton},
  year = 1992,
  title = {On games of incomplete information},
  journal = {Theoret. Comput. Sci.},
  volume = 103,
  pages = {25-38},
}

@incollection{Cal1996,
  author = {D. Calistrate},
  year = 1996,
  title = {The reduced canonical form of a game},
  pages = {409-416},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = 29,
  booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
  mrnumber = {MR1427979 (97m:90122)},
}

@incollection{CPW2002,
  author = {D. Calistrate and M. Paulhus and D. Wolfe},
  year = 2002,
  title = {On the lattice structure of finite games},
  pages = {25-30},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = {42},
  booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
  mrnumber = {MR1973001},
}

@article{Cam2004,
  author = {G. Campbell},
  year = 2004,
  title = {On optimal play in the game of Hex},
  journal = {INTEGERS, Electr. J. of Combinat. Number Theory},
  volume = 4,
  url = {http://www.integers-ejcnt.org/vol4.html},
  pages = {\#G2, 23pp., Comb. Games Sect.},
  mrnumber = {MR2056016 (2005c:91032)},
}

@article{CaHa1992,
  author = {C. Cannings and J. Haigh},
  year = 1992,
  title = {Montreal solitaire},
  journal = {J. Combin. Theory \emph{(Ser.~A)}},
  volume = 60,
  pages = {50-66},
}

@article{CaSt2004,
  author = {J. Carlson and D. Stolarski},
  year = 2004,
  title = {The correct solution to Berlekamp's switching game},
  journal = {Discrete Math.},
  volume = 287,
  pages = {145-150},
  mrnumber = {MR2094708 (2005d:05005)},
}

@article{Cha1989,
  author = {T-H. Chan},
  year = 1989,
  title = {A statistical analysis of the towers of Hanoi problem},
  journal = {Intern. J. Computer Math.},
  volume = 28,
  pages = {57-65},
}

@incollection{ChTs2002,
  author = {A. Chan and A. Tsai},
  year = 2002,
  title = {$1\times n$ Konane: a summary of results},
  pages = {331-339},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = {42},
  booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
  mrnumber = {MR1973021},
}

@article{CKS1981,
  author = {A. K. Chandra and D. C. Kozen and L. J. Stockmeyer},
  year = 1981,
  title = {Alternation},
  journal = {J. Assoc. Comput. Mach.},
  volume = 28,
  pages = {114-133},
}

@inproceedings{ChSt1976,
  author = {A. K. Chandra and L. J. Stockmeyer},
  year = 1976,
  title = {Alternation},
  booktitle = {Proc. 17th Ann. Symp. Foundations of Computer Science
\emph{(Houston, TX, Oct. 1976)}},
  organization = {IEEE Computer Soc., Long Beach, CA},
  pages = {98-108},
}

@article{CHSV1995,
  author = {G. Chartrand and F. Harary and M. Schultz and D. W. VanderJagt},
  year = 1995,
  title = {Achievement and avoidance of a strong orientation of a graph},
  journal = {Congr. Numer.},
  volume = 108,
  pages = {193-203},
}

@article{Cha1972,
  author = {S. M. Chase},
  year = 1972,
  title = {An implemented graph algorithm for winning Shannon switching games},
  journal = {Commun. Assoc. Comput. Mach.},
  volume = 15,
  pages = {253-256},
}

@article{CLP2000,
  author = {M. Chastand and F. Laviolette and N. Polat},
  year = 2000,
  title = {On constructible graphs, infinite bridged graphs and weakly
cop-win graphs},
  journal = {Discrete Math.},
  volume = 224,
  pages = {61-78},
  mrnumber = {MR1781285 (2002g:05152)},
}

@article{CSS1997,
  author = {G. Chen and R. H. Schelp and W. E. Shreve},
  year = 1997,
  title = {A new game chromatic number},
  journal = {European J. Combin.},
  volume = 18,
  pages = {1-9},
}

@article{Che1997,
  author = {V. Chepoi},
  year = 1997,
  title = {Bridged graphs are cop-win graphs: an algorithmic proof},
  journal = {J. Combin. Theory \emph{(Ser.~B)}},
  volume = 69,
  pages = {97-100},
}

@article{Chl1986,
  author = {B. S. Chlebus},
  year = 1986,
  title = {Domino-tiling games},
  journal = {J. Comput. System Sci.},
  volume = 32,
  pages = {374-392},
}

@article{CWZ2003,
  author = {C-Y. Chou and W. Wang and X. Zhu},
  year = 2003,
  title = {Relaxed game chromatic number of graphs},
  journal = {Discrete Math.},
  volume = 262,
  pages = {89-98},
  mrnumber = {MR1951379 (2003m:05062)},
}

@article{GNCG1997,
  author = {J. D. Christensen and M. Tilford},
  year = 1997,
  title = {Unsolved Problems: David Gale's subset take-away game},
  journal = {Amer. Math. Monthly},
  volume = 104,
  pages = {762-766},
  note = {Unsolved Problems Section},
}

@article{Chu1989,
  author = {F. R. K. Chung},
  year = 1989,
  title = {Pebbling in hypercubes},
  journal = {SIAM J. Disc. Math.},
  volume = 2,
  pages = {467-472},
}

@article{CCG1988,
  author = {F. R. K. Chung and J. E. Cohen and R. L. Graham},
  year = 1988,
  title = {Pursuit-evasion games on graphs},
  journal = {J. Graph Theory},
  volume = 12,
  pages = {159-167},
}

@article{ChEl2002,
  author = {F. Chung and R. B. Ellis},
  year = 2002,
  title = {A chip-firing game and Dirichlet eigenvalues},
  journal = {Discrete Math.},
  volume = 257,
  pages = {341-355},
  mrnumber = {MR1935732 (2003i:05087)},
}

@article{CGMO1995,
  author = {F. Chung and R. Graham and J. Morrison and A. Odlyzko},
  year = 1995,
  title = {Pebbling a chessboard},
  journal = {Amer. Math. Monthly},
  volume = 102,
  pages = {113-123},
}

@techreport{Chv1973,
  author = {V. Chv\'atal},
  year = 1973,
  title = {On the computational complexity of finding a kernel},
  type = {Report},
  number = {No. CRM-300},
  institution = {Centre de Recherches Math\'ematiques, Universit\'e de Montr\'eal},
}

@incollection{Chv1981,
  author = {V. Chv\'atal},
  year = 1981,
  title = {Cheap, middling or dear},
  pages = {44-50},
  editor = {D. A. Klarner},
  publisher = {Wadsworth Internat., Belmont, CA},
  booktitle = {The Mathematical Gardner},
}

@article{Chv1983,
  author = {V. Chv\'atal},
  year = 1983,
  title = {Mastermind},
  journal = {Combinatorica},
  volume = 3,
  pages = {325-329},
}

@article{ChEr1978,
  author = {V. Chv\'atal and P. Erd\H{o}s},
  year = 1978,
  title = {Biased positional games},
  journal = {Ann. Discrete Math.},
  volume = 2,
  note = {Algorithmic Aspects of Combinatorics, (B. Alspach, P.
Hell and D. J. Miller, eds.), Qualicum Beach, BC, Canada, 1976, North-Holland},
  pages = {221-229},
}

@article{CMV2002,
  author = {F. Cicalese and D. Mundici and U. Vaccaro},
  year = 2002,
  title = {Least adaptive optimal search with unreliable tests},
  journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
  volume = 270,
  pages = {877-893},
  mrnumber = {MR1871101 (2003g:94052)},
}

@article{CiVa2000,
  author = {F. Cicalese and U. Vaccaro},
  year = 2000,
  title = {Optimal strategies against a liar},
  journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
  volume = 230,
  pages = {167-193},
  mrnumber = {MR1725636 (2001g:91040)},
}

@article{Cin2005,
  author = {A. Cincotti},
  year = 2005,
  title = {Three-player partizan games},
  journal = {Theoret. Comput. Sci.},
  volume = 332,
  pages = {367-389},
  mrnumber = {MR2122510 (2005j:91018)},
}

@incollection{Cla1996,
  author = {C. Clark},
  year = 1996,
  title = {On achieving channels in a bipolar game},
  pages = {23-27},
  publisher = {Amer. Math. Soc., Providence, RI},
  volume = 34,
  booktitle = {African Americans in Mathematics \emph{(Piscataway, NJ, 1996),
DIMACS Ser. Discrete Math. Theoret. Comput. Sci.}},
}

@article{Cla1986,
  author = {D. S. Clark},
  year = 1986,
  title = {Fibonacci numbers as expected values in a game of chance},
  journal = {Fibonacci Quart.},
  volume = 24,
  pages = {263-267},
}

@article{ClNo2000,
  author = {N. E. Clarke and R. J. Nowakowski},
  year = 2000,
  title = {Cops, robber, and photo radar},
  journal = {Ars Combin.},
  volume = 56,
  pages = {97-103},
  mrnumber = {MR1768605 (2001e:91040)},
}

@article{ClNo2001,
  author = {N. E. Clarke and R. J. Nowakowski},
  year = 2001,
  title = {Cops, robber and traps},
  journal = {Util. Math.},
  volume = 60,
  pages = {91-98},
  mrnumber = {MR1863432 (2002i:91014)},
}

@article{ClNo2005,
  author = {N. E. Clarke and R. J. Nowakowski},
  year = 2005,
  title = {Tandem-win graphs},
  journal = {Discrete Math.},
  volume = 299,
  pages = {56-64},
  mrnumber = {MR2168695},
}

@article{CHH1997,
  author = {T. A. Clarke and R. A. Hochberg and G. H. Hurlbert},
  year = 1997,
  title = {Pebbling in diameter two graphs and products of paths},
  journal = {J. Graph Theory},
  volume = 25,
  pages = {119-128},
}

@article{Cla1884,
  author = {{N. Claus (=E. Lucas)}},
  year = 1884,
  title = {La tour d'Hanoi, jeu de calcul},
  journal = {Science et Nature},
  volume = 1,
  pages = {127-128},
}

@article{Cla2001,
  author = {A. Clausing},
  year = 2001,
  title = {Das Trisentis Spiel (The Trisentis game)},
  journal = {Math. Semesterberichte},
  volume = 48,
  pages = {49-66},
  mrnumber = {MR1950212 (2003k:91045)},
}

@article{Coc1990,
  author = {E. J. Cockayne},
  year = 1990,
  title = {Chessboard domination problems},
  journal = {Discrete Math.},
  volume = 86,
  pages = {13-20},
}

@article{CoHe1986,
  author = {E. J. Cockayne and S. T. Hedetniemi},
  year = 1986,
  title = {On the diagonal queens domination problem},
  journal = {J. Combin. Theory \emph{(Ser.~A)}},
  volume = 42,
  pages = {137-139},
}

@article{CoMy2001,
  author = {E. J. Cockayne and C. M. Mynhardt},
  year = 2001,
  title = {Properties of queens graphs and the irredundance number
of $Q\sb 7$},
  journal = {Australas. J. Combin.},
  volume = 23,
  pages = {285-299},
  mrnumber = {MR1815019 (2002a:05189)},
}

@article{CoDa1969,
  author = {A. J. Cole and A. J. T. Davie},
  year = 1969,
  title = {A game based on the Euclidean algorithm and a winning strategy for it},
  journal = {Math. Gaz.},
  volume = 53,
  pages = {354-357},
}

@article{Col1978,
  author = {D. B. Coleman},
  year = 1978,
  title = {Stretch: a geoboard game},
  journal = {Math. Mag.},
  volume = 51,
  pages = {49-54},
}

@article{Col2005,
  author = {D. Collins},
  year = 2005,
  title = {Variations on a theme of Euclid},
  journal = {INTEGERS, Electr. J. of Combinat. Number Theory},
  volume = 5,
  pages = {\#G3, 12pp., Comb. Games Sect.},
  url = {http://www.integers-ejcnt.org/vol5.html},
  mrnumber = {MR2139166 (2005k:91080)},
}

@book{Con1989,
  author = {A. Condon},
  year = 1989,
  title = {Computational Models of Games},
  series = {ACM Distinguished Dissertation},
  publisher = {MIT Press, Cambridge, MA},
}

@article{Con1991,
  author = {A. Condon},
  year = 1991,
  title = {Space-bounded probabilistic game automata},
  journal = {J. Assoc. Comput. Mach.},
  volume = 38,
  pages = {472-494},
}

@article{Con1992,
  author = {A. Condon},
  year = 1992,
  title = {The complexity of Stochastic games},
  journal = {Information and Computation},
  volume = 96,
  pages = {203-224},
}

@incollection{Con1993,
  author = {A. Condon},
  year = 1993,
  title = {On algorithms for simple stochastic games},
  pages = {51-71},
  publisher = {Amer. Math. Soc., Providence, RI},
  booktitle = {Advances in Computational Complexity Theory \emph{(New
Brunswick, NJ, 1990), DIMACS Ser. Discrete Math. Theoret. Comput. Sci.}},
  volume = 13,
}

@inproceedings{CFLS1993,
  author = {A. Condon and J. Feigenbaum and C. Lund and P. Shor},
  year = 1993,
  title = {Probabilistically checkable debate systems and approximation
algorithms for PSPACE-hard functions},
  booktitle = {Proc. 25th Ann. ACM Symp. Theory of Computing, \emph{Assoc.
Comput. Mach., New York, NY}},
  pages = {305-314},
}

@article{CoLa1988,
  author = {A. Condon and R. E. Ladner},
  year = 1988,
  title = {Probabilistic game automata},
  journal = {J. Comput. System Sci.},
  volume = 36,
  pages = {452-489},
  note = {preliminary version in: Proc. Structure in complexity theory
(Berkeley, CA, 1986), Lecture Notes in Comput. Sci., Vol. 223, Springer,
Berlin, pp. 144--162},
}

@article{Con1959,
  author = {I. G. Connell},
  year = 1959,
  title = {A generalization of Wythoff's game},
  journal = {Canad. Math. Bull.},
  volume = 2,
  pages = {181-190},
}

@techreport{Con1972,
  author = {J. H. Conway},
  year = 1972,
  title = {All numbers great and small},
  institution = {Univ. of Calgary Math. Dept.},
  type = {Res. Paper},
  number = {No. 149},
}

@article{Con1977,
  author = {J. H. Conway},
  year = 1977,
  title = {All games bright and beautiful},
  journal = {Amer. Math. Monthly},
  volume = 84,
  pages = {417-434},
}


Conway, J. H. $M\sb {13}$.  Surveys in combinatorics, 1997 (London),  1--11, London Math. Soc. Lecture Note Ser., 241, Cambridge Univ. Press, Cambridge, 1997.
@article{Con1978,
  author = {J. H. Conway},
  year = 1978,
  title = {A gamut of game theories},
  journal = {Math. Mag.},
  volume = 51,
  pages = {5-12},
}

@article{Con1978a,
  author = {J. H. Conway},
  year = 1978,
  title = {Loopy Games},
  journal = {Ann. Discrete Math.},
  volume = 3,
  note = {Proc. Symp. Advances in Graph Theory, Cambridge Combinatorial
Conf. (B. Bollob\'as, ed.), Cambridge, May 1977},
  pages = {55-74},
}

@article{Con1990,
  author = {J. H. Conway},
  year = 1990,
  title = {Integral lexicographic codes},
  journal = {Discrete Math.},
  volume = 83,
  pages = {219-235},
}

@incollection{Con1991a,
  author = {J. H. Conway},
  year = 1991,
  title = {More ways of combining games},
  pages = {57-71},
  editor = {R. K. Guy},
  publisher = {Amer. Math. Soc., Providence, RI},
  volume = 43,
  booktitle = {Combinatorial Games, \emph{Proc. Symp. Appl. Math.}},
}

@incollection{Con1991b,
  author = {J. H. Conway},
  year = 1991,
  title = {Numbers and games},
  pages = {23-34},
  editor = {R. K. Guy},
  publisher = {Amer. Math. Soc., Providence, RI},
  volume = 43,
  booktitle = {Combinatorial Games, \emph{Proc. Symp. Appl. Math.}},
}

@incollection{Con1994,
  author = {J. H. Conway},
  year = 1994,
  title = {The surreals and the reals.  Real numbers, generalizations of
the reals, and theories of continua},
  pages = {93-103},
  editor = {},
  publisher = {Kluwer Acad. Publ., Dordrecht},
  volume = 242,
  booktitle = {Synthese Lib.}
}

@incollection{Con1996,
  author = {J. H. Conway},
  year = 1996,
  title = {The angel problem},
  pages = {3-12},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = 29,
  booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}

@incollection{Con1997,
  author = {J. H. Conway},
  year = 1997,
  title = {$M\sb {13}$},
  pages = {1-11},
  publisher = {London Math. Soc., Lecture Note Ser. 241, Cambridge Univ.
Press, Cambridge},
  booktitle = {Surveys in combinatorics},
}

@book{Con2001,
  author = {J. H. Conway},
  year = 2001,
  title = {On Numbers and Games},
  publisher = {A K Peters, Natick, MA},
  note = {2nd edition; translation of 1st edition (1976) into
German: {\it \"Uber Zahlen und Spiele} by Brigitte Kunisch, Friedr.
Vieweg \& Sohn, Braunschweig, 1983},
}

@incollection{Con2002,
  author = {J. H. Conway},
  year = 2002,
  title = {More infinite games},
  pages = {31-36},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = {42},
  booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
  mrnumber = {MR1973002},
}

@incollection{Con2003,
  author = {J. H. Conway},
  year = 2003,
  title = {Integral lexicographic codes},
  pages = {185-189},
  editor = {S. Katok and S. Tabachnikov},
  publisher = {Amer. Math. Soc.},
  volume = {},
  booktitle = {MASS selecta},
  mrnumber = {MR2027176},
}

@article{CoCo1973,
  author = {J. H. Conway and H. S. M. Coxeter},
  year = 1973,
  title = {Triangulated polygons and frieze patterns},
  journal = {Math. Gaz.},
  volume = 57,
  pages = {87-94; 175-183},
}

@article{CoSl1986,
  author = {J. H. Conway and N. J. A. Sloane},
  year = 1986,
  title = {Lexicographic codes: error-cor\-rec\-ting codes from game theory},
  journal = {IEEE Trans. Inform. Theory},
  volume = {IT-32},
  pages = {337-348},
}

@inproceedings{CoSh1979,
  author = {M. L. Cook and L. E. Shader},
  title = {A strategy for the {R}amsey game ``{T}ritip''},
  booktitle = {Proc. 10th Southeastern Conf. on Combinatorics, Graph
Theory and Computing, Boca Raton, FL},
  year = 1979,
  volume = 1,
  series = {Congr. Numer. 23, \emph{Utilitas Math.}},
  pages = {315-324},
}

@article{Cop1993,
  author = {M. Copper},
  year = 1993,
  title = {Graph theory and the game of sprouts},
  journal = {Amer. Math. Monthly},
  volume = 100,
  pages = {478-482},
}

@book{CoPa1991,
  author = {M. Cornelius and A. Parr},
  year = 1991,
  title = {What's Your Game?},
  publisher = {Cambridge University Press, Cambridge},
}

@inproceedings{Cov1987,
  author = {T. Cover},
  title = {Pick the largest number},
  booktitle = {Open Problems in Communication and Computation},
  organization = {Springer-Verlag, New York},
  year = 1987,
  volume= {},
  editor = {T. M. Cover and B. Gopinath},
  pages = {152},
}

@article{Cox1953,
  author = {H. S. M. Coxeter},
  year = 1953,
  title = {The golden section, phyllotaxis and Wythoff's game},
  journal = {Scripta Math.},
  volume = 19,
  pages = {135-143},
}

@inproceedings{CrTr2001,
  author = {M. Cr\^{a}\c{s}maru and J. Tromp},
  title = {Ladders are PSPACE-complete},
  booktitle = {Proc.\ 2nd Intern.\ Conference on Computers and
Games CG'2000},
  organization = {Hamamatsu, Japan, Oct.\ 2000, Lecture Notes in Computer
Science, Springer},
  year = 2001,
  volume= {2063},
  editor = {T. Marsland and I. Frank},
  pages = {241-249},
  mrnumber = {MR1909613},
}

@article{Cre1987,
  author = {J. W. Creely},
  year = 1987,
  title = {The length of a two-number game},
  journal = {Fibonacci Quart.},
  volume = 25,
  pages = {174-179},
}

@article{Cre1988,
  author = {J. W. Creely},
  year = 1988,
  title = {The length of a three-number game},
  journal = {Fibonacci Quart.},
  volume = 26,
  pages = {141-143},
}

@article{Cro1964,
  author = {H. T. Croft},
  year = 1964,
  title = {`Lion and man': a postscript},
  journal = {J. London Math. Soc.},
  volume = 39,
  pages = {385-390},
}

@article{Cro1956,
  author = {D. W. Crowe},
  year = 1956,
  title = {The $n$-dimensional cube and the tower of Hanoi},
  journal = {Amer. Math. Monthly},
  volume = 63,
  pages = {29-30},
}

@article{CCFHPST2005,
  author = {B. Crull and T. Cundiff and P. Feltman and G. H. Hurlbert
and L. Pudwell and Z. Szaniszlo and Z. Tuza},
  year = 2005,
  title = {The cover pebbling number of graphs},
  journal = {Discrete Math.},
  volume = 296,
  pages = {15-23},
  mrnumber = {MR2148478},
}

@article{Csi1980,
  author = {L. Csirmaz},
  year = 1980,
  title = {On a combinatorial game with an application to Go-Moku},
  journal = {Discrete Math.},
  volume = 29,
  pages = {19-23},
}

@article{CsNa1979,
  author = {L. Csirmaz and Zs. Nagy},
  year = 1979,
  title = {On a generalization of the game Go-Moku II},
  journal = {Studia Sci. Math. Hung.},
  volume = 14,
  pages = {461-469},
}

@article{Cso2005,
  author = {P. Csorba},
  year = 2005,
  title = {On the biased $n$-in-a-row game},
  journal = {Discrete Math.},
  volume = 503,
  pages = {100-111},
}

@incollection{Cul1999,
  author = {J. Culberson},
  title = {Sokoban is PSPACE complete},
  booktitle = {Fun With Algorithms},
  series = {Proceedings in Informatics},
  volume = 4,
  publisher = {Carleton Scientific},
  address = {University of Waterloo, Waterloo, Ont.},
  year = 1999,
  pages = {65-76},
  note = {Conference took place on the island of Elba, June 1998}
}

@article{CuEc1982,
  author = {P. Cull and Ecklund, Jr., E. F.},
  year = 1982,
  title = {On the towers of Hanoi and generalized towers of Hanoi problems},
  journal = {Congr. Numer.},
  volume = 35,
  pages = {229-238},
}

@article{CuEc1985,
  author = {P. Cull and Ecklund, Jr., E. F.},
  year = 1985,
  title = {Towers of Hanoi and analysis of algorithms},
  journal = {Amer. Math. Monthly},
  volume = 92,
  pages = {407-420},
}

@article{CuGe1985,
  author = {P. Cull and C. Gerety},
  year = 1985,
  title = {Is towers of Hanoi really hard?},
  journal = {Congr. Numer.},
  volume = 47,
  pages = {237-242},
}

@article{CuNea1999,
  author = {P. Cull and I. Nelson},
  year = 1999,
  title = {Error-correcting codes on the towers of Hanoi graphs},
  journal = {Discrete Math.},
  volume = {208/209},
  pages = {157-175},
}

@article{CuNeb1999,
  author = {P. Cull and I. Nelson},
  year = 1999,
  title = {Perfect codes, NP-completeness, and towers of Hanoi graphs},
  journal = {Bull. Inst. Combin. Appl.},
  volume = 26,
  pages = {13-38},
}

@article{CEHK2002,
  author = {A. Czygrinow and N. Eaton and G. Hurlbert and P. M. Kayll},
  year = 2002,
  title = {On pebbling threshold functions for graph sequences},
  journal = {Discrete Math.},
  volume = 247,
  pages = {93-105},
  mrnumber = {MR1877652 (2002m:05058)},
}

@article{CzHu2003,
  author = {A. Czygrinow and G.Hurlbert},
  year = 2003,
  title = {Pebbling in dense graphs},
  journal = {Australas. J. Combin.},
  volume = 28,
  pages = {201-208},
}

@article{CHKT2002,
  author = {A. Czygrinow and G. Hurlbert and H. A. Kierstead and
W. T. Trotter},
  year = 2002,
  title = {A note on graph pebbling},
  journal = {Graphs Combin.},
  volume = 18,
  pages = {219-225},
  mrnumber = {MR1913664 (2004d:05170)},
}

@article{CMP1988,
  author = {J. Czyzowicz and D. Mundici and A. Pelc},
  year = 1988,
  title = {Solution of Ulam's problem on binary search with two lies},
  journal = {J. Combin. Theory \emph{(Ser.~A)}},
  volume = 49,
  pages = {384-388},
  mrnumber = {MR1998872 (2004g:05078)},
}

@article{CMP1989,
  author = {J. Czyzowicz and D. Mundici and A. Pelc},
  year = 1989,
  title = {Ulam's searching game with lies},
  journal = {J. Combin. Theory \emph{(Ser.~A)}},
  volume = 52,
  pages = {62-76},
  mrnumber = {MR1008160 (90k:94026)},
}

@article{DaKl1977,
  author = {G. Danaraj and V. Klee},
  year = 1977,
  title = {The connectedness game and the $c$-comp\-le\-xi\-ty of certain graphs},
  journal = {SIAM J. Appl. Math.},
  volume = 32,
  pages = {431-442},
}

@inproceedings{DaLa1998,
  author = {C. Darby and R. Laver},
  title = {Countable length {R}amsey games},
  booktitle = {Set Theory: Techniques and Applications. \emph{Proc.
of the conferences, Curacao, Netherlands Antilles, June 26--30,
1995 and Barcelona, Spain, June 10--14, 1996}},
  year = 1998,
  editor = {Carlos Augusto {Di Prisco} and others},
  pages = {41-46},
  publisher = {Kluwer, Dordrecht},
}

@article{Dav1970,
  author = {A. L. Davies},
  year = 1970,
  title = {Rotating the fifteen puzzle},
  journal = {Math. Gaz.},
  volume = 54,
  pages = {237-240},
}

@article{Dav1963,
  author = {M. Davis},
  year = 1963,
  title = {Infinite games of perfect information},
  journal = {Ann. of Math. Stud., Princeton},
  volume = 52,
  pages = {85-101},
}

@article{Daw1992,
  author = {R. W. Dawes},
  year = 1992,
  title = {Some pursuit-evasion problems on grids},
  journal = {Inform. Process. Lett.},
  volume = 43,
  pages = {241-247},
}

@article{Daw1934,
  author = {T. R. Dawson},
  year = 1934,
  title = {Problem 1603},
  journal = {Fairy Chess Review},
  pages = {94},
  note = dec,
}

@misc{Daw1935,
  author = {T. R. Dawson},
  year = 1935,
  title = {Caissa's Wild Roses},
  note = {reprinted in: {\it Five Classics of Fairy Chess}, Dover, 1973},
}

@article{Bru1972,
  author = {N. G. de Bruijn},
  year = 1972,
  title = {A solitaire game and its relation to a finite field},
  journal = {J. Recr. Math.},
  volume = 5,
  pages = {133-137},
}

@incollection{Bru1981,
  author = {N. G. de Bruijn},
  year = 1981,
  title = {Pretzel Solitaire as a pastime for the lonely mathematician},
  pages = {16-24},
  editor = {D. A. Klarner},
  publisher = {Wadsworth Internat., Belmont, CA},
  booktitle = {The Mathematical Gardner},
}

@article{Car1970,
  author = {F. de Carteblanche},
  year = 1970,
  title = {The princess and the roses},
  journal = {J. Recr. Math.},
  volume = 3,
  pages = {238-239},
}

@article{Car1974,
  author = {F. deCarte Blanche},
  year = 1974,
  title = {The roses and the princes},
  journal = {J. Recr. Math.},
  volume = 7,
  pages = {295-298},
}

@article{DeL1971,
  author = {A. P. DeLoach},
  year = 1971,
  title = {Some investigations into the game of SIM},
  journal = {J. Recr. Math.},
  volume = 4,
  pages = {36-41},
}

@inproceedings{Dem2001,
  author = {E. D. Demaine},
  year = 2001,
  title = {Playing games with algorithms: algorithmic combinatorial
game theory},
  editor = {J. Sgall and A. Pultr and P. Kolman},
  pages = {18-32},
  publisher = {Springer, Berlin},
  volume = {2136},
  booktitle = {Mathematical Foundations of Computer Science},
  series = {Lecture Notes in Comput. Sci.},
  mrnumber = {MR1906998 (2003d:68076)},
}

@incollection{DDE2002,
  author = {E. D. Demaine and M. L. Demaine and D. Eppstein},
  year = 2002,
  title = {Phutball Endgames are Hard},
  pages = {351-360},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = {42},
  booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
  mrnumber = {MR1973023 (2004b:91042)},
}

@article{DDF2004,
  author = {E. D. Demaine and M. L. Demaine and R. Fleischer},
  year = 2004,
  title = {Solitaire clobber},
  journal = {Theoret. Comp. Sci.},
  volume = {313},
  pages = {325-338},
  note = {special issue of Dagstuhl Seminar ``Algorithmic Combinatorial
Game Theory'', Feb. 2002},
  mrnumber = {MR2056930.  There will be no review of this item},
}

@inproceedings{DDO2000,
  author = {E.D. Demaine and M. L. Demaine and J. O'Rourke},
  title = {PushPush and Push-1 are NP-hard in 2D},
  booktitle = {Proc. 12th Annual Canadian Conf. on Computational Geometry},
  year = 2000,
  pages = {17-20},
  publisher = {Fredericton, New Brunswick, Canada},
}

@incollection{DDV2002,
  author = {E. D. Demaine and M. L. Demaine and H. A. Verrill},
  year = 2002,
  title = {Coin-moving puzzles},
  pages = {405-431},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = {42},
  booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
  mrnumber = {MR1973108 (2004b:91043)},
}

@article{DFFN2004,
  author = {E. D. Demaine and R. Fleischer and A. S. Fraenkel and
  R. J. Nowakowski},
  year = 2004,
  title = {Open problems at the 2002 Dagstuhl Seminar on algorithmic
  combinatorial game theory},
  journal = {Theoret. Comp. Sci.},
  volume = {313},
  pages = {539-543},
  note = {special issue of Dagstuhl Seminar ``Algorithmic Combinatorial
Game Theory'' (Appendix B), Feb. 2002},
  mrnumber = {MR2056945.  There will be no review of this item},
}

@article{Par1884,
  author = {H. de Parville},
  year = 1884,
  title = {La tour d'Hano\" {\i} et la question du Tonkin},
  journal = {La Nature},
  volume = 12,
  pages = {285-286},
}

@article{Dep2000,
  author = {C. Deppe},
  year = 2000,
  title = {Solution of Ulam's searching game with three lies or an
optimal adaptive strategy for binary three-error-correcting codes},
  journal = {Discrete Math.},
  volume = 224,
  pages = {79-98},
  mrnumber = {MR1781286 (2001j:94054)},
}

@article{Dep2004,
  author = {C. Deppe},
  year = 2004,
  title = {Strategies for the Renyi-Ulam game with fixed number of lies},
  journal = {Theoret. Comput. Sci.},
  volume = 314,
  pages = {45-55},
  mrnumber = {MR2033744 (2004k:05012)},
}

@article{Des1953,
  author = {B. Descartes},
  year = 1953,
  title = {Why are series musical?},
  journal = {Eureka},
  volume = 16,
  pages = {18-20},
  note = {reprinted {\it ibid.} {\bf 27} (1964) 29--31},
}

@inproceedings{DeTh1996,
  author = {W. Deuber and S. Thomass\'e},
  year = 1996,
  title = {Grundy Sets of Partial Orders},
  booktitle = {Technical Report No. 96-123},
  number = {Diskrete Strukturen in der Mathematik},
  pages = {},
  address = {Universit\"at Bielefeld},
}

@misc{Dew1984,
  author = {A. K. Dewdney},
  year = {1984 -- 1991$\ $},
  title = {Computer Recreations},
  howpublished = {a column in Scientific American (May, 1984 -- September 1991)},
}

@book{Dew1988,
  author = {A. K. Dewdney},
  year = 1988,
  title = {The Armchair Universe: An Exploration of Computer Worlds},
  publisher = {W. H. Freeman and Company, New York},
}

@book{Dew1989,
  author = {A. K. Dewdney},
  year = 1989,
  title = {The Turing Omnibus: 61 Excursions in Computer Science},
  publisher = {Computer Science Press, Rockville, MD},
}

@book{Dew1993,
  author = {A. K. Dewdney},
  year = 1993,
  title = {The $($new$)$ Turing Omnibus: 66 Excursions in Computer Science},
  publisher = {Computer Science Press, New York},
}

@inproceedings{DGW1992,
  author = {A. Dhagat and P. G\'{a}cs and P. Winkler},
  title = {On playing "twenty questions" with a liar},
  booktitle = {Proc.\ Third Annual ACM-SIAM Sympos.\ on
Discrete Algorithms},
  year = 1992,
  pages = {16-22},
  publisher = {(Orlando, FL, 1992), ACM, New York},
}

@article{DiWa1981,
  author = {C. S. Dibley and W. D. Wallis},
  year = 1981,
  title = {The effect of starting position in jai-alai},
  journal = {Congr. Numer.},
  volume = 32,
  pages = {253-259},
  note = {Proc. 12-th Southeastern Conference on Combinatorics, Graph
Theory and Computing, Vol. I (Baton Rouge, LA, 1981)},
}

@misc{Did1995,
  author = {C. G. Diderich},
  year = 1995,
  title = {Bibliography on minimax game theory, sequential and parallel
algorithms},
  url = {http://diwww.epfl.ch/$\sim$diderich/bibliographies.html},
}

@article{DiLe1994,
  author = {R. Diestel and I. Leader},
  year = 1994,
  title = {Domination games on infinite graphs},
  journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
  volume = 132,
  pages = {337-345},
}

@article{DiZh1999,
  author = {T. Dinski and X. Zhu},
  year = 1999,
  title = {A bound for the game chromatic number of graphs},
  journal = {Discrete Math.},
  volume = 196,
  pages = {109-115},
}

@inproceedings{DoWi2001,
  author = {Y. Dodis and P. Winkler},
  title = {Universal configurations in light-flipping games},
  booktitle = {Proc.\ 12th Annual ACM-SIAM Sympos.\ on
Discrete Algorithms },
  year = 2001,
  pages = {926-927},
  publisher = {(Washington, DC, 2001), ACM, New York},
}

@article{Doe2001,
  author = {B. Doerr},
  year = 2001,
  title = {Vector balancing games with aging},
  journal = {J. Combin. Theory Ser. A},
  volume = 95,
  pages = {219-233},
  mrnumber = {MR2154483},
}

@book{Dom1964,
  author = {A. P. Domoryad},
  year = 1964,
  title = {Mathematical Games and Pastimes},
  note = {translated by H. Moss},
  publisher = {Pergamon Press, Oxford},
}

@article{DoZw1999,
  author = {D. Dor and U. Zwick},
  year = 1999,
  title = {SOKOBAN and other motion planning problems},
  pages = {215-228},
  volume = 13,
  journal = {Comput. Geom.},
}

@article{Dre1951,
  author = {M. Dresher},
  year = 1951,
  title = {Games of strategy},
  pages = {93-99},
  volume = 25,
  journal = {Math. Mag.},
}

@article{DFP1999,
  author = {A. Dress and A. Flammenkamp and N. Pink},
  year = 1999,
  title = {Additive periodicity of the Sprague-Grundy function of certain
           Nim games},
  pages = {249-270},
  volume = 22,
  journal = {Adv. in Appl. Math.},
}

@article{Dru2005,
  author = {G. C. Drummond-Cole},
  year = 2005,
  title = {Positions of value *2 in
generalized domineering and chess},
  journal = {INTEGERS, Electr. J. of Combinat. Number Theory},
  volume = 5,
  pages = {\#G6, 13pp., Comb. Games Sect.},
  url = {http://www.integers-ejcnt.org/vol5.html},
  mrnumber = {MR2192254},
}

@article{Duc1980,
  author = {P. Duchet},
  year = 1980,
  title = {Graphes noyau-parfaits},
  pages = {93-101},
  volume = 9,
  journal = {Ann. Discrete Math.},
}

@article{Duc1987,
  author = {P. Duchet},
  year = 1987,
  title = {A sufficient condition for a digraph to be kernel-perfect},
  journal = {J. Graph Theory},
  volume = 11,
  pages = {81-85},
}

@article{Duc1987a,
  author = {P. Duchet},
  year = 1987,
  title = {Parity graphs are kernel-M-solvable},
  journal = {J. Combin. Theory \emph{(Ser.~B)}},
  volume = 43,
  pages = {121-126},
}

@article{DuMe1981,
  author = {P. Duchet and H. Meyniel},
  year = 1981,
  title = {A note on kernel-critical graphs},
  journal = {Discrete Math.},
  volume = 33,
  pages = {103-105},
}

@article{DuMe1983,
  author = {P. Duchet and H. Meyniel},
  year = 1983,
  title = {Une g\'en\'eralisation du th\'eor\`eme de Ri\-chard\-son sur
l'existence de noyaux dans le graphes orient\'es},
  journal = {Discrete Math.},
  volume = 43,
  pages = {21-27},
}

@article{DuMe1993,
  author = {P. Duchet and H. Meyniel},
  year = 1993,
  title = {Kernels in directed graphs: a poison game},
  journal = {Discrete Math.},
  volume = 115,
  pages = {273-276},
}

@book{Dud1958,
  author = {H. E. Dudeney},
  year = 1958,
  title = {The Canterbury Puzzles and Other Curious Problems},
  edition = {4th},
  publisher = {Dover, Mineola, NY},
  note = {1st edn: W. Heinemann, 1907},
}

@book{Dud1970,
  author = {H. E. Dudeney},
  year = 1970,
  title = {Amusements in Mathematics},
  publisher = {Dover, Mineola, NY},
  note = {1st edn: Dover, 1917, reprinted by Dover in 1959},
}

@article{DuSp2004,
  author = {I. Dumitriu and J. Spencer},
  year = 2004,
  title = {A halfliar's game},
  journal = {Theoret. Comp. Sci.},
  volume = {313},
  pages = {353-369},
  note = {special issue of Dagstuhl Seminar ``Algorithmic Combinatorial
Game Theory'', Feb. 2002},
  mrnumber = {MR2056932.  There will be no review of this item},
}

@article{DuKi2004a,
  author = {C. Dunn and H. A. Kierstead},
  year = 2004,
  title = {A simple competitive graph coloring algorithm, II},
  journal = {J. Combin. Theory Ser. B},
  volume = 90,
  pages = {93-106},
}

@article{DuKi2004b,
  author = {C. Dunn and H. A. Kierstead},
  year = 2004,
  title = {A simple competitive graph coloring algorithm, III},
  journal = {J. Combin. Theory Ser. B},
  volume = 92,
  pages = {137-150},
}

@article{DuKi2004c,
  author = {C. Dunn and H. A. Kierstead},
  year = 2004,
  title = {The relaxed game chromatic number of outerplanar graphs},
  journal = {J. Graph Theory},
  volume = 46,
  pages = {69--78},
}

@article{DuFr1989,
  author = {N. Duvdevani and A. S. Fraenkel},
  year = 1989,
  title = {Properties of $k$-Welter's game},
  journal = {Discrete Math.},
  volume = 76,
  pages = {197-221},
}

@article{Edm1965,
  author = {J. Edmonds},
  year = 1965,
  title = {Lehman's switching game and a theorem of Tutte and Nash--Williams},
  journal = {J. Res. Nat. Bur. Standards},
  volume = {69B},
  pages = {73-77},
}

@article{EhSt1996,
  author = {R. Ehrenborg and E. Steingr\'\i{}msson},
  year = 1996,
  title = {Playing Nim on a simplicial complex},
  journal = {Electr. J. Combin.},
  volume = 3,
  number = {1},
  pages = {\#R9, 33pp.},
  url = {http://www.combinatorics.org/},
}

@article{EhMy1979,
  author = {A. Ehrenfeucht and J. Mycielski},
  year = 1979,
  title = {Positional strategies for mean payoff games},
  journal = {Internat. J. Game Theory},
  volume = 8,
  pages = {109-113},
}

@incollection{Elk1996,
  author = {N. D. Elkies},
  year = 1996,
  title = {On numbers and endgames: combinatorial game theory in chess
endgames},
  pages = {135-150},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = 29,
  booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
  mrnumber = {MR1427963},
}

@incollection{Elk2002,
  author = {N. D. Elkies},
  year = 2002,
  title = {Higher nimbers in pawn endgames on large chessboards},
  pages = {61-78},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = {42},
  booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
  mrnumber = {MR1973005 (2004c:91029)},
}

@article {EPV2005,
    AUTHOR = {Ellis, Robert B. and Ponomarenko, Vadim and Yan, Catherine H.},
     TITLE = {The {R}\'enyi-{U}lam pathological liar game with a fixed
              number of lies},
   JOURNAL = {J. Combin. Theory Ser. A},
  FJOURNAL = {Journal of Combinatorial Theory. Series A},
    VOLUME = {112},
      YEAR = {2005},
     PAGES = {328--336},
      ISSN = {0097-3165},
     CODEN = {JCBTA7},
   MRCLASS = {91A46 (05A99)},
  MRNUMBER = {MR2177490 (2006g:91040)},
MRREVIEWER = {Kimmo Eriksson},
}
	
@article {ElYa2004,
    AUTHOR = {Ellis, Robert B. and Yan, Catherine H.},
     TITLE = {Ulam's pathological liar game with one half-lie},
   JOURNAL = {Int. J. Math. Math. Sci.},
  FJOURNAL = {International Journal of Mathematics and Mathematical
              Sciences},
      YEAR = {2004},
     PAGES = {1523--1532},
      ISSN = {0161-1712},
   MRCLASS = {91A46 (05A99)},
  MRNUMBER = {MR2085073 (2005c:91033)},
}
			
@article{Eng1972,
  author = {D. Engel},
  title = {{DIM}: three-dimensional {S}im},
  journal = {J. Recr. Math.},
  year = 1972,
  volume = 5,
  pages = {274-275},
}

@article{EpFe1980,
  author = {R. J. Epp and T. S. Ferguson},
  year = 1980,
  title = {A note on take-away games},
  journal = {Fibonacci Quart.},
  volume = 18,
  pages = {300-303},
}

@incollection{Epp2002,
  author = {D. Eppstein},
  year = 2002,
  title = {Searching for spaceships},
  pages = {433-453},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = {42},
  booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
}

@book{Eps1977,
  author = {R. A. Epstein},
  year = 1977,
  title = {Theory of Gambling and Statistial Logic},
  publisher = {Academic Press, New York, NY},
}

@article{Er1982,
  author = {M. C. Er},
  year = 1982,
  title = {A representation approach to the tower of Hanoi problem},
  journal = {Comput. J.},
  volume = 25,
  pages = {442-447},
}

@article{Er1983,
  author = {M. C. Er},
  year = 1983,
  title = {An analysis of the generalized towers of Hanoi problem},
  journal = {BIT},
  volume = 23,
  pages = {429-435},
}

@article{Er1983a,
  author = {M. C. Er},
  year = 1983,
  title = {An iterative solution to the generalized towers of Hanoi problem},
  journal = {BIT},
  volume = 23,
  pages = {295-302},
}

@article{Er1984,
  author = {M. C. Er},
  year = 1984,
  title = {A generalization of the cyclic towers of Hanoi},
  journal = {Intern. J. Comput. Math.},
  volume = 15,
  pages = {129-140},
}

@article{Er1984a,
  author = {M. C. Er},
  year = 1984,
  title = {The colour towers of Hanoi: a generalization},
  journal = {Comput. J.},
  volume = 27,
  pages = {80-82},
}

@article{Er1984b,
  author = {M. C. Er},
  year = 1984,
  title = {The cyclic towers of Hanoi: a representation approach},
  journal = {Comput. J.},
  volume = 27,
  pages = {171-175},
}

@article{Er1984c,
  author = {M. C. Er},
  year = 1984,
  title = {The generalized colour towers of Hanoi: an iterative algorithm},
  journal = {Comput. J.},
  volume = 27,
  pages = {278-282},
}

@article{Er1984d,
  author = {M. C. Er},
  year = 1984,
  title = {The generalized towers of Hanoi problem},
  journal = {J. Inform. Optim. Sci.},
  volume = 5,
  pages = {89-94},
}

@article{Er1985,
  author = {M. C. Er},
  year = 1985,
  title = {The complexity of the generalized cyclic towers of Hanoi problem},
  journal = {J. Algorithms},
  volume = 6,
  pages = {351-358},
}

@article{Er1987a,
  author = {M. C. Er},
  year = 1987,
  title = {A general algorithm for finding a shortest path between two
$n$-configurations},
  journal = {Information Sciences},
  volume = 42,
  pages = {137-141},
}

@article{Er1987b,
  author = {M. C. Er},
  year = 1987,
  title = {A time and space efficient algorithm for the cyclic Towers of Hanoi
problem},
  journal = {J. Inform. Process.},
  volume = 9,
  pages = {163-165},
}

@article{Er1988,
  author = {M. C. Er},
  year = 1988,
  title = {A minimal space algorithm for solving the towers of Hanoi problem},
  journal = {J. Inform. Optim. Sci.},
  volume = 9,
  pages = {183-191},
}

@article{Er1989,
  author = {M. C. Er},
  year = 1989,
  title = {A linear space algorithm for solving the Towers of Hanoi
problem by using a virtual disc.},
  journal = {Inform. Sci.},
  volume = 47,
  pages = {47-52},
}

@inproceedings{EST1992,
  author = {C. Erbas and S. Sarkeshik and M. M. Tanik},
  year = 1992,
  title = {Different perspectives of the $N$-queens problem},
  booktitle = {Proc. ACM Computer Science Conf., \emph{Kansas City, MO}},
  pages = {99-108},
}

@article{ErTa1994,
  author = {C. Erbas and M. M. Tanik},
  year = 1994,
  title = {Parallel memory allocation and data alignment in SIMD machines},
  journal = {Parallel Algorithms and Applications},
  volume = 4,
  pages = {139-151},
  note = {preliminary version appeared under the title: Storage schemes
for parallel memory systems and the $N$-queens problem, in: Proc. 15th
Ann. Energy Tech. Conf., Houston, TX, Amer. Soc. Mech. Eng., Vol. 43,
1992, pp. 115--120},
}

@article{ETA1992,
  author = {C. Erbas and M. M. Tanik and Z. Aliyazicioglu},
  year = 1992,
  title = {Linear conguence equations for the solutions of the $N$-queens problem},
  journal = {Inform. Process. Lett.},
  volume = 41,
  pages = {301-306},
}

@article{EFHK2004,
  author = {P. L. Erd\"{o}s and U. Faigle and W. Hochst\"{a}ttler and W. Kern},
  year = 2004,
  title = {Note on the game chromatic index of trees},
  journal = {Theoret. Comp. Sci.},
  volume = {313},
  pages = {371-376},
  note = {special issue of Dagstuhl Seminar ``Algorithmic Combinatorial
Game Theory'', Feb. 2002},
  mrnumber = {MR2056933.  There will be no review of this item},
}

@article{EHHL1987,
  author = {P. Erd\H{o}s and W. R. Hare and S. T. Hedetniemi and
R. C. Laskar},
  year = 1987,
  title = {On the equality of the Grundy and ochromatic
numbers of a graph},
  journal = {J. Graph Theory},
  volume = 11,
  pages = {157-159},
}

@article{EHLP2003,
  author = {P. Erd\H{o}s and S. T. Hedetniemi and R. C. Laskar and
G. C. E. Prins},
  year = 2003,
  title = {On the equality of the partial Grundy and upper ochromatic
numbers of graphs},
  journal = {Discrete Math.},
  volume = 272,
  pages = {53-64},
  mrnumber = {MR2019200 (2004i:05048)},
}

@article{ErSe1973,
  author = {P. Erd\H{o}s and J. L. Selfridge},
  year = 1973,
  title = {On a combinatorial game},
  journal = {J. Combin. Theory \emph{(Ser.~A)}},
  volume = 14,
  pages = {298-301},
}

@incollection{Eri1996a,
  author = {J. Erickson},
  year = 1996,
  title = {New toads and frogs results},
  pages = {299-310},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = 29,
  booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}

@incollection{Eri1996b,
  author = {J. Erickson},
  year = 1996,
  title = {Sowing games},
  pages = {287-297},
  editor = {R. J. Nowa\-kowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = 29,
  booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@article{ErHa1983,
  author = {M. Erickson and F. Harary},
  year = 1983,
  title = {Picasso animal achievement games},
  journal = {Bull. Malaysian Math. Soc.},
  volume = 6,
  pages = {37-44},
}

@article{EEE2000,
  author = {N. Eriksen and H. Eriksson and K. Eriksson},
  year = 2000,
  title = {Diagonal checker-jumping and Eulerian numbers for color-signed
permutations},
  journal = {Electr. J. Combin.},
  volume = 7,
  pages = {\#R3, 11 pp.},
  url = {http://www.combinatorics.org/}
}


@article{Eri1995,
  author = {H. Eriksson},
  year = 1995,
  title = {Pebblings},
  journal = {Electr. J. Combin.},
  volume = 2,
  pages = {\#R7, 18pp.},
  url = {http://www.combinatorics.org/},
}

@article{EEKSW2001,
  author = {H. Eriksson and K. Eriksson and J. Karlander and L. Svensson
and J. W\"{a}stlund},
  year = 2001,
  title = {Sorting a bridge hand},
  journal = {Discrete Math.},
  volume = 241,
  pages = {289-300},
  note = {Selected papers in honor of Helge Tverberg}
}

@article{ErLi1995,
  author = {H. Eriksson and B. Lindstr\"om},
  year = 1995,
  title = {Twin jumping checkers in $\IZ^d$},
  journal = {European J. Combin.},
  volume = 16,
  pages = {153-157},
}

@article{Eri1991,
  author = {K. Eriksson},
  year = 1991,
  title = {No polynomial bound for the chip firing game on directed graphs},
  journal = {Proc. Amer. Math. Soc.},
  volume = 112,
  pages = {1203-1205},
}

@article{Eri1992,
  author = {K. Eriksson},
  year = 1992,
  title = {Convergence of Mozes' game of numbers},
  journal = {Linear Algebra Appl.},
  volume = 166,
  pages = {151-165},
}

@article{Eri1994a,
  author = {K. Eriksson},
  year = 1994,
  title = {Node firing games on graphs},
  journal = {Contemp. Math.},
  volume = 178,
  pages = {117-127},
}

@article{Eri1994b,
  author = {K. Eriksson},
  year = 1994,
  title = {Reachability is decidable in the numbers game},
  journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
  volume = 131,
  pages = {431-439},
}

@article{Eri1995a,
  author = {K. Eriksson},
  year = 1995,
  title = {The numbers game and Coxeter groups},
  journal = {Discrete Math.},
  volume = 139,
  pages = {155-166},
}

@article{Eri1996c,
  author = {K. Eriksson},
  year = 1996,
  title = {Chip-firing games on mutating graphs},
  journal = {SIAM J. Discrete Math.},
  volume = 9,
  pages = {118-128},
}

@article{Eri1996d,
  author = {K. Eriksson},
  year = 1996,
  title = {Strong convergence and a game of numbers},
  journal = {European J. Combin.},
  volume = 17,
  pages = {379-390},
}

@article{Eri1996e,
  author = {K. Eriksson},
  year = 1996,
  title = {Strong convergence and the polygon property of 1-player games},
  journal = {Discrete Math.},
  volume = 153,
  pages = {105-122},
  note = {Proc. 5th Conf. on Formal Power Series and Algebraic
Combinatorics (Florence 1993)},
}

@article {Eti1991,
    AUTHOR = {Etienne, Gwihen},
     TITLE = {Tableaux de {Y}oung et solitaire bulgare},
   JOURNAL = {J. Combin. Theory \rm({Ser. A})},
  FJOURNAL = {Journal of Combinatorial Theory. \rm{Series A}},
    VOLUME = {58},
      YEAR = {1991},
     PAGES = {181--197},
      ISSN = {0097-3165},
     CODEN = {JCBTA7},
   MRCLASS = {05E99 (05E10)},
  MRNUMBER = {MR1129115 (93a:05134)},
MRREVIEWER = {Andrea Brini},
}

@article{Ett,
  author = {J. M. Ettinger},
  year = 2000,
  title = {A metric for positional games},
  journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
  volume = 230,
  pages = {207-219},
  mrnumber = {MR1725638 (2001g:91041)},
}

@article{Euw,
  author = {M. Euwe},
  year = 1929,
  title = {Mengentheoretische Betrachtungen \"{u}ber das Schachspiel},
  journal = {Proc. Konin. Akad. Wetenschappen},
  volume = 32,
  pages = {633-642},
}

@article{Eva1974,
  author = {R. J. Evans},
  year = 1974,
  title = {A winning opening in reverse Hex},
  journal = {J. Recr. Math.},
  volume = 7,
  pages = {189-192},
}

@article{Eva1975,
  author = {R. J. Evans},
  year = {1975--76},
  title = {Some variants of Hex},
  journal = {J. Recr. Math.},
  volume = 8,
  pages = {120-122},
}

@article{Eva1979,
  author = {R. J. Evans},
  year = 1979,
  title = {Silverman's game on intervals},
  journal = {Amer. Math. Monthly},
  volume = 86,
  pages = {277-281},
}

@article{EvHe1992,
  author = {R. J. Evans and G. A. Heuer},
  year = 1992,
  title = {Silverman's game on discrete sets},
  journal = {Linear Algebra Appl.},
  volume = 166,
  pages = {217-235},
}

@article{EvTa1976,
  author = {S. Even and R. E. Tarjan},
  year = 1976,
  title = {A combinatorial problem which is complete in polynomial space},
  journal = {J. Assoc. Comput. Mach.},
  volume = 23,
  pages = {710-719},
  note = {also appeared in Proc. 7th Ann. ACM Symp. Theory of Computing
(Albuquerque, NM, 1975), Assoc. Comput. Mach., New York, NY, 1975, pp. 66--71},
}

@article{Exo1980,
  author = {G. Exoo},
  title = {A new way to play {R}amsey games},
  journal = {J. Recr. Math.},
  year = {1980-81},
  volume = 13,
  number = 2,
  pages = {111-113},
}

@article{FKKT1993,
  author = {U. Faigle and W. Kern and H. Kierstead and W. T. Trotter},
  year = 1993,
  title = {On the game chromatic number of some classes of graphs},
  journal = {Ars Combin.},
  volume = 35,
  pages = {143-150},
}

@article{FKK1998,
  author = {U. Faigle and W. Kern and J. Kuipers},
  year = 1998,
  title = {Computing the nucleolus of min-cost spanning tree games is NP-hard},
  journal = {Internat. J. Game Theory},
  volume = 27,
  pages = {443-450},
}

@book{Fal1961,
  author = {E. Falkener},
  year = 1961,
  title = {Games Ancient and Oriental and How to Play Them},
  publisher = {Dover, New York, NY. (Published previously by Longmans Green, 1892.)},
}

@article{FaSc1986,
  author = {B.-J. Falkowski and L. Schmitz},
  year = 1986,
  title = {A note on the queens' problem},
  journal = {Inform. Process. Lett.},
  volume = 23,
  pages = {39-46},
}

@article{Far2003,
  author = {G. E. Farr},
  year = 2003,
  title = {The Go polynomials of a graph},
  journal = {Theoret. Comp. Sci.},
  volume = 306,
  pages = {1-18},
  mrnumber = {MR2000162 (2004e:05074)},
}

@article{FGR2005,
  author = {J. Farrell and M. Gardner and T. Rodgers},
  year = 2005,
  title = {Configuration games},
  journal = {{\rm in:} Tribute to a Mathemagician{\rm ,}},
  chapter = {},
  note = {honoring Martin Gardner (B. Cipra, E. D. Demaine,
M. L. Demaine and T. Rodgers, eds.),
A K Peters, Wellesley, MA, pp. 93-99.},
  publisher = {},
}

@article{Fed1990,
  author = {T. Feder},
  year = 1990,
  title = {Toetjes},
  journal = {Amer. Math. Monthly},
  volume = 97,
  pages = {785-794},
}

@article {MR2191279,
    AUTHOR = {Feder, Tom{\'a}s and Subi, Carlos},
     TITLE = {Disks on a tree: analysis of a combinatorial game},
   JOURNAL = {SIAM J. Discrete Math.},
  FJOURNAL = {SIAM Journal on Discrete Mathematics},
    VOLUME = {19},
      YEAR = {2005},
     PAGES = {543--552 (electronic)},
      ISSN = {0895-4801},
   MRCLASS = {05A99 (82C20)},
  MRNUMBER = {MR2191279 (2006i:05022)},
MRREVIEWER = {Deepak Dhar},
}

@article{FFFS2004,
  author = {S. P. Fekete and R. Fleischer and A. S. Fraenkel and M. Schmitt},
  year = 2004,
  title = {Traveling salesmen in the presence of competition},
  journal = {Theoret. Comp. Sci.},
  volume = {313},
  pages = {377-392},
  note = {special issue of Dagstuhl Seminar ``Algorithmic Combinatorial
Game Theory'', Feb. 2002},
  mrnumber = {MR2056934 (2005a:90168)},
}

@article{Fer1974,
  author = {T. S. Ferguson},
  year = 1974,
  title = {On sums of graph games with last player losing},
  journal = {Internat. J. Game Theory},
  volume = 3,
  pages = {159-167},
}

@article{Fer1984,
  author = {T. S. Ferguson},
  year = 1984,
  title = {Mis\`ere annihilation games},
  journal = {J. Combin. Theory \emph{(Ser.~A)}},
  volume = 37,
  pages = {205-230},
}

@article{Fer1989,
  author = {T. S. Ferguson},
  year = 1989,
  title = {Who solved the secretary problem?},
  journal = {Statistical Science},
  volume = 4,
  pages = {282-296},
}

@article{Fer1992,
  author = {T. S. Ferguson},
  year = 1992,
  title = {Mate with bishop and knight in kriegspiel},
  journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
  volume = 96,
  pages = {389-403},
}

@article{Fer1998,
  author = {T. S. Ferguson},
  year = 1998,
  title = {Some chip transfer games},
  journal = {Theoret. Comp. Sci. \emph{(Math Games)}},
  volume = 191,
  pages = {157-171},
}

@article{Fer2001,
  author = {T. S. Ferguson},
  year = 2001,
  title = {Another form of matrix Nim},
  journal = {Electr. J. Combin.},
  volume = {8(2)},
  pages = {\#R9, 9pp.},
  url = {http://www.combinatorics.org/},
  note = {Volume in honor of Aviezri S. Fraenkel},
  mrnumber = {MR1853260 (2002g:91046)},
}

@article{FiHa1983,
  author = {A. S. Finbow and B. L. Hartnell},
  year = 1983,
  title = {A game related to covering by stars},
  journal = {Ars Combinatoria},
  volume = {16-A},
  pages = {189-198},
}

@inproceedings{FiWr1993,
  author = {M. J. Fischer and R. N. Wright},
  year = 1993,
  title = {An application of game-theoretic techniques to cryptography},
  pages = {99-118},
  volume = 13,
  booktitle = {Advances in Computational Complexity Theory \emph{(New
Brunswick, NJ, 1990), DIMACS Ser. Discrete Math. Theoret. Comput. Sci.}},
}

@article{FiSl1989,
  author = {P. C. Fishburn and N. J. A. Sloane},
  year = 1989,
  title = {The solution to Berlekamp's switching game},
  journal = {Discrete Math.},
  volume = 74,
  pages = {263-290},
}

@article{FiRy1992,
  author = {D. C. Fisher and J. Ryan},
  year = 1992,
  title = {Optimal strategies for a generalized ``scissors, paper, and stone" game},
  journal = {Amer. Math. Monthly},
  volume = 99,
  pages = {935-942},
}

@article{FiRy1995,
  author = {D. C. Fisher and J. Ryan},
  year = 1995,
  title = {Probabilities within optimal strategies for tournament games},
  journal = {Discrete Appl. Math.},
  volume = 56,
  pages = {87-91},
}

@article{FiRy1995a,
  author = {D. C. Fisher and J. Ryan},
  year = 1995,
  title = {Tournament games and positive tournaments},
  journal = {J. Graph Theory},
  volume = 19,
  pages = {217-236},
}

@article{FiNo2001,
  author = {S. L. Fitzpatrick and R. J. Nowakowski},
  year = 2001,
  title = {Copnumber of graphs with strong isometric dimension two},
  journal = {Ars Combin.},
  volume = 59,
  pages = {65-73},
  mrnumber = {MR1832198 (2002b:05053)},
}

@article{FlBa2002,
  author = {G. W. Flake and E. B. Baum},
  year = 2002,
  title = {{\it Rush Hour\/} is PSPACE-complete, or "Why you should
generously tip parking lot attendants"},
  journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
  volume = 270,
  pages = {895-911},
  mrnumber = {MR1871102 (2002h:68068)},
}

@phdthesis{Fla1996,
  author = {A. Flammenkamp},
  year = 1996,
  title = {Lange Perioden in Subtraktions-Spielen},
  school= {University of Bielefeld},
}

@article{FHR2003,
  author = {A. Flammenkamp and A. Holshouser and H. Reiter},
  year = 2003,
  title = {Dynamic one-pile blocking Nim},
  journal = {Electr. J. Combinatorics},
  volume = 10,
  pages = {\#N4, 6pp.},
  url = {http://www.combinatorics.org/},
  mrnumber = {MR1975777 (2004b:05027)},
}

@article{Fla1978,
  author = {J. A. Flanigan},
  year = 1978,
  title = {Generalized two-pile Fibonacci nim},
  journal = {Fibonacci Quart.},
  volume = 16,
  pages = {459-469},
}

@article{Fla1981,
  author = {J. A. Flanigan},
  year = 1981,
  title = {On the distribution of winning moves in random game trees},
  journal = {Bull. Austr. Math. Soc.},
  volume = 24,
  pages = {227-237},
}

@article{Fla1981a,
  author = {J. A. Flanigan},
  year = 1981,
  title = {Selective sums of loopy partizan graph games},
  journal = {Internat. J. Game Theory},
  volume = 10,
  pages = {1-10},
}

@article{Fla1982,
  author = {J. A. Flanigan},
  year = 1982,
  title = {A complete analysis of black-white Hackendot},
  journal = {Internat. J. Game Theory},
  volume = 11,
  pages = {21-25},
}

@article{Fla1982a,
  author = {J. A. Flanigan},
  year = 1982,
  title = {One-pile time and size dependent take-away games},
  journal = {Fibonacci Quart.},
  volume = 20,
  pages = {51-59},
}

@article{Fla1983,
  author = {J. A. Flanigan},
  year = 1983,
  title = {Slow joins of loopy games},
  journal = {J. Combin. Theory \emph{(Ser.~A)}},
  volume = 34,
  pages = {46-59},
}

@inproceedings{FlTr2006,
  author = {R. Fleischer and G. Trippen},
  title = {Kayles on the way to the stars},
  booktitle = {Proc.\ 4th Intern.\ Conference on Computers and
Games CG'2004},
  organization = {Bar-Ilan University, Ramat-Gan, Israel, July 2004, Lecture Notes in Computer
Science Vol. 3846, Springer},
  year = 2006,
  volume= {},
  editor = {H. J. van den Herik and Y. Bj\"ornsson and N. S. Netanyahu},
  pages = {232-245},
}

@article{Fly1973,
  author = {J. O. Flynn},
  year = 1973,
  title = {Lion and man: the boundary constraint},
  journal = {SIAM J. Control},
  volume = 11,
  pages = {397-411},
}

@article{Fly1974a,
  author = {J. O. Flynn},
  year = 1974,
  title = {Lion and man: the general case},
  journal = {SIAM J. Control},
  volume = 12,
  pages = {581-597},
}

@article{Fly1974b,
  author = {J. O. Flynn},
  year = 1974,
  title = {Some results on max-min pursuit},
  journal = {SIAM J. Control},
  volume = 12,
  pages = {53-69},
}

@article{Fom1998,
  author = {F. V. Fomin},
  year = 1998,
  title = {Helicopter search problems, bandwidth and pathwidth},
  journal = {Discrete Appl. Math.},
  volume = 85,
  pages = {59-70},
}

@article{Fom1999,
  author = {F. V. Fomin},
  year = 1999,
  title = {Note on a helicopter search problem on graphs},
  journal = {Discrete Appl. Math.},
  volume = 95,
  pages = {241-249},
  note = {Proc. Conf. on Optimal Discrete Structures and Algorithms ---
ODSA '97 (Rostock)}
}

@article{FoPe1996,
  author = {F. V. Fomin and N. N. Petrov},
  year = 1996,
  title = {Pursuit-evasion and search problems on graphs},
  journal = {Congr. Numer.},
  volume = 122,
  pages = {47-58},
  note = {Proc. 27-th Southeastern Intern. Conf. on Combinatorics,
Graph Theory and Computing (Baton Rouge, LA, 1996)}
}

@article{FoJo1984,
  author = {L. R. Foulds and D. G. Johnson},
  year = 1984,
  title = {An application of graph theory and integer programming:
chessboard non-attacking puzzles},
  journal = {Math. Mag.},
  volume = 57,
  pages = {95-104},
}

@incollection{Fra1974,
  author = {A. S. Fraenkel},
  year = 1974,
  title = {Combinatorial games with an annihilation rule},
  pages = {87-91},
  editor = {J. P. LaSalle},
  publisher = {Amer. Math. Soc., Providence, RI},
  volume = 20,
  booktitle = {The Influence of Computing on Mathematical Research and
Education, {\rm Missoula MT, August 1973}, \emph{Proc. Symp. Appl. Math.,}},
}

@article{Fra1977,
  author = {A. S. Fraenkel},
  year = 1977,
  title = {The particles and antiparticles game},
  journal = {Comput. Math. Appl.},
  volume = 3,
  pages = {327-328},
}

@article{Fra1980,
  author = {A. S. Fraenkel},
  year = 1980,
  title = {From Nim to Go},
  journal = {Ann. Discrete Math.},
  volume = 6,
  note = {Proc. Symp. on Combinatorial Mathematics, Combinatorial
Designs and Their Applications (J. Srivastava, ed.), Colorado State
Univ., Fort Collins, CO, June 1978},
  pages = {137-156},
}

@article{Fra1981,
  author = {A. S. Fraenkel},
  year = 1981,
  title = {Planar kernel and Grundy with $d\leq 3$, $d_{out}\leq 2$,
$d_{in}\leq 2$ are NP-complete},
  journal = {Discrete Appl. Math.},
  volume = 3,
  pages = {257-262},
}

@article{Fra1982,
  author = {A. S. Fraenkel},
  year = 1982,
  title = {How to beat your Wythoff games' opponent on three fronts},
  journal = {Amer. Math. Monthly},
  volume = 89,
  pages = {353-361},
}

@article{Fra1983,
  author = {A. S. Fraenkel},
  year = 1983,
  title = {15 Research problems on games},
  journal = {Discrete Math.},
  note = {in "Research Problems" section, Vols. {\bf 43-46}},
}

@article{Fra1984,
  author = {A. S. Fraenkel},
  year = 1984,
  title = {Wythoff games, continued fractions, cedar trees and Fibonacci searches},
  journal = {Theoret. Comput. Sci.},
  volume = 29,
  pages = {49-73},
  note = {an earlier version appeared in Proc. 10th Internat. Colloq.
on Automata, Languages and Programming (J. Diaz, ed.), Vol. 154,
Barcelona, July 1983, Lecture Notes in Computer Science,
Springer Verlag, Berlin, 1983, pp. 203--225},
}

@article{Fra1988,
  author = {A. S. Fraenkel},
  year = 1988,
  title = {The complexity of chess, Letter to the Editor},
  journal = {J. Recr. Math.},
  volume = 20,
  pages = {13-14},
}

@incollection{Fra1991,
  author = {A. S. Fraenkel},
  year = 1991,
  title = {Complexity of games},
  pages = {111-153},
  editor = {R. K. Guy},
  publisher = {Amer. Math. Soc., Providence, RI},
  volume = 43,
  booktitle = {Combinatorial Games, \emph{Proc. Symp. Appl. Math.}},
}

@article{Fra1994,
  author = {A. S. Fraenkel},
  year = 1994,
  title = {Even kernels},
  journal = {Electr. J. Combinatorics},
  volume = 1,
  pages = {\#R5, 13pp.},
  url = {http://www.combinatorics.org/},
}

@incollection{Fra1994a,
  author = {A. S. Fraenkel},
  year = 1994,
  title = {Recreation and depth in combinatorial games},
  pages = {176-194},
  editor = {R. K. Guy and R. E. Woodrow},
  publisher = {Math. Assoc. of America, Washington, DC},
  booktitle = {The Lighter Side of Mathematics, \emph{Proc. E. Strens
Memorial Conf. on Recr. Math. and its History, Calgary, 1986, Spectrum
Series}},
}

@incollection{Fra1996,
  author = {A. S. Fraenkel},
  year = 1996,
  title = {Error-correcting codes derived from combinatorial games},
  pages = {417-431},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = 29,
  booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}

@incollection{Fra1996a,
  author = {A. S. Fraenkel},
  year = 1996,
  title = {Scenic trails ascending from sea-level Nim to alpine chess},
  pages = {13-42},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = 29,
  booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}

@article{Fra1997,
  author = {A. S. Fraenkel},
  year = 1997,
  title = {Combinatorial game theory foundations applied to digraph kernels},
  journal = {Electr. J. Combinatorics},
  volume =  4,
  number = {2},
  pages = {\#R10, 17pp.},
  note = {Volume in honor of Herbert Wilf},
  url = {http://www.combinatorics.org/},
}

@article{Fra1998a,
  author = {A. S. Fraenkel},
  year = 1998,
  title = {Heap games, numeration systems and sequences},
  journal = {Ann. Comb.},
  volume = 2,
  pages = {197-210},
  note = {an earlier version appeared in: {\em Fun With
Algorithms\/}, Vol.~4 of {\it Proceedings in Informatics\/} (E. Lodi,
L. Pagli and N. Santoro, eds.), Carleton Scientific, University of
Waterloo, Waterloo, Ont., pp. 99--113, 1999. Conference took place on the
island of Elba, June 1998.},
  mrnumber = {MR1681514 (2000b:91001)},
}

@article{Fra1998b,
  author = {A. S. Fraenkel},
  year = 1998,
  title = {Multivision: an intractable impartial game with a linear winning strategy},
  journal = {Amer. Math. Monthly},
  volume = 105,
  pages = {923-928},
}

@article{Fra2000,
  author = {A. S. Fraenkel},
  year = 2000,
  title = {Recent results and questions in combinatorial game complexities},
  journal = {Theoret. Comput. Sci.},
  volume = 249,
  pages = {265-288},
  note = {Conference version in: Proc. AWOCA98 --- Ninth Australasian
Workshop on Combinatorial Algorithms, C.S. Iliopoulos, ed., Perth,
Western Australia, 27--30 July, 1998, special AWOCA98 issue, pp. 124-146},
  mrnumber = {MR1798313 (2001j:91033)},
}

@inproceedings{Fra2001,
  author = {A. S. Fraenkel},
  year = 2001,
  title = {Virus versus mankind},
  booktitle = {Proc.\ 2nd Intern.\ Conference on Computers and
Games CG'2000},
  organization = {Hamamatsu, Japan, Oct.\ 2000, Lecture Notes in Computer
Science, Springer},
  volume= {2063},
  pages = {204--213},
  editor = {T. Marsland and I. Frank},
}

@article{Fra2002a,
  author = {A. S. Fraenkel},
  year = 2002,
  title = {Mathematical chats between two physicists},
  journal = {{\rm in:} Puzzler's Tribute: a Feast for the Mind{\rm ,}},
  chapter = {},
  note = {honoring Martin Gardner (D. Wolfe and T. Rodgers, eds.),
A K Peters, Natick, MA, pp. 383-386},
  publisher = {},
}

@article{Fra2002b,
  author = {A. S. Fraenkel},
  year = 2002,
  title = {Arrays, numeration systems and Frankenstein games},
  journal = {Theoret. Comput. Sci.},
  volume = 282,
  pages = {271-284},
  note = {special`` Fun With Algorithms" issue},
  mrnumber = {MR1909052 (2003h:91036)},
}

@incollection{Fra2002c,
  author = {A. S. Fraenkel},
  year = 2002,
  title = {Two-player games on cellular automata},
  pages = {279-306},
  editor = {R. J. Nowakowski},
  publisher = {Cambridge University Press, Cambridge},
  volume = {42},
  booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
  mrnumber = {MR1973018 (2004b:91004)},
}

@article{Fra2004a,
  author = {A. S. Fraenkel},
  year = 2004,
  title = {Complexity, appeal and challenges of combinatorial games},
  journal = {Theoret. Comp. Sci.},
  volume = {313},
  pages = {393-415},
  note = {Expanded version of a keynote address at Dagstuhl Seminar
``Algorithmic Combinatorial Game Theory'', Feb. 2002, special
issue on Algorithmic Combinatorial Game Theory},
  mrnumber = {MR2056935.  There will be no review of this item},
}

@article{Fra2004b,
  author = {A. S. Fraenkel},
  year = 2004,
  title = {New games related to old and new sequences},
  journal = {INTEGERS, Electr. J of Combinat. Number Theory},
  volume = {4},
  pages = {\#G6, 18pp., Comb. Games Sect.},
  url = {http://www.integers-ejcnt.org/vol4.html},
  note = {1st version
in Proc.10-th Advances in Computer Games (ACG-10 Conf.),
H. J. van den Herik, H. Iida and E. A. Heinz eds., Graz, Austria,
Nov.\ 2003, Kluwer, pp. 367-382},
  mrnumber = {MR2042724},
}

@article{Fra2005,
  author = {A. S. Fraenkel},
  year = 2005,
  title = {Euclid and Wythoff games},
  journal = {Discrete Math.},
  volume = {304},
  pages = {65-68},
  mrnumber = {MR2184445 (2006f:91006)},
}

@article{Fra2006a,
  author = {A. S. Fraenkel},
  year = 2006,
  title = {Games played by Boole and Galois},
  journal = {Discrete Appl. Math.},
  volume = {},
  pages = {},
  note = {to appear in special issue honoring Peter Hammer},
}

@article{Fra2006b,
  author = {A. S. Fraenkel},
  year = 2006,
  title = {Nim is easy, chess is hard --- but why??},
  journal = {J. Internat. Computer Games Assoc.},
  volume = {},
  issue = {40}, 
  pages = {},
  note = {to appear; earlier version appeared in Plus Mag. {\rm 
(}electronic{\rm )}, pluschat section,\hfill\break
http://plus.maths.org/issue40/editorial/index.html},  
}

@article{Fra2007a,
  author = {A. S. Fraenkel},
  year = 2007,
  title = {The Raleigh game},
  journal = {INTEGERS, Electr. J. of Combinat. Number Theory},
  volume = 7,
  pages = {},
  note = {special volume in honor of Ron Graham, to appear},
}

@article{Fra2007b,
  author = {A. S. Fraenkel},
  year = 2007,
  title = {Why are games exciting and stimulating?},
  journal = {Math Horizons},
  volume = {},
  pages = {},
  note = {to appear in a special issue
focusing on mathematics and games},
}

@article{FrBo1973,
  author = {A. S. Fraenkel and I. Borosh},
  year = 1973,
  title = {A generalization of Wythoff's game},
  journal = {J. Combin. Theory \emph{(Ser.~A)}},
  volume = 15,
  pages = {175-191},
}

@inproceedings{FGJSY1978,
  author = {A. S. Fraenkel and M. R. Garey and D. S. Johnson and T.
Schaefer and Y. Yesha},
  year = 1978,
  title = {The complexity of checkers on an $n\times n$
board --- preliminary report},
  booktitle = {Proc. 19th Ann. Symp. Foundations of Computer Science
\emph{(Ann Arbor, MI, Oct. 1978)}},
  organization = {IEEE Computer Soc., Long Beach, CA},
  pages = {55-64},
}

@article{FrGo1987,
  author = {A. S. Fraenkel and E. Goldschmidt},
  year = 1987,
  title = {Pspace-hardness of some combinatorial games},
  journal = {J. Combin. Theory \emph{(Ser.~A)}},
  volume = 46,
  pages = {21-38},
}

@article{FrHa1989,
  author = {A. S. Fraenkel and F. Harary},
  year = 1989,
  title = {Geodetic contraction games on graphs},
  journal = {Internat. J. Game Theory},
  volume = 18,
  pages = {327-338},
}

@article{FrHe1980,
  author = {A. S. Fraenkel and H. Herda},
  year = 1980,
  title = {Never rush to be first in playing Nimbi},
  journal = {Math. Mag.},
  volume = 53,
  pages = {21-26},
}

@article{FJKS1995,
  author = {A. S. Fraenkel and A. Jaffray and A. Kotzig and G. Sabidussi},
  year = 1995,
  title = {Modular Nim},
  journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
  volume = 143,
  pages = {319-333},
}
@article {FrKi1994,
    AUTHOR = {Fraenkel, A. S. and Kimberling, Clark},
     TITLE = {Generalized {W}ythoff arrays, shuffles and interspersions},
   JOURNAL = {Discrete Math.},
  FJOURNAL = {Discrete Mathematics},
    VOLUME = {126},
      YEAR = {1994},
     PAGES = {137--149},
      ISSN = {0012-365X},
     CODEN = {DSMHA4},
   MRCLASS = {11B83 (05A99)},
  MRNUMBER = {MR1264482 (95c:11028)},
MRREVIEWER = {Volker Strehl},
}
		
@article{FrKo2007,
  author = {A. S. Fraenkel and A. Kontorovich},
  year = 2007,
  title = {The Sierpi\'{n}ski sieve of Nim-varieties and binomial 
coefficients},
  journal = {INTEGERS, Electr. J. of Combinat. Number Theory},
  volume = 7,
  pages = {special volume in honor of Ron Graham},
  note = {to appear},
}

@article{FrKo1987,
  author = {A. S. Fraenkel and A. Kotzig},
  year = 1987,
  title = {Partizan octal games: partizan subtraction games},
  journal = {Internat. J. Game Theory},
  volume = 16,
  pages = {145-154},
}

@article{FrKr2004,
  author = {A. S. Fraenkel and D. Krieger},
  year = 2004,
  title = {The structure of complementary sets of integers: a 3-shift
theorem},
  journal = {Internat. J. Pure and Appl. Math.},
  volume = {10},
  pages = {1-49},
  mrnumber = {MR2020683 (2004h:05012)},
}

@article{FrLi1981,
  author = {A. S. Fraenkel and D. Lichtenstein},
  year = 1981,
  title = {Computing a perfect strategy for $n\times n$ chess requires
time exponential in $n$},
  journal = {J. Combin. Theory \emph{(Ser.~A)}},
  volume = 31,
  pages = {199-214},
  MRNUMBER = {MR629595 (83b:68044)},
  note = {preliminary version in Proc. 8th Internat. Colloq. Automata,
Languages and Programming (S. Even and O. Kariv, eds.), Vol. 115, Acre,
Israel, 1981, Lecture Notes in Computer Science, Springer
Verlag, Berlin, pp. 278--293},
}

@article{FLN1988,
  author = {A. S. Fraenkel and M. Loebl and J. Ne\v{s}et\v{r}il},
  year = 1988,
  title = {Epidemiography II.~Games with a dozing yet winning player},
  journal = {J. Combin. Theory \emph{(Ser.~A)}},
  volume = 49,
  pages = {129-144},
}

@article{FrLo1989,
  author = {A. S. Fraenkel and M. Lorberbom},
  year = 1989,
  title = {Epidemiography with various growth functions},
  journal = {Discrete Appl. Math.},
  volume = 25,
  pages = {53-71},
  note = {special issue on Combinatorics and Complexity}
}

@article{FrLo1991,
  author = {A. S. Fraenkel and M. Lorberbom},
  year = 1991,
  title = {Nimhoff games},
  journal = {J. Combin. Theory \emph{(Ser.~A)}},
  volume = 58,
  pages = {1-25},
}

@article{FrNe1985,
  author = {A. S. Fraenkel and J. Ne\v{s}et\v{r}il},
  year = 1985,
  title = {Epidemiography},
  journal = {Pacific J. Math.},
  volume = 118,
  pages = {369-381},
}

@article{FrOz1998,
  author = {A. S. Fraenkel and M. Ozery},
  year = 1998,
  title = {Adjoining to Wythoff's game its $P$-positions as moves},
  journal = {Theoret. Comput. Sci.},
  volume = 205,
  pages = {283-296},
}

@article{FrPe1975,
  author = {A. S. Fraenkel and Y. Perl},
  year = 1975,
  title = {Constructions in combinatorial games with cycles},
  journal = {Coll. Math. Soc. J\'anos Bolyai},
  volume = 10,
  note = {Proc. Internat. Colloq. on Infinite and Finite Sets, Vol.~2
(A. Hajnal, R. Rado and V. T. S\'os, eds.) Keszthely, Hungary, 1973, North-Holland},
  pages = {667-699},
}

@article{FrRa2001,
  author = {A. S. Fraenkel and O. Rahat},
  year = 2001,
  title = {Infinite cyclic impartial games},
  journal = {Theoret. Comput. Sci.},
  volume = 252,
  publisher = {Springer},
  pages = {13-22},
  note = {special "Computers and Games" issue; first version appeared in
Proc. 1st Intern. Conf. on Computer Games CG'98, {\rm Tsukuba, Japan, Nov.
1998,} \emph{Lecture Notes in Computer Science}, Vol. 1558, Springer,
pp. 212-221, 1999.},
  mrnumber = {MR1715689 (2000m:91028)},
}

@inproceedings{FrRa2003,
  author = {A. S. Fraenkel and O. Rahat},
  year = 2003,
  title = {Complexity of error-correcting codes derived from
combinatorial games},
  booktitle = {Proc. Intern. Conference on Computers and Games CG'2002,
Edmonton, Alberta, Canada, July 2002,},
  editor = {Y. Bj\"{o}rnsson and M. M\"{u}ller and J. Schaeffer},
  volume = {LNCS 2883},
  pages = {201-21},
  publisher = {Lecture Notes in Computer Science, Springer},
}

@article{FrSc1991,
  author = {A. S. Fraenkel and E. R. Scheinerman},
  year = 1991,
  title = {A deletion game on hypergraphs},
  journal = {Discrete Appl. Math.},
  volume = 30,
  pages = {155-162},
}

@article{FSU1993,
  author = {A. S. Fraenkel and E. R. Scheinerman and D. Ullman},
  year = 1993,
  title = {Undirected edge geography},
  journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
  volume = 112,
  pages = {371-381},
}

@article{FrSi1993,
  author = {A. S. Fraenkel and S. Simonson},
  year = 1993,
  title = {Geography},
  journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
  volume = 110,
  pages = {197-214},
}

@article{FrTa1975,
  author = {A. S. Fraenkel and U. Tassa},
  year = 1975,
  title = {Strategy for a class of games with dynamic ties},
  journal = {Comput. Math. Appl.},
  volume = 1,
  pages = {237-254},
}

@article{FrTa1982,
  author = {A. S. Fraenkel and U. Tassa},
  year = 1982,
  title = {Strategies for compounds of