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=393
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Unconditional competitive auctions with copy and budget constraints
Tian-Ming Bu
,
Qi Qi
,
Aries Wei Sun
Theoretical Computer Science
393
(1-3), 2008, pp. 1-13
A fast asymptotic approximation scheme for bin packing with rejection
Wolfgang Bein
,
José R. Correa
,
Xin Han
Theoretical Computer Science
393
(1-3), 2008, pp. 14-22
On different generalizations of Episturmian words
Michelangelo Bucci
,
Aldo de Luca
,
Alessandro De Luca
,
Luca Q. Zamboni
Theoretical Computer Science
393
(1-3), 2008, pp. 23-36
Mixed Nash equilibria in selfish routing problems with dynamic constraints
Alessandro Ferrante
,
Mimmo Parente
Theoretical Computer Science
393
(1-3), 2008, pp. 37-53
Approximating the online set multicover problems via randomized winnowing
Piotr Berman
,
Bhaskar DasGupta
Theoretical Computer Science
393
(1-3), 2008, pp. 54-71
Competitive graph searches
Binh-Minh Bui-Xuan
,
Michel Habib
,
Christophe Paul
Theoretical Computer Science
393
(1-3), 2008, pp. 72-80
Energy conservation in wireless sensor networks and connectivity of graphs
Hao Li
,
Huifang Miao
,
Li Liu
,
Lian Li
,
Heping Zhang
Theoretical Computer Science
393
(1-3), 2008, pp. 81-89
Move-optimal gossiping among mobile agents
Tomoko Suzuki
,
Taisuke Izumi
,
Fukuhito Ooshita
,
Hirotsugu Kakugawa
,
Toshimitsu Masuzawa
Theoretical Computer Science
393
(1-3), 2008, pp. 90-101
Single machine scheduling with release dates and job delivery to minimize the makespan
Lingfa Lu
,
Jinjiang Yuan
,
Liqi Zhang
Theoretical Computer Science
393
(1-3), 2008, pp. 102-108
Bisimulation relations for weighted automata
Peter Buchholz
Theoretical Computer Science
393
(1-3), 2008, pp. 109-123
The Magnus-Derek game
Z. Nedev
,
S. Muthukrishnan
Theoretical Computer Science
393
(1-3), 2008, pp. 124-132
Approximating a vehicle scheduling problem with time windows and handling times
Hiroshi Nagamochi
,
Takaharu Ohnishi
Theoretical Computer Science
393
(1-3), 2008, pp. 133-146
Graph automata
Symeon Bozapalidis
,
Antonios Kalampakas
Theoretical Computer Science
393
(1-3), 2008, pp. 147-165
Smooth words on 2-letter alphabets having same parity
S. Brlek
,
D. Jamet
,
G. Paquin
Theoretical Computer Science
393
(1-3), 2008, pp. 166-181
The computational complexity of the parallel knock-out problem
Hajo Broersma
,
Matthew Johnson
,
Daniël Paulusma
,
Iain A. Stewart
Theoretical Computer Science
393
(1-3), 2008, pp. 182-195
Another proof of Soittola's theorem
Jean Berstel
,
Christophe Reutenauer
Theoretical Computer Science
393
(1-3), 2008, pp. 196-203
Parallel-machine scheduling with time dependent processing times
Wen-Hung Kuo
,
Dar-Li Yang
Theoretical Computer Science
393
(1-3), 2008, pp. 204-210
Semi-online scheduling on two uniform processors
Enrico Angelelli
,
Maria Grazia Speranza
,
Zsolt Tuza
Theoretical Computer Science
393
(1-3), 2008, pp. 211-219
On the hardness of optimization in power-law graphs
Alessandro Ferrante
,
Gopal Pandurangan
,
Kihong Park
Theoretical Computer Science
393
(1-3), 2008, pp. 220-230
The cost of offline binary search tree algorithms and the complexity of the request sequence
Jussi Kujala
,
Tapio Elomaa
Theoretical Computer Science
393
(1-3), 2008, pp. 231-239
The class constrained bin packing problem with applications to video-on-demand
E.C. Xavier
,
F.K. Miyazawa
Theoretical Computer Science
393
(1-3), 2008, pp. 240-259
Pairs of SAT-assignments in random Boolean formulae
Hervé Daudé
,
Marc Mézard
,
Thierry Mora
,
Riccardo Zecchina
Theoretical Computer Science
393
(1-3), 2008, pp. 260-279
About the number of
C^\infty
-words of form
\tilde{w}xw
Y.B. Huang
Theoretical Computer Science
393
(1-3), 2008, pp. 280-286
A best on-line algorithm for single machine scheduling with small delivery times
Ji Tian
,
Ruyan Fu
,
Jinjiang Yuan
Theoretical Computer Science
393
(1-3), 2008, pp. 287-293
Computing closest and farthest points for a query segment
Michael Segal
,
Eli Zeitlin
Theoretical Computer Science
393
(1-3), 2008, pp. 294-300