In Memoriam: Ingo Wegener Benjamin DoerrFrank Neumann EditorialNotes Open access 17 November 2009 Pages: 541 - 542
Algorithmic Aspects of Proportional Symbol Maps Sergio CabelloHerman HaverkortBettina Speckmann OriginalPaper Open access 12 February 2009 Pages: 543 - 565
On the Fastest Vickrey Algorithm Elena GrigorievaP. Jean-Jacques HeringsDries Vermeulen OriginalPaper Open access 14 February 2009 Pages: 566 - 590
Approximate Boyer-Moore String Matching for Small Alphabets Leena SalmelaJorma TarhioPetri Kalsi OriginalPaper 18 February 2009 Pages: 591 - 609
Multi-Color Pebble Motion on Graphs Gilad GoralyRefael Hassin OriginalPaper 25 February 2009 Pages: 610 - 636
A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs Louis Ibarra OriginalPaper 28 March 2009 Pages: 637 - 678
The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs Katerina AsdreStavros D. Nikolopoulos OriginalPaper 04 March 2009 Pages: 679 - 710
Computing the Greedy Spanner in Near-Quadratic Time Prosenjit BosePaz CarmiMichiel Smid OriginalPaper 13 March 2009 Pages: 711 - 729
Analysis of the Expected Number of Bit Comparisons Required by Quickselect James Allen FillTakéhiko Nakama OriginalPaper 07 March 2009 Pages: 730 - 769
Fast 3-coloring Triangle-Free Planar Graphs Lukasz Kowalik OriginalPaper 05 March 2009 Pages: 770 - 789
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions Frederic DornEelko PenninkxFedor V. Fomin OriginalPaper 13 March 2009 Pages: 790 - 810