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=396
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An improved lower bound for approximating minimum GCD multiplier in
l \infty
norm
(GCDM \infty)
WenBin Chen
,
Jiangtao Meng
,
Dengpan Yin
Theoretical Computer Science
396
(1-3), 2008, pp. 1-9
Covering by squares
L. Salinas
,
E. Goles
Theoretical Computer Science
396
(1-3), 2008, pp. 10-27
Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
Longcheng Liu
,
Enyu Yao
Theoretical Computer Science
396
(1-3), 2008, pp. 28-34
Combinatorial Gray codes for classes of pattern avoiding permutations
W.M.B. Dukes
,
M.F. Flanagan
,
T. Mansour
,
V. Vajnovszki
Theoretical Computer Science
396
(1-3), 2008, pp. 35-49
Jug measuring: Algorithms and complexity
Min-Zheng Shieh
,
Shi-Chun Tsai
Theoretical Computer Science
396
(1-3), 2008, pp. 50-62
A better differential approximation ratio for symmetric TSP
Bruno Escoffier
,
Jérôme Monnot
Theoretical Computer Science
396
(1-3), 2008, pp. 63-70
On a quasi-ordering on Boolean functions
Miguel Couceiro
,
Maurice Pouzet
Theoretical Computer Science
396
(1-3), 2008, pp. 71-87
Modelling the navigation potential of a web page
Trevor Fenner
,
Mark Levene
,
George Loizou
Theoretical Computer Science
396
(1-3), 2008, pp. 88-96
Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
Xavier Défago
,
Samia Souissi
Theoretical Computer Science
396
(1-3), 2008, pp. 97-112
The complexity of deciding reachability properties of distributed negotiation schemes
Paul E. Dunne
,
Yann Chevaleyre
Theoretical Computer Science
396
(1-3), 2008, pp. 113-144
All-pairs disjoint paths from a common ancestor in
\~O(n^\omega)
time
Raphael Yuster
Theoretical Computer Science
396
(1-3), 2008, pp. 145-150
The 2nd-order conditional 3-coloring of claw-free graphs
Xueliang Li
,
Wenli Zhou
Theoretical Computer Science
396
(1-3), 2008, pp. 151-157
Probabilistic analysis for scheduling with conflicts
Sandy Irani
,
Vitus Leung
Theoretical Computer Science
396
(1-3), 2008, pp. 158-179
On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity
Chen Wang
,
Myung-Ah Park
,
James Willson
,
Yongxi Cheng
,
Andras Farago
,
Weili Wu
Theoretical Computer Science
396
(1-3), 2008, pp. 180-190
Weak-vertex-pancyclicity of
(n, k)
-star graphs
Ying-You Chen
,
Dyi-Rong Duh
,
Tai-Ling Ye
,
Jung-Sheng Fu
Theoretical Computer Science
396
(1-3), 2008, pp. 191-199
Competitive analysis of most-request-first for scheduling broadcasts with start-up delay
Regant Y.S. Hung
,
H.F. Ting
Theoretical Computer Science
396
(1-3), 2008, pp. 200-211
Partitioned probe comparability graphs
David B. Chandler
,
Maw-Shang Chang
,
Ton Kloks
,
Jiping Liu
,
Sheng-Lung Peng
Theoretical Computer Science
396
(1-3), 2008, pp. 212-222
Tight bounds for the multiplicative complexity of symmetric functions
Joan Boyar
,
René Peralta
Theoretical Computer Science
396
(1-3), 2008, pp. 223-246
Comparison between parallel and serial dynamics of Boolean networks
E. Goles
,
L. Salinas
Theoretical Computer Science
396
(1-3), 2008, pp. 247-253
Palindrome positions in ternary square-free words
James D. Currie
Theoretical Computer Science
396
(1-3), 2008, pp. 254-257
Paths in circuit graphs of matroids
Guizhen Liu
,
Ping Li
Theoretical Computer Science
396
(1-3), 2008, pp. 258-263
On the weight of universal insertion grammars
Lila Kari
,
Petr Sosík
Theoretical Computer Science
396
(1-3), 2008, pp. 264-270
The
NP
-hardness of finding a directed acyclic graph for regular resolution
Samuel R. Buss
,
Jan Hoffmann
Theoretical Computer Science
396
(1-3), 2008, pp. 271-276
A simple transitive signature scheme for directed trees
Gregory Neven
Theoretical Computer Science
396
(1-3), 2008, pp. 277-282
The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
Lingfa Lu
,
Liqi Zhang
,
Jinjiang Yuan
Theoretical Computer Science
396
(1-3), 2008, pp. 283-289
Seiten 1
2
>