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=19
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast parallel algorithms for all-sources lexicographic search and path-algebra problems
Pilar de la Torre
,
Clyde P. Kruskal
Journal of Algorithms
19
(1), 1995, pp. 1-24
Self-adjusting
k
-ary search trees
Murray Sherk
Journal of Algorithms
19
(1), 1995, pp. 25-44
Using cellular graph embeddings in solving all pairs shortest paths problems
Greg N. Frederickson
Journal of Algorithms
19
(1), 1995, pp. 45-85
Growing a tree from its branches
Prosenjit Bose
,
Godfried Toussaint
Journal of Algorithms
19
(1), 1995, pp. 86-103
A nearly best-possible approximation algorithm for node-weighted Steiner trees
Philip Klein
,
R. Ravi
Journal of Algorithms
19
(1), 1995, pp. 104-115
Efficient minimum cost matching and transportation using the quadrangle inequality
Alok Aggarwal
,
Amotz Bar-Noy
,
Samir Khuller
,
Dina Kravets
,
Baruch Schieber
Journal of Algorithms
19
(1), 1995, pp. 116-143
Independent sets in circular-arc graphs
Wen-Lian Hsu
,
Jeremy P. Spinrad
Journal of Algorithms
19
(2), 1995, pp. 145-160
Fractional cascading revisited
Sandeep Sen
Journal of Algorithms
19
(2), 1995, pp. 161-172
NC
-algorithms for minimum link path and related problems
Vijay Chandru
,
Subir Kumar Ghosh
,
Anil Maheshwari
,
V.T. Rajan
,
Sanjeev Saluja
Journal of Algorithms
19
(2), 1995, pp. 173-203
Coloring random and semi-random
k
-colorable graphs
Avrim Blum
,
Joel Spencer
Journal of Algorithms
19
(2), 1995, pp. 204-234
Optimal partitioning of sequences
Fredrik Manne
,
Tor Sorevik
Journal of Algorithms
19
(2), 1995, pp. 235-249
Counting the integers factorable via cyclotomic methods
Carl Pomerance
,
Jonathan Sorenson
Journal of Algorithms
19
(2), 1995, pp. 250-265
Treewidth of chordal bipartite graphs
T. Kloks
,
D. Kratsch
Journal of Algorithms
19
(2), 1995, pp. 266-281
Further results on generalized intersection searching problems: Counting, reporting, and dynamization
Prosenjit Gupta
,
Ravi Janardan
,
Michiel Smid
Journal of Algorithms
19
(2), 1995, pp. 282-317
An Improved algorithm for the traveler's problem
Alok Aggarwal
,
Takeshi Tokuyama
Journal of Algorithms
19
(2), 1995, pp. 318-330
A polynomial algorithm for homomorphisms to oriented cycles
Xuding Zhu
Journal of Algorithms
19
(3), 1995, pp. 333-345
A subquadratic algorithm for approximate regular expression matching
Sun Wu
,
Udi Manber
,
Eugene Myers
Journal of Algorithms
19
(3), 1995, pp. 346-360
k-k
routing,
k-k
sorting, and cut-through routing on the mesh
Sanguthevar Rajasekaran
Journal of Algorithms
19
(3), 1995, pp. 361-382
A parallel algorithm for computing minimum spanning trees
Donald B. Johnson
,
Panagiotis Metaxas
Journal of Algorithms
19
(3), 1995, pp. 383-401
How many comparisons does Quicksort use?
William F. Eddy
,
Mark J. Schervish
Journal of Algorithms
19
(3), 1995, pp. 402-431
A parallel reduction of Hamiltonian cycle to Hamiltonian path in tournaments
E. Bampis
,
M. El Haddad
,
Y. Manoussakis
,
M. Santha
Journal of Algorithms
19
(3), 1995, pp. 432-440
An algorithm for the determination of the variance of a partially ordered set
Konrad Engel
Journal of Algorithms
19
(3), 1995, pp. 441-448
Graph sandwich problems
Martin Charles Golumbic
,
Haim Kaplan
,
Ron Shamir
Journal of Algorithms
19
(3), 1995, pp. 449-473
Static and dynamic algorithms for
k
-point clustering problems
Amitava Datta
,
Hans-Peter Lenhof
,
Christian Schwarz
,
Michiel Smid
Journal of Algorithms
19
(3), 1995, pp. 474-503