Algorithmica, Volume 51, 2008

Volume 51, Number 1, May 2008

• Zhi-Zhong Chen:
  Approximation Algorithms for Bounded Degree Phylogenetic Roots. 1-23
  Electronic Edition (link) BibTeX
• Shirley Halevy, Eyal Kushilevitz:
  Distribution-Free Connectivity Testing for Sparse Graphs. 24-48
  Electronic Edition (link) BibTeX
• Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
  Tight Results on Minimum Entropy Set Cover. 49-60
  Electronic Edition (link) BibTeX
• Christian Boulinier, Franck Petit, Vincent Villain:
  Synchronous vs. Asynchronous Unison. 61-80
  Electronic Edition (link) BibTeX
• Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster:
  Treewidth Lower Bounds with Brambles. 81-98
  Electronic Edition (link) BibTeX

Volume 51, Number 2, June 2008

• Iyad A. Kanj, Luay Nakhleh, Ge Xia:
  The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms. 99-128
  Electronic Edition (link) BibTeX
• Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Eduardo D. Sontag:
  Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs. 129-159
  Electronic Edition (link) BibTeX
• Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
  Property-Preserving Data Reconstruction. 160-182
  Electronic Edition (link) BibTeX
• Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli:
  Grouping Techniques for Scheduling Problems: Simpler and Faster. 183-199
  Electronic Edition (link) BibTeX
• Bernd Gärtner, Walter D. Morris Jr., Leo Rüst:
  Unique Sink Orientations of Grids. 200-235
  Electronic Edition (link) BibTeX

Volume 51, Number 3, July 2008

• Xiaotie Deng, Ding-Zhu Du:
  Preface. 237-238
  Electronic Edition (link) BibTeX
• Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
  Generating Cut Conjunctions in Graphs and Related Problems. 239-263
  Electronic Edition (link) BibTeX
• Jianxi Fan, Xiaohua Jia, Xiaola Lin:
  Embedding of Cycles in Twisted Cubes with Edge-Pancyclic. 264-282
  Electronic Edition (link) BibTeX
• Lusheng Wang, Kaizhong Zhang:
  Space Efficient Algorithms for Ordered Tree Comparison. 283-297
  Electronic Edition (link) BibTeX
• Tak Wah Lam, Wing-Kin Sung, Swee-Seong Wong:
  Improved Approximate String Matching Using Compressed Suffix Data Structures. 298-314
  Electronic Edition (link) BibTeX
• Marios Mavronicolas, Vicky Papadopoulou, Anna Philippou, Paul G. Spirakis:
  A Network Game with Attackers and a Defender. 315-341
  Electronic Edition (link) BibTeX
• Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi:
  A (2-c(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem. 342-356
  Electronic Edition (link) BibTeX
• Li-Sha Huang:
  A Primal-Dual Algorithm for the Computation of Market Equilibrium with Logarithmic Utility Functions. 357-366
  Electronic Edition (link) BibTeX

Volume 51, Number 4, August 2008

• Wojciech Jawor, Marek Chrobak, Christoph Dürr:
  Competitive Analysis of Scheduling Algorithms for Aggregated Links. 367-386
  Electronic Edition (link) BibTeX
• Camil Demetrescu, Giuseppe F. Italiano:
  Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure. 387-427
  Electronic Edition (link) BibTeX
• Yijie Han:
  An O ( n ³(log log n /log n )^5/4) Time Algorithm for All Pairs Shortest Path. 428-434
  Electronic Edition (link) BibTeX
• Guojun Li, Zhijie Liu, Jun-tao Guo, Ying Xu:
  An Algorithm for Simultaneous Backbone Threading and Side-Chain Packing. 435-450
  Electronic Edition (link) BibTeX
• Natalia V. Shakhlevich, Vitaly A. Strusevich:
  Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times. 451-473
  Electronic Edition (link) BibTeX