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=507
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks
Jing (Selena) He
,
Shouling Ji
,
Yi Pan
,
Zhipeng Cai
Theoretical Computer Science
507
, 2013, pp. 2-16
Reducing price of anarchy of selfish task allocation with more selfishness
Xujin Chen
,
Xiaodong Hu
,
Weidong Ma
,
Changjun Wang
Theoretical Computer Science
507
, 2013, pp. 17-33
Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
Qiang Zhang
,
Weiwei Wu
,
Minming Li
Theoretical Computer Science
507
, 2013, pp. 34-40
Feedback vertex sets on restricted bipartite graphs
Wei Jiang
,
Tian Liu
,
Chaoyi Wang
,
Ke Xu
Theoretical Computer Science
507
, 2013, pp. 41-51
Maximum matching in multi-interface networks
Adrian Kosowski
,
Alfredo Navarra
,
Dominik Pajak
,
Cristina M. Pinotti
Theoretical Computer Science
507
, 2013, pp. 52-60
On a biobjective search problem in a line: Formulations and algorithms
Luís Paquete
,
Mathias Jaschob
,
Kathrin Klamroth
,
Jochen Gorski
Theoretical Computer Science
507
, 2013, pp. 61-71
Streaming with minimum space: An algorithm for covering by two congruent balls
Chung Keung Poon
,
Binhai Zhu
Theoretical Computer Science
507
, 2013, pp. 72-82
On the central path problem
Yongding Zhu
,
Jinhui Xu
Theoretical Computer Science
507
, 2013, pp. 83-99
Fast-mixed searching and related problems on graphs
Boting Yang
Theoretical Computer Science
507
, 2013, pp. 100-113