Andrzej Lingas, Martin Wahlen. Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box 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 50-56, Springer, 2003. [doi]
@inproceedings{LingasW03,
title = {Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs},
author = {Andrzej Lingas and Martin Wahlen},
year = {2003},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2697&spage=50},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/LingasW03},
cites = {0},
citedby = {0},
pages = {50-56},
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},
}