Mingyu Xiao, Hiroshi Nagamochi. Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs. In Hee-Kap Ahn, Chan-Su Shin, editors, Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings. Volume 8889 of Lecture Notes in Computer Science, pages 429-440, Springer, 2014. [doi]
@inproceedings{XiaoN14,
title = {Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs},
author = {Mingyu Xiao and Hiroshi Nagamochi},
year = {2014},
doi = {10.1007/978-3-319-13075-0_34},
url = {http://dx.doi.org/10.1007/978-3-319-13075-0_34},
researchr = {https://researchr.org/publication/XiaoN14},
cites = {0},
citedby = {0},
pages = {429-440},
booktitle = {Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings},
editor = {Hee-Kap Ahn and Chan-Su Shin},
volume = {8889},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-13074-3},
}