1: Prismatic Algorithm for Discrete D.C. Programming Problems
2: Lagrangian Relaxation Applied to Sparse Global Network Alignment
3: On Compressing Permutations and Adaptive Sorting
4: Parameterized Complexity of MaxSat Above Average
5: Capacitated Domination: Constant Factor Approximation for Planar Graphs
6: A note on efficient computation of hybridization number via softwired clusters
7: Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Short)
8: Constraint Satisfaction Problems Parameterized Above or Below Tight Bounds: A Survey
9: A $(k + 3)/2$-approximation algorithm for monotone submodular maximization over a $k$-exchange system
10: RBO Protocol: Broadcasting Huge Databases for Tiny Receivers
11: Confluent Hasse diagrams
12: Solving Hard Computational Problems Efficiently: Asymptotic Parametric Complexity 3-Coloring Algorithm
13: Linear Time Inference of Strings from Cover Arrays using a Binary Alphabet
14: Deciding first order logic properties of matroids
15: New Results on the Fault-Tolerant Facility Placement Problem