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=Inf.~Comput. AND Volume=219
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Connected graph searching
Lali Barrière
,
Paola Flocchini
,
Fedor V. Fomin
,
Pierre Fraigniaud
,
Nicolas Nisse
,
Nicola Santoro
,
Dimitrios M. Thilikos
Information and Computation
219
, 2012, pp. 1-16
Approximate counting for complex-weighted Boolean constraint satisfaction problems
Tomoyuki Yamakami
Information and Computation
219
, 2012, pp. 17-38
Efficient algorithms for the conditional covering problem
Robert Benkoczi
,
Binay Bhattacharya
,
Yuzhuang Hu
,
Chien-Hsin Lin
,
Qiaosheng Shi
,
Biing-Feng Wang
Information and Computation
219
, 2012, pp. 39-57
Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings
Giovanni Battaglia
,
Roberto Grossi
,
Noemi Scutellà
Information and Computation
219
, 2012, pp. 58-70