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=41
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs
Jrgen Bang-Jensen
,
Anders Yeo
Journal of Algorithms
41
(1), 2001, pp. 1-19
Approximation algorithms for independent sets in map graphs
Zhi-Zhong Chen
Journal of Algorithms
41
(1), 2001, pp. 20-40
Efficient merging and construction of evolutionary trees
Andrzej Lingas
,
Hans Olsson
,
Anna Östlin
Journal of Algorithms
41
(1), 2001, pp. 41-51
Computing Chow forms and some applications
Gabriela Jeronimo
,
Susana Puddu
,
Juan Sabia
Journal of Algorithms
41
(1), 2001, pp. 52-68
Deterministic dictionaries
Torben Hagerup
,
Peter Bro Miltersen
,
Rasmus Pagh
Journal of Algorithms
41
(1), 2001, pp. 69-85
How helpers hasten
h
-relations
Peter Sanders
,
Roberto Solis-Oba
Journal of Algorithms
41
(1), 2001, pp. 86-98
Approximating coloring and maximum independent sets in 3-uniform hypergraphs
Michael Krivelevich
,
Ram Nathaniel
,
Benny Sudakov
Journal of Algorithms
41
(1), 2001, pp. 99-113
The
k
-client problem
Houman Alborzi
,
Eric Torng
,
Patchrawat Uthaisombut
,
Stephen Wagner
Journal of Algorithms
41
(2), 2001, pp. 115-173
Approximation algorithms for maximization problems arising in graph partitioning
Uriel Feige
,
Michael Langberg
Journal of Algorithms
41
(2), 2001, pp. 174-211
An efficient approximation algorithm for minimizing makespan on uniformly related machines
Chandra Chekuri
,
Michael Bender
Journal of Algorithms
41
(2), 2001, pp. 212-224
The complexity of gene placement
Leslie Ann Goldberg
,
Paul W. Goldberg
,
Mike Paterson
,
Pavel Pevzner
,
Süleyman Cenk Sahinalp
,
Elizabeth Sweedyk
Journal of Algorithms
41
(2), 2001, pp. 225-243
Optimality and greed in dynamic allocation
Peter Winkler
Journal of Algorithms
41
(2), 2001, pp. 244-261
An
O(\sqrt N)
oblivious routing algorithm for two-dimensional meshes of constant queue-size
Kazuo Iwama
,
Eiji Miyano
Journal of Algorithms
41
(2), 2001, pp. 262-279
Vertex cover: Further observations and further improvements
Jianer Chen
,
Iyad A. Kanj
,
Weijia Jia
Journal of Algorithms
41
(2), 2001, pp. 280-301
Algorithms for leader election by cellular automata
Codrin Nichitiu
,
Jacques Mazoyer
,
Eric Rémila
Journal of Algorithms
41
(2), 2001, pp. 302-329
Fly cheaply: On the minimum fuel consumption problem
Timothy M. Chan
,
Alon Efrat
Journal of Algorithms
41
(2), 2001, pp. 330-337
On the common substring alignment problem
Gad M. Landau
,
Michal Ziv-Ukelson
Journal of Algorithms
41
(2), 2001, pp. 338-359
Efficient and practical algorithms for sequential modular decomposition
Elias Dahlhaus
,
Jens Gustedt
,
Ross M. McConnell
Journal of Algorithms
41
(2), 2001, pp. 360-387
On bipartite and multipartite clique problems
Milind Dawande
,
Pinar Keskinocak
,
Jayashankar M. Swaminathan
,
Sridhar Tayur
Journal of Algorithms
41
(2), 2001, pp. 388-403
Approximation algorithms for the achromatic number
Amitabh Chaudhary
,
Sundar Vishwanathan
Journal of Algorithms
41
(2), 2001, pp. 404-416
Toward optimal
\epsilon
-approximate nearest neighbor algorithms
Matthew Cary
Journal of Algorithms
41
(2), 2001, pp. 417-428
z
-approximations
Refael Hassin
,
Samir Khuller
Journal of Algorithms
41
(2), 2001, pp. 429-442
Efficient approximation algorithms for tiling and packing problems with rectangles
Piotr Berman
,
Bhaskar DasGupta
,
S. Muthukrishnan
,
Suneeta Ramaswami
Journal of Algorithms
41
(2), 2001, pp. 443-470