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=531
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Graph transformation for incremental natural language analysis
Suna Bensch
,
Frank Drewes
,
Helmut Jürgensen
,
Brink van der Merwe
Theoretical Computer Science
531
, 2014, pp. 1-25
Many-to-many two-disjoint path covers in restricted hypercube-like graphs
Sook-Yeon Kim
,
Jung-Heum Park
Theoretical Computer Science
531
, 2014, pp. 26-36
Optimal algorithms for semi-online machine covering on two hierarchical machines
Yong Wu
,
T.C.E. Cheng
,
Min Ji
Theoretical Computer Science
531
, 2014, pp. 37-46
Conditional diagnosability of optical multi-mesh hypercube networks under the comparison diagnosis model
Xianyong Li
,
Xiaofan Yang
,
Li He
,
Jing Zhang
,
Cui Yu
Theoretical Computer Science
531
, 2014, pp. 47-53
Complexity and approximation for Traveling Salesman Problems with profits
Enrico Angelelli
,
Cristina Bazgan
,
M. Grazia Speranza
,
Zsolt Tuza
Theoretical Computer Science
531
, 2014, pp. 54-65
A revisit of the scheme for computing treewidth and minimum fill-in
Masanobu Furuse
,
Koichi Yamazaki
Theoretical Computer Science
531
, 2014, pp. 66-76
A bijective variant of the Burrows-Wheeler Transform using
V
-order
Jacqueline W. Daykin
,
W.F. Smyth
Theoretical Computer Science
531
, 2014, pp. 77-89