Paper by Erik D. Demaine

Reference:

Therese Biedl, Broňa Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz, and Tomáš Vinař, “Finding Hidden Independent Sets in Interval Graphs”, Theoretical Computer Science, volume 310, number 1–3, January 2004, pages 287–307.

BibTeX

@Article{PCR_TCS,
  AUTHOR        = {Therese Biedl and Bro\v{n}a Brejov\'a and Erik D. Demaine and
                   Ang\`ele M. Hamel and Alejandro L\'opez-Ortiz and
                   Tom\'a\v{s} Vina\v{r}},
  TITLE         = {Finding Hidden Independent Sets in Interval Graphs},
  JOURNAL       = {Theoretical Computer Science},
  journalurl    = {https://www.journals.elsevier.com/theoretical-computer-science},
  VOLUME        = 310,
  NUMBER        = {1--3},
  MONTH         = {January},
  YEAR          = {2004},
  PAGES         = {287--307},

  papers        = {PCR_COCOON2003; PCR_TR2001},
  replaces      = {PCR_COCOON2003},
  length        = {21 pages},
  doi           = {https://dx.doi.org/10.1016/S0304-3975(03)00422-5},
  dblp          = {https://dblp.org/rec/journals/tcs/BiedlBDHLV04},
  comments      = {This paper is also available from <A HREF="http://dx.doi.org/10.1016/S0304-3975(03)00422-5">ScienceDirect</A>.},
}

Comments:

This paper is also available from ScienceDirect.

Length:

The paper is 21 pages.

Availability:

The paper is available in PostScript (312k) and gzipped PostScript (117k).

See information on file formats.

[Google Scholar search]

Related papers:

PCR_COCOON2003 (Finding Hidden Independent Sets in Interval Graphs)

PCR_TR2001 (Finding Hidden Independent Sets in Interval Graphs)