TILens Daily Edition
2026-08-13
Filters: topic=algorithms, github=hidden

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

## Research

- Measuring Decidability as Related to Busy Beaver Numbers
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2605.20215

- Evaluating QAOA expectation values can be as hard as counting optimal solutions
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11385

- An Exponential Separation between Deterministic CDCL and DPLL Solvers
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.16156

- An FKN Theorem for the Binary Grassmann Scheme
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11320

- RevCRN: Reversible Analog Computation using Chemical Reaction Networks
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11362

- Adversarial Resilience of Poisson-Process Submodular Maximization over Matroids: From Robust Offline Optimization to Full-Bandit Learning
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12134

- How Difficult Is It to Recognize CIS Graphs?
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11289

- Structural Lemmas on Temporal Connectivity
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.15606

- Search and Rescue on the Plane
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12039

- Cops and robbers pebbling in graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2301.00434

- The arc chromatic number for Galois projective planes, affine planes and Euclidean grids
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2601.19043

- Greedy approaches for Gold Grabbing on subclasses of split graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12053

- The Edge-based Contiguous p-median Problem with Connections to Logistics Districting
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11230

- Complexity and algorithms for proper conflict-free coloring in graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.10874

- Nonisomorphic Graphs Can Share an Arbitrarily Large Fraction of Their Vertex-Deleted Cards
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11930

- $K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2503.00798

- Faster Exponential Algorithms for Multi-Machine Scheduling Problems
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12224

- Learning Nearest-Neighbor Maps from Adaptive Queries
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.07352

- EF(X) Orientations: A Parameterized Complexity Perspective
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2512.25033

- Hardness, Tractability and Density Thresholds of finite Pinwheel Scheduling Variants
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.16030

- Graphic Matroid Secretary without the Graph
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11413

- Harmonic Ranking for Edge-Weighted Oblivious Matching
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12176

- Distributed Quantum Algorithms Cannot Color Cycles with Probability 1
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11720

- CKR Partitions and Lower Bounds for Constrained Correlation Clustering and Variants
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.08291

- Polynomial-Time Singular Witnesses for Non-SNS Sign Patterns
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12075

- Parallel Machine Scheduling with a Singler Server and Loading-Unloading Operations
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12087

- New Lower and Upper Bounds for the Grothendieck Constant
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11158

- Going in Circles: Collaborative Multi-Robot Treasure Hunting
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12115

- Text Indexing: From Reporting to Counting
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.24043

- The Grothendieck Constant is Less Than $\frac{\pi}{2 \log (1+ \sqrt{2})} - 10^{-5}$
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.03991

- Distribution-Free Halfspace Testing with Samples
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11346

- Strongly Polynomial Parallel Maximum Flow Revisited
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12171

- Dequantization and Hardness of Spectral Sum Estimation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2509.20183

- A Tight Scale-Locality Bound for Partial Detection in Non-Adaptive Group Testing
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11858

- Asymmetric Palette Sparsification, Slightly Simplified
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12289