1. Practical and Efficient Circle Graph Recognition

   • Emeric Gioan
   • Christophe Paul
   • Derek Corneil

   OriginalPaper 07 March 2013 Pages: 759 - 788

   

2. Practical and Efficient Split Decomposition via Graph-Labelled Trees

   • Emeric Gioan
   • Christophe Paul
   • Derek Corneil

   OriginalPaper 07 March 2013 Pages: 789 - 843

   

3. On the Advantage of Overlapping Clusters for Minimizing Conductance

   • Rohit Khandekar
   • Guy Kortsarz
   • Vahab Mirrokni

   OriginalPaper 06 March 2013 Pages: 844 - 863

4. Cache-Oblivious Hashing

   • Rasmus Pagh
   • Zhewei Wei
   • Qin Zhang

   OriginalPaper 08 March 2013 Pages: 864 - 883

   

5. An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs

   • Feodor F. Dragan
   • Ekkehard Köhler

   OriginalPaper 14 March 2013 Pages: 884 - 905

   

6. Optimal Indexes for Sparse Bit Vectors

   • Alexander Golynski
   • Alessio Orlandi
   • S. Srinivasa Rao

   OriginalPaper 16 March 2013 Pages: 906 - 924

7. Computing the Throughput of Probabilistic and Replicated Streaming Applications

   • Anne Benoit
   • Matthieu Gallet
   • Yves Robert

   OriginalPaper 27 March 2013 Pages: 925 - 957

   

8. Multikey Quickselect

   • Leonor Frias
   • Salvador Roura

   OriginalPaper 05 April 2013 Pages: 958 - 973