Practical and Efficient Circle Graph Recognition Emeric GioanChristophe PaulDerek Corneil OriginalPaper 07 March 2013 Pages: 759 - 788
Practical and Efficient Split Decomposition via Graph-Labelled Trees Emeric GioanChristophe PaulDerek Corneil OriginalPaper 07 March 2013 Pages: 789 - 843
On the Advantage of Overlapping Clusters for Minimizing Conductance Rohit KhandekarGuy KortsarzVahab Mirrokni OriginalPaper 06 March 2013 Pages: 844 - 863
An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs Feodor F. DraganEkkehard Köhler OriginalPaper 14 March 2013 Pages: 884 - 905
Optimal Indexes for Sparse Bit Vectors Alexander GolynskiAlessio OrlandiS. Srinivasa Rao OriginalPaper 16 March 2013 Pages: 906 - 924
Computing the Throughput of Probabilistic and Replicated Streaming Applications Anne BenoitMatthieu GalletYves Robert OriginalPaper 27 March 2013 Pages: 925 - 957