1: Online Exploration of Polygons with Holes
2: Approximating Soft-Capacitated Facility Location Problem With Uncertainty
3: Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model
4: Algorithmic Aspects of Homophyly of Networks
5: INSTRUCT: Space-Efficient Structure for Indexing and Complete Query Management of String Databases
6: A new path algorithm for the weighted multi-graphs WMGPA: application to the Direct Topological Method
7: Algorithms for Approximate Minimization of the Difference Between Submodular Functions, with Applications
8: Parameterized Runtime Analyses of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem
9: Playing Mastermind with Many Colors
10: Linear kernels and single-exponential algorithms via protrusion decompositions
11: Theory and Techniques for Synthesizing a Family of Graph Algorithms
12: Incubators vs Zombies: Fault-Tolerant, Short, Thin and Lanky Spanners for Doubling Metrics
13: Optimal Cuts and Bisections on the Real Line in Polynomial Time
14: Sparse Suffix Tree Construction with Small Space
15: The Longest Queue Drop Policy for Shared-Memory Switches is 1.5-competitive
16: Modular Arithmetic Expressions and Primality Testing via DNA Self-Assembly
17: Locally Stable Marriage with Strict Preferences
18: Simple Deterministic Algorithms for Fully Dynamic Maximal Matching
19: On Privacy-Preserving Histograms
20: On the optimality of tree-reweighted max-product message-passing
21: A submodular-supermodular procedure with applications to discriminative structure learning
22: Identifying all abelian periods of a string in quadratic time and relevant problems
23: Advances on Matroid Secretary Problems: Free Order Model and Laminar Case
24: Fast Constructions of Light-Weight Spanners for General Graphs
25: Improved Bounds for Online Preemptive Matching
26: Design, Evaluation and Analysis of Combinatorial Optimization Heuristic Algorithms