TILens Daily Edition 2026-11-16 Filters: topic=algorithms, github=hidden Stats: 40 articles, 3 sources, 40 research papers Top topics: Algorithms, AI ## Research - Fault Tolerant Coresets Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.17574 - Listing Even Cycles Faster than the Submodular-Width Barrier Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2605.30564 - Quantum Channel Testing in Average-Case Distance Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2409.12566 - A Framework for Cost-Preserving Rounding with Applications to Laminar Thin Trees Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.18399 - Random Abstract Cell Complexes Source: arxiv-cs-ds Topic: Algorithms (+AI) URL: https://arxiv.org/abs/2406.01999 - Dual-Slack Frontier Matching: Parallel Approximate Maximum-Product Matching Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.17502 - Quantum Algorithm with Quadratic Speedup for 2D Pattern Matching Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.17541 - Polynomial-time computation of $\ell_p$-contraction fixed points for even $p$ Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2607.23863 - Parameterized Approximation for Minimizing Uncovered Elements and Unsatisfied Constraints Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.17951 - Online Nonconvex Decision Making with Approximate Oracles Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2211.03997 - Long rational and Gaussian integer multiplication Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.18028 - Tight Bounds for k-Median++ and Improved Bounds for k-Means++ Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.18544 - How rigid is maximum cardinality search? Stability and locality of MCS orderings under edge updates, verified in Lean Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.18369 - Exact-Quota Facility Location: A Transfer Framework and Three Approximation Guarantees Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.18262 - The Complexity of Traffic Engineering in Segment Routing Networks Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.18152 - Color Refinement Distinguishes Connected Rooted Outerplanar Graphs Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.18391 - Adaptive Power Iteration Method for Differentially Private PCA Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2602.11454 - From smoothed analysis to backward error: The power of adaptive perturbations Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.18545 - Online Fair Division Meets Reordering Buffers Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2607.01159 - Tight Quantum Query Bounds for Minimum Cut and Multicut on Dense Graphs Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.17845 - A Common Improved Bound for Asymmetric TSP and Path TSP Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.18498 - A Fine-Grained Classification of Subquadratic Patterns for Subgraph Listing and Friends Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2404.04369 - Express Language Modeling Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2606.10944 - Adversarially Batched Online Learning Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.17500 - On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2508.18104 - Collective Tree Exploration with Predictions Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.17482 - Exact Failure Probabilities for d-Choice Cuckoo Hashing Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.17688 - LinearKnot: Linear-Time Approximation of the Pseudoknot Partition Function Source: arxiv-cs-ds Topic: Algorithms URL: https://arxiv.org/abs/2611.17602 - Isolation of $k$-cliques in uniform hypergraphs Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.17489 - The Cranston--Li--Su--Wang--Xu (2026) conjecture is true Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2610.40863 - TSP instances that require exponentially many subtour elimination constraints Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.17386 - Additive cubes are avoidable over $\{0,1,2,3\}$, $\{0,1,4\}$ and $\{0,2,5\}$ Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2611.17999 - An 'Experimental Mathematics' Approach to Stolarsky Interspersions via Automata Theory Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2502.03312 - An annihilation-number Caro-Wei bound: a TxGraffiti conjecture and an independence-number bracket Source: arxiv-cs-dm Topic: Algorithms URL: https://arxiv.org/abs/2606.29553 - Quantum query complexity of Hurwitz stability testing Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2610.41180 - Efficient LP warmstarting for linear modifications of the constraint matrix Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2501.04151 - Tight Quantum Query Bounds for Collision Finding over Arbitrary Bounded Types Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.17804 - Simulating Space Bounded Read-$k$ PTMs with Space Bounded Read-Once PTMs Source: arxiv-cs-cc Topic: Algorithms (+AI) URL: https://arxiv.org/abs/2611.17690 - Go under Chinese Rules with a Succinct Game History is Complete for Exponential Space Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.18201 - On Applications of Polynomial-Time Group Isomorphism Algorithm Source: arxiv-cs-cc Topic: Algorithms URL: https://arxiv.org/abs/2611.18084