Paper by Erik D. Demaine

Reference:

Sachio Teramoto, Erik Demaine, and Ryuhei Uehara, “Voronoi game on graphs and its complexity”, in Proceedings of the 2nd IEEE Symposium on Computational Intelligence and Games (CIG 2006), Reno, Nevada, May 22–24, 2006, pages 265–271.

BibTeX

@InProceedings{VoronoiGame_CIG2006,
  AUTHOR        = {Sachio Teramoto and Erik Demaine and Ryuhei Uehara},
  TITLE         = {Voronoi game on graphs and its complexity},
  BOOKTITLE     = {Proceedings of the 2nd IEEE Symposium on
                   Computational Intelligence and Games (CIG 2006)},
  bookurl       = {http://www.cse.unr.edu/~sushil/cig06/},
  ADDRESS       = {Reno, Nevada},
  MONTH         = {May 22--24},
  YEAR          = 2006,
  PAGES         = {265--271},

  papers        = {VoronoiGame_JGAA},
  doi           = {https://dx.doi.org/10.1109/CIG.2006.311711},
  dblp          = {https://dblp.org/rec/conf/cig/TeramotoDU06},
  comments      = {This paper is also available from <A HREF="https://doi.org/10.1109/CIG.2006.311711">IEEE</A>.},
}

Comments:

This paper is also available from IEEE.

Availability:

Currently unavailable. If you are in a rush for copies, contact me.

[Google Scholar search]

Related papers:

VoronoiGame_JGAA (Voronoi game on graphs and its complexity)