An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs

George B. Mertzios, Walter Unger. An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs. In Mirka Miller, Koichi Wada, editors, Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA 2008, September 13-15, 2008, Nagoya, Japan. pages 197-211, College Publications, 2008.

@inproceedings{MertziosU08,
  title = {An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs},
  author = {George B. Mertzios and Walter Unger},
  year = {2008},
  researchr = {https://researchr.org/publication/MertziosU08},
  cites = {0},
  citedby = {0},
  pages = {197-211},
  booktitle = {Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA 2008, September 13-15, 2008, Nagoya, Japan},
  editor = {Mirka Miller and Koichi Wada},
  publisher = {College Publications},
  isbn = {978-1-904987-74-1},
}