1: Parameterized Complexity of Critical Node Cuts
2: Balancing Communication for Multi-party Interactive Coding
3: Large-scale Log-determinant Computation through Stochastic Chebyshev Expansions
4: Maximization Problems Parameterized Using Their Minimization Versions: The Case of Vertex Cover
5: Sum-of-squares lower bounds for planted clique
6: Construction of FuzzyFind Dictionary using Golay Coding Transformation for Searching Applications
7: On some provably correct cases of variational inference for topic models
8: Efficient Generation of Stable Planar Cages for Chemistry
9: A Fast Heuristic Algorithm for Redundancy Removal
10: Exact sampling of graphs with prescribed degree correlations
11: Tree spanners of bounded degree graphs
12: Binary and Multi-Bit Coding for Stable Random Projections
13: On the Complexity of Nondeterministically Testable Hypergraph Parameters
14: An Integer Linear Programming Solution to the Telescope Network Scheduling Problem
15: Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures
16: Building Efficient and Compact Data Structures for Simplicial Complexes
17: Computing the partition function of a polynomial on the Boolean cube
18: Mind the Gap
19: Router-level community structure of the Internet Autonomous Systems
20: Analyzing Adaptive Cache Replacement Strategies
21: D3-Tree: A Dynamic Distributed Deterministic Load - Balancer for decentralized tree structures
22: Competitive Distribution Estimation
23: Optimality of Fast Matching Algorithms for Random Networks with Applications to Structural Controllability
24: Parameterized Complexity of Asynchronous Border Minimization