Journal of Algorithms, Volume 27

Volume 27, Number 1, April 1998

• Cyril Gavoille, Eric Guévremont:
  Worst Case Bounds for Shortest Path Interval Routing. 1-25
  
• Anna Galluccio, Martin Loebl:
  Even Directed Cycles in H-Free Digraphs. 26-41
  
• Avner Dor:
  The Greedy Search Algorithm on Binary Vectors. 42-60
  
• Rajeev Motwani:
  Realization of Matrices and Directed Graphs. 61-74
  
• Susanne Albers, Hisashi Koga:
  New On-Line Algorithms for the Page Replication Problem. 75-96
  
• Delma J. Hebert:
  Cyclic Interlaced Quadtree Algorithms for Quincunx Multiresolution. 97-128
  
• Daniel M. Gordon:
  A Survey of Fast Exponentiation Methods. 129-146
  
• Timothy M. Chan:
  Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming. 147-166
  

Volume 27, Number 2, May 1998

• James Gary Propp, David Bruce Wilson:
  How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph. 170-217
  
• Claire Kenyon, Yuval Rabani, Alistair Sinclair:
  Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing. 218-235
  
• Anil Kamath, Omri Palmon, Serge A. Plotkin:
  Routing and Admission Control in General Topology Networks with Poisson Arrivals. 236-258
  
• Rina Panigrahy, Sundar Vishwanathan:
  An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem. 259-268
  
• Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff:
  A Better Approximation Algorithm for Finding Planar Subgraphs. 269-302
  
• Christos Levcopoulos, Drago Krznaric:
  Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation. 303-338
  
• Robert Lupton, F. Miller Maley, Neal E. Young:
  Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic. 339-356
  

Last update Mon May 20 17:57:25 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page