StringologyTimes

Data Structures and Algorithms: 2019/12/29-31

1: A Fine-Grained Perspective on Approximating Subset Sum and Partition
2: Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
3: Quantum Image Preparation Based on Exclusive Sum-of-Product Minimization and Ternary Trees
4: Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs
5: Practice of Streaming Processing of Dynamic Graphs: Concepts, Models, and Systems
6: Worst-Case Optimal Radix Triejoin
7: Deleting to Structured Trees
8: Computing $2$-twinless blocks
9: Exact exponential algorithms for two poset problems
10: LinearPartition: Linear-Time Approximation of RNA Folding Partition Function and Base Pairing Probabilities
11: Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods
12: Efficiently Realizing Interval Sequences