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=J. Algorithms AND Volume=42
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Oblivious gossiping on Tori
Ulrich Meyer
,
Jop F. Sibeyn
Journal of Algorithms
42
(1), 2002, pp. 1-19
Approximating element-weighted vertex deletion problems for the complete
k
-partite property
Reuven Bar-Yehuda
,
Dror Rawitz
Journal of Algorithms
42
(1), 2002, pp. 20-40
The exact path length problem
Matti Nykänen
,
Esko Ukkonen
Journal of Algorithms
42
(1), 2002, pp. 41-53
Locating sources to meet flow demands in undirected networks
Kouji Arata
,
Satoru Iwata
,
Kazuhisa Makino
,
Satoru Fujishige
Journal of Algorithms
42
(1), 2002, pp. 54-68
On graph powers for leaf-labeled trees
Naomi Nishimura
,
Prabhakar Ragde
,
Dimitrios M. Thilikos
Journal of Algorithms
42
(1), 2002, pp. 69-108
The 2-center problem with obstacles
Dan Halperin
,
Micha Sharir
,
Ken Goldberg
Journal of Algorithms
42
(1), 2002, pp. 109-134
Broadcast scheduling optimization for heterogeneous cluster systems
Pangfeng Liu
Journal of Algorithms
42
(1), 2002, pp. 135-152
General partitioning on random graphs
C.R. Subramanian
,
C.E. Veni Madhavan
Journal of Algorithms
42
(1), 2002, pp. 153-172
Improved approximation algorithms for MAX SAT
Takao Asano
,
David P. Williamson
Journal of Algorithms
42
(1), 2002, pp. 173-202
Randomized sorting in
O(n \log\log n)
time and linear space using addition, shift, and bit-wise Boolean operations
Mikkel Thorup
Journal of Algorithms
42
(2), 2002, pp. 205-230
Sparse dynamic programming for longest common subsequence from fragments
Brenda S. Baker
,
Raffaele Giancarlo
Journal of Algorithms
42
(2), 2002, pp. 231-254
A(2+\varepsilon)
-approximation scheme for minimum domination on circle graphs
Mirela Damian-Iordache
,
Sriram V. Pemmaraju
Journal of Algorithms
42
(2), 2002, pp. 255-276
Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
Phil Bradford
,
Mordecai J. Golin
,
Lawrence L. Larmore
,
Wojciech Rytter
Journal of Algorithms
42
(2), 2002, pp. 277-303
Some properties of nonstar steps in addition chains and new cases where the Scholz conjecture is true
Hatem M. Bahig
,
Ken Nakamula
Journal of Algorithms
42
(2), 2002, pp. 304-316
Analysis of carry propagation in addition: An elementary approach
Nicholas Pippenger
Journal of Algorithms
42
(2), 2002, pp. 317-333
Tools for multicoloring with applications to planar graphs and partial
k
-trees
Magnús M. Halldórsson
,
Guy Kortsarz
Journal of Algorithms
42
(2), 2002, pp. 334-366