1. Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation

   • Leah Epstein
   • Arik Ganot

   OriginalPaper 27 June 2007 Pages: 431 - 449

2. Synthesis of Autosymmetric Functions in a New Three-Level Form

   • Anna Bernasconi
   • Valentina Ciriani
   • Linda Pagli

   OriginalPaper 29 June 2007 Pages: 450 - 464

3. On “Exploiting” Node-Heterogeneous Clusters Optimally

   • Micah Adler
   • Ying Gong
   • Arnold L. Rosenberg

   OriginalPaper 04 July 2007 Pages: 465 - 487

4. On the Complexity of 2-Monotone Restarting Automata

   • Tomasz Jurdziński
   • Friedrich Otto
   • Martin Plátek

   OriginalPaper 10 July 2007 Pages: 488 - 518

5. Store-and-Forward Multicast Routing on the Mesh

   • Kieran T. Herley
   • Andrea Pietracaprina
   • Geppino Pucci

   OriginalPaper 24 July 2007 Pages: 519 - 535

6. Pattern Matching and Membership for Hierarchical Message Sequence Charts

   • Blaise Genest
   • Anca Muscholl

   OriginalPaper 06 October 2007 Pages: 536 - 567

7. Provably Fast Training Algorithms for Support Vector Machines

   • José L. Balcázar
   • Yang Dai
   • Osamu Watanabe

   OriginalPaper 13 February 2008 Pages: 568 - 595

8. Relations between Average-Case and Worst-Case Complexity

   • A. Pavan
   • N. V. Vinodchandran

   OriginalPaper 13 November 2007 Pages: 596 - 607

9. On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables

   • Manfred Droste
   • Paul Gastin

   OriginalPaper 27 October 2007 Pages: 608 - 631

10. Asymptotically Optimal Solutions for Small World Graphs

    • Michele Flammini
    • Luca Moscardelli
    • Stéphane Pérennes

    OriginalPaper 18 October 2007 Pages: 632 - 650