Therese C. Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz, Tomás Vinar. Finding Hidden Independent Sets in Interval Graphs. In Tandy Warnow, Binhai Zhu, editors, Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings. Volume 2697 of Lecture Notes in Computer Science, pages 182-191, Springer, 2003. [doi]
@inproceedings{BiedlBDHLV03, title = {Finding Hidden Independent Sets in Interval Graphs}, author = {Therese C. Biedl and Brona Brejová and Erik D. Demaine and Angèle M. Hamel and Alejandro López-Ortiz and Tomás Vinar}, year = {2003}, url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2697&spage=182}, tags = {graph-rewriting, C++, rewriting}, researchr = {https://researchr.org/publication/BiedlBDHLV03}, cites = {0}, citedby = {0}, pages = {182-191}, booktitle = {Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings}, editor = {Tandy Warnow and Binhai Zhu}, volume = {2697}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-40534-8}, }