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=18
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On finding minimal two-connected subgraphs
Pierre Kelsen
,
Vijaya Ramachandran
Journal of Algorithms
18
(1), 1995, pp. 1-49
An asynchronous parallel algorithm for undirected graph connectivity
Richard Cole
,
Ofer Zajicek
Journal of Algorithms
18
(1), 1995, pp. 50-97
Scheduling with concurrency-based constraints
Bonnie Berger
,
Lenore Cowen
Journal of Algorithms
18
(1), 1995, pp. 98-123
On nonpreepmtive LCFS scheduling with deadlines
U. Schmid
,
J. Blieberger
Journal of Algorithms
18
(1), 1995, pp. 124-158
Constructing reliable communication networks of small weight online
Barun Chandra
,
Sundar Vishwanathan
Journal of Algorithms
18
(1), 1995, pp. 159-175
The parallel complexity of tree embedding problems
Arvind Gupta
,
Naomi Nishimura
Journal of Algorithms
18
(1), 1995, pp. 176-200
An efficient parallel algorithm for finding Hamiltonian cycles in dense directed graphs
Martin Fürer
,
Balaji Raghavachari
Journal of Algorithms
18
(2), 1995, pp. 203-220
The competitiveness of on-line assignments
Jossi Azar
,
Joseph (Seffi) Naor
,
Raphael Rom
Journal of Algorithms
18
(2), 1995, pp. 221-237
Approximating treewidth, pathwidth, frontsize, and shortes elimination tree
Hans L. Bodlaender
,
John R. Gilbert
,
Hjálmtýr Hafsteinsson
,
Ton Kloks
Journal of Algorithms
18
(2), 1995, pp. 238-255
Two-and three-dimensional point location in rectangular subdivisions
Mark de Berg
,
Marc van Kreveld
,
Jack Snoeyink
Journal of Algorithms
18
(2), 1995, pp. 256-277
Dictionary-matching on unbounded alphabets: Uniform length dictionaries
Dany Breslauer
Journal of Algorithms
18
(2), 1995, pp. 278-295
Edge coloring series parallel graphs
Yuval Caspi
,
Eliezer Dekel
Journal of Algorithms
18
(2), 1995, pp. 296-321
The complexity of data reduction on a reconfigurable linear array
Yosi Ben-Asher
,
Assaf Schuster
Journal of Algorithms
18
(2), 1995, pp. 322-357
Algorithms for page retrieval and Hamiltonian paths on forward-convex line graphs
Ten-Hwang Lai
,
Shu-Shang Wei
Journal of Algorithms
18
(2), 1995, pp. 358-375
Finding connected components in
O(\log n\log\log n)
time on the EREW PRAM
Ka Wong Chong
,
Tak Wah Lam
Journal of Algorithms
18
(3), 1995, pp. 378-402
A pedestrian approach to ray shooting: Shoot a ray, take a walk
John Hershberger
,
Subhash Suri
Journal of Algorithms
18
(3), 1995, pp. 403-431
Data structures for traveling salesmen
M.L. Fredman
,
D.S. Johnson
,
L.A. McGeoch
,
G. Ostheimer
Journal of Algorithms
18
(3), 1995, pp. 432-479
On traversing layered graphs on-line
H. Ramesh
Journal of Algorithms
18
(3), 1995, pp. 480-512
Confluently persistent deques via data-structural bootstrapping
Adam L. Buchsbaum
,
Robert E. Tarjan
Journal of Algorithms
18
(3), 1995, pp. 513-547
A Delaunay refinement algorithm for quality 2-dimensional mesh generation
Jim Ruppert
Journal of Algorithms
18
(3), 1995, pp. 548-585
Centroids, representations, and submodular flows
Harold N. Gabow
Journal of Algorithms
18
(3), 1995, pp. 586-628
Fast deterministic processor allocation
Torben Hagerup
Journal of Algorithms
18
(3), 1995, pp. 629-649