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=562
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximation algorithms for digraph width parameters
Shiva Kintali
,
Nishad Kothari
,
Akash Kumar
Theoretical Computer Science
562
, 2014, pp. 365-376
Performance guarantees for a scheduling problem with common stepwise job payoffs
Yasmina Seddik
,
Christophe Gonzales
,
Safia Kedad-Sidhoum
Theoretical Computer Science
562
, 2014, pp. 377-394
Randomized algorithms for online knapsack problems
Xin Han
,
Yasushi Kawase
,
Kazuhisa Makino
Theoretical Computer Science
562
, 2014, pp. 395-405
The predecessor-existence problem for
k
-reversible processes
Leonardo I.L. Oliveira
,
Valmir C. Barbosa
,
Fábio Protti
Theoretical Computer Science
562
, 2014, pp. 406-418
Bounding the payment of approximate truthful mechanisms
Gruia Calinescu
Theoretical Computer Science
562
, 2014, pp. 419-435
Inapproximability of dominating set on power law graphs
Mikael Gast
,
Mathias Hauptmann
,
Marek Karpinski
Theoretical Computer Science
562
, 2014, pp. 436-452
Data gathering and personalized broadcasting in radio grids with interference
Jean-Claude Bermond
,
Bi Li
,
Nicolas Nisse
,
Hervé Rivano
,
Min-Li Yu
Theoretical Computer Science
562
, 2014, pp. 453-475
On the commutative equivalence of semi-linear sets of
\mathbb N^k
Flavio D'Alessandro
,
Benedetto Intrigila
Theoretical Computer Science
562
, 2014, pp. 476-495
Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
Jianer Chen
,
Jia-Hao Fan
,
Sing-Hoi Sze
Theoretical Computer Science
562
, 2014, pp. 496-512
The benefit of adaptivity in stochastic packing problems with probing
Asaf Levin
,
Aleksander Vainer
Theoretical Computer Science
562
, 2014, pp. 513-523
Optimizing busy time on parallel machines
George B. Mertzios
,
Mordechai Shalom
,
Ariella Voloshin
,
Prudence W.H. Wong
,
Shmuel Zaks
Theoretical Computer Science
562
, 2014, pp. 524-541
Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes
Yi-Chun Wang
,
Justie Su-Tzu Juan
Theoretical Computer Science
562
, 2014, pp. 542-556
Improving the
H_k
-bound on the price of stability in undirected Shapley network design games
Yann Disser
,
Andreas Emil Feldmann
,
Max Klimm
,
Matús̑ Mihalák
Theoretical Computer Science
562
, 2014, pp. 557-564
Conditional diagnosability and strong diagnosability of Split-Star Networks under the PMC model
Limei Lin
,
Li Xu
,
Shuming Zhou
Theoretical Computer Science
562
, 2014, pp. 565-580
Integrated scheduling of production and delivery on a single machine with availability constraint
Jing Fan
,
Xiwen Lu
,
Peihai Liu
Theoretical Computer Science
562
, 2014, pp. 581-589
Postfix automata
Maohua Jing
,
Yixian Yang
,
Ning Lu
,
Wenbo Shi
,
Changyong Yu
Theoretical Computer Science
562
, 2014, pp. 590-605
Using swaps and deletes to make strings match
Daniel Meister
Theoretical Computer Science
562
, 2014, pp. 606-620
A simple yet time-optimal and linear-space algorithm for shortest unique substring queries
Atalay Mert İleri
,
M. Og̑uzhan Külekci
,
Bojian Xu
Theoretical Computer Science
562
, 2014, pp. 621-633
On the number of minimal dominating sets on some graph classes
Jean-François Couturier
,
Romain Letourneur
,
Mathieu Liedloff
Theoretical Computer Science
562
, 2014, pp. 634-642
Specializations and generalizations of the Stackelberg minimum spanning tree game
Davide Bilò
,
Luciano Gualà
,
Stefano Leucci
,
Guido Proietti
Theoretical Computer Science
562
, 2014, pp. 643-657
A note on short palindromes in square-free words
Tero Harju
,
Mike Müller
Theoretical Computer Science
562
, 2014, pp. 658-659
Corrigendum to ``On the approximability and hardness of minimum topic connected overlay and its special instances''
Jun Hosoda
,
Juraj Hromkovic̑
,
Taisuke Izumi
,
Hirotaka Ono
,
Monika Steinová
,
Koichi Wada
Theoretical Computer Science
562
, 2014, pp. 660-661
Seiten
<
1
2