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=540-541
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Multi-target ray searching problems
Spyros Angelopoulos
,
Alejandro López-Ortiz
,
Konstantinos Panagiotou
Theoretical Computer Science
540-541
, 2014, pp. 2-12
Reoptimization in machine scheduling
Nicolas Boria
,
Federico Della Croce
Theoretical Computer Science
540-541
, 2014, pp. 13-26
Online Sum-Radii Clustering
Dimitris Fotakis
,
Paraschos Koutris
Theoretical Computer Science
540-541
, 2014, pp. 27-39
On the complexity of constructing minimum changeover cost arborescences
Didem Gözüpek
,
Mordechai Shalom
,
Ariella Voloshin
,
Shmuel Zaks
Theoretical Computer Science
540-541
, 2014, pp. 40-52
Solutions for the stable roommates problem with payments
Péter Biró
,
Matthijs Bomhoff
,
Petr A. Golovach
,
Walter Kern
,
Daniël Paulusma
Theoretical Computer Science
540-541
, 2014, pp. 53-61
Online removable knapsack problem under convex function
Xin Han
,
Yasushi Kawase
,
Kazuhisa Makino
,
He Guo
Theoretical Computer Science
540-541
, 2014, pp. 62-69
Efficient sub-5 approximations for minimum dominating sets in unit disk graphs
Guilherme D. da Fonseca
,
Celina M.H. de Figueiredo
,
Vinícius G. Pereira de Sá
,
Raphael C.S. Machado
Theoretical Computer Science
540-541
, 2014, pp. 70-81
Optimal data placement on networks with a constant number of clients
Eric Angel
,
Evripidis Bampis
,
Gerasimos G. Pollatos
,
Vassilis Zissimopoulos
Theoretical Computer Science
540-541
, 2014, pp. 82-88
On the complexity of the selective graph coloring problem in some special classes of graphs
Marc Demange
,
Jérôme Monnot
,
Petrica Pop
,
Bernard Ries
Theoretical Computer Science
540-541
, 2014, pp. 89-102
Second-price ad auctions with binary bids and markets with good competition
Cristina G. Fernandes
,
Rafael C.S. Schouery
Theoretical Computer Science
540-541
, 2014, pp. 103-114
Bi-criteria and approximation algorithms for restricted matchings
Monaldo Mastrolilli
,
Georgios Stamoulis
Theoretical Computer Science
540-541
, 2014, pp. 115-132
On permuted super-secondary structures of transmembrane
\beta
-barrel proteins
Van Du T. Tran
,
Philippe Chassignet
,
Jean-Marc Steyaert
Theoretical Computer Science
540-541
, 2014, pp. 133-142
On the sum-max graph partitioning problem
Rémi Watrigant
,
Marin Bougeret
,
Rodolphe Giroudeau
,
Jean-Claude König
Theoretical Computer Science
540-541
, 2014, pp. 143-155
On the computational complexity of the Probabilistic Traveling Salesman Problem with Deadlines
D. Weyland
Theoretical Computer Science
540-541
, 2014, pp. 156-168
The fashion game: Network extension of Matching Pennies
Zhigang Cao
,
Xiaoguang Yang
Theoretical Computer Science
540-541
, 2014, pp. 169-181