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=Algorithmica AND YEAR=2000
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A strong and easily computable separation bound for arithmetic expressions involving radicals
C. Burnikel
,
R. Fleischer
,
K. Mehlhorn
,
S. Schirra
Algorithmica
27
(1), 2000, pp. 87-99
Parameterization in finite precision
C.L. Bajaj
,
A.V. Royappa
Algorithmica
27
(1), 2000, pp. 100-114
An algorithm for enumerating all spanning trees of a directed graph
S. Kapoor
,
H. Ramesh
Algorithmica
27
(2), 2000, pp. 120-130
One for the price of two: A unified approach for approximating covering problems
R. Bar-Yehuda
Algorithmica
27
(2), 2000, pp. 131-144
Binary searching with nonuniform costs and its application to text retrieval
G. Navarro
,
E.F. Barbosa
,
R. Baeza-Yates
,
W. Cunto
,
N. Ziviani
Algorithmica
27
(2), 2000, pp. 145-169
Smallest enclosing cylinders
E. Schömer
,
J. Sellen
,
M. Teichmann
,
Chee Yap
Algorithmica
27
(2), 2000, pp. 170-186
Optimal sublogarithmic time parallel algorithms on rooted forests
G. Sajith
,
S. Saxena
Algorithmica
27
(2), 2000, pp. 187-197
Approximation algorithms for minimum
K
-cut
N. Guttman-Beck
,
R. Hassin
Algorithmica
27
(2), 2000, pp. 198-207
Introduction
H.L. Bodlaender
Algorithmica
27
, 2000, pp. 209-211
Shortest paths in digraphs of small treewidth - Part I: Sequential algorithms
S. Chaudhuri
,
C.D. Zaroliagis
Algorithmica
27
, 2000, pp. 212-226
A linear algorithm for finding
[g,f]
-colorings of partial
k
-trees
X. Zhou
,
K. Fuse
,
T. Nishizeki
Algorithmica
27
, 2000, pp. 227-243
Generalized dominators for structured programs
S. Alstrup
,
P.W. Lauridsen
,
M. Thorup
Algorithmica
27
, 2000, pp. 244-253
Linear-time algorithms for partial
k
-tree complements
A. Gupta
,
D. Kaller
,
T. Shermer
Algorithmica
27
, 2000, pp. 254-274
Diameter and treewidth in minor-closed graph families
D. Eppstein
Algorithmica
27
, 2000, pp. 275-291
Dynamic algorithms for graphs of bounded treewidth
T. Hagerup
Algorithmica
27
, 2000, pp. 292-315
Evaluating network reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs
C. Lucet
,
J.-F. Manouvrier
,
J. Carlier
Algorithmica
27
, 2000, pp. 316-336
Faster algorithms for subgraph isomorphism of
k
-connected partial
k
-trees
A. Dessmark
,
A. Lingas
,
A. Proskurowski
Algorithmica
27
, 2000, pp. 337-347
Definability equals recognizability of partial 3-trees and
k
-connected partial
k
-trees
D. Kaller
Algorithmica
27
, 2000, pp. 348-381
Memory requirements for table computations in partial
k
-tree algorithms
B. Aspvall
,
A. Proskurowski
,
J.A. Telle
Algorithmica
27
, 2000, pp. 382-394
Graph searching on some subclasses of chordal graphs
S.-L. Peng
,
M.-T. Ko
,
C.-W. Ho
,
T.-s. Hsu
,
C.Y. Tang
Algorithmica
27
, 2000, pp. 395-426
Finding edge-disjoint paths in partial
k
-trees
X. Zhou
,
S. Tamura
,
T. Nishizeki
Algorithmica
26
(1), 2000, pp. 3-30
Computing mimicking networks
S. Chaudhuri
,
K.V. Subrahmanyam
,
F. Wagner
,
C.D. Zaroliagis
Algorithmica
26
(1), 2000, pp. 31-49
A simplified
{\tilde{O}}(nm)
time edge-splitting algorithm in undirected graphs
H. Nagamochi
,
S. Nakamura
,
T. Ibaraki
Algorithmica
26
(1), 2000, pp. 50-67
On exact solutions for the rectilinear Steiner tree problem - Part I: Theoretical results
U. Föss̈meier
,
M. Kaufmann
Algorithmica
26
(1), 2000, pp. 68-99
Efficient orthogonal drawings of high degree graphs
A. Papakostas
,
I.G. Tollis
Algorithmica
26
(1), 2000, pp. 100-125
Seiten
<
1
2
3
>