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=385
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the minimum monochromatic or multicolored subgraph partition problems
Xueliang Li
,
Xiaoyan Zhang
Theoretical Computer Science
385
(1-3), 2007, pp. 1-10
Path constraints in semistructured data
Y. André
,
A.C. Caron
,
D. Debarbieux
,
Y. Roos
,
S. Tison
Theoretical Computer Science
385
(1-3), 2007, pp. 11-33
Map construction of unknown graphs by multiple agents
Shantanu Das
,
Paola Flocchini
,
Shay Kutten
,
Amiya Nayak
,
Nicola Santoro
Theoretical Computer Science
385
(1-3), 2007, pp. 34-48
On approximation algorithms of
k
-connected
m
-dominating sets in disk graphs
My T. Thai
,
Ning Zhang
,
Ravi Tiwari
,
Xiaochun Xu
Theoretical Computer Science
385
(1-3), 2007, pp. 49-59
On the complexity of dominating set problems related to the minimum all-ones problem
Hajo Broersma
,
Xueliang Li
Theoretical Computer Science
385
(1-3), 2007, pp. 60-70
A sufficient condition for a planar graph to be class 1
Weifan Wang
,
Yongzhu Chen
Theoretical Computer Science
385
(1-3), 2007, pp. 71-77
Approximation algorithms for maximum cut with limited unbalance
Giulia Galbiati
,
Francesco Maffioli
Theoretical Computer Science
385
(1-3), 2007, pp. 78-87
On the fairness and complexity of generalized
k
-in-a-row games
Ming Yu Hsieh
,
Shi-Chun Tsai
Theoretical Computer Science
385
(1-3), 2007, pp. 88-100
A simple randomized scheme for constructing low-weight
k
-connected spanning subgraphs with applications to distributed algorithms
Maleq Khan
,
Gopal Pandurangan
,
V.S. Anil Kumar
Theoretical Computer Science
385
(1-3), 2007, pp. 101-114
Multiple genome rearrangement by swaps and by element duplications
V.Yu. Popov
Theoretical Computer Science
385
(1-3), 2007, pp. 115-126
Alphabet-independent linear-time construction of compressed suffix arrays using
o(n \log n)
-bit working space
Joong Chae Na
,
Kunsoo Park
Theoretical Computer Science
385
(1-3), 2007, pp. 127-136
On Dejean's conjecture over large alphabets
Arturo Carpi
Theoretical Computer Science
385
(1-3), 2007, pp. 137-151
Languages with mismatches
C. Epifanio
,
A. Gabriele
,
F. Mignosi
,
A. Restivo
,
M. Sciortino
Theoretical Computer Science
385
(1-3), 2007, pp. 152-166
Polylogarithmic-round interactive proofs for
coNP
collapse the exponential hierarchy
A. Pavan
,
Alan L. Selman
,
Samik Sengupta
,
N.V. Vinodchandran
Theoretical Computer Science
385
(1-3), 2007, pp. 167-178
Partial words and the critical factorization theorem revisited
F. Blanchet-Sadri
,
Nathan D. Wetzler
Theoretical Computer Science
385
(1-3), 2007, pp. 179-192
Random reals à la Chaitin with or without prefix-freeness
Verónica Becher
,
Serge Grigorieff
Theoretical Computer Science
385
(1-3), 2007, pp. 193-201
Approximability of the capacitated
b
-edge dominating set problem
André Berger
,
Takuro Fukunaga
,
Hiroshi Nagamochi
,
Ojas Parekh
Theoretical Computer Science
385
(1-3), 2007, pp. 202-213
Classification of rotations on the torus
T^2
Nicolas Bedaride
Theoretical Computer Science
385
(1-3), 2007, pp. 214-225
An exact algorithm for the minimum dominating clique problem
Dieter Kratsch
,
Mathieu Liedloff
Theoretical Computer Science
385
(1-3), 2007, pp. 226-240
Extracting constrained 2-interval subsets in 2-interval sets
Guillaume Blin
,
Guillaume Fertin
,
Stéphane Vialette
Theoretical Computer Science
385
(1-3), 2007, pp. 241-263
An analytical approach to the inference of summary data of additive type
Francesco M. Malvestuto
,
Mauro Mezzini
,
Marina Moscarini
Theoretical Computer Science
385
(1-3), 2007, pp. 264-285
The bipanconnectivity and
m
-panconnectivity of the folded hypercube
Jywe-Fei Fang
Theoretical Computer Science
385
(1-3), 2007, pp. 286-300