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=1999
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Linear time algorithms for Knapsack Problems with bounded weights
David Pisinger
Journal of Algorithms
33
(1), 1999, pp. 1-14
Fast algorithms for
k
-shredders and
k
-node connectivity augmentation
Joseph Cheriyan
,
Ramakrishna Thurimella
Journal of Algorithms
33
(1), 1999, pp. 15-50
Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time
Lisa Fleischer
Journal of Algorithms
33
(1), 1999, pp. 51-72
Approximation algorithms for directed Steiner problems
Moses Charikar
,
Chandra Chekuri
,
To-yat Cheung
,
Zuo Dai
,
Ashish Goel
,
Sudipto Guha
,
Ming Li
Journal of Algorithms
33
(1), 1999, pp. 73-91
Improving minimum cost spanning trees by upgrading nodes
S.O. Krumke
,
M.V. Marathe
,
H. Noltemeier
,
R. Ravi
,
S.S. Ravi
,
S. Sundaram
,
H.-C. Wirth
Journal of Algorithms
33
(1), 1999, pp. 92-111
Minimum coloring
k
-coloring graphs in polynomial average time
C.R. Subramanian
Journal of Algorithms
33
(1), 1999, pp. 112-123
A polynomial time algorithm for finding a cycle covering a given set of vertices in a semicomplete multipartite graph
Anders Yeo
Journal of Algorithms
33
(1), 1999, pp. 124-139
Algorithms for polyhedral approximation of multidimensional ellipsoids
Mario A. Lopez
,
Shlomo Reisner
Journal of Algorithms
33
(1), 1999, pp. 140-165
Splitting an expander graph
Alan M. Frieze
,
Michael Molloy
Journal of Algorithms
33
(1), 1999, pp. 166-172
On two segmentation problems
Noga Alon
,
Benny Sudakov
Journal of Algorithms
33
(1), 1999, pp. 173-184
On computing the subset graph of a collection of sets
Paul Pritchard
Journal of Algorithms
33
(2), 1999, pp. 187-203
Interpolation of sparse multivariate polynomials over large finite fields with applications
Ming-Deh A. Huang
,
Ashwin J. Rao
Journal of Algorithms
33
(2), 1999, pp. 204-228
Decremental dynamic connectivity
Mikkel Thorup
Journal of Algorithms
33
(2), 1999, pp. 229-243
Increasing the weight of minimum spanning trees
Greg N. Frederickson
,
Roberto Solis-Oba
Journal of Algorithms
33
(2), 1999, pp. 244-266
Faster subtree isomorphism
Ron Shamir
,
Dekel Tsur
Journal of Algorithms
33
(2), 1999, pp. 267-280
Exploring unknown undirected graphs
Petrişor Panaite
,
Andrzej Pelc
Journal of Algorithms
33
(2), 1999, pp. 281-295
Asymptotically optimal algorithms for job shop scheduling and packet routing
Dimitris Bertsimas
,
David Gamarnik
Journal of Algorithms
33
(2), 1999, pp. 296-318
Lower bounds for the complexity of functions in a realistic RAM model
Nader H. Bshouty
Journal of Algorithms
32
(1), 1999, pp. 1-20
A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph
Vincenzo Auletta
,
Yefim Dinitz
,
Zeev Nutov
,
Domenico Parente
Journal of Algorithms
32
(1), 1999, pp. 21-30
A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs
Yefim Dinitz
,
Zeev Nutov
Journal of Algorithms
32
(1), 1999, pp. 31-40
Approximating the bandwidth for asteroidal triple-free graphs
Ton Kloks
,
Dieter Kratsch
,
Haiko Müller
Journal of Algorithms
32
(1), 1999, pp. 41-57
Bases for polynomial invariants of conjugates of permutation groups
Manfred Göbel
,
Jochen Walter
Journal of Algorithms
32
(1), 1999, pp. 58-61
An algorithm for the modular decomposition of hypergraphs
Paola Bonizzoni
,
Gianluca Della Vedova
Journal of Algorithms
32
(2), 1999, pp. 65-86
Two-connected augmentation problems in planar graphs
J. Scott Provan
,
Roger C. Burk
Journal of Algorithms
32
(2), 1999, pp. 87-107
How to pack trees
Joseph Gil
,
Alon Itai
Journal of Algorithms
32
(2), 1999, pp. 108-132
Seiten 1
2
3
>