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=26
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Ultrafast expected time parallel algorithms
Philip D. MacKenzie
,
Quentin F. Stout
Journal of Algorithms
26
(1), 1998, pp. 1-33
Scheduling interval ordered tasks in parallel
Sivaprakasam Sunder
,
Xin He
Journal of Algorithms
26
(1), 1998, pp. 34-47
Algorithms for graphic polymatroids and parametric
\bar{s}
-sets
Harold N. Gabow
Journal of Algorithms
26
(1), 1998, pp. 48-86
Placing resources on a growing line
Vincenzo Auletta
,
Domenico Parente
,
Giuseppe Persiano
Journal of Algorithms
26
(1), 1998, pp. 87-100
Polygon graph recognition
E.S. Elmallah
,
L.K. Stewart
Journal of Algorithms
26
(1), 1998, pp. 101-140
On approximation algorithms for hierarchical MAX-SAT
Sameet Agarwal
,
Anne Condon
Journal of Algorithms
26
(1), 1998, pp. 141-165
Efficient approximation schemes for maximization problems on
K_{3,3}
-free or
K_5
-free graphs
Zhi-Zhong Chen
Journal of Algorithms
26
(1), 1998, pp. 166-187
Constructing computer virus phylogenies
Leslie Ann Goldberg
,
Paul W. Goldberg
,
Cynthia A. Phillips
,
Gregory B. Sorkin
Journal of Algorithms
26
(1), 1998, pp. 188-208
Convex minimization on a grid and applications
Claudio Mirolo
Journal of Algorithms
26
(2), 1998, pp. 209-237
NC
-approximation schemes for
NP
- and PSPACE-hard problems for geometric graphs
Harry B. Hunt III
,
Madhav V. Marathe
,
Venkatesh Radhakrishnan
,
S.S. Ravi
,
Daniel J. Rosenkrantz
,
Richard E. Stearns
Journal of Algorithms
26
(2), 1998, pp. 238-274
Generating the acyclic orientations of a graph
Matthew B. Squire
Journal of Algorithms
26
(2), 1998, pp. 275-290
A fast and simple algorithm for identifying 2-monotonic positive Boolean functions
Kazuhisa Makino
,
Toshihide Ibaraki
Journal of Algorithms
26
(2), 1998, pp. 291-305
Isomorph-free exhaustive generation
Brendan D. McKay
Journal of Algorithms
26
(2), 1998, pp. 306-324
Interval routing on
k
-trees
Lata Narayanan
,
Naomi Nishimura
Journal of Algorithms
26
(2), 1998, pp. 325-369
More efficient algorithm for ordered tree inclusion
Weimin Chen
Journal of Algorithms
26
(2), 1998, pp. 370-385
Spreading rumors rapidly despite an adversary
James Aspnes
,
William Hurwood
Journal of Algorithms
26
(2), 1998, pp. 386-411