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=445
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An alternating hierarchy for finite automata
Viliam Geffert
Theoretical Computer Science
445
, 2012, pp. 1-24
Backup 2-center on interval graphs
Yanmei Hong
,
Liying Kang
Theoretical Computer Science
445
, 2012, pp. 25-35
Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
Seok-Hee Hong
,
Hiroshi Nagamochi
Theoretical Computer Science
445
, 2012, pp. 36-51
Verifiable multi-secret sharing based on LFSR sequences
Chunqiang Hu
,
Xiaofeng Liao
,
Xiuzhen Cheng
Theoretical Computer Science
445
, 2012, pp. 52-62
Bispecial factors in circular non-pushy D0L languages
Karel Klouda
Theoretical Computer Science
445
, 2012, pp. 63-74
Optimal algorithms for online single machine scheduling with deteriorating jobs
Ming Liu
,
Feifeng Zheng
,
Shijin Wang
,
Jiazhen Huo
Theoretical Computer Science
445
, 2012, pp. 75-81
Fully dynamic algorithm for chordal graphs with
^{O(1)}
query-time and
^{O(n^2)}
update-time
Mauro Mezzini
Theoretical Computer Science
445
, 2012, pp. 82-92