arXiv cs.DS Data Structures and Algorithms
@csds-bot.bsky.social
Unofficial bot by @vele.bsky.social w/ http://github.com/so-okada/bXiv https://arxiv.org/list/cs.DS/new
List https://bsky.app/profile/vele.bsky.social/lists/3lim7ccweqo2j
ModList https://bsky.app/profile/vele.bsky.social/lists/3lim3qnexsw2g
List https://bsky.app/profile/vele.bsky.social/lists/3lim7ccweqo2j
ModList https://bsky.app/profile/vele.bsky.social/lists/3lim3qnexsw2g
Reposted by arXiv cs.DS Data Structures and Algorithms
Jordana Blazek, Frederick C. Harris Jr: Bipartiteness in Progressive Second-Price Multi-Auction Networks with Perfect Substitute https://arxiv.org/abs/2511.19225 https://arxiv.org/pdf/2511.19225 https://arxiv.org/html/2511.19225
November 25, 2025 at 6:32 AM
Jordana Blazek, Frederick C. Harris Jr: Bipartiteness in Progressive Second-Price Multi-Auction Networks with Perfect Substitute https://arxiv.org/abs/2511.19225 https://arxiv.org/pdf/2511.19225 https://arxiv.org/html/2511.19225
Reposted by arXiv cs.DS Data Structures and Algorithms
Jannik Olbrich, Enno Ohlebusch: The TAG array of a multiple sequence alignment https://arxiv.org/abs/2511.19068 https://arxiv.org/pdf/2511.19068 https://arxiv.org/html/2511.19068
November 25, 2025 at 6:50 AM
Jannik Olbrich, Enno Ohlebusch: The TAG array of a multiple sequence alignment https://arxiv.org/abs/2511.19068 https://arxiv.org/pdf/2511.19068 https://arxiv.org/html/2511.19068
Reposted by arXiv cs.DS Data Structures and Algorithms
Blazej Wrobel, Dominik Bojko: Using random spanning trees in survivable networks design https://arxiv.org/abs/2511.19018 https://arxiv.org/pdf/2511.19018 https://arxiv.org/html/2511.19018
November 25, 2025 at 6:30 AM
Blazej Wrobel, Dominik Bojko: Using random spanning trees in survivable networks design https://arxiv.org/abs/2511.19018 https://arxiv.org/pdf/2511.19018 https://arxiv.org/html/2511.19018
Reposted by arXiv cs.DS Data Structures and Algorithms
David A. Brewster, Yichen Huang, Michael Mitzenmacher, Martin A. Nowak: The Mixed Birth-death/death-Birth Moran Process https://arxiv.org/abs/2511.18252 https://arxiv.org/pdf/2511.18252 https://arxiv.org/html/2511.18252
November 25, 2025 at 6:40 AM
David A. Brewster, Yichen Huang, Michael Mitzenmacher, Martin A. Nowak: The Mixed Birth-death/death-Birth Moran Process https://arxiv.org/abs/2511.18252 https://arxiv.org/pdf/2511.18252 https://arxiv.org/html/2511.18252
Reposted by arXiv cs.DS Data Structures and Algorithms
Ziyun Chen, Spencer Compton, Daniel Kane, Jerry Li: High-Accuracy List-Decodable Mean Estimation https://arxiv.org/abs/2511.17822 https://arxiv.org/pdf/2511.17822 https://arxiv.org/html/2511.17822
November 25, 2025 at 6:33 AM
Ziyun Chen, Spencer Compton, Daniel Kane, Jerry Li: High-Accuracy List-Decodable Mean Estimation https://arxiv.org/abs/2511.17822 https://arxiv.org/pdf/2511.17822 https://arxiv.org/html/2511.17822
Ilias Diakonikolas, Daniel M. Kane, Sihan Liu, Thanasis Pittas: PTF Testing Lower Bounds for Non-Gaussian Component Analysis https://arxiv.org/abs/2511.19398 https://arxiv.org/pdf/2511.19398 https://arxiv.org/html/2511.19398
November 25, 2025 at 6:31 AM
Ilias Diakonikolas, Daniel M. Kane, Sihan Liu, Thanasis Pittas: PTF Testing Lower Bounds for Non-Gaussian Component Analysis https://arxiv.org/abs/2511.19398 https://arxiv.org/pdf/2511.19398 https://arxiv.org/html/2511.19398
Francisco Sena, Alexandru I. Tomescu: Fast and Flexible Flow Decompositions in General Graphs via Dominators https://arxiv.org/abs/2511.19153 https://arxiv.org/pdf/2511.19153 https://arxiv.org/html/2511.19153
November 25, 2025 at 6:31 AM
Francisco Sena, Alexandru I. Tomescu: Fast and Flexible Flow Decompositions in General Graphs via Dominators https://arxiv.org/abs/2511.19153 https://arxiv.org/pdf/2511.19153 https://arxiv.org/html/2511.19153
Jan Eube, Heiko R\"oglin: New Algorithms and Hardness Results for Connected Clustering https://arxiv.org/abs/2511.19085 https://arxiv.org/pdf/2511.19085 https://arxiv.org/html/2511.19085
November 25, 2025 at 6:31 AM
Jan Eube, Heiko R\"oglin: New Algorithms and Hardness Results for Connected Clustering https://arxiv.org/abs/2511.19085 https://arxiv.org/pdf/2511.19085 https://arxiv.org/html/2511.19085
Christine Awofeso, Patrick Greaves, Oded Lachish, Amit Levi, Felix Reidl: A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neigh... https://arxiv.org/abs/2511.19027 https://arxiv.org/pdf/2511.19027 https://arxiv.org/html/2511.19027
November 25, 2025 at 6:31 AM
Christine Awofeso, Patrick Greaves, Oded Lachish, Amit Levi, Felix Reidl: A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neigh... https://arxiv.org/abs/2511.19027 https://arxiv.org/pdf/2511.19027 https://arxiv.org/html/2511.19027
Frederic Koehler, Joonhyung Shin: Overlap Analysis of the Shortest Path Problem: Local Search, Landscapes, and Franz--Parisi Potential https://arxiv.org/abs/2511.18666 https://arxiv.org/pdf/2511.18666 https://arxiv.org/html/2511.18666
November 25, 2025 at 6:31 AM
Frederic Koehler, Joonhyung Shin: Overlap Analysis of the Shortest Path Problem: Local Search, Landscapes, and Franz--Parisi Potential https://arxiv.org/abs/2511.18666 https://arxiv.org/pdf/2511.18666 https://arxiv.org/html/2511.18666
Adam Lechowicz, Nicolas Christianson, Mohammad Hajiesmaili, Adam Wierman, Prashant Shenoy: Online Smoothed Demand Management https://arxiv.org/abs/2511.18554 https://arxiv.org/pdf/2511.18554 https://arxiv.org/html/2511.18554
November 25, 2025 at 6:31 AM
Adam Lechowicz, Nicolas Christianson, Mohammad Hajiesmaili, Adam Wierman, Prashant Shenoy: Online Smoothed Demand Management https://arxiv.org/abs/2511.18554 https://arxiv.org/pdf/2511.18554 https://arxiv.org/html/2511.18554
Siyue Liu, Victor Reis: Weighted Chairman Assignment and Flow-Time Scheduling https://arxiv.org/abs/2511.18546 https://arxiv.org/pdf/2511.18546 https://arxiv.org/html/2511.18546
November 25, 2025 at 6:31 AM
Siyue Liu, Victor Reis: Weighted Chairman Assignment and Flow-Time Scheduling https://arxiv.org/abs/2511.18546 https://arxiv.org/pdf/2511.18546 https://arxiv.org/html/2511.18546
Anupam Gupta, Vera Traub: Steiner Forest: A Simplified Better-Than-2 Approximation https://arxiv.org/abs/2511.18460 https://arxiv.org/pdf/2511.18460 https://arxiv.org/html/2511.18460
November 25, 2025 at 6:31 AM
Anupam Gupta, Vera Traub: Steiner Forest: A Simplified Better-Than-2 Approximation https://arxiv.org/abs/2511.18460 https://arxiv.org/pdf/2511.18460 https://arxiv.org/html/2511.18460
Yuhang Bai, Krist\'of B\'erczi, Johanna K. Siemelink: Approximating maximum properly colored forests via degree bounded independent sets https://arxiv.org/abs/2511.18263 https://arxiv.org/pdf/2511.18263 https://arxiv.org/html/2511.18263
November 25, 2025 at 6:31 AM
Yuhang Bai, Krist\'of B\'erczi, Johanna K. Siemelink: Approximating maximum properly colored forests via degree bounded independent sets https://arxiv.org/abs/2511.18263 https://arxiv.org/pdf/2511.18263 https://arxiv.org/html/2511.18263
Kent Quanrud, Navid Tajkhorshid: From Hop Reduction to Sparsification for Negative Length Shortest Paths https://arxiv.org/abs/2511.18253 https://arxiv.org/pdf/2511.18253 https://arxiv.org/html/2511.18253
November 25, 2025 at 6:31 AM
Kent Quanrud, Navid Tajkhorshid: From Hop Reduction to Sparsification for Negative Length Shortest Paths https://arxiv.org/abs/2511.18253 https://arxiv.org/pdf/2511.18253 https://arxiv.org/html/2511.18253
Elise Tate, Joshua A. Grochow: Reconstructing Sets of Strings from Their k-way Projections: Algorithms & Complexity https://arxiv.org/abs/2511.17707 https://arxiv.org/pdf/2511.17707 https://arxiv.org/html/2511.17707
November 25, 2025 at 6:31 AM
Elise Tate, Joshua A. Grochow: Reconstructing Sets of Strings from Their k-way Projections: Algorithms & Complexity https://arxiv.org/abs/2511.17707 https://arxiv.org/pdf/2511.17707 https://arxiv.org/html/2511.17707
[2025-11-25 Tue (UTC), 11 new articles found for csDS Data Structures and Algorithms]
November 25, 2025 at 6:31 AM
[2025-11-25 Tue (UTC), 11 new articles found for csDS Data Structures and Algorithms]
Tom\'a\v{s} Domes, Pavel Vesel\'y: Relative Error Streaming Quantiles with Seamless Mergeability via Adaptive Compactors https://arxiv.org/abs/2511.17396 https://arxiv.org/pdf/2511.17396 https://arxiv.org/html/2511.17396
November 24, 2025 at 6:31 AM
Tom\'a\v{s} Domes, Pavel Vesel\'y: Relative Error Streaming Quantiles with Seamless Mergeability via Adaptive Compactors https://arxiv.org/abs/2511.17396 https://arxiv.org/pdf/2511.17396 https://arxiv.org/html/2511.17396
Hendrik Fichtenberger, Michael Kapralov, Ekaterina Kochetkova, Silvio Lattanzi, Davide Mazzali, Weronika Wrzos-Kaminska: Spectral Clustering with Side Information https://arxiv.org/abs/2511.17326 https://arxiv.org/pdf/2511.17326 https://arxiv.org/html/2511.17326
November 24, 2025 at 6:31 AM
Hendrik Fichtenberger, Michael Kapralov, Ekaterina Kochetkova, Silvio Lattanzi, Davide Mazzali, Weronika Wrzos-Kaminska: Spectral Clustering with Side Information https://arxiv.org/abs/2511.17326 https://arxiv.org/pdf/2511.17326 https://arxiv.org/html/2511.17326
Amir Abboud, Ron Safier, Nathan Wallheimer: Triangle Detection in H-Free Graphs https://arxiv.org/abs/2511.17224 https://arxiv.org/pdf/2511.17224 https://arxiv.org/html/2511.17224
November 24, 2025 at 6:31 AM
Amir Abboud, Ron Safier, Nathan Wallheimer: Triangle Detection in H-Free Graphs https://arxiv.org/abs/2511.17224 https://arxiv.org/pdf/2511.17224 https://arxiv.org/html/2511.17224
Travis Gagie: Merging RLBWTs adaptively https://arxiv.org/abs/2511.16953 https://arxiv.org/pdf/2511.16953 https://arxiv.org/html/2511.16953
November 24, 2025 at 6:31 AM
Travis Gagie: Merging RLBWTs adaptively https://arxiv.org/abs/2511.16953 https://arxiv.org/pdf/2511.16953 https://arxiv.org/html/2511.16953
Yuichi Yoshida, Zihan Zhang: Low-Sensitivity Matching via Sampling from Gibbs Distributions https://arxiv.org/abs/2511.16918 https://arxiv.org/pdf/2511.16918 https://arxiv.org/html/2511.16918
November 24, 2025 at 6:31 AM
Yuichi Yoshida, Zihan Zhang: Low-Sensitivity Matching via Sampling from Gibbs Distributions https://arxiv.org/abs/2511.16918 https://arxiv.org/pdf/2511.16918 https://arxiv.org/html/2511.16918
P\'eter Madarasi: Efficient Algorithms and Implementations for Extracting Maximum-Size $(k,\ell)$-Sparse Subgraphs https://arxiv.org/abs/2511.16877 https://arxiv.org/pdf/2511.16877 https://arxiv.org/html/2511.16877
November 24, 2025 at 6:31 AM
P\'eter Madarasi: Efficient Algorithms and Implementations for Extracting Maximum-Size $(k,\ell)$-Sparse Subgraphs https://arxiv.org/abs/2511.16877 https://arxiv.org/pdf/2511.16877 https://arxiv.org/html/2511.16877
[2025-11-24 Mon (UTC), 6 new articles found for csDS Data Structures and Algorithms]
November 24, 2025 at 6:31 AM
[2025-11-24 Mon (UTC), 6 new articles found for csDS Data Structures and Algorithms]
Reposted by arXiv cs.DS Data Structures and Algorithms
Reza Gheissari, Will Perkins, Corrine Yap: Fixed-magnetization Ising on random graphs up to reconstruction https://arxiv.org/abs/2511.16620 https://arxiv.org/pdf/2511.16620 https://arxiv.org/html/2511.16620
November 21, 2025 at 6:40 AM
Reza Gheissari, Will Perkins, Corrine Yap: Fixed-magnetization Ising on random graphs up to reconstruction https://arxiv.org/abs/2511.16620 https://arxiv.org/pdf/2511.16620 https://arxiv.org/html/2511.16620