Journal of Algorithms, Volume 7

Volume 7, Number 1, March 1986

• Marinus Veldhorst:
  The Optimal Representation of Disjoint Iso-Oriented Rectangles in Two-Dimensional Trees. 1-34
  
• Donald K. Friesen, Michael A. Langston:
  Evaluation of a MULTIFIT-Based Scheduling Algorithm. 35-59
  
• Mark Jerrum:
  A Compact Representation for Permutation Groups. 60-78
  
• Dorit S. Hochbaum, Takao Nishizeki, David B. Shmoys:
  A Better than "Best Possible" Algorithm to Edge Color Multigraphs. 79-104
  
• Prasoon Tiwari:
  An Efficient Parallel Algorithm for Shifting the Root of a Depth First Spanning Tree. 105-119
  
• Miroslawa Skowronska, Maciej M. Syslo, Christina Zamfirescu:
  An Algorithmic Characterization of Total Digraphs. 120-133
  
• Esther M. Arkin, Christos H. Papadimitriou:
  On the Complexity of Circulations. 134-145
  
• Ouri Wolfson:
  An Algorithm for Early Unlocking of Entities in Database Transactions. 146-156
  

Volume 7, Number 2, June 1986

• Robert Sedgewick:
  A New Upper Bound for Shellsort. 159-173
  
• Martin E. Dyer, Alan M. Frieze:
  Planar 3DM is NP-Complete. 174-184
  
• Marc Snir:
  Depth-Size Trade-Offs for Parallel Prefix Computation. 185-201
  
• Richard Cole:
  Searching and Storing Similar Lists. 202-220
  
• Takao Asano, Tetsuo Asano, Ron Y. Pinter:
  Polygon Triangulation: Efficiency and Minimality. 221-231
  
• Raghunath Raghavan, James Cohoon, Sartaj Sahni:
  Single Bend Wiring. 232-257
  
• Joseph O'Rourke, Alok Aggarwal, Sanjeev R. Maddila, Michael Baldwin:
  An Optimal Algorithm for Finding Minimal Enclosing Triangles. 258-269
  
• Max L. Warshauer:
  Conway's Parallel Sorting Algorithm. 270-276
  
• Michael Werman, Shmuel Peleg, Robert Melter, T. Yung Kong:
  Bipartite Graph Matching for Points on a Line or a Circle. 277-284
  
• Mikhail J. Atallah:
  Computing the Convex Hull of Line Intersections. 285-288
  
• David S. Johnson:
  The NP-Completeness Column: An Ongoing Guide. 289-305
  

Volume 7, Number 3, September 1986

• Neil Robertson, Paul D. Seymour:
  Graph Minors. II. Algorithmic Aspects of Tree-Width. 309-322
  
• J. L. Lewandowski, C. L. Liu, Jane W.-S. Liu:
  An Algorithmic Proof of a Generalization of the Birkhoff-Von Neumann Theorem. 323-330
  
• Tuvi Etzion:
  An Algorithm for Constructing m-ary de Bruijn Sequences. 331-340
  
• Mai Thanh, Vangalur S. Alagar, T. D. Bui:
  Optimal Expected-Time Algorithms for Merging. 341-357
  
• Nimrod Megiddo, Eitan Zemel:
  An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem. 358-368
  
• Alok Aggarwal, Robert Melville:
  Fast Computation of the Modality of Polygons. 369-381
  
• Dana S. Richards:
  Finding Short Cycles in Planar Graphs Using Separators. 382-394
  
• Keith Brinck:
  On Deletion in Threaded Binary Trees. 395-411
  
• James H. Hester, Daniel S. Hirschberg, S.-H. H. Huang, C. K. Wong:
  Faster Construction of Optimal Binary Split Trees. 412-424
  
• J. M. Robson:
  Algorithms for Maximum Independent Sets. 425-440
  
• Mike Paterson, F. Frances Yao:
  Point Retrieval for Polygons. 441-447
  

Volume 7, Number 4, December 1986

• Ker-I Ko, Shia-Chung Teng:
  On the Number of Queries Necessary to Identify a Permutation. 449-462
  
• Philippe Flajolet, Nasser Saheb:
  The Complexity of Generating an Exponentially Distributed Variate. 463-488
  
• Micha Hofri, Sami Kamhi:
  A Stochastic Analysis of the NFD Bin-Packing Algorithm. 489-509
  
• Michael Kaufmann, Kurt Mehlhorn:
  Routing Through a Generalized Switchbox. 510-531
  
• Brenda S. Baker, Steven Fortune, Stephen R. Mahaney:
  Polygon Containment under Translation. 532-548
  
• Pawel Winter:
  Generalized Steiner Problem in Series-Parallel Networks. 549-566
  
• Noga Alon, László Babai, Alon Itai:
  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. 567-583
  
• David S. Johnson:
  The NP-Completeness Column: An Ongoing Guide. 584-601
  

Last update Tue Feb 14 04:19:57 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page