Hans Leo Bodlaender, Klaus Jansen. On the Complexity of the Maximum Cut Problem. In Patrice Enjalbert, Ernst W. Mayr, Klaus W. Wagner, editors, STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings. Volume 775 of Lecture Notes in Computer Science, pages 769-780, Springer, 1994.
@inproceedings{BodlaenderJ94,
title = {On the Complexity of the Maximum Cut Problem},
author = {Hans Leo Bodlaender and Klaus Jansen},
year = {1994},
researchr = {https://researchr.org/publication/BodlaenderJ94},
cites = {0},
citedby = {0},
pages = {769-780},
booktitle = {STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings},
editor = {Patrice Enjalbert and Ernst W. Mayr and Klaus W. Wagner},
volume = {775},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-57785-8},
}