StringologyTimes

Data Structures and Algorithms: 2021/9/15-21

1: Construction of $k$-matchings and $k$-regular subgraphs in graph products
2: Computing Balanced Solutions for Large International Kidney Exchange Schemes
3: Minimum Path Star Topology Algorithms for Weighted Regions and Obstacles
4: Probabilistic Analysis of Euclidean Capacitated Vehicle Routing
5: Convergence of a Human-in-the-Loop Policy-Gradient Algorithm With Eligibility Trace Under Reward, Policy, and Advantage Feedback
6: {\alpha}-Indirect Control in Onion-like Networks
7: A Characterization of Individualization-Refinement Trees
8: Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane
9: Sublinear Time Eigenvalue Approximation via Random Sampling
10: A Quadratic Time Locally Optimal Algorithm for NP-hard Equal Cardinality Partition Optimization
11: Vertex Fault-Tolerant Emulators
12: Gaussian discrepancy: a probabilistic relaxation of vector balancing
13: Distortion-Oblivious Algorithms for Minimizing Flow Time
14: Micro-architectural Analysis of a Learned Index
15: Sublinear-Time Computation in the Presence of Online Erasures
16: Streaming algorithms for Budgeted $k$-Submodular Maximization problem
17: Fairness Maximization among Offline Agents in Online-Matching Markets
18: An Improved Scheduling Algorithm for Traveling Tournament Problem with Maximum Trip Length Two
19: Solving systems of inequalities in two variables with floating point arithmetic
20: Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees
21: Parallel Algorithms for Finding Large Cliques in Sparse Graphs
22: GPGPU-Parallel Re-indexing of Triangle Meshes with Duplicate-Vertex and Unused-Vertex Removal
23: Robust Multi-Robot Active Target Tracking Against Sensing and Communication Attacks
24: Approximating Biobjective Minimization Problems Using General Ordering Cones
25: An Approximation Algorithm for a General Class of Multi-Parametric Optimization Problems