Search dblp for Publications

• > Home > Search

@article{DBLP:journals/dmtcs/Wood11a,
  author       = {David R. Wood},
  title        = {On the number of maximal independent sets in a graph},
  journal      = {Discret. Math. Theor. Comput. Sci.},
  volume       = {13},
  number       = {3},
  pages        = {17--20},
  year         = {2011},
  url          = {https://doi.org/10.46298/dmtcs.543},
  doi          = {10.46298/DMTCS.543},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dmtcs/Wood11a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1104-1243,
  author       = {David R. Wood},
  title        = {On the number of maximal independent sets in a graph},
  journal      = {CoRR},
  volume       = {abs/1104.1243},
  year         = {2011},
  url          = {http://arxiv.org/abs/1104.1243},
  eprinttype    = {arXiv},
  eprint       = {1104.1243},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1104-1243.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/BorosEGK03,
  author       = {Endre Boros and
                  Khaled M. Elbassioni and
                  Vladimir Gurvich and
                  Leonid Khachiyan},
  title        = {Extending the Balas-Yu bounds on the number of maximal independent
                  sets in graphs to hypergraphs and lattices},
  journal      = {Math. Program.},
  volume       = {98},
  number       = {1-3},
  pages        = {355--368},
  year         = {2003},
  url          = {https://doi.org/10.1007/s10107-003-0408-4},
  doi          = {10.1007/S10107-003-0408-4},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/BorosEGK03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}