1: On Stabbing Queries for Generalized Longest Repeat
2: Graph Isomorphism for Bounded Genus Graphs In Linear Time
3: Statistical physics of inference: Thresholds and algorithms
4: Interdicting Structured Combinatorial Optimization Problems with {0,1}-Objectives
5: Hardness and Approximation for Network Flow Interdiction
6: Algorithmic Stability for Adaptive Data Analysis
7: Improved Approximation Algorithms for Relay Placement
8: Faster Randomized Branching Algorithms for $r$-SAT
9: A New Relaxation Approach to Normalized Hypergraph Cut
10: Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal
11: Optimal Dynamic Strings
12: Two Flow-Based Approaches for the Static Relocation Problem in Carsharing Systems
13: An Efficient Multilinear Optimization Framework for Hypergraph Matching
14: ReOpt: an Algorithm with a Quality Guaranty for Solving the Static Relocation Problem
15: Approximation Algorithms for Finding Maximum Induced Expanders
16: Parameterized complexity of length-bounded cuts and multi-cuts
17: Strong Connectivity in Directed Graphs under Failures, with Application
18: k-way Hypergraph Partitioning via n-Level Recursive Bisection
19: A Study on Splay Trees
20: Accelerated Newton Iteration: Roots of Black Box Polynomials and Matrix Eigenvalues
21: Learning Communities in the Presence of Errors
22: Tight Bounds for the Distribution-Free Testing of Monotone Conjunctions
23: Huge tables and multicommodity flows are fixed parameter tractable via unimodular integer Caratheodory
24: Reorganizing topologies of Steiner trees to accelerate their elimination
25: The Fourier Transform of Poisson Multinomial Distributions and its Algorithmic Applications
26: A Size-Free CLT for Poisson Multinomials and its Applications
27: On the Optimal Sample Complexity for Best Arm Identification
28: Private False Discovery Rate Control
29: Find Your Place: Simple Distributed Algorithms for Community Detection
30: RasBhari: optimizing spaced seeds for database searching, read mapping and alignment-free sequence comparison
31: Properly Learning Poisson Binomial Distributions in Almost Polynomial Time
32: On Choosing Committees Based on Approval Votes in the Presence of Outliers
33: Experimental Evaluation of Distributed Node Coloring Algorithms for Wireless Networks
34: Combining Monte-Carlo and Hyper-heuristic methods for the Multi-mode Resource-constrained Multi-project Scheduling Problem
35: An Efficient Assignment of Drainage Direction Over Flat Surfaces in Raster Digital Elevation Models
36: Priority-Flood: An Optimal Depression-Filling and Watershed-Labeling Algorithm for Digital Elevation Models
37: Optimizing Star-Convex Functions
38: Detection of multiple and overlapping bidirectional communities within large, directed and weighted networks of neurons
39: A Backward/Forward Recovery Approach for the Preconditioned Conjugate Gradient Method
40: Multi-Clique-Width