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

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

## Research

- A Dense Weisfeiler-Leman Algorithm for Deciding Bounded-Cliquewidth Homomorphism Indistinguishability
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.13382

- On the Exponential Circuit Imbalance of the Ben-Tal Nemirovski Approximation
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12550

- On the Expressive Power of Transformers
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12671

- Long-Horizon AI Research for Grothendieck Constant: A Case Study in Human-AI Mathematical Collaboration
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.11195

- PSPACE-Completeness of Multi-Agent Path Finding for Large Agents
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12955

- 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

- Fortune's Bounty: Taming Complexity by Trimming Trees --- A Hands-On Problem-Solving Experience in Advanced Complexity Suitable for Introductory Students
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12976

- Spectral Independence and Local-to-Global Techniques for Optimal Mixing of Markov Chains
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2307.13826

- Metropolis-Hastings Sampling of Phylogenetic Networks: Correcting for Symmetries
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12430

- Quasicrystalline Gibbs states in 4-dimensional lattice-gas models with finite-range interactions
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2512.24436

- A relaxation of the Bermond-Thomassen conjecture
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12948

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

- On the Gap of Finite Posets
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12678

- A linear upper bound on the number of moves required for independent set reconfiguration with two sliding tokens
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.13130

- Hit-and-Run Mixes as Fast as the Ball Walk
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.13487

- Patching leaky tunnels in BWTs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.01387

- Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.05358

- Minimum eccentricity shortest paths of $K_{2,3}$-minor-free graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.13158

- Arithmetic Variable LogLog: Advancing the Memory-Variance Frontier
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12575

- Lindbladian Simulation with Commutator Bounds
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.28602

- Compact Path Representation in DAGs via Colored Edge Pebbling
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.13480

- An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2605.10058

- Defensive Boosting for Online Probabilistic Forecasting
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.13554

- Three trees suffice for a constant stretch in minor-free graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.13508

- From One Solution to Many: An Oracle-Based FPT Framework for Diverse Solutions under Generalized Diversity Measures
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.13033

- $\tilde{O}(1)$-Depth Parallel Reachability Faster than Transitive Closure
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.13231

- Online balancing of vectors with small coordinates
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12490

- Solving Square-Submatrix Equation Systems
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.13408

- Fast Length-Squared Sampling for Positive-Semidefinite Matrices
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12503

- Efficient Randomized LL/SC that Preserves History Independence
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12946

- Sublinear Time Eigenvector Approximation via Column Sampling
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.00840

- 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

- Bagging Robustly Learns VC Classes with Linear Sample Complexity
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.13514

- The Cost of Changing Edges for Diameter Computation and More
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.12628

- Tight Adaptive Bounds for Convex Hulls
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2512.06559

- Satisfactory Budget Division
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2502.00484

- New Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2005.10800

- Unlocking Fractional Moments in Delphic Set Streams
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.13126

- Asymptotically Faster Algorithms for Recognizing $(k,\ell)$-Sparse Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.13025

- Triangle-Free Coloring in LOCAL via Resilient Lov\'asz Local Lemma
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.13357

- Online Correlation Clustering: Simultaneously Optimizing All $\ell_p$-norms
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2510.15076

- Testing Properties of Edge Distributions
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2603.22702