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=554
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A systematic methodology for automated theorem finding
Hongbiao Gao
,
Yuichi Goto
,
Jingde Cheng
Theoretical Computer Science
554
, 2014, pp. 2-21
On the advice complexity of the online
L(2,1)
-coloring problem on paths and cycles
Maria Paola Bianchi
,
Hans-Joachim Böckenhauer
,
Juraj Hromkovic̑
,
Sacha Krug
,
Björn Steffen
Theoretical Computer Science
554
, 2014, pp. 22-39
H
-coloring degree-bounded (acyclic) digraphs
Pavol Hell
,
Aurosish Mishra
Theoretical Computer Science
554
, 2014, pp. 40-49
On linear-size pseudorandom generators and hardcore functions
Joshua Baron
,
Yuval Ishai
,
Rafail Ostrovsky
Theoretical Computer Science
554
, 2014, pp. 50-63
Selection from read-only memory with limited workspace
Amr Elmasry
,
Daniel Dahl Juhl
,
Jyrki Katajainen
,
Srinivasa Rao Satti
Theoretical Computer Science
554
, 2014, pp. 64-73
A linear edge kernel for two-layer crossing minimization
Yasuaki Kobayashi
,
Hirokazu Maruta
,
Yusuke Nakae
,
Hisao Tamaki
Theoretical Computer Science
554
, 2014, pp. 74-81
How to catch
L_2
-heavy-hitters on sliding windows
Vladimir Braverman
,
Ran Gelles
,
Rafail Ostrovsky
Theoretical Computer Science
554
, 2014, pp. 82-94
The string guessing problem as a method to prove lower bounds on the advice complexity
Hans-Joachim Böckenhauer
,
Juraj Hromkovic̑
,
Dennis Komm
,
Sacha Krug
,
Jasmin Smula
,
Andreas Sprock
Theoretical Computer Science
554
, 2014, pp. 95-108
Connection between conjunctive capacity and structural properties of graphs
Miroslav Chlebík
,
Janka Chlebíková
Theoretical Computer Science
554
, 2014, pp. 109-118
2-connecting outerplanar graphs without blowing up the pathwidth
Jasine Babu
,
Manu Basavaraju
,
L. Sunil Chandran
,
Deepak Rajendraprasad
Theoretical Computer Science
554
, 2014, pp. 119-134
Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
Yong Zhang
,
Francis Y.L. Chin
,
Hing-Fung Ting
,
Xin Han
,
Chung Keung Poon
,
Yung H. Tsin
,
Deshi Ye
Theoretical Computer Science
554
, 2014, pp. 135-149
Non-planar square-orthogonal drawing with few-bend edges
Yu-An Lin
,
Sheung-Hung Poon
Theoretical Computer Science
554
, 2014, pp. 150-168
A practical decision procedure for Propositional Projection Temporal Logic with infinite models
Zhenhua Duan
,
Cong Tian
Theoretical Computer Science
554
, 2014, pp. 169-190
Schedules for marketing products with negative externalities
Zhigang Cao
,
Xujin Chen
,
Changjun Wang
Theoretical Computer Science
554
, 2014, pp. 191-206
Algorithms for parameterized maximum agreement forest problem on multiple trees
Feng Shi
,
Jianxin Wang
,
Jianer Chen
,
Qilong Feng
,
Jiong Guo
Theoretical Computer Science
554
, 2014, pp. 207-216
On the treewidth of dynamic graphs
Bernard Mans
,
Luke Mathieson
Theoretical Computer Science
554
, 2014, pp. 217-228
A formal proof of the deadline driven scheduler in PPTL axiomatic system
Nan Zhang
,
Zhenhua Duan
,
Cong Tian
,
Dingzhu Du
Theoretical Computer Science
554
, 2014, pp. 229-253
A fast algorithm for data collection along a fixed track
O. Cheong
,
R. El Shawi
,
J. Gudmundsson
Theoretical Computer Science
554
, 2014, pp. 254-262
Social exchange networks with distant bargaining
Konstantinos Georgiou
,
George Karakostas
,
Jochen Könemann
,
Zuzanna Stamirowska
Theoretical Computer Science
554
, 2014, pp. 263-274
Approximating the minimum independent dominating set in perturbed graphs
Weitian Tong
,
Randy Goebel
,
Guohui Lin
Theoretical Computer Science
554
, 2014, pp. 275-282