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

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

## Research

- Clique-dependent strongly sublinear treewidth and strongly sublinear tree-independence number
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.24684

- A 3.1462-Competitive Algorithm for Matroid Secretary
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.17782

- Busy Time Minimization with Preemption, Migration, and One Resource Requirement
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23197

- Byzantine Causal Reliable Broadcast (BCRB) with Constant-Size Message Metadata
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.24018

- Single-Pass Estimation of the Clustering Coefficient Distribution in Graph Streams
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23489

- FPT Isomorphism Test for $F$-Free Tournaments
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.24804

- Moving Geometric Objects to Render Their Intersection Graph Connected or Locally Dense
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.22958

- A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2302.06506

- Bounds on Longest Simple Cycles in Weighted Directed Graphs via Optimum Cycle Means
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2601.00094

- Large-Scale Trade-Off Curve Computation for Incentive Allocation with Cardinality and Matroid Constraints
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20699

- Improved polynomial-time algorithms for detecting and recovering planted $\Theta(\sqrt{n})$-cliques
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.24780

- Vertex Cover Interdiction in Bipartite Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.24624

- Optimal Analysis of Greedy for Stochastic Online Euclidean Matching
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23947

- When Shall We $k$ Meet Again? Tight Algorithms for Diameter and Radius under the Meet Distance
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.22569

- An Arboricity-Sensitive Algorithm for the $K_r-e$-Free Graph Sandwich Problem
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23458

- Union-Find with Constant-Time Deletions Across the Optimal Worst-Case Tradeoff
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.22892

- A constant-factor approximation of the Gromov-Hausdorff distance in the plane
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.17051

- Hardness of Online Directed Steiner Network
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.22605

- A Polynomial Kernel for Planar Directed Feedback Vertex Set
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23669

- Poisson Exchange Beyond Submodularity: Effective Approximation Algorithms for Offline and Online Subset Selection over Matroids
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.24569

- The Nelson-Nguyen Conjecture via Mean-to-Moments Concentration
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.22548

- Parameter-Free Triangle Counting
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.24829

- Independent Set Reconfiguration via Dilworth Decompositions
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.10629

- A Simpler and Faster Min-Cost Flow Solver via Min-Ratio Cycles from Distance Oracles
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23852

- Budget-Independent Influence Maximization in Nearly Linear Time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23604

- The Facility Advantage in the One-Round Discrete Voronoi Game on a Line
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.24936

- The Inverse Lyndon Array
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23401

- Self-Referential $K$-SAT and the Finite Analogue of G\"odel's Incompleteness Theorem
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.01671

- A Proof of the Most Informative Boolean Function Conjecture
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.24931

- Smoothed Analysis of Inconsistent A*
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.23680

- Approximating Prize-Collecting TSP below 1.556
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.24944

- An Incremental Algorithm for Checking the Possibility of Braess Paradox in Dynamic Nets
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.24719

- Witness Set in Weak Visibility Polygons is Polynomial-Time Solvable
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.24460

- A Fixed-Parameter Algorithm for 4-Block Integer Programming
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23711

- Matrix Spencer: Eight Standard Deviations Suffice and an Almost-Linear Time Algorithm for Dense Input
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.15025

- A general counting and sampling Lov\'asz local lemma
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23671

- Kadison--Singer partitions and Bilu--Linial graph signings in polynomial time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23855

- Local Representatives and Shortest Completions for Next-to-Shortest Paths in Directed Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.22940

- On Deterministically Computing Total Variation Distance via Zonotope Compression
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.24235

- Algorithmic Collusion and the Complexity of Information-Value-Free Equilibria
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.22757

- Vector Balancing in Polynomial Time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23540

- Gain-Sharing Optimization in Randomized Primal--Dual Analysis: Structure and Certification
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2503.09508

- A Finer View of the Parameterized Landscape of Labeled Graph Contractions
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2510.06102

- The Koml\'os conjecture for complex discrepancy
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.15071

- Structural Classes for Chollet's Permanent Conjecture
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.24192

- Conjugator Length in Iterated Cyclic Amalgams of Free Groups
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21116

- Notes on a strongly aperiodic monotile in $E^3$
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.24779

- On the majority game chromatic number of forests and other graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23803

- Discrete Isoperimetric Inequalities via Curvature
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.24687

- Counting and Covering in Nearest-Neighbour Representations of Boolean Functions
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23094

- An Odd Pfaffian Number
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.22928

- The speed of convergence in the Cooper-Dutle dueling game
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2605.00194

- Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2605.19055

- Arc Kayles is PSPACE-complete
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23777

- An $O(k\log(n/k))$ Bound on Spanning Bipartite Connectivity
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23262

- Sensitivity and Block Sensitivity of Elementary Symmetric Boolean Functions of Arbitrary Degree
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23781

- Three Hardness Results for Graph Similarity Problems
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2309.03810

- A geometric characterization of unbounded integer cubic optimization problems via thin rays
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2511.02983

- Finding a Positive Index Nash Equilibrium is PPADS-Complete
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23879

- Many Proof Complexity Generators Inside One Demi-Bits Generator
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23228

- Formalizing PARITY Circuit Lower Bounds in Lean
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.24188

- Unrestrictions and concise secant varieties
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.24879

- Polyhedral Methods for Cooperative Games: Small Lifts and Hard Faces
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.24593

- Hierarchies within TFNP: building blocks and collapses
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2507.21550

- Sumset Structure in Local Computation
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.22732

- Metric Self-Dual Completion and Optimal Additive Hardness for Quantum and Graph-State Distance
  Source: arxiv-cs-cc
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2609.22669

- Strong NP-Completeness of Unrestricted Balanced Mobiles
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.24654

- Bit-counting complexity classes
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.04406

- An exponential lower bound for the bit pigeonhole principle in resolution over parities
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23015

- Constant-Coin Complete-Information Debates for $\mathsf{P}$ with Arbitrarily Small Strong Error
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.24272

- SC Derandomization for Regular ROBPs and Models Beyond BPL
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23603

- Undefinability of Approximation of 2-to-2 Games
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2504.03523

- Interval number for tournaments in P3-convexity
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.22640

- Complexity of Output Feedback Stabilization
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.20636

- Quadratic Word Equations with a Linear Side: Polynomial Nielsen Graph Diameter and NP-Completeness
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.21785

- Lee-Yang theorem for fermions
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.23942