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=21
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Augmenting outerplanar graphs
Goos Kant
Journal of Algorithms
21
(1), 1996, pp. 1-25
Determining the evolutionary tree using experiments
Sampath K. Kannan
,
Eugene L. Lawler
,
Tandy J. Warnow
Journal of Algorithms
21
(1), 1996, pp. 26-50
Cycles of prescribed modularity in planar digraphs
Anna Galluccio
,
Martin Loebl
Journal of Algorithms
21
(1), 1996, pp. 51-70
Very fast approximation of the matrix chain product problem
Artur Czumaj
Journal of Algorithms
21
(1), 1996, pp. 71-79
Repetitive hidden surface removal for polyhedra
Marco Pellegrini
Journal of Algorithms
21
(1), 1996, pp. 80-101
Best first search algorithm in AND/OR graphs with cycles
Dus̑an Hvalica
Journal of Algorithms
21
(1), 1996, pp. 102-110
On envelopes of arrangements of lines
D. Eu
,
E. Guévremont
,
G.T. Toussaint
Journal of Algorithms
21
(1), 1996, pp. 111-148
Randomized on-line scheduling of parallel jobs
Jiȓí Sgall
Journal of Algorithms
21
(1), 1996, pp. 149-175
Generating and counting Hamilton cycles in random regular graphs
Alan Frieze
,
Mark Jerrum
,
Michael Molloy
,
Robert Robinson
,
Nicholas Wormald
Journal of Algorithms
21
(1), 1996, pp. 176-198
On-line planar graph embedding
Roberto Tamassia
Journal of Algorithms
21
(2), 1996, pp. 201-239
On computing the nested sums and infimal convolutions of convex piecewise-linear functions
Paul Tseng
,
Zhi-Quan Luo
Journal of Algorithms
21
(2), 1996, pp. 240-266
An incremental algorithm for a generalization of the shortest-path problem
G. Ramalingam
,
Thomas Reps
Journal of Algorithms
21
(2), 1996, pp. 267-305
Approximation algorithms for Min-
k
-overlap problems using the prinicipal lattice of partitions approach
H. Narayanan
,
Subir Roy
,
Sachin Patkar
Journal of Algorithms
21
(2), 1996, pp. 306-330
Efficient parallel shortest-paths in digraphs with a separator decomposition
Edith Cohen
Journal of Algorithms
21
(2), 1996, pp. 331-357
Efficient and constructive algorithms for the pathwidth and treewidth of graphs
Hans L. Bodlaender
,
Ton Kloks
Journal of Algorithms
21
(2), 1996, pp. 358-402
Approximation algorithms for network design problems on bounded subsets
Dorit S. Hochbaum
,
Joseph (Seffi) Naor
Journal of Algorithms
21
(2), 1996, pp. 403-414
Single-machine scheduling to minimize a fuction of two or three maximum cost criteria
J.A. Hoogeveen
Journal of Algorithms
21
(2), 1996, pp. 415-433
Improved approximation algorithms for uniform connectivity problems
Samir Khuller
,
Balaji Raghavachari
Journal of Algorithms
21
(2), 1996, pp. 434-450
Off-line maintenance of planar configurations
John Hershberger
,
Subhash Suri
Journal of Algorithms
21
(3), 1996, pp. 453-475
Large deviations for Quicksort
C.J.H. McDiarmid
,
R.B. Hayward
Journal of Algorithms
21
(3), 1996, pp. 476-507
Ray shooting amidst convex polygons in 2D
Pankaj K. Agarwal
,
Micha Sharir
Journal of Algorithms
21
(3), 1996, pp. 508-519
Enclosing a set of objects by two minimum area rectangles
Bruno Becker
,
Paolo Giulio Franciosa
,
Stephan Gschwind
,
Stefano Leonardi
,
Thomas Ohler
,
Peter Widmayer
Journal of Algorithms
21
(3), 1996, pp. 520-541
The isomorphism problem for directed path graphs and for rooted directed path graphs
L. Babel
,
I.N. Ponomarenko
,
G. Tinhofer
Journal of Algorithms
21
(3), 1996, pp. 542-564
The generalized Gauss reduction algorithm
Michael Kaib
,
Claus P. Schnorr
Journal of Algorithms
21
(3), 1996, pp. 565-578
On linear-time deterministic algorithms for optimization problems in fixed dimension
Bernard Chazelle
,
Jiȓí Matous̑ek
Journal of Algorithms
21
(3), 1996, pp. 579-597
Seiten 1
2
>