1: Alignment-free sequence comparison using absent words
2: Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class
3: Data Summarization at Scale: A Two-Stage Submodular Approach
4: Optimal Design of Process Flexibility for General Production Systems
5: Robust Node Generation for Meshfree Discretizations on Irregular Domains and Surfaces
6: Compressed Communication Complexity of Longest Common Prefixes
7: The Well Tempered Lasso
8: Privacy-Preserving Identification via Layered Sparse Code Design: Distributed Servers and Multiple Access Authorization
9: A Scenario Decomposition Algorithm for Strategic Time Window Assignment Vehicle Routing Problems
10: Distributed Algorithms for Minimum Degree Spanning Trees
11: On closeness to k-wise uniformity
12: CuCoTrack: Cuckoo Filter Based Connection Tracking
13: Analysis of Nederlof’s algorithm for subset sum
14: A new quadratic-time number-theoretic algorithm to solve matrix multiplication problem
15: Deterministic Min-Cost Matching with Delays
16: Minmax-Regret $k$-Sink Location on a Dynamic Tree Network with Uniform Capacities
17: Scalable Approximation Algorithm for Graph Summarization
18: Reconciling Multiple Genes Trees via Segmental Duplications and Losses
19: Perturbation Resilient Clustering for $k$-Center and Related Problems via LP Relaxations
20: Indexed Dynamic Programming to boost Edit Distance and LCSS Computation
21: Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth
22: MISSION: Ultra Large-Scale Feature Selection using Count-Sketches
23: Computing directed path-width and directed tree-width of recursively defined digraphs
24: Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness Region
25: Minimum Shared-Power Edge Cut
26: $O(n \log n)$-time text compression by LZ-style longest first substitution
27: Stability and complexity of mixed discriminants
28: Bounds and algorithms for graph trusses