Connected proper interval graphs and the guard problem in spiral polygons

Chiuyuan Chen, Chin Chen Chang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations
Original languageEnglish
Title of host publicationCombinatorics and Computer Science - 8th Franco-Japanese and 4th Franco-Chinese Conference 1995, Selected Papers
EditorsReinhardt Euler, Ioannis Manoussakis, Michel Deza
PublisherSpringer Verlag
Pages39-47
Number of pages9
ISBN (Print)3540615768, 9783540615767
DOIs
StatePublished - 1 Jan 1996
Event4th Franco-Chinese and 8th Franco-Japanese Conference on Combinatorics and Computer Science, CCS 1995 - Brest, France
Duration: 3 Jul 19955 Jul 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1120
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th Franco-Chinese and 8th Franco-Japanese Conference on Combinatorics and Computer Science, CCS 1995
CountryFrance
CityBrest
Period3/07/955/07/95

Cite this

Chen, C., & Chang, C. C. (1996). Connected proper interval graphs and the guard problem in spiral polygons. In R. Euler, I. Manoussakis, & M. Deza (Eds.), Combinatorics and Computer Science - 8th Franco-Japanese and 4th Franco-Chinese Conference 1995, Selected Papers (pp. 39-47). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1120). Springer Verlag. https://doi.org/10.1007/3-540-61576-8_71