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=443
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Semi-online scheduling revisited
Susanne Albers
,
Matthias Hellwig
Theoretical Computer Science
443
, 2012, pp. 1-9
Finding an induced subdivision of a digraph
Jrgen Bang-Jensen
,
Frédéric Havet
,
Nicolas Trotignon
Theoretical Computer Science
443
, 2012, pp. 10-24
String matching with variable length gaps
Philip Bille
,
Inge Li Grtz
,
Hjalte Wedel Vildhj
,
David Kofoed Wind
Theoretical Computer Science
443
, 2012, pp. 25-34
Periodicity algorithms and a conjecture on overlaps in partial words
F. Blanchet-Sadri
,
Robert Mercaş
,
Abraham Rashin
,
Elara Willett
Theoretical Computer Science
443
, 2012, pp. 35-45
Automata and differentiable words
Jean-Marc Fédou
,
Gabriele Fici
Theoretical Computer Science
443
, 2012, pp. 46-62
Extraconnectivity of
k
-ary
n
-cube networks
Sun-Yuan Hsieh
,
Ying-Hsuan Chang
Theoretical Computer Science
443
, 2012, pp. 63-69
Groups and decompositions of codes
Yun Liu
Theoretical Computer Science
443
, 2012, pp. 70-81