1: Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method
2: Experimental Study of Compressed Stack Algorithms in Limited Memory Environments
3: The design of a streaming analytical workflow for processing massive transit feeds
4: Improved Distributed Degree Splitting and Edge Coloring
5: Efficient Representative Subset Selection over Sliding Windows
6: Improved Set-based Symbolic Algorithms for Parity Games
7: The complexity of the Multiple Pattern Matching Problem for random strings
8: Online Strip Packing with Polynomial Migration
9: Generalization for Adaptively-chosen Estimators via Stable Median
10: Parameterized Verification of Algorithms for Oblivious Robots on a Ring
11: [1, 2]-sets and [1, 2]-total Sets in Trees with Algorithms
12: Optimal Online Two-way Trading with Bounded Number of Transactions
13: Modeling Biological Problems in Computer Science: A Case Study in Genome Assembly
14: An Efficient Probabilistic Approach for Graph Similarity Search
15: On the Optimization Landscape of Tensor Decompositions
16: An improved kernel for the cycle contraction problem
17: Recognizing hyperelliptic graphs in polynomial time
18: A new method for recognising Suzuki groups
19: SuperMinHash - A New Minwise Hashing Algorithm for Jaccard Similarity Estimation
20: Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data
21: Fourier-Based Testing for Families of Distributions
22: Approximate Generalized Matching: $f$-Factors and $f$-Edge Covers
23: How Hard is it to Find (Honest) Witnesses?
24: Capacity Releasing Diffusion for Speed and Locality
25: Conditional Lower Bounds for Space/Time Tradeoffs
26: Signal Machine And Cellular Automaton Time-Optimal Quasi-Solutions Of The Firing Squad/Mob Synchronisation Problem On Connected Graphs
27: Selecting nodes and buying links to maximize the information diffusion in a network
28: Solving Integer Linear Programs with a Small Number of Global Variables and Constraints
29: An exponential lower bound for cut sparsifiers in planar graphs
30: Learning Graphical Models Using Multiplicative Weights
31: Orthogonal Compaction Using Additional Bends
32: On the Integrality Gap of the Prize-Collecting Steiner Forest LP
33: BB-Graph: A Subgraph Isomorphism Algorithm for Efficiently Querying Big Graph Databases
34: Computing maximum cliques in $B_2$-EPG graphs
35: Index Search Algorithms for Databases and Modern CPUs
36: Maxent-Stress Optimization of 3D Biomolecular Models
37: Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low-Dimensional Spaces
38: Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs
39: Faster batched range minimum queries
40: New Cardinality Estimation Methods for HyperLogLog Sketches