Computing the Map of Geometric Minimal Cuts Jinhui XuLei XuEvanthia Papadopoulou OriginalPaper 24 October 2012 Pages: 805 - 834
Spin-the-Bottle Sort and Annealing Sort: Oblivious Sorting via Round-Robin Random Comparisons Michael T. Goodrich OriginalPaper 25 October 2012 Pages: 835 - 858
Orthogonal Graph Drawing with Flexibility Constraints Thomas BläsiusMarcus KrugDorothea Wagner OriginalPaper 07 November 2012 Pages: 859 - 885
Constructing Minimal Phylogenetic Networks from Softwired Clusters is Fixed Parameter Tractable Steven KelkCeline Scornavacca OriginalPaper 08 November 2012 Pages: 886 - 915
Fast Sequential Importance Sampling to Estimate the Graph Reliability Polynomial David G. HarrisFrancis SullivanIsabel Beichl OriginalPaper 08 November 2012 Pages: 916 - 939
On Cutwidth Parameterized by Vertex Cover Marek CyganDaniel LokshtanovSaket Saurabh OriginalPaper Open access 08 November 2012 Pages: 940 - 953
2-Layer Right Angle Crossing Drawings Emilio Di GiacomoWalter DidimoGiuseppe Liotta OriginalPaper 08 November 2012 Pages: 954 - 997
Dominating Induced Matchings for P 7-Free Graphs in Linear Time Andreas BrandstädtRaffaele Mosca OriginalPaper 10 November 2012 Pages: 998 - 1018
Online Square Packing with Gravity Sándor P. FeketeTom KamphansNils Schweer OriginalPaper 16 November 2012 Pages: 1019 - 1044
Improved Approximation Algorithms for the Average-Case Tree Searching Problem Ferdinando CicaleseTobias JacobsMarco Molinaro OriginalPaper 16 November 2012 Pages: 1045 - 1074
On the Complexity of Time-Dependent Shortest Paths Luca FoschiniJohn HershbergerSubhash Suri OriginalPaper 18 November 2012 Pages: 1075 - 1097