On the minimum edge size for 2-colorability and realizability of hypergraphs by axis-parallel rectangles

Nirman Kumar. On the minimum edge size for 2-colorability and realizability of hypergraphs by axis-parallel rectangles. In Joachim Gudmundsson, Michiel H. M. Smid, editors, Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario, Canada. pages 226-231, 2017.

@inproceedings{Kumar17-21,
  title = {On the minimum edge size for 2-colorability and realizability of hypergraphs by axis-parallel rectangles},
  author = {Nirman Kumar},
  year = {2017},
  researchr = {https://researchr.org/publication/Kumar17-21},
  cites = {0},
  citedby = {0},
  pages = {226-231},
  booktitle = {Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario, Canada},
  editor = {Joachim Gudmundsson and Michiel H. M. Smid},
}