Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections

Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan. Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. In Martin Farach-Colton, editor, LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings. Volume 2976 of Lecture Notes in Computer Science, pages 488-498, Springer, 2004. [doi]

@inproceedings{BorosEGK04:1,
  title = {Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections},
  author = {Endre Boros and Khaled M. Elbassioni and Vladimir Gurvich and Leonid Khachiyan},
  year = {2004},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2976&spage=488},
  researchr = {https://researchr.org/publication/BorosEGK04%3A1},
  cites = {0},
  citedby = {0},
  pages = {488-498},
  booktitle = {LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings},
  editor = {Martin Farach-Colton},
  volume = {2976},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-21258-2},
}