A Tight Bound for Online Coloring of Disk Graphs

Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou. A Tight Bound for Online Coloring of Disk Graphs. In Andrzej Pelc, Michel Raynal, editors, Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings. Volume 3499 of Lecture Notes in Computer Science, pages 78-88, Springer, 2005. [doi]

@inproceedings{CaragiannisFKP05,
  title = {A Tight Bound for Online Coloring of Disk Graphs},
  author = {Ioannis Caragiannis and Aleksei V. Fishkin and Christos Kaklamanis and Evi Papaioannou},
  year = {2005},
  doi = {10.1007/11429647_8},
  url = {http://dx.doi.org/10.1007/11429647_8},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/CaragiannisFKP05},
  cites = {0},
  citedby = {0},
  pages = {78-88},
  booktitle = {Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings},
  editor = {Andrzej Pelc and Michel Raynal},
  volume = {3499},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-26052-8},
}