default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 219
Volume 219, October 2012
- Lali Barrière, Paola Flocchini, Fedor V. Fomin
, Pierre Fraigniaud, Nicolas Nisse, Nicola Santoro, Dimitrios M. Thilikos:
Connected graph searching. 1-16 - Tomoyuki Yamakami:
Approximate counting for complex-weighted Boolean constraint satisfaction problems. 17-38 - Robert Benkoczi, Binay K. Bhattacharya, Yuzhuang Hu, Chien-Hsin Lin, Qiaosheng Shi, Biing-Feng Wang:
Efficient algorithms for the conditional covering problem. 39-57 - Giovanni Battaglia, Roberto Grossi, Noemi Scutellà:
Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings. 58-70
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-14 21:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
