1: Maximum Persistency via Iterative Relaxed Inference with Graphical Models
2: Simultaneous Embeddings with Few Bends and Crossings
3: Explicit resilient functions matching Ajtai-Linial
4: Bounds and Fixed-Parameter Algorithms for Weighted Improper Coloring (Extended Version)
5: Towards Tight Bounds for the Streaming Set Cover Problem
6: On Minimizing Crossings in Storyline Visualizations
7: Gaussian random projections for Euclidean membership problems
8: Extremal Distances for Subtree Transfer Operations in Binary Trees
9: L-Drawings of Directed Graphs
10: Variants of Plane Diameter Completion
11: Finding Near-Optimal Independent Sets at Scale
12: A note on Probably Certifiably Correct algorithms
13: Strong Pseudoprimes to Twelve Prime Bases
14: Testing Properties of Functions on Finite Groups
15: On the Equivalence among Problems of Bounded Width
16: Finding the Leftmost Critical Factorization on Unordered Alphabet
17: Advanced Multilevel Node Separator Algorithms
18: NoSPaM Manual - A Tool for Node-Specific Triad Pattern Mining
19: Optimization and Reoptimization in Scheduling Problems
20: Linear kernels for outbranching problems in sparse digraphs
21: Sparsification of Two-Variable Valued CSPs
22: Approximation of the Quadratic Knapsack Problem
23: A macro placer algorithm for chip design
24: Stable Matching with Evolving Preferences
25: Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently