Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Rudolf Fleischer, Aviezri S. Fraenkel, and Richard J. Nowakowski, “Open Problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory”, Theoretical Computer Science, volume 313, number 3, February 2004, pages 539–543. Special issue on algorithmic combinatorial game theory.

BibTeX

@Article{DagstuhlGames2002Open,
  AUTHOR        = {Erik D. Demaine and Rudolf Fleischer and Aviezri S. Fraenkel
                   and Richard J. Nowakowski},
  TITLE         = {Open Problems at the 2002 Dagstuhl Seminar on
                   Algorithmic Combinatorial Game Theory},
  JOURNAL       = {Theoretical Computer Science},
  journalurl    = {https://www.journals.elsevier.com/theoretical-computer-science},
  VOLUME        = 313,
  NUMBER        = 3,
  MONTH         = {February},
  YEAR          = 2004,
  PAGES         = {539--543},
  NOTE          = {Special issue on algorithmic combinatorial game theory.},

  doi           = {https://dx.doi.org/10.1016/J.TCS.2003.09.012},
  dblp          = {https://dblp.org/rec/journals/tcs/DemaineFFN04},
  comments      = {This paper is also available from <A HREF="http://dx.doi.org/10.1016/j.tcs.2003.09.012">ScienceDirect</A>.},
  unrefereed    = 1,
}

Comments:

This paper is also available from ScienceDirect.

Availability:

The paper is available in PostScript (233k), gzipped PostScript (113k), and PDF (90k).

See information on file formats.

[Google Scholar search]