Search dblp for Publications

export results for "toc:db/journals/iandc/iandc219.bht:"

 download as .bib file

@article{DBLP:journals/iandc/BarriereFFFNST12,
  author       = {Lali Barri{\`{e}}re and
                  Paola Flocchini and
                  Fedor V. Fomin and
                  Pierre Fraigniaud and
                  Nicolas Nisse and
                  Nicola Santoro and
                  Dimitrios M. Thilikos},
  title        = {Connected graph searching},
  journal      = {Inf. Comput.},
  volume       = {219},
  pages        = {1--16},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.ic.2012.08.004},
  doi          = {10.1016/J.IC.2012.08.004},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/BarriereFFFNST12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BattagliaGS12,
  author       = {Giovanni Battaglia and
                  Roberto Grossi and
                  Noemi Scutell{\`{a}}},
  title        = {Consecutive ones property and PQ-trees for multisets: Hardness of
                  counting their orderings},
  journal      = {Inf. Comput.},
  volume       = {219},
  pages        = {58--70},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.ic.2012.08.005},
  doi          = {10.1016/J.IC.2012.08.005},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/BattagliaGS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BenkocziBHLSW12,
  author       = {Robert Benkoczi and
                  Binay K. Bhattacharya and
                  Yuzhuang Hu and
                  Chien{-}Hsin Lin and
                  Qiaosheng Shi and
                  Biing{-}Feng Wang},
  title        = {Efficient algorithms for the conditional covering problem},
  journal      = {Inf. Comput.},
  volume       = {219},
  pages        = {39--57},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.ic.2012.08.003},
  doi          = {10.1016/J.IC.2012.08.003},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/BenkocziBHLSW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Yamakami12,
  author       = {Tomoyuki Yamakami},
  title        = {Approximate counting for complex-weighted Boolean constraint satisfaction
                  problems},
  journal      = {Inf. Comput.},
  volume       = {219},
  pages        = {17--38},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.ic.2012.08.002},
  doi          = {10.1016/J.IC.2012.08.002},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Yamakami12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics