Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=461
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Spin systems on
k
-regular graphs with complex edge functions
Jin-Yi Cai
,
Michael Kowalczyk
Theoretical Computer Science
461
, 2012, pp. 2-16
Computing majority with triple queries
Gianluca De Marco
,
Evangelos Kranakis
,
Gábor Wiener
Theoretical Computer Science
461
, 2012, pp. 17-26
Parameterized complexity in multiple-interval graphs: Domination, partition, separation, irredundancy
Minghui Jiang
,
Yong Zhang
Theoretical Computer Science
461
, 2012, pp. 27-44
Complexity and parameterized algorithms for Cograph Editing
Yunlong Liu
,
Jianxin Wang
,
Jiong Guo
,
Jianer Chen
Theoretical Computer Science
461
, 2012, pp. 45-54
A Kolmogorov complexity proof of the Lovász Local Lemma for satisfiability
Jochen Messner
,
Thomas Thierauf
Theoretical Computer Science
461
, 2012, pp. 55-64
On Parameterized Independent Feedback Vertex Set
Neeldhara Misra
,
Geevarghese Philip
,
Venkatesh Raman
,
Saket Saurabh
Theoretical Computer Science
461
, 2012, pp. 65-75
An efficient approach for abstraction-refinement in model checking
Cong Tian
,
Zhenhua Duan
,
Nan Zhang
Theoretical Computer Science
461
, 2012, pp. 76-85
Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems
Tomoyuki Yamakami
Theoretical Computer Science
461
, 2012, pp. 86-105
An efficient conditionally anonymous ring signature in the random oracle model
Shengke Zeng
,
Shaoquan Jiang
,
Zhiguang Qin
Theoretical Computer Science
461
, 2012, pp. 106-114