External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs

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]

Authors

Mingyu Xiao

This author has not been identified. Look up 'Mingyu Xiao' in Google

Hiroshi Nagamochi

This author has not been identified. Look up 'Hiroshi Nagamochi' in Google
runs on