Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes L. Sunil ChandranMathew C. FrancisNaveen Sivadasan OriginalPaper 24 January 2008 Pages: 129 - 140
Note on the Structure of Kruskal’s Algorithm Nicolas BroutinLuc DevroyeErin McLeish OriginalPaper 24 January 2008 Pages: 141 - 159
Augmenting the Connectivity of Outerplanar Graphs A. GarcíaF. HurtadoJ. Tejel OriginalPaper 24 January 2008 Pages: 160 - 179
Fast Dynamic Transitive Closure with Lookahead Piotr SankowskiMarcin Mucha OriginalPaper 25 January 2008 Pages: 180 - 197
Approximation Algorithms for Requirement Cut on Graphs Viswanath NagarajanR. Ravi OriginalPaper 29 January 2008 Pages: 198 - 213
Faster Two Dimensional Scaled Matching Amihood AmirEran Chencinski OriginalPaper 04 March 2008 Pages: 214 - 234
Largest and Smallest Convex Hulls for Imprecise Points Maarten LöfflerMarc van Kreveld OriginalPaper Open access 04 March 2008 Pages: 235 - 269
On the Longest Common Rigid Subsequence Problem Nikhil BansalMoshe LewensteinKaizhong Zhang OriginalPaper 04 March 2008 Pages: 270 - 280