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=518
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Total coloring of embedded graphs with maximum degree at least seven
Huijuan Wang
,
Bin Liu
,
Jianliang Wu
,
Guizhen Liu
Theoretical Computer Science
518
, 2014, pp. 1-9
Constant-competitive tree node assignment
Yong Zhang
,
Francis Y.L. Chin
,
Hing-Fung Ting
Theoretical Computer Science
518
, 2014, pp. 10-21
The 2-surviving rate of planar graphs without 6-cycles
Weifan Wang
,
Stephen Finbow
,
Jiangxu Kong
Theoretical Computer Science
518
, 2014, pp. 22-31
Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks
Weizhong Luo
,
Jianxin Wang
,
Jiong Guo
,
Jianer Chen
Theoretical Computer Science
518
, 2014, pp. 32-41
Palindromic richness for languages invariant under more symmetries
Edita Pelantová
,
S̑tȇpán Starosta
Theoretical Computer Science
518
, 2014, pp. 42-63
Truthful optimization using mechanisms with verification
Carmine Ventre
Theoretical Computer Science
518
, 2014, pp. 64-79
Regular and context-free pattern languages over small alphabets
Daniel Reidenbach
,
Markus L. Schmid
Theoretical Computer Science
518
, 2014, pp. 80-95
On the approximability of the link building problem
Martin Olsen
,
Anastasios Viglas
Theoretical Computer Science
518
, 2014, pp. 96-116
Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines
Long Wan
,
Ran Ma
,
Jinjiang Yuan
Theoretical Computer Science
518
, 2014, pp. 117-123
Edge colorings of planar graphs without 5-cycles with two chords
Jian-Liang Wu
,
Ling Xue
Theoretical Computer Science
518
, 2014, pp. 124-127
On the complexity of quantified linear systems
Salvatore Ruggieri
,
Pavlos Eirinakis
,
K. Subramani
,
Piotr Wojciechowski
Theoretical Computer Science
518
, 2014, pp. 128-134