Emgad H. Bachoore, Hans Leo Bodlaender. New Upper Bound Heuristics for Treewidth. In Sotiris E. Nikoletseas, editor, Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings. Volume 3503 of Lecture Notes in Computer Science, pages 216-227, Springer, 2005. [doi]
@inproceedings{BachooreB05,
title = {New Upper Bound Heuristics for Treewidth},
author = {Emgad H. Bachoore and Hans Leo Bodlaender},
year = {2005},
doi = {10.1007/11427186_20},
url = {http://dx.doi.org/10.1007/11427186_20},
researchr = {https://researchr.org/publication/BachooreB05},
cites = {0},
citedby = {0},
pages = {216-227},
booktitle = {Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings},
editor = {Sotiris E. Nikoletseas},
volume = {3503},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-25920-1},
}