1: A Sparse Stress Model
2: The Generalized Smallest Grammar Problem
3: Computing NodeTrix Representations of Clustered Graphs
4: J-Viz: Sibling-First Recursive Graph Drawing for Visualizing Java Bytecode
5: Practical sketching algorithms for low-rank matrix approximation
6: Attribute Truss Community Search
7: Two-connected spanning subgraphs with at most $\frac{10}{7}$OPT edges
8: Parallel Clustering of Graphs for Anonymization and Recommender Systems
9: Testing $k$-Monotonicity
10: Ten Steps of EM Suffice for Mixtures of Two Gaussians
11: Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons
12: On unrooted and root-uncertain variants of several well-known phylogenetic network problems
13: Predicting Signed Edges with $O(n^{1+o(1)} \log{n})$ Queries
14: Algorithms for Visualizing Phylogenetic Networks
15: Scalable Betweenness Centrality Maximization via Sampling
16: Greedy MAXCUT Algorithms and their Information Content
17: Dynamic beats fixed: On phase-based algorithms for file migration
18: A Robust Sparse Fourier Transform in the Continuous Setting
19: Cost-efficient Scheduling on Machines from the Cloud
20: Fourier-sparse interpolation without a frequency gap
21: Improved Algorithms for Computing $k$-Sink on Dynamic Path Networks
22: Succinct data-structure for nearest colored node in a tree
23: Faster O(|V|^2|E|W)-Time Energy Algorithms for Optimal Strategy Synthesis in Mean Payoff Games
24: Mixed-Integer Programming for Cycle Detection in Non-reversible Markov Processes
25: Quantum conditional query complexity
26: Fleet management for autonomous vehicles
27: 401 and beyond: improved bounds and algorithms for the Ramsey algebra search
28: Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm