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=418
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On sum coloring and sum multi-coloring for restricted families of graphs
Allan Borodin
,
Ioana Ivan
,
Yuli Ye
,
Bryce Zimny
Theoretical Computer Science
418
, 2012, pp. 1-13
Weighted automata and multi-valued logics over arbitrary bounded lattices
Manfred Droste
,
Heiko Vogler
Theoretical Computer Science
418
, 2012, pp. 14-36
Deterministic recurrent communication in restricted Sensor Networks
Antonio Fernández Anta
,
Miguel A. Mosteiro
,
Christopher Thraves
Theoretical Computer Science
418
, 2012, pp. 37-47
Regular sets over extended tree structures
Séverine Fratani
Theoretical Computer Science
418
, 2012, pp. 48-70
On primary and secondary repetitions in words
Roman Kolpakov
Theoretical Computer Science
418
, 2012, pp. 71-81
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
Cheng-Nan Lai
Theoretical Computer Science
418
, 2012, pp. 82-91
Degree-bounded minimum spanning tree for unit disk graph
Hongli Xu
,
Liusheng Huang
,
Wang Liu
,
Yindong Zhang
,
Yanjing Sun
Theoretical Computer Science
418
, 2012, pp. 92-105
Threshold changeable secret sharing schemes revisited
Zhifang Zhang
,
Yeow Meng Chee
,
San Ling
,
Mulan Liu
,
Huaxiong Wang
Theoretical Computer Science
418
, 2012, pp. 106-115
Absoluteness of subword inequality is undecidable
Shinnosuke Seki
Theoretical Computer Science
418
, 2012, pp. 116-120