Deeparnab Chakrabarty, Jonathan Conroy, Ankita Sarkar Clustering in Varying Metrics https://arxiv.org/abs/2510.07860

Anton Herrmann, Christian Komusiewicz, Nils Morawietz, Frank Sommer Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set https://arxiv.org/abs/2510.08124

Simon Meierhans, Maximilian Probst Gutenberg Dynamic Connectivity with Expected Polylogarithmic Worst-Case Update Time https://arxiv.org/abs/2510.08297

Zachary Friggstad, Tobias M\"omke Approximating Multiple-Depot Capacitated Vehicle Routing via LP Rounding https://arxiv.org/abs/2510.05321

Michael A. Bender, Alex Conway, Mart\'in Farach-Colton, Rob Johnson, Prashant Pandey Time To Replace Your Filter: How Maplets Simplify System Design https://arxiv.org/abs/2510.05518

Argyrios Deligkas, Michelle D\"oring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs https://arxiv.org/abs/2510.05806

Longkun Guo, Zeyu Lin, Chaoqi Jia, Chao Chen Improved Streaming Algorithm for Fair $k$-Center Clustering https://arxiv.org/abs/2510.05937

S\'andor P. Fekete, Phillip Keldenich, Dominik Krupke, Michael Perk Efficient Heuristics and Exact Methods for Pairwise Interaction Sampling https://arxiv.org/abs/2510.05955

Binhong Li, Xiao Yan, Shangqi Lu Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search https://arxiv.org/abs/2510.05975

Yashaswini Mathur, Prafullkumar Tale A Finer View of the Parameterized Landscape of Labeled Graph Contractions https://arxiv.org/abs/2510.06102

Binita Maity, Shrutimoy Das, Anirban Dasgupta Local Search-based Individually Fair Clustering with Outliers https://arxiv.org/abs/2510.06130

Hossein Gholizadeh, Yonggang Jiang A Subquadratic Two-Party Communication Protocol for Minimum Cost Flow https://arxiv.org/abs/2510.03427

Sukanya Samanta, Manohar Reddy A Dynamic Programming Approach to Evader Pathfinding in Static Pursuit Scenarios https://arxiv.org/abs/2510.04050

Shaofeng H. -C. Jiang, Pan Peng, Haoze Wang Streaming Max-Cut in General Metrics https://arxiv.org/abs/2510.04435

Yusuf Amidu, Khaled Elbassioni, Adriana F. Gabor Online Multiple Resource Allocation Problems with Departures via the Primal-Dual Approach https://arxiv.org/abs/2510.04737

Sanjeev Khanna, Ashwin Padaki, Krish Singal, Erik Waingarten A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams https://arxiv.org/abs/2510.04918

Rikhav Shah, Sandeep Silwal, Haike Xu Even Faster Kernel Matrix Linear Algebra via Density Estimation https://arxiv.org/abs/2510.02540

Gary Hoppenworth, Thatchaphol Saranurak, Benyu Wang Near-Optimal Fault-Tolerant Strong Connectivity Preservers https://arxiv.org/abs/2510.02562

Sayan Mukherjee, Shinichiro Akiyama Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry https://arxiv.org/abs/2510.02725

Ethan Torres, Ramavarapu Sreenivas, Richard Sowers On the Enumeration of all Unique Paths of Recombining Trinomial Trees https://arxiv.org/abs/2510.02727

Moses Charikar, Chirag Pabbaraju Pareto-optimal Non-uniform Language Generation https://arxiv.org/abs/2510.02795

J Niklas Dahlmeier, D Ellis Hershkowitz Low Recourse Arborescence Forests Under Uniformly Random Arcs https://arxiv.org/abs/2510.02950

Thanh Dang, Jiaming Liang Oracle-based Uniform Sampling from Convex Bodies https://arxiv.org/abs/2510.02983

Pravesh K. Kothari, Jeff Xu Smooth Trade-off for Tensor PCA via Sharp Bounds for Kikuchi Matrices https://arxiv.org/abs/2510.03061

Da Qi Chen, Daniel Hathcock, D Ellis Hershkowitz, R. Ravi The Steiner Path Aggregation Problem https://arxiv.org/abs/2510.01392

Justine Cauvi (ENS de Lyon, ARGO), Nils Morawietz (LaBRI), Laurent Viennot (DI-ENS, ARGO) Foremost, Fastest, Shortest: Temporal Graph Realization under Various Path Metrics https://arxiv.org/abs/2510.01702

Alina Ene, Ta Duy Nguyen, Adrian Vladu Improved $\ell_{p}$ Regression via Iteratively Reweighted Least Squares https://arxiv.org/abs/2510.01729

Alexander E. Black, Christian N\"obel, Raphael Steiner Short circuit walks in fixed dimension https://arxiv.org/abs/2510.01916

Micha{\l} W{\l}odarczyk Designing Compact ILPs via Fast Witness Verification https://arxiv.org/abs/2509.25445

Andreas Kalavas, Charalampos Platanos, Thanos Tolias A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP https://arxiv.org/abs/2509.26073

Mattia D'Emidio, Gabriele Di Stefano On Computing Top-$k$ Simple Shortest Paths from a Single Source https://arxiv.org/abs/2509.26094

Jeffrey Bringolf, Anne-Laure Ehresmann, Hovhannes A. Harutyunyan Improved Approximation for Broadcasting in k-cycle Graphs https://arxiv.org/abs/2509.26426

Ezra Johnson, Adam Lechowicz, Mohammad Hajiesmaili Signal-Aware Workload Shifting Algorithms with Uncertainty-Quantified Predictors https://arxiv.org/abs/2509.26511

Xiaobin Rui, Zhixiao Wang, Chen Peng, Qiangpeng Fang, Wei Chen Efficient Approximation Algorithms for Fair Influence Maximization under Maximin Constraint https://arxiv.org/abs/2509.26579

Jarno N. Alanko, Maximo Perez-Lopez Computing k-mers in Graphs https://arxiv.org/abs/2509.22885

Fuming Yang, Yaron Meirovitch, Jeff W. Lichtman Sparse Graph Reconstruction and Seriation for Large-Scale Image Stacks https://arxiv.org/abs/2509.23084

D\'aniel Gerbner, Andr\'as Imolay, Kartal Nagy, Bal\'azs Patk\'os, Krist\'of Z\'olomy Finding the diameter of a tree with distance queries https://arxiv.org/abs/2509.23326

Sukanya Samanta, Abhi Rohit Kalathoti, Siva Jayanth Gonchi, Venkata Krishna Kashyap Adiraju, Sai Kiran Nettem Maximal Covering Location Problem: A Set Coverage Approach Using Dynamic Programming https://arxiv.org/abs/2509.23334

Arnold Filtser Stochastic Embedding of Digraphs into DAGs https://arxiv.org/abs/2509.23458

Chenghao Zhu, Yi Zhou A Near-Real-Time Reduction-Based Algorithm for Coloring Massive Graphs https://arxiv.org/abs/2509.23606

Ilari Vallivaara, Katja Poikselk\"a, Pauli Rikula, Juha R\"oning Systematic Alias Sampling: an efficient and low-variance way to sample from a discrete distribution https://arxiv.org/abs/2509.24089

Jos\'e Correa, Evangelia Gergatsouli, Bruno Ziliotto The Role of Commitment in Optimal Stopping https://arxiv.org/abs/2509.24132

Louis-Roy Langevin, Alex Waese-Perlman Optimally revealing bits for rejection sampling https://arxiv.org/abs/2509.24290

Tatsuya Gima, Yasuaki Kobayashi, Yota Otachi, Takumi Sato Forcing a unique minimum spanning tree and a unique shortest path https://arxiv.org/abs/2509.24309

Christian Siebert Simple in-place yet comparison-optimal Mergesort https://arxiv.org/abs/2509.24540

Bernhard Haeupler, Richard Hlad\'ik, Shengzhe Wang, Zhijun Zhang Stronger Directed Low-Diameter Decompositions with Sub-Logarithmic Diameter and Separation https://arxiv.org/abs/2509.24565

Igor V. Netay Algorithms and data structures for automatic precision estimation of neural networks https://arxiv.org/abs/2509.24607

Sebastian Bruch, Franco Maria Nardini, Cosimo Rulli, Rossano Venturini Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets https://arxiv.org/abs/2509.24815

Salman Beigi, Omid Etesami, Mohammad Mahmoody, Amir Najafi New Algorithmic Directions in Optimal Transport and Applications for Product Spaces https://arxiv.org/abs/2509.21502

Slobodan Mitrovi\'c, Theodore Pan, Mahdi Qaempanah, Mohammad Amin Raeisi New Parallel and Streaming Algorithms for Directed Densest Subgraph https://arxiv.org/abs/2509.21729