1: An Algorithm for $L_\infty$ Approximation by Step Functions
2: A New Exact Algorithm for Traveling Salesman Problem with Time Complexity Interval (O(n^4), O(n^3(star)2^n))
3: Exploiting Packing Components in General-Purpose Integer Programming Solvers
4: Computational Protein Design Using AND/OR Branch-and-Bound Search
5: Computing Exact Distances in the Congested Clique
6: A Robust and Scalable Algorithm for the Steiner Problem in Graphs
7: Optimal Reduced Isotonic Regression
8: Max vs Min: Tensor Decomposition and ICA with nearly Linear Sample Complexity
9: Computing Covers Using Prefix Tables
10: Parameterized and Approximation Algorithms for the Load Coloring Problem
11: Clique-Relaxed Competitive Graph Coloring
12: Numeric certified algorithm for the topology of resultant and discriminant curves
13: Empirical Algorithmics: draw your own conclusions
14: Computational Complexity of Competitive Diffusion on (Un)weighted Graphs
15: On DDoS Attack Related Minimum Cut Problems
16: Approximation of Distances and Shortest Paths in the Broadcast Congest Clique
17: Online Covering with Convex Objectives and Applications
18: On martingale tail sums for the path length in random trees
19: Bounded-degree factors of lacunary multivariate polynomials
20: Run-Length Encoded Nondeterministic KMP and Suffix Automata
21: Covering Problems for Partial Words and for Indeterminate Strings
22: Approximation Algorithms for Budget Constrained Network Upgradeable Problems
23: Fully Dynamic All Pairs All Shortest Paths
24: The Parameterized Complexity of Graph Cyclability
25: Reconfiguration of Cliques in a Graph
26: Complexity issues in some clustering problems in combinatorial circuits
27: Proceedings 3rd International Workshop on Trends in Functional Programming in Education
28: Permutation Reconstruction from MinMax-Betweenness Constraints
29: On the complexity of computing MP distance between binary phylogenetic trees
30: Faster Sparse Multivariate Polynomial Interpolation of Straight-Line Programs
31: Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion