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=434
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle
Xiaoguang Bao
,
Zhaohui Liu
Theoretical Computer Science
434
, 2012, pp. 1-10
Fighting constrained fires in graphs
Anthony Bonato
,
Margaret-Ellen Messinger
,
Paweƚ Praƚat
Theoretical Computer Science
434
, 2012, pp. 11-22
Improved algorithms for the range next value problem and applications
Maxime Crochemore
,
Costas S. Iliopoulos
,
Marcin Kubica
,
M. Sohel Rahman
,
German Tischler
,
Tomasz Waleń
Theoretical Computer Science
434
, 2012, pp. 23-34
On derandomization and average-case complexity of monotone functions
George Karakostas
,
Jeff Kinne
,
Dieter van Melkebeek
Theoretical Computer Science
434
, 2012, pp. 35-44
Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups
Ching-Jong Liao
,
Hsin-Hui Tsou
,
Kuo-Ling Huang
Theoretical Computer Science
434
, 2012, pp. 45-52
A theory of computation based on unsharp quantum logic: Finite state automata and pushdown automata
Yun Shang
,
Xian Lu
,
Ruqian Lu
Theoretical Computer Science
434
, 2012, pp. 53-86
A stronger LP bound for formula size lower bounds via clique constraints
Kenya Ueno
Theoretical Computer Science
434
, 2012, pp. 87-97
Testing the
^{(s, t)}
-disconnectivity of graphs and digraphs
Yuichi Yoshida
,
Yusuke Kobayashi
Theoretical Computer Science
434
, 2012, pp. 98-113