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
[1]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND YEAR=2015
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives
Krishnendu Chatterjee
,
Manas Joglekar
,
Nisarg Shah
Theoretical Computer Science
573
, 2015, pp. 71-89
On the commutative equivalence of bounded context-free and regular languages: The semi-linear case
Flavio D'Alessandro
,
Benedetto Intrigila
Theoretical Computer Science
572
, 2015, pp. 1-24
Post-challenge leakage in public-key encryption
Zongyang Zhang
,
Sherman S.M. Chow
,
Zhenfu Cao
Theoretical Computer Science
572
, 2015, pp. 25-49
Integrated production and delivery scheduling on a serial batch machine to minimize the makespan
Lingfa Lu
,
Liqi Zhang
,
Long Wan
Theoretical Computer Science
572
, 2015, pp. 50-57
Online scheduling with equal processing times and machine eligibility constraints
Jia Xu
,
Zhaohui Liu
Theoretical Computer Science
572
, 2015, pp. 58-65
Online pricing for multi-type of items
H.F. Ting
,
Xiangzhong Xiang
Theoretical Computer Science
572
, 2015, pp. 66-82
Avoiding 2-binomial squares and cubes
Michaël Rao
,
Michel Rigo
,
Pavel Salimov
Theoretical Computer Science
572
, 2015, pp. 83-91
The importance of being proper: (In clustered-level planarity and
T
-level planarity)
Patrizio Angelini
,
Giordano Da Lozzo
,
Giuseppe Di Battista
,
Fabrizio Frati
,
Vincenzo Roselli
Theoretical Computer Science
571
, 2015, pp. 1-9
On the construction of all shortest vertex-disjoint paths in Cayley graphs of Abelian groups
Cheng-Nan Lai
Theoretical Computer Science
571
, 2015, pp. 10-20
Combinatorial auctions with verification are tractable
Piotr Krysta
,
Carmine Ventre
Theoretical Computer Science
571
, 2015, pp. 21-35
Upward planar graphs and their duals
Christopher Auer
,
Christian Bachmaier
,
Franz J. Brandenburg
,
Andreas Gleißner
,
Kathrin Hanauer
Theoretical Computer Science
571
, 2015, pp. 36-49
Searching for Zimin patterns
Wojciech Rytter
,
Arseny M. Shur
Theoretical Computer Science
571
, 2015, pp. 50-57
A PTAS for the minimum weight connected vertex cover
P_3
problem on unit disk graphs
Limin Wang
,
Xiaoyan Zhang
,
Zhao Zhang
,
Hajo Broersma
Theoretical Computer Science
571
, 2015, pp. 58-66
Termination of the iterated strong-factor operator on multipartite graphs
Christophe Crespelle
,
Thi Ha Duong Phan
,
The Hung Tran
Theoretical Computer Science
571
, 2015, pp. 67-77
On graphs that are not PCGs
Stephane Durocher
,
Debajyoti Mondal
,
Md. Saidur Rahman
Theoretical Computer Science
571
, 2015, pp. 78-87
The role of planarity in connectivity problems parameterized by treewidth
Julien Baste
,
Ignasi Sau
Theoretical Computer Science
570
, 2015, pp. 1-14
The hub number of co-comparability graphs
Jia-Jie Liu
,
Cindy Tzu-Hsin Wang
,
Yue-Li Wang
,
William Chung-Kung Yen
Theoretical Computer Science
570
, 2015, pp. 15-21
Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
Zhichao Geng
,
Jinjiang Yuan
Theoretical Computer Science
570
, 2015, pp. 22-29
Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries
Chung-Lun Li
Theoretical Computer Science
570
, 2015, pp. 30-39
Coordinating oligopolistic players in unrelated machine scheduling
Fidaa Abed
,
Chien-Chung Huang
Theoretical Computer Science
570
, 2015, pp. 40-54
Pfaffian orientations and perfect matchings of scale-free networks
Zhongzhi Zhang
,
Bin Wu
Theoretical Computer Science
570
, 2015, pp. 55-69
Associative and commutative tree representations for Boolean functions
Antoine Genitrini
,
Bernhard Gittenberger
,
Veronika Kraus
,
Cécile Mailler
Theoretical Computer Science
570
, 2015, pp. 70-101
n
-player impartial combinatorial games with random players
Walter O. Krawec
Theoretical Computer Science
569
, 2015, pp. 1-12
Message and time efficient multi-broadcast schemes
Liron Levin
,
Dariusz R. Kowalski
,
Michael Segal
Theoretical Computer Science
569
, 2015, pp. 13-23
Searching on a line: A complete characterization of the optimal solution
Prosenjit Bose
,
Jean-Lou De Carufel
,
Stephane Durocher
Theoretical Computer Science
569
, 2015, pp. 24-42
Seiten
<
1
2
3
4
5
6
7
8
9
>