Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed. Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. In Robert E. Bixby, E. Andrew Boyd, Roger Z. Ríos-Mercado, editors, Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings. Volume 1412 of Lecture Notes in Computer Science, pages 137-152, Springer, 1998. [doi]
@inproceedings{CalinescuFR98,
title = {Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width},
author = {Gruia Calinescu and Cristina G. Fernandes and Bruce A. Reed},
year = {1998},
url = {http://link.springer.de/link/service/series/0558/bibs/1412/14120137.htm},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/CalinescuFR98},
cites = {0},
citedby = {0},
pages = {137-152},
booktitle = {Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings},
editor = {Robert E. Bixby and E. Andrew Boyd and Roger Z. Ríos-Mercado},
volume = {1412},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-64590-X},
}