1: Just-in-Time Batch Scheduling Problem with Two-dimensional Bin Packing Constraints
2: Construction of Directed 2K Graphs
3: Distributed Distance-Bounded Network Design Through Distributed Convex Programming
4: Efficient PAC Learning from the Crowd
5: Clustering for Different Scales of Measurement - the Gap-Ratio Weighted K-means Algorithm
6: On the Probe Complexity of Local Computation Algorithms
7: Distance-Sensitive hashing
8: Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths
9: Resolving the Complexity of Some Fundamental Problems in Computational Social Choice
10: Optimal lower bounds for universal relation, samplers, and finding duplicates
11: An Asymptotically Tighter Bound on Sampling for Frequent Itemsets Mining
12: Metric random matchings with applications
13: Compression with wildcards: All k-models of a binary decision diagram
14: Polynomial-Time Methods to Solve Unimodular Quadratic Programs With Performance Guarantees
15: Maximizing the area of intersection of rectangles
16: Randomized Load Balancing on Networks with Stochastic Inputs
17: Steiner Point Removal — Distant Terminals Don’t (Really) Bother
18: Palindromic Decompositions with Gaps and Errors
19: Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can)
20: Gene tree species tree reconciliation with gene conversion
21: The weighted stable matching problem
22: New algorithms for the Minimum Coloring Cut Problem
23: Fluid Communities: A Competitive, Scalable and Diverse Community Detection Algorithm
24: Algorithmic interpretations of fractal dimension
25: Edge-matching Problems with Rotations
26: Routing in Polygonal Domains