Computing Maximal Repeating Subsequences in a String Mingyang Gong, Adiesha Liyanage, Braeden Sopp, Binhai Zhu arxiv.org/abs/2601.12200 [𝚌𝚜.𝙳𝚂 𝚌𝚜.𝙵𝙻]

Analysis of a Random Local Search Algorithm for Dominating Set Hendrik Higl arxiv.org/abs/2601.11841 [𝚌𝚜.𝙳𝚂 𝚖𝚊𝚝𝚑.𝙲𝙾 𝚖𝚊𝚝𝚑.𝙿𝚁]

Sum Estimation via Vector Similarity Search Stephen Mussmann, Mehul Smriti Raje, Kavya Tumkur, Oumayma Messoussi, Cyprien Hachem, Seby Jacob arxiv.org/abs/2601.11765 [𝚌𝚜.𝙳𝚂]

Learning-Augmented Online TRP on a Line Swapnil Guragain, Gokarna Sharma arxiv.org/abs/2601.13494 [𝚌𝚜.𝙳𝚂 𝚌𝚜.𝚁𝙾]

Approximation Schemes for Sequential Hiring Problems Danny Segev, Uri Stein arxiv.org/abs/2601.12750 [𝚌𝚜.𝙳𝚂 𝚖𝚊𝚝𝚑.𝙾𝙲]

Kd-tree Based Wasserstein Distance Approximation for High-Dimensional Data Kanata Teshigawara, Keisho Oh, Ken Kobayashi, Kazuhide Nakata arxiv.org/abs/2601.12975 [𝚌𝚜.𝙳𝚂]

Exact Computation of the Catalan Number C(2,050,572,903) Mahesh Ramani arxiv.org/abs/2601.11621 [𝚌𝚜.𝙳𝚂 𝚖𝚊𝚝𝚑.𝙲𝙾]

Bicriteria Algorithms for Submodular Cover with Partition and Fairness Constraints Wenjing Chen, Yixin Chen, Victoria G. Crawford arxiv.org/abs/2601.11755 [𝚌𝚜.𝙳𝚂]

Optimising Cylindrical Algebraic Coverings for use in SMT by Solving a Set Covering Problem with Reasons Abiola Babatunde, Matthew England, AmirHosein Sadeghimanesh arxiv.org/abs/2601.14424 [𝚌𝚜.𝙳𝚂 𝚖𝚊𝚝𝚑.𝙲𝙾]

Economic Warehouse Lot Scheduling: Breaking the 2-Approximation Barrier Danny Segev arxiv.org/abs/2601.15068 [𝚌𝚜.𝙳𝚂 𝚖𝚊𝚝𝚑.𝙾𝙲]

Economic Warehouse Lot Scheduling: Approximation Schemes via Efficiently-Representable DP-Encoded Policies Danny Segev arxiv.org/abs/2601.14993 [𝚌𝚜.𝙳𝚂 𝚖𝚊𝚝𝚑.𝙾𝙲]

Dynamic Pattern Matching with Wildcards Arshia Ataee Naeini, Amir-Parsa Mobed, Masoud Seddighin, Saeed Seddighin arxiv.org/abs/2601.16182 [𝚌𝚜.𝙳𝚂]

Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number Daniel Lokshtanov, Michał Pilipczuk, Paweł Rzążewski arxiv.org/abs/2601.15861 [𝚌𝚜.𝙳𝚂]

Improved Approximation Ratios for the Shortest Common Superstring Problem with Reverse Complements Ryosuke Yamano, Tetsuo Shibuya arxiv.org/abs/2601.15814 [𝚌𝚜.𝙳𝚂]

Tight Bounds for Gaussian Mean Estimation under Personalized Differential Privacy Wei Dong, Li Ge arxiv.org/abs/2601.15682 [𝚌𝚜.𝙳𝚂]

Nested and outlier embeddings into trees Shuchi Chawla, Kristin Sheridan arxiv.org/abs/2601.15470 [𝚌𝚜.𝙳𝚂]

Online Computation of Palindromes and Suffix Trees on Tries Hiroki Shibata, Mitsuru Funakoshi, Takuya Mieno, Masakazu Ishihata, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda arxiv.org/abs/2601.16485 [𝚌𝚜.𝙳𝚂]

Conditionally Tight Algorithms for Maximum k-Coverage and Partial k-Dominating Set via Arity-Reducing Hypercuts Nick Fischer, Marvin Künnemann, Mirza Redzic arxiv.org/abs/2601.16923 [𝚌𝚜.𝙳𝚂]

Recovering Communities in Structured Random Graphs Michael Kapralov, Luca Trevisan, Weronika Wrzos-Kaminska arxiv.org/abs/2601.16910 [𝚌𝚜.𝙳𝚂]

Minimizing Completion Times of Stochastic Jobs on Parallel Machines is Hard Benjamin Moseley, Kirk Pruhs, Marc Uetz, Rudy Zhou arxiv.org/abs/2601.17425 [𝚌𝚜.𝙳𝚂 𝚌𝚜.𝙲𝙲 𝚖𝚊𝚝𝚑.𝙾𝙲]