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

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

## Research

- Parameterized Complexity and Geometric Approximation of Riesz Energy Subset Selection
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13600

- Edit Distance Approximation: Subquadratic Factor Three and Monge Approximation Schemes
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01311

- Query Complexity of Learning Axis-Aligned Partitions
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.35495

- Pair-Merge Tokenisation Is Hard to Approximate on Binary Strings and Strongly NP-Hard on Unary Datasets
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13568

- Bounded Weighted Edit Distance with Metric Costs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13984

- List Update with Per-Page Maximum Delay
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13750

- Minimum Membership Dominating Set and Its Generalization: Leafage vs. Asteroidal Number
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13392

- Query Complexity of Testing Structured Parenthesis Languages
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.37431

- Stochastic Aggregation with Prescribed Resources and Additive Delay
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13757

- Min-CSPs on Complete Instances III: Nearly Optimal Characterizations of Approximation for Symmetric CSPs
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2611.13635

- Directed Singular-Value Sparsifiers with $O(n \log n/\epsilon^2)$ Arcs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.14342

- Nonadaptive One-Sided Testing of Binary Rank
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.14163

- Bounded Integer Programming in Almost $N^{2d}$ Time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.25955

- Differentially Private Verification of Distribution Properties
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.10819

- Function Inversion Reporting
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13294

- Approximating graphic TSP by b-matchings
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13585

- List coloring uncrowded hypergraphs at the shattering threshold
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.18048

- Online Graph Coloring: Competitive Ratios Separating Randomized and Deterministic Algorithms
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.14513

- What to Predict for Efficient Scheduling on Parallel Machines
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13980

- Pauli-Z Moment Matrices in the Variational Quantum Power Method: Goemans-Williamson Rounding, Qubit Locking, and a Correlation-Based Circuit-Cutting Heuristic
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.23727

- The Left Ripple of Byte-Pair Encoding: Certified Lookbehind for Every Dictionary
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13061

- EFX Need Not Exist
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.18216

- Nash Incentive-compatible Online Mechanism Learning via Weakly Differentially Private Online Learning
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2407.04898

- Real-Time String Indexing in Optimal Time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13950

- Deterministic $n^{O(\log n)}$ Graph Isomorphism Algorithm via Inherited Decompositions
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.01399

- Mixed-integer dual network problems are solvable in strongly polynomial time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.14045

- Bounding and Approximating Kostka Numbers
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.14322

- A New Quantum Linear System Algorithm Beyond the Condition Number and Its Application to Solving Multivariate Polynomial Systems
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2510.05588

- Do Language Models Know Which Constraints Belong Together?
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.05726

- A note on the intractability of enumerating the maximal satisfiable subformulas of a Horn expression
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.14471

- Greedy+Singleton for knapsack-constrained monotone submodular maximization has approximation ratio exactly $\beta^\star \approx 0.42944$
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13575

- 51 Additions per Recursive Step for Rank-23 $3\times3$ Matrix Multiplication, Machine-Checked over Arbitrary Rings
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.12907

- Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2605.13299

- Improved Bounds for Online Matching with Random Edge Arrivals
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13571

- Combinatorial optimization with bounded subdeterminants
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13065

- Layer-Based Width for PAFP
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2605.12457

- Convex Minimization with Integer Minima in $\widetilde O(n^4)$ Time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2304.03426

- Online Network Design with Maximum Delay and Stochastic Arrivals
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13865

- A Fast Algorithm for Subspace Convolution
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13134

- Total Variation Distance Estimation in Autoregressive Models
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2607.19510

- Sliding-Window Quotas in Apache Hadoop YARN: Exact Admission and Flexible Placement
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.06145

- An Improved $(1+2e)$-Approximation Algorithm for Metric Data Placement
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13224

- Online Network Design with Additive Delays and Poisson Arrivals
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13859

- Differential Privacy for Euclidean Jordan Algebra with Applications to Private Symmetric Cone Programming
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2509.16915

- Moments of Magic Squares: Line-Sum Conditions, a Permutation Threshold, and Random Energies
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.38386

- Scheduling on identical machines with conflicts to minimize the total completion time
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2507.01759

- Feedback Vertex Set, Max Cut, and Edge Coloring on the Strong Product of a Graph and a Path
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13917

- Maximum Probability of Independence in Transitive Matroids
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2605.23291

- Local Modifications of Nearest-Neighbor and Min-Plus Representations
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13787

- Rotating Walks, Derandomized Squares, and Permutation Conjugated Walks
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13693

- Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2605.14058

- Characterizing Fixed-Treewidth Planar Graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.14327

- You Can Have It All: Small sparse induced-universal graphs for minor-closed classes
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.14194

- Temporal Cliques Admit Linear Spanners
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.05156

- Optimal radio labelings for the Cartesian product of a path and the Heawood graph
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13813

- Multiway Partition is FPT for Connectivity Functions
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.10380

- SVP Is NP-Hard for Some Rank-2 Cyclotomic Modules
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.01469

- The Exact Complexity of Majority in Depth-Three Circuits with Bottom Fan-in Three
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2601.04072

- Complexity of Deciding Existence of Maltsev Polymorphisms of Finite Relational Structures
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.14379

- Computational complexity of Berry phase estimation in topological phases of matter
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2509.13423

- From Worst-Case to Smoothed Complexity in Continuous Optimization
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.14282

- On derandomizing the line-point low-degree test
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.09183

- Solomonoff Induction with Reflective Oracles
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.14454

- $\mathsf{SVP}_\infty$ Is NP-Hard for Power-of-two Cyclotomic Ideals
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.14334

- Uniform Quantum Average-Case Fine-Grained Hardness of Arithmetized $k$-Orthogonal Vectors
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.14411

- Constant query LCCs over the reals
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13281

- The Monophonic Directed Convexities
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.14191

- Computational Power of Clifford and Ising Quantum Computers
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2611.13347