Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs

Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal. Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. In Mike Paterson, editor, Algorithms - ESA 2000, 8th Annual European Symposium, Saarbrücken, Germany, September 5-8, 2000, Proceedings. Volume 1879 of Lecture Notes in Computer Science, pages 100-111, Springer, 2000.

@inproceedings{BespamyatnikhBKKS00,
  title = {Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs},
  author = {Sergei Bespamyatnikh and Binay K. Bhattacharya and J. Mark Keil and David G. Kirkpatrick and Michael Segal},
  year = {2000},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BespamyatnikhBKKS00},
  cites = {0},
  citedby = {0},
  pages = {100-111},
  booktitle = {Algorithms - ESA 2000, 8th Annual European Symposium, Saarbrücken, Germany, September 5-8, 2000, Proceedings},
  editor = {Mike Paterson},
  volume = {1879},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-41004-X},
}