Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarJournal of Algorithms, Volume 14
Volume 14, Number 1, January 1993
- Jianzhong Du, Joseph Y.-T. Leung:
Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops. 24-44 - Jianzhong Du, Joseph Y.-T. Leung:
Minimizing Mean Flow Time with Release Time and Deadline Constraints. 45-68 - Pavol Hell, David G. Kirkpatrick:
Algorithms for Degree Constrained Graph Factors of Minimum Deficiency. 115-138 - Jeong-In Doh, Kyung-Yong Chwa:
An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment. 139-168
Volume 14, Number 2, March 1993
- David Pearson, Vijay V. Vazirani:
Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets. 171-179 - Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya:
Sublinear-Time Parallel Algorithms for Matching and Related Problems. 180-213 - Oscar H. Ibarra, Hui Wang, Tao Jiang:
On Efficient Parallel Algorithms for Solving Set Recurrence Equations. 244-257 - Krzysztof Diks, Hristo Djidjev, Ondrej Sýkora, Imrich Vrto:
Edge Separators of Planar and Outerplanar Graphs with Applications. 258-279
Volume 14, Number 3, May 1993
- Philip N. Klein:
Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs. 331-343 - Omer Berkman, Baruch Schieber, Uzi Vishkin:
Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values. 344-370
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-25 19:18 CEST by the dblp team