1: A MILP model for an extended version of the Flexible Job Shop Problem
2: Better Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring
3: Improved analysis of D2-sampling based PTAS for k-means and other Clustering problems
4: An Experimental Evaluation of List Coloring Algorithms
5: Large neighborhoods with implicit customer selection for vehicle routing problems with profits
6: Soft Constraints of Difference and Equality
7: Scheduling Bipartite Tournaments to Minimize Total Travel Distance
8: Preserving the Basic Property of Stable Matching by Deleting a pair
9: Consistency Techniques for Flow-Based Projection-Safe Global Cost Functions in Weighted Constraint Satisfaction
10: Computing All-Pairs Shortest Paths by Leveraging Low Treewidth
11: Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach
12: Finding minimum Tucker submatrices
13: A domination algorithm for ${0,1}$-instances of the travelling salesman problem
14: Light spanners for snowflake metrics
15: Fully Online Grammar Compression in Constant Space
16: Stable Roommates Problem with Random Preferences
17: A Distributed Minimum Cut Approximation Scheme