On the Complexity of Finding Circumscribed Rectangles for a Two-Dimensional Domain

Fuxiang Yu, Arthur W. Chou, Ker-I Ko. On the Complexity of Finding Circumscribed Rectangles for a Two-Dimensional Domain. In Tanja Grubba, Peter Hertling, Hideki Tsuiki, Klaus Weihrauch, editors, CCA 2005 - Second International Conference on Computability and Complexity in Analysis, August 25-29, 2005, Kyoto, Japan. Volume 326-7/2005 of Informatik Berichte, pages 341-355, FernUniversität Hagen, Germany, 2005.

@inproceedings{YuCK05,
  title = {On the Complexity of Finding Circumscribed Rectangles for a Two-Dimensional Domain},
  author = {Fuxiang Yu and Arthur W. Chou and Ker-I Ko},
  year = {2005},
  researchr = {https://researchr.org/publication/YuCK05},
  cites = {0},
  citedby = {0},
  pages = {341-355},
  booktitle = {CCA 2005 - Second International Conference on Computability and Complexity in Analysis, August 25-29, 2005, Kyoto, Japan},
  editor = {Tanja Grubba and Peter Hertling and Hideki Tsuiki and Klaus Weihrauch},
  volume = {326-7/2005},
  series = {Informatik Berichte},
  publisher = {FernUniversität Hagen, Germany},
}