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

Stats: 38 articles, 3 sources, 38 research papers
Top topics: Algorithms, AI

## Research

- Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2406.00437

- The Price of Almost Navigability
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.02498

- Compressed Inverse Suffix Arrays
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.17287

- Forbidden Subgraphs of Graphs with Low Bandwidth
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.01949

- Connectivity Oracles Under Vertex Failures via a Simple and Fast Low-Degree Steiner Forest Decomposition
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.02388

- The Minimum-Weight Mixed Dominating Set on Threshold Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11057

- The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/1911.01951

- Hardness of Multi-Agent Path Finding on Trees: A Unified Approach
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.06686

- Optimal girth-dependent bounds for the Bethe approximation of the permanent
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.02017

- Finding a Shortest Vector and More in $2^{n/2+o(n)}$ Time using $q$-ary Coset Difference Tree
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.02764

- Tight bounds on the number of non-equivalent parameterized squares in a word
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2408.04920

- Near-Feasible Stable Matchings: Incentives and Optimality
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2602.10851

- Almost Linear 3-Spanners of Temporal Cliques
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.02851

- The Exact Online Threshold for the Asymmetric Binary Perceptron
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.02124

- Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2505.11456

- Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2409.00771

- A Minimax Perspective on Almost-Stable Matchings
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2601.14195

- Albertson's Conjecture Holds for r at Most 26
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.01682

- Logarithmic basis number of graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.02080

- Circular Chromatic Numbers, Signability, Relation Algebras, and Network Satisfaction Problems
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2512.06878

- Towards Solving the Gilbert-Pollak Conjecture via Large Language Models
  Source: arxiv-cs-dm
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2601.22365

- An $n(\log n)^{o(1)}$ bound for nested cycles without geometric crossings
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.02234

- The Class Edge-Reconstruction Number of a Maximal Planar Graph Is One or Two
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.02389

- Multiset Metric Dimension of Binomial Random Graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2507.11686

- Helly Type Theorems for Splitting Point-Sets
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.02180

- Distributed $(\Delta+1)$-Coloring in Graphs of Bounded Neighborhood Independence
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2510.21549

- Characterizations and Complexity of Minimum Forward and Integer Cycle Bases
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.02317

- frb100-40 After Two Decades: An Optimality Certificate and a Preregistered Search Study
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.02804

- Embracing exchange sequences and oriented matroid polyhedron diameter
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.19573

- New Upper bounds on the Mondrian Art Problem
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.01998

- Extremal Asymmetric Depth of Planar Graphs and Hidden Near-Mirror Symmetries of IPR Fullerenes
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.02585

- Optimal Sensor and Actuator Selection for Factored Markov Decision Processes: Complexity, Approximability and Algorithms
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2407.07310

- Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2407.00966

- Quantum Blind Rotation for Fast Functional Bootstrapping
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2409.20182

- Overcoming the Randomness-Utility Trade-off in Answering Differentially Private Linear Queries
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.02880

- Online Non-Monotone DR-Submodular Maximization Matching the Offline $0.401$ Factor
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.02145

- On Top-Down and Local Lower Bounds for $\mathrm{AC^0}$ Circuits
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.01759

- On the Expressive Power and Limitations of Multi-Layer SSMs
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.14501