1. How to Use Spanning Trees to Navigate in Graphs

   • Feodor F. Dragan
   • Yang Xiang

   OriginalPaper 18 April 2012 Pages: 479 - 511

   

2. Efficient Coordination Mechanisms for Unrelated Machine Scheduling

   • Ioannis Caragiannis

   OriginalPaper 25 April 2012 Pages: 512 - 540

3. Recognizing d-Interval Graphs and d-Track Interval Graphs

   • Minghui Jiang

   OriginalPaper 24 April 2012 Pages: 541 - 563

   

4. Approximate Guarding of Monotone and Rectilinear Polygons

   • Erik A. Krohn
   • Bengt J. Nilsson

   OriginalPaper 06 June 2012 Pages: 564 - 594

   

5. Median Trajectories

   • Kevin Buchin
   • Maike Buchin
   • Lionov Wiratma

   OriginalPaper Open access 05 May 2012 Pages: 595 - 614

   

6. Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs

   • Avivit Lazar
   • Arie Tamir

   OriginalPaper 10 May 2012 Pages: 615 - 640

7. On Finding Min-Min Disjoint Paths

   • Longkun Guo
   • Hong Shen

   OriginalPaper 18 May 2012 Pages: 641 - 653

   

8. A Linear Time Algorithm for L(2,1)-Labeling of Trees

   • Toru Hasunuma
   • Toshimasa Ishii
   • Yushi Uno

   OriginalPaper 19 May 2012 Pages: 654 - 681

   

9. Approximating Points by a Piecewise Linear Function

   • Danny Z. Chen
   • Haitao Wang

   OriginalPaper 18 May 2012 Pages: 682 - 713

   

10. Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets

    • K. T. Huber
    • V. Moulton

    OriginalPaper 19 May 2012 Pages: 714 - 738