1: Algorithms on Ideal over Complex Multiplication order
2: PROMETHEE is Not Quadratic: An O(qn log(n)) Algorithm
3: An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems
4: A Game-Theoretic Approach for Detection of Overlapping Communities in Dynamic Complex Networks
5: Optimal Scheduling for Incentive WiFi Offloading under Energy Constraint
6: BPTree: an $\ell_2$ heavy hitters algorithm using constant memory
7: Vertex Cover Structural Parameterization Revisited
8: Pareto optimal matchings of students to courses in the presence of prerequisites
9: Using Quadrilaterals to Compute the Shortest Path
10: Tight Analysis of a Multiple-Swap Heuristic for Budgeted Red-Blue Median
11: Generation, Ranking and Unranking of Ordered Trees with Degree Bounds
12: Yes-no Bloom filter: A way of representing sets with fewer false positives
13: Minimization of B"uchi Automata using Fair Simulation
14: The Domination Game: Proving the 3/5 Conjecture on Isolate-Free Forests
15: A fixed-parameter algorithm for a routing open shop problem: unit processing times, few machines and locations
16: Sequential ranking under random semi-bandit feedback
17: Distributed $(\Delta+1)$-Coloring in Sublogarithmic Rounds
18: Inferential Privacy Guarantees for Differentially Private Mechanisms
19: Rapidly Mixing Markov Chains: A Comparison of Techniques (A Survey)
20: Randomized algorithms for finding a majority element
21: Computing Shortest Paths Using A(star), Landmarks, and Polygon Inequalities (Abstract)
22: New Algorithms for Heavy Hitters in Data Streams
23: New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness
24: Complex-demand Scheduling Problem with Application in Smart Grid
25: Concentrated Differential Privacy
26: Bounds on the Voter Model in Dynamic Networks
27: On the Complexity of Detecting Constrained Negative Cost Cycles
28: On the Implicit Graph Conjecture
29: Aggregated 2D Range Queries on Clustered Points