1. Foreword

   • Mirka Miller
   • Koichi Wada

   OriginalPaper 27 November 2009 Pages: 1 - 2

2. Partitioning Bispanning Graphs into Spanning Trees

   • Matthias Baumgart

   OriginalPaper 27 November 2009 Pages: 3 - 15

3. Finding Range Minima in the Middle: Approximations and Applications

   • Johannes Fischer
   • Volker Heun

   OriginalPaper 27 November 2009 Pages: 17 - 30

4. Loose Cover of Graphs

   • Satoshi Fujita

   OriginalPaper 27 November 2009 Pages: 31 - 38

5. On Partitional Labelings of Graphs

   • Rikio Ichishima
   • Akito Oshima

   OriginalPaper 10 December 2009 Pages: 39 - 45

6. An Improved Version of Cuckoo Hashing: Average Case Analysis of Construction Cost and Search Operations

   • Reinhard Kutzelnigg

   OriginalPaper 27 November 2009 Pages: 47 - 60

7. k-Phase Oscillator Synchronization for Graph Coloring

   • Sof Anthony Lee

   OriginalPaper 27 November 2009 Pages: 61 - 72

8. Preemptive Scheduling of Equal-Length Jobs in Polynomial Time

   • George B. Mertzios
   • Walter Unger

   OriginalPaper 27 November 2009 Pages: 73 - 84

9. An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs

   • George B. Mertzios
   • Walter Unger

   OriginalPaper 16 December 2009 Pages: 85 - 96

10. On Conditional Covering Problem

    • Balasubramanian Sivan
    • S. Harini
    • C. Pandu Rangan

    OriginalPaper 14 November 2009 Pages: 97 - 107

11. On the Pagenumber of the Cube-Connected Cycles

    • Yuuki Tanaka
    • Yukio Shibata

    OriginalPaper 27 November 2009 Pages: 109 - 117

12. New Results on EX Graphs

    • Jianmin Tang
    • Yuqing Lin
    • Mirka Miller

    OriginalPaper 27 November 2009 Pages: 119 - 126