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=510
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of rerouting shortest paths
Paul Bonsma
Theoretical Computer Science
510
, 2013, pp. 1-12
Tight absolute bound for First Fit Decreasing bin-packing:
FFD(L)\le 11/9\ OPT(L)+6/9
György Dósa
,
Rongheng Li
,
Xin Han
,
Zsolt Tuza
Theoretical Computer Science
510
, 2013, pp. 13-61
Color visual cryptography schemes for black and white secret images
Roberto De Prisco
,
Alfredo De Santis
Theoretical Computer Science
510
, 2013, pp. 62-86
State complexity of combined operations for suffix-free regular languages
Hae-Sung Eom
,
Yo-Sub Han
Theoretical Computer Science
510
, 2013, pp. 87-93
Conditional edge-fault pancyclicity of augmented cubes
Dongqin Cheng
,
Rong-Xia Hao
,
Yan-Quan Feng
Theoretical Computer Science
510
, 2013, pp. 94-101
The generalization of scheduling with machine cost
György Dósa
,
Csanád Imreh
Theoretical Computer Science
510
, 2013, pp. 102-110
A decomposition method for CNF minimality proofs
Endre Boros
,
Ondȓej C̑epek
,
Petr Kuc̑era
Theoretical Computer Science
510
, 2013, pp. 111-126
On the Carathéodory number of interval and graph convexities
Mitre C. Dourado
,
Dieter Rautenbach
,
Vinícius Fernandes dos Santos
,
Philipp M. Schäfer
,
Jayme L. Szwarcfiter
Theoretical Computer Science
510
, 2013, pp. 127-135