Local Computation Algorithms for Graphs of Non-constant Degrees Reut LeviRonitt RubinfeldAnak Yodpinyanee OriginalPaper 02 February 2016 Pages: 971 - 994
Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games Carlo CominRomeo Rizzi OriginalPaper 02 February 2016 Pages: 995 - 1021
Strip Planarity Testing for Embedded Planar Graphs Patrizio AngeliniGiordano Da LozzoFabrizio Frati OriginalPaper 08 February 2016 Pages: 1022 - 1059
An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths Piotr MicekVeit Wiechert OriginalPaper Open access 09 February 2016 Pages: 1060 - 1070
Extending Partial Representations of Proper and Unit Interval Graphs Pavel KlavíkJan KratochvílTomáš Vyskočil OriginalPaper 25 February 2016 Pages: 1071 - 1104
A Constant Factor Approximation Algorithm for the Storage Allocation Problem Reuven Bar-YehudaMichael BederDror Rawitz OriginalPaper 03 March 2016 Pages: 1105 - 1127
Finding a Shortest Non-zero Path in Group-Labeled Graphs via Permanent Computation Yusuke KobayashiSho Toyooka OriginalPaper 10 March 2016 Pages: 1128 - 1142
Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games Ioannis CaragiannisAngelo FanelliNick Gravin OriginalPaper 10 March 2016 Pages: 1143 - 1158
A Generalization of Multiple Choice Balls-into-Bins: Tight Bounds Gahyun Park OriginalPaper 17 March 2016 Pages: 1159 - 1193
Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet Tomasz KociumakaJakub RadoszewskiWojciech Rytter OriginalPaper Open access 21 March 2016 Pages: 1194 - 1215
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands Rajesh ChitnisHossein EsfandiariSaeed Seddighin OriginalPaper 29 March 2016 Pages: 1216 - 1239
Optimal Program-Size Complexity for Self-Assembled Squares at Temperature 1 in 3D David FurcySamuel MickaScott M. Summers OriginalPaper 31 March 2016 Pages: 1240 - 1282
Finding Dominating Induced Matchings in \(P_8\)-Free Graphs in Polynomial Time Andreas BrandstädtRaffaele Mosca OriginalPaper 25 April 2016 Pages: 1283 - 1302