1: Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces
2: Analyzing Boltzmann Samplers for Bose-Einstein Condensates with Dirichlet Generating Functions
3: Odd Multiway Cut in Directed Acyclic Graphs
4: Belief Propagation, Bethe Approximation and Polynomials
5: Distributed rank-1 dictionary learning: Towards fast and scalable solutions for fMRI big data analytics
6: Randomly coloring graphs of bounded treewidth
7: Optimal Identity Testing with High Probability
8: Fast Algorithm for Finding Maximum Distance with Space Subdivision in E2
9: Space Subdivision to Speed-up Convex Hull Construction in E3
10: On Maximum Common Subgraph Problems in Series-Parallel Graphs
11: Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
12: Partial Optimality of Dual Decomposition for MAP Inference in Pairwise MRFs
13: Simple Analysis of Sparse, Sign-Consistent JL
14: Distance-preserving Subgraphs of Interval Graphs
15: Lower bounds for several online variants of bin packing
16: Robust polynomial regression up to the information theoretic limit
17: Nearly Optimal Sparse Group Testing
18: Combinatorial Optimization by Decomposition on Hybrid CPU–non-CPU Solver Architectures
19: Algorithms based on (star)-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
20: An Ensemble Classification Algorithm Based on Information Entropy for Data Streams
21: New Tools and Connections for Exponential-time Approximation
22: An Efficient NPN Boolean Matching Algorithm Based on Structural Signature and Shannon Expansion
23: An Introduction to Quantum Computing, Without the Physics
24: Eigenvalue Decay Implies Polynomial-Time Learnability for Neural Networks
25: Optimal Offline Dynamic $2,3$-Edge/Vertex Connectivity
26: Training Support Vector Machines using Coresets
27: The Parameterized Complexity of Happy Colorings
28: Distributed Exact Weighted All-Pairs Shortest Paths in $\tilde O(n^{5/4})$ Rounds
29: Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time
30: Metric Embedding via Shortest Path Decompositions
31: Solving Hard Stable Matching Problems Involving Groups of Similar Agents
32: A branch, price and remember algorithm for the U shaped assembly line balancing problem