TILens Daily Edition
2026-09-02
Filters: topic=algorithms, github=hidden

Stats: 33 articles, 3 sources, 33 research papers
Top topics: Algorithms

## Research

- Fair Minimum Labeling: Efficient Temporal Network Activations for Reachability and Equity
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2510.03899

- Optimality of Random Regular Graphs in Sparse Network Designs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.14995

- Quantum matrix arithmetics with Hamiltonian evolution
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2510.06316

- Disproving the Greedy Superstring Conjecture
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.01365

- Bridging the Gap Between Stable Marriage and Stable Roommates: A Parameterized Algorithm for Optimal Stable Matchings
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.26943

- Dense Weak Hiding: Closing Complexity Gaps in Nonconvex and PL Finite-Sum Optimization under Individual Smoothness
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.00045

- Designing Compact ILPs via Fast Witness Verification
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2509.25445

- Finding $b$-colorings Using Feedback Edges
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2512.14390

- On the Instance Optimality of Bidirectional Dijkstra's Algorithm
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.26952

- Finding Shortest Reconfiguration Sequences on Independent Set Polytopes
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.24132

- Sensitivity Oracles for Matroid Packing, Matroid Covering, and Matching Problems with Applications
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.01283

- Kernelization of 2-Club Cluster Edge Deletion on Interval Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.01021

- Beyond the Bethe Approximation of the Permanent
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.28031

- Prediction-Assisted Pricing and Admission for LLM APIs with Stochastic Token Consumption
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.00710

- Fuzzy Pattern Matching in Ordered Structures
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.25032

- Improved lower bounds of the time complexity of shellsort
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.08997

- Random-Priority Frontier Routing: Tight $\Theta(n^c)$ Bounds Against $c$-Node Cartels
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.00893

- Two-State Max-Plus Comparison Is Decidable
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.00678

- A Simpler Analysis of the Bansal-Jiang Quasi Monte-Carlo Algorithm via Haar Wavelets
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.27986

- Logarithmic Chowla Correlations Across All Shift Scales
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.23500

- Improved bounds for the variant of lazy cops and robbers on generalized hypercubes
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.00720

- Eleven, twelve, and thirteen lonely runners
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.23906

- The Most Malicious Ma\^{i}tre D'
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2407.09000

- On the Extension Theorem for Packing Steiner Forests
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.16956

- Graphs with Long Pseudosimilarity Chains under Consecutive Vertex Deletions
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.00394

- Bounded Relative Boundary Implies Narrow DNF Approximation
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.00240

- Convergence and efficiency proof of quantum imaginary time evolution for bounded order systems
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2506.03014

- Quantified propositional calculi and narrow implicit proofs
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.10535

- Subgroup Accessibility in Group Order Logic
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.00499

- SVP Is NP-Hard for Some Rank-2 Cyclotomic Modules
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.01469

- Depth-1 expanders on the unitary group and applications
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.01605

- A Dichotomy for Complex Boolean Holant with Binary Disequality
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.00219

- Towards a Characterization of Counting and Alternating Classes via Discrete Ordinary Differential Equations
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.05431