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

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

## Research

- A Reusable Framework for Robust Approximation Algorithms in the Interval Uncertainty Model
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.11621

- Lower Bounds for Private Graph Optimization Problems using Reconstruction Attacks
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.10877

- Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.11160

- Streaming Algorithms for Monotonicity Testing
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.07073

- Tackling Parallelization Challenges of Randomized Preconditioners With Dependency Tracking
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2505.02977

- The 11/6 supremum of the Wang-Sitters rounding scheme for graph balancing
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.03890

- A Deadline-Driven Algorithm for Polyamorous Scheduling
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.10641

- Free-Probabilistic State Evolution and Random Matrix Discrepancy
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.11836

- A minimum witness for the 3/2 configuration-linear-program gap in two-weight graph balancing, unique at its size
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.13318

- Paths and Intersections: Repelling Pairs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.02883

- Oracle Separations in the Fourier Hierarchy
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.11830

- Euclidean SVP is deterministically NP-hard to approximate within any constant factor
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12664

- PureSuperQMA(exp) = BellPureSymQMA(poly) = QMA via Dimension-Free Bosonic Argmax
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.11854

- The Quantum Overlap Gap Property and Algorithmic Hardness for the Quantum Hypergraph Max-Cut Problem
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.10838

- The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.11175

- Online Treasure Hunt in Vertex-Permuted Dynamic Rings
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.11013

- Topology inside NC$^1$
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.11822

- When Relaxation Does Not Help: RLDCs with Small Soundness Yield LDCs
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.03717

- An FPTAS for Two-Machine Open-Shop Scheduling with a Single Unavailability Interval
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.11693

- Approximation guarantees for Hub Covering Problems
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2503.02566

- Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2601.18602

- Sharp Embeddings of Layer-Rainbow Cubes and Orthogonal Pairs
  Source: arxiv-cs-dm
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2209.06404

- Multiparameter counting of numerical semigroups: recurrences and leaf-discriminating trees
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.23111

- Knowledge management in House of Graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.23070

- Coloring graphs with no long induced path
  Source: arxiv-cs-dm
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.08847

- Maximizing entropy for power-free languages
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2507.18779

- Degree-based weighted adjacency matrices: spectra, integrality, and edge deletion effects
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.08895

- Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.11285

- Tight Time-Space Lower Bounds for Collision Finding and Element Distinctness under Label Symmetry
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.10808

- Lower Bounds for PIR with Preprocessing from Blackbox Cryptography
  Source: arxiv-cs-ds
  Topic: Algorithms (+Information Retrieval)
  URL: https://arxiv.org/abs/2607.06451

- A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.11049

- A Group-Based Resource Allocation Model for the Fractional Knapsack Problem
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.06470

- Near-Optimal Distributed 2-Ruling Sets on Graphs with Low Arboricity
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.11974

- Navigating Small-World Networks with Distance Predictions
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.10885

- Paths and Intersections: Recognizing Outerplanar Metrics
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.25827

- Faster Hamiltonian Monte Carlo by Learning Leapfrog Scale: an offline randomized solution
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/1810.04449

- Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.10921

- Convex Optimization with Nested Evolving Feasible Sets (CONES) under Time-Varying Loss Functions
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.11207