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

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

## Research

- Pseudometric-Weighted Correlation Clustering via Spectral Preclustering
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17403

- Stuffed IBLTs: Optimal Linear Multiset Sketches
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17487

- A Fresh Look at Lamarckian Evolution and the Baldwin Effect
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2605.28703

- A deterministic $(2 + \varepsilon)$-approximation for directed feedback vertex sets in tournaments
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.16723

- A Cheeger Inequality for Hypergraphs and Its Applications
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.16286

- Equitable Partition Realizability for Dynamics-preserving and Privacy-aware Network Reconstruction
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.16762

- Quadratic Probing Insertions Are $\epsilon^{-(1+o(1))}$ Time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.28512

- Algorithms for adaptive and heteroskedastic linear regression at the computational threshold
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.18402

- Should Tables Be Sorted? Revisited with a Large Language Model
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.14032

- List Decoding, Linear Hashing, and Furstenberg over $\mathbb{F}_q$
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17020

- Rank-One Matrix Discrepancy and Algorithmic Kadison--Singer
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17266

- Extending Courcelle's Theorem with Optimality Predicates
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.20175

- On testing the incentive compatibility of single-parameter allocation mechanisms
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17406

- High Probability Streaming Lower Bounds for $F_2$ Estimation
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.17286

- High-Multiplicity Bin Packing is FPT
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.16923

- Scalable Algorithms for Approximate DNF Model Counting
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2601.10511

- Improved Regular Expression Matching with Simple Backreferences
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.16914

- The Price of Random Access: Measuring Block Granularity Across Four Compressed Formats
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.16731

- Scheduling Jobs with Multiple Operational Modes and Tail Times
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.16001

- SETH-based Lower Bound for Dynamic Degeneracy
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.16303

- PrecPack: An Efficient Open-Source Exact Solver for Bin Packing with Generalized Precedence Constraints
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17368

- High-Performance Tensor Formulation of the Viterbi Algorithm for Hidden Semi-Markov Models
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.16500

- Improved Approximation for Unsplittable CVRP via a Greedy Approach
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.16910

- The Classical Weisfeiler-Leman Algorithm Stabilizes in $O(n)$ Rounds
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.17364

- Cluster deletion in cographs, permutation graphs, and graphs with bounded clique number
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2505.00922

- Improved Approximation Algorithms for the Multiple-Depot Split Delivery Vehicle Routing Problem
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2601.01841

- Online Allocation using Few Samples
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17343

- Determinant maximization subject to a partition matroid constraint via stable distributions
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17407

- The price of anarchy in the max-distance network creation game is not constant
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17395

- Ramsey Obstructions to Disambiguation
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.16359

- Quantitative central limit theorems for exponential random graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2507.10531

- Linear Programming Bounds for Locally Recovery Codes II
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.16044

- A Branch-and-Cut Algorithm for the Optimal Design of Parking Lots with One-way and Two-way Lanes
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2506.09961

- The forced colouring function of a graph
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17108

- A Resolution of Friedgut's Conjecture on Influential Coalitions
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.16401

- A simpler proof of the Matrix Spencer Theorem
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.16100

- Amortized Relaxed Locally Decodable Codes
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.16332

- Asymmetric Weighted Earliness-Tardiness: Scheduling with a Nonrestrictive Common Due Date
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.16046

- On the completeness of several fortification-interdiction games in the Polynomial Hierarchy
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2406.01756

- Tight Lower Bounds for Algebraic Communication and Applications
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17082

- Euclidean SVP is NP-hard for Cyclic Lattices
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.16711

- The Complexity of Recognizing SDP Exactness for the Maximum Cut Problem
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.03508

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

- Improved Separations between Quantum and Classical Communication Complexity of Total Functions
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.16726

- Towards Optimal Prefix-Free Graph Construction: NP-Hardness and Structural Insights
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17353

- The Role of Symmetry in Quantum Query-to-Communication Simulation
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2012.05233

- Concise tensors with maximal symmetries
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17280