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=32
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
An
n \log n
algorithm for online BDD refinement
Nils Klarlund
Journal of Algorithms
32
(2), 1999, pp. 133-154
Twist-rotation transformations of binary trees and arithmetic expressions
Ming Li
,
Louxin Zhang
Journal of Algorithms
32
(2), 1999, pp. 155-166
Graphs with branchwidth at most three
Hans L. Bodlaender
,
Dimitrios M. Thilikos
Journal of Algorithms
32
(2), 1999, pp. 167-194
Bounding the compression loss of the FGK algorithm
Ruy Luiz Milidiú
,
Eduardo Sany Laber
,
Artur Alves Pessoa
Journal of Algorithms
32
(2), 1999, pp. 195-211