Connected Proper Interval Graphs and the Guard Problem in Spiral Polygons

Chiuyuan Chen, Chin-Chen Chang. Connected Proper Interval Graphs and the Guard Problem in Spiral Polygons. In Michel Deza, Reinhardt Euler, Yannis Manoussakis, editors, Combinatorics and Computer Science, 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3-5, 1995, Selected Papers. Volume 1120 of Lecture Notes in Computer Science, pages 39-47, Springer, 1995.

@inproceedings{ChenC95:1,
  title = {Connected Proper Interval Graphs and the Guard Problem in Spiral Polygons},
  author = {Chiuyuan Chen and Chin-Chen Chang},
  year = {1995},
  tags = {Spiral, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/ChenC95%3A1},
  cites = {0},
  citedby = {0},
  pages = {39-47},
  booktitle = {Combinatorics and Computer Science, 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3-5, 1995, Selected Papers},
  editor = {Michel Deza and Reinhardt Euler and Yannis Manoussakis},
  volume = {1120},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-61576-8},
}