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]
No reviews for this publication, yet.