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

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

## Research

- Computing Lewis Weights to High Precision by Fixed-Point Iteration
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.04338

- Beyond Distance Ordering: Resource Complexity and Universal Optimality of Exact Labeled Directed Shortest Paths
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.04825

- An iterative rounding $2$-approximation for Feedback Vertex Set via AI-assisted proof of an extreme point property
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.04414

- On Maximizing a Weakly Submodular Function over a Matroid Constraint via the Greedy Algorithm
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.05008

- Machine Unlearning as Private Retroactive Algorithms
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.05329

- Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.26831

- Online Matching in Convex Bipartite Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.05057

- Algebraic Geometry Codes Approach the Half-Singleton Bound with Constant Field Size
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.05017

- Integrality Gap Bounds for the Goemans-Linial SDP on Finite Abelian Cayley Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.05368

- Finding Many Overlapping Dense Subgraphs Using Triadic Cohorts
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.04890

- Colorful Minors
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2507.10467

- Strategic Facility Location in Euclidean Spaces
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.05132

- Multiobjective Hypergraph Min-Cut in Quasi-Polynomial Time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.04389

- Statistics of Similarity Graphs in Node-Arrival Streams
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.04505

- Learning-Augmented Algorithms: Guarantees, Construction Mechanisms, and System-Level Implications
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.04787

- An $O\big((5/3)^n\mathrm{poly}(n)\big)$ One-Sided Monte Carlo Algorithm for Equal Subset Sum
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.08260

- Improved algorithm for counting spanning trees by $\ell_1$-regularized resistance
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.03574

- A Polymatroidal Perspective on Random Contraction
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.04521

- The Popular Dimension of Matchings
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2509.25150

- The Erd\H{o}s-P\'osa Property for Colorful Minors
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.04956

- Trade-off between spread and width for tree decompositions
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2601.04040

- Order 14 is the largest order for which every 4-total coloring of every cubic graph is equitable
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.05259

- Determining a graph from its reconfiguration graph
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2504.19783

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

- Binary X-rays of doubly stochastic matrices
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.01442

- On the Structure of $(\min,+)$ Convolution
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.13310

- A Counterexample to Teschner's Bondage-Number Conjecture
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.04257

- The fourth generalized Davenport constant of $C_5^3$
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.04950

- An almost quadratic bound for the minimal excluded minors for a surface
  Source: arxiv-cs-dm
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2604.02796

- Symmetrization maps and minimal border rank Comon's conjecture
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2411.05721

- Optimal inequalities for completely bounded polynomials and the limitations of quantum query algorithms
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.05201

- A Computational Obstruction to Swapping Area and Dinv: An Automata-Theoretic View of the $q,t$-Catalan Symmetry
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.05005

- Solving Hard XAI Queries Based on a Compiled Dual-Rail Encoding
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.04931

- Fine-Grained $\mathrm{AC}^0$ Lower Bounds for $k$-$\mathrm{OV}$, $k$-$\mathrm{XOR}$, and $k$-$\mathrm{SUM}$ via Colored Subgraph Isomorphism
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.08578

- A characterization of efficiently compilable constraint languages
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2311.10040