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=470
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
SDP-based algorithms for maximum independent set problems on hypergraphs
Geir Agnarsson
,
Magnús M. Halldórsson
,
Elena Losievskaja
Theoretical Computer Science
470
, 2013, pp. 1-9
Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
Tatsuya Akutsu
,
Daiji Fukagawa
,
Magnús M. Halldórsson
,
Atsuhiro Takasu
,
Keisuke Tanaka
Theoretical Computer Science
470
, 2013, pp. 10-22
Paging mobile users in cellular networks: Optimality versus complexity and simplicity
Amotz Bar-Noy
,
Panagiotis Cheilaris
,
Yi Feng
,
Mordecai J. Golin
Theoretical Computer Science
470
, 2013, pp. 23-35
Quotient complexity of ideal languages
Janusz Brzozowski
,
Galina Jirásková
,
Baiyu Li
Theoretical Computer Science
470
, 2013, pp. 36-52
Complementary cooperation, minimal winning coalitions, and power indices
Zhigang Cao
,
Xiaoguang Yang
Theoretical Computer Science
470
, 2013, pp. 53-92
Scheduling for weighted flow time and energy with rejection penalty
Sze-Hang Chan
,
Tak-Wah Lam
,
Lap-Kei Lee
Theoretical Computer Science
470
, 2013, pp. 93-104
Parameterized top-
K
algorithms
Jianer Chen
,
Iyad A. Kanj
,
Jie Meng
,
Ge Xia
,
Fenghui Zhang
Theoretical Computer Science
470
, 2013, pp. 105-119