Journal of Algorithms, Volume 58

Volume 58, Number 1, January 2006

• Zheng Sun, John H. Reif:
  On finding approximate optimal paths in weighted regions. 1-32
  Electronic Edition (link) BibTeX
• Anne Berry, Jean Paul Bordat, Pinar Heggernes, Geneviève Simonet, Yngve Villanger:
  A wide-range algorithm for minimal triangulation from an arbitrary ordering. 33-66
  Electronic Edition (link) BibTeX
• Guillermo Durán, Agustín Gravano, Ross M. McConnell, Jeremy Spinrad, Alan Tucker:
  Polynomial time recognition of unit circular-arc graphs. 67-78
  Electronic Edition (link) BibTeX

Volume 58, Number 2, February 2006

• Arye Barkan, Haim Kaplan:
  Partial alphabetic trees. 81-103
  Electronic Edition (link) BibTeX
• Jop F. Sibeyn:
  External selection. 104-117
  Electronic Edition (link) BibTeX
• Igor E. Zverovich:
  A new kind of graph coloring. 118-133
  Electronic Edition (link) BibTeX
• Ian F. Blake, V. Kumar Murty, Guangwu Xu:
  Refinements of Miller's algorithm for computing the Weil/Tate pairing. 134-149
  Electronic Edition (link) BibTeX
• Aranyak Mehta, Scott Shenker, Vijay V. Vazirani:
  Posted price profit maximization for multicast by approximating fixed points. 150-164
  Electronic Edition (link) BibTeX