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

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

## Research

- The Parameter Report: An Orientation Guide for Data-Driven Parameterization
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2509.06880

- Canonization of a random graph by two matrix-vector multiplications
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2312.03686

- Laziness of Quantum Walks on Graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.20739

- Temporal Orienteering with Changing Fuel Costs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2507.00728

- Structural Parameters for Dense Temporal Graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2404.19453

- Recognizing Level-k-Based Phylogenetic Networks is NP-Complete
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2605.26852

- Compact Representations of Geometric Bipartite Graphs via Weighted Biclique Covers
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.20767

- Stochastic Multi-Robot Monitoring on Graphs under Markovian Mobility
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.20618

- Online Service with Per-Batch Maximum Delay
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.18577

- Forcing a unique minimum spanning tree and a unique shortest path
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2509.24309

- T-Robinson Spaces: Structure, Recognition, and Applications to Real Data
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.21248

- Approximation Algorithms for Perfect Fair-Triangle Packing
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.07674

- The Sharp Dimension Bound in the Johnson--Lindenstrauss Lemma
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.13782

- A note on efficient k-limited broadcast domination in graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.20437

- Maximum Covering Network Design on Graphs with Low Connectivity: Dynamic Programming and Block-Cut Trees
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.20894

- Sublinear Algorithms for Estimating the Number of Hyperedges in Arbitrary Hypergraphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.20559

- Simple Low-Overhead Communication-Efficient String Reconciliation and Edit Distance
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.19149

- jXBW: A Compressed Index Enabling Structure-Aware JSONL Retrieval for Structured RAG
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2508.12536

- A new analysis of the randomly pivoted Cholesky algorithm
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.20633

- Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2602.05394

- Truthful Calibration Measures for Sequential Prediction
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.21348

- Sampling Balanced Forests of Grids in Polynomial Time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2310.15152

- Query Efficient Structured Matrix Learning
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2507.19290

- Generalized Balls into Bins
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.20924

- Online computation of maximal closed substrings
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.00612

- Cluster-Graph Edit Distance: Optimal Explicit Embeddings, Metric Proxies, and Complexity
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.17990