Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem

Bin Fu, Haitao Jiang, Boting Yang, Binhai Zhu. Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem. In Weifan Wang, Xuding Zhu, Ding-Zhu Du, editors, Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011. Proceedings. Volume 6831 of Lecture Notes in Computer Science, pages 299-310, Springer, 2011. [doi]

@inproceedings{FuJYZ11,
  title = {Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem},
  author = {Bin Fu and Haitao Jiang and Boting Yang and Binhai Zhu},
  year = {2011},
  doi = {10.1007/978-3-642-22616-8_24},
  url = {http://dx.doi.org/10.1007/978-3-642-22616-8_24},
  tags = {partitioning},
  researchr = {https://researchr.org/publication/FuJYZ11},
  cites = {0},
  citedby = {0},
  pages = {299-310},
  booktitle = {Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011. Proceedings},
  editor = {Weifan Wang and Xuding Zhu and Ding-Zhu Du},
  volume = {6831},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-22615-1},
}