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

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

## Research

- Locally Sparsified, Globally Near-Optimal: Matching under Independent Vertex Arrivals
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27161

- Dense Interprocedural Dominance in Acyclic Graphs: Context Bounds and Compact Queries
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27818

- Boyer-Moore Variants for Indeterminate String Matching and Experimental Evaluation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27170

- A 27 x 27 x 27 counterexample to Comon's conjecture
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28292

- Minimum Sum Vertex Cover via Minimum Vertex Cover
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27117

- Vertex-Coloring Edge-Weighting: Kernelization and Generalization
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27719

- Learning to Approximate Uniform Facility Location via Graph Neural Networks
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2602.13155

- Silver Rate Is (Almost) Optimal for Gradient Descent: The Strongly Convex Case
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.26873

- $c$-Packedness versus $\lambda$-Low-Density in Geometric Graphs: Theory and Practice
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27231

- Fast Geometric Spanners via Approximate Nearest Neighbor Search
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.26934

- Sampling Line-Graph Colorings with Constant Extra Colors
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27440

- Inverse knapsack at two capacities: which pairs of value-cardinality hulls are realizable?
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28128

- An FPT algorithm for cycle rank on semi-complete digraphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.29336

- Asymptotic Rank Speedup Theorems, Revisited
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2605.21738

- Faster Minimum k-Cut II: Near-Optimal and Deterministic for Weighted Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27797

- An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2407.07058

- A Tight Cycle-Cover Inequality for Shortest Common Superstring
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27921

- An $\widetilde{O}\left(n^2 \right)$-Time Sampler for Zero-Field Ferromagnetic Ising Models
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.26197

- Hutch#: Optimal non-adaptive Frobenius norm estimation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28472

- High-Dimensional Ultra-Log-Concave Distributions
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23994

- Spirals and Beyond: Competitive Plane Search with Multi-Speed Agents
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2508.10793

- Independent Set Discovery on Biclique-Free Graphs Is Fixed-Parameter Tractable
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27837

- Approximating Partition in Deterministic Near-Linear Time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2501.12848

- Dynamic Treewidth in Logarithmic Time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2504.02790

- Transposition achieves OPT$+O(1)$ in polynomial time for IID list update
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28397

- The Exact Approximation Ratio of the Optimal Fixed-Price Mechanism in Bilateral Trade
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27878

- Tight Regret Bound for Online Inverse Linear Optimization via Multiscale Matrix Weights
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.26978

- Homological Trimming and Regularity of Filtrations via Local Obstruction Modules
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28160

- Personalised versus Posted Pricing from Samples
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28181

- Faster Minimum k-Cut I: Simple and Sparse Weighted Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27781

- Always-Correct Succinct Dynamic Fusion Nodes Are Impossible: A Cell-Probe Lower Bound in the Small-Set, Large-Universe Regime
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27945

- Awesome graph parameters
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2511.05285

- Backtracking Candidate Elimination: A One-Pass Algorithm for the Chip Testing Problem
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.26995

- Flip Dynamics for Sampling Colorings: Improving $(11/6-\epsilon)$ Using a Simple Metric
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2407.04870

- Parity families and signed spectra: kernel averaging, near-Ramanujan bounds, and exact circulant models
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.17343

- Perfect Sphere Packing In The Boolean Space
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.18718

- A New Method that can Generate Ramsey Colourings for Eight and Thirteen Colours
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.26851

- Constructing longer snakes and improved asymptotic bounds in hypercubes
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27483

- Smallest Cubic Non-1-Planar Graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27168

- Lettericity Is NP-Complete
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28023

- Shorthand Universal Tori for Permutations: Existence, Symmetry, and Generation of Twori
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27583

- Inter-Temporal Price Constraints in Dynamic Pricing: Performance Guarantees Under Price Monotonicity and Promotion Fatigue
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28451

- A New Upper Bound for the Tur\'an Density of the Tetrahedron
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27495

- Signed circulants at the Ramanujan bound
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.18334

- Pimp my fixpoint: sofic realization of multidimensional substitution-based shift spaces
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28207

- Ideal Membership in Polynomial Calculus: Complexity and Reductions
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28243

- Attention-based representations for multi-task computation
  Source: arxiv-cs-cc
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2608.04243

- Cubical Sheaf Complexes with Constant Expansion with Applications to Asymptotically Good qLTCs
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28028

- Envy-Free Allocation of Indivisible Goods under Leontief Preferences
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28308

- Algorithmic Unverifiability of Safety for Fixed and Recursively Self-Improving Systems
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.28639

- Quantum Soundness of a Total-Degree Line-versus-Point Test
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27129

- Weighted Quantum Signal Processing: Low-Depth Polynomial Approximation with Applications to Kolmogorov-Arnold Networks
  Source: arxiv-cs-cc
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.21567

- Blocky Matrices and Group Idempotents
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.27951

- Near-Optimal Mixedness Testing with Pauli Measurements
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.18839

- DQC1-completeness of normalized trace estimation for functions of log-local Hamiltonians
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.01519

- An elementary proof of the Koml\'os conjecture
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20979