default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 461
Volume 461, November 2012
- Ding-Zhu Du, Bin Fu:
Preface - COCOON'2011. 1
- Jin-Yi Cai, Michael Kowalczyk:
Spin systems on k-regular graphs with complex edge functions. 2-16 - Gianluca De Marco
, Evangelos Kranakis, Gábor Wiener:
Computing majority with triple queries. 17-26 - Minghui Jiang, Yong Zhang:
Parameterized complexity in multiple-interval graphs: Domination, partition, separation, irredundancy. 27-44 - Yunlong Liu, Jianxin Wang, Jiong Guo, Jianer Chen:
Complexity and parameterized algorithms for Cograph Editing. 45-54 - Jochen Messner, Thomas Thierauf:
A Kolmogorov complexity proof of the Lovász Local Lemma for satisfiability. 55-64 - Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh:
On Parameterized Independent Feedback Vertex Set. 65-75 - Cong Tian, Zhenhua Duan, Nan Zhang:
An efficient approach for abstraction-refinement in model checking. 76-85 - Tomoyuki Yamakami:
Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems. 86-105 - Shengke Zeng, Shaoquan Jiang, Zhiguang Qin:
An efficient conditionally anonymous ring signature in the random oracle model. 106-114
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 2024-10-08 20:21 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
