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=438
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The derivational complexity of string rewriting systems
Yuji Kobayashi
Theoretical Computer Science
438
, 2012, pp. 1-12
Convergence and approximation in potential games
George Christodoulou
,
Vahab S. Mirrokni
,
Anastasios Sidiropoulos
Theoretical Computer Science
438
, 2012, pp. 13-27
On the structure of linear apex NLC graph grammars
Changwook Kim
Theoretical Computer Science
438
, 2012, pp. 28-33
The recognition of triangle graphs
George B. Mertzios
Theoretical Computer Science
438
, 2012, pp. 34-47
Arc-disjoint spanning sub(di)graphs in digraphs
Jrgen Bang-Jensen
,
Anders Yeo
Theoretical Computer Science
438
, 2012, pp. 48-54
New results on single-machine scheduling with past-sequence-dependent delivery times
Ming Liu
,
Feifeng Zheng
,
Chengbin Chu
,
Yinfeng Xu
Theoretical Computer Science
438
, 2012, pp. 55-61
A linearly computable measure of string complexity
Verónica Becher
,
Pablo Ariel Heiber
Theoretical Computer Science
438
, 2012, pp. 62-73
Succinct representations of permutations and functions
J. Ian Munro
,
Rajeev Raman
,
Venkatesh Raman
,
Srinivasa Rao S.
Theoretical Computer Science
438
, 2012, pp. 74-88
Max-cut
and containment relations in graphs
Marcin Kamiński
Theoretical Computer Science
438
, 2012, pp. 89-95
The relation of Connected Set Cover and Group Steiner Tree
Khaled Elbassioni
,
Slobodan Jelić
,
Domagoj Matijević
Theoretical Computer Science
438
, 2012, pp. 96-101