1: Hard-Clustering with Gaussian Mixture Models
2: Characterizations of symmetrically partial Boolean functions with exact quantum query complexity
3: Robust principal graphs for data approximation
4: Aligning 415 519 proteins in less than two hours on PC
5: A Quantum Version of Sch"oning’s Algorithm Applied to Quantum 2-SAT
6: Cosolver2B: An Efficient Local Search Heuristic for the Travelling Thief Problem
7: Computing Nonsimple Polygons of Minimum Perimeter
8: Computing Equilibria in Markets with Budget-Additive Utilities
9: Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems
10: Efficient Enumeration of Unidirectional Cuts for Technology Mapping of Boolean Networks
11: An effective Time-Aware Map Matching process for low sampling GPS data
12: Parameterized Pattern Matching – Succinctly
13: A General Framework for Estimating Graphlet Statistics via Random Walk
14: Online Budgeted Allocation with General Budgets
15: Approximate Personalized PageRank on Dynamic Graphs
16: An Empirical Study of Online Packet Scheduling Algorithms
17: Experimental Analysis of Algorithms for Coflow Scheduling
18: A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems
19: Shortest (A+B)-path packing via hafnian
20: Binary search trees and rectangulations
21: A Generic Inverted Index Framework for Similarity Search on the GPU - Technical Report