Tight Time Bounds for the Minimum Local Convex Partition Problem

Magdalene Grantson, Christos Levcopoulos. Tight Time Bounds for the Minimum Local Convex Partition Problem. In Jin Akiyama, Mikio Kano, Xuehou Tan, editors, Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers. Volume 3742 of Lecture Notes in Computer Science, pages 95-105, Springer, 2004. [doi]

@inproceedings{GrantsonL04a,
  title = {Tight Time Bounds for the Minimum Local Convex Partition Problem},
  author = {Magdalene Grantson and Christos Levcopoulos},
  year = {2004},
  doi = {10.1007/11589440_10},
  url = {http://dx.doi.org/10.1007/11589440_10},
  tags = {partitioning},
  researchr = {https://researchr.org/publication/GrantsonL04a},
  cites = {0},
  citedby = {0},
  pages = {95-105},
  booktitle = {Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers},
  editor = {Jin Akiyama and Mikio Kano and Xuehou Tan},
  volume = {3742},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-30467-3},
}