1: Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency
2: Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity
3: A Distributed Architecture for Edge Service Orchestration with Guarantees
4: Max-Min Greedy Matching
5: Relaxed Locally Correctable Codes in Computationally Bounded Channels
6: A Generalized Matching Reconfiguration Problem
7: The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics
8: Average Cost of QuickXsort with Pivot Sampling
9: Ridge Regression and Provable Deterministic Ridge Leverage Score Sampling
10: Reconfiguring spanning and induced subgraphs
11: Parameterized Low-Rank Binary Matrix Approximation
12: A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case
13: Fast approximation and exact computation of negative curvature parameters of graphs
14: Differential Privacy for Growing Databases
15: Leveraging Sparsity to Speed Up Polynomial Feature Expansions of CSR Matrices Using $K$-Simplex Numbers
16: Beyond the Low-Degree Algorithm: Mixtures of Subcubes and Their Applications
17: Computing and Testing Pareto Optimal Committees
18: On-line Chain Partitioning Approach to Scheduling
19: Swapping Colored Tokens on Graphs
20: An improved isomorphism test for bounded-tree-width graphs
21: Parameterized Complexity of Fair Vertex Evaluation Problems
22: Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond
23: $\tilde{O}(n^{1/3})$-Space Algorithm for the Grid Graph Reachability Problem
24: Twelve Simple Algorithms to Compute Fibonacci Numbers
25: Learning the Hierarchical Parts of Objects by Deep Non-Smooth Nonnegative Matrix Factorization
26: Adaptive Greedy Algorithms for Stochastic Set Cover Problems
27: Introducing higher order correlations to marginals’ subset of multivariate data by means of Archimedean copulas