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 YEAR=2002
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Thresholds and optimal binary comparison search trees
Richard Anderson
,
Sampath Kannan
,
Howard Karloff
,
Richard E. Ladner
Journal of Algorithms
44
(2), 2002, pp. 338-358
A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
Bang Ye Wu
Journal of Algorithms
44
(2), 2002, pp. 359-378
A simple test for the consecutive ones property
Wen-Lian Hsu
Journal of Algorithms
43
(1), 2002, pp. 1-16
Embedding graphs with bounded treewidth into their optimal hypercubes
Volker Heun
,
Ernst W. Mayr
Journal of Algorithms
43
(1), 2002, pp. 17-50
Efficient dynamic embeddings of binary trees into hypercubes
Volker Heun
,
Ernst W. Mayr
Journal of Algorithms
43
(1), 2002, pp. 51-84
The stable roommates problem with ties
Robert W. Irving
,
David F. Manlove
Journal of Algorithms
43
(1), 2002, pp. 85-105
Kayles and Nimbers
Hans L. Bodlaender
,
Dieter Kratsch
Journal of Algorithms
43
(1), 2002, pp. 106-119
The dynamic stream merging algorithm
E.G., Jr. Coffman
,
Predrag Jelenković
,
Petar Momc̑ilović
Journal of Algorithms
43
(1), 2002, pp. 120-137
Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem
Daya Ram Gaur
,
Toshihide Ibaraki
,
Ramesh Krishnamurti
Journal of Algorithms
43
(1), 2002, pp. 138-152
A linear time algorithm for recognizing regular Boolean functions
Kazuhisa Makino
Journal of Algorithms
43
(2), 2002, pp. 155-176
Fast broadcasting and gossiping in radio networks
Marek Chrobak
,
Leszek Ga̧sieniec
,
Wojciech Rytter
Journal of Algorithms
43
(2), 2002, pp. 177-189
Approximation of pathwidth of outerplanar graphs
Hans L. Bodlaender
,
Fedor V. Fomin
Journal of Algorithms
43
(2), 2002, pp. 190-200
Improved approximation of Max-Cut on graphs of bounded degree
Uriel Feige
,
Marek Karpinski
,
Michael Langberg
Journal of Algorithms
43
(2), 2002, pp. 201-219
Exploiting structure in quantified formulas
Richard E. Stearns
,
Harry B. Hunt III
Journal of Algorithms
43
(2), 2002, pp. 220-263
Gossip is synteny: Incomplete gossip and the syntenic distance between genomes
David Liben-Nowell
Journal of Algorithms
43
(2), 2002, pp. 264-283
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
Seiten
<
1
2
3
>