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
Wenyan Luo, Dustin G. Mixon: BalLOT: Balanced $k$-means clustering with optimal transport https://arxiv.org/abs/2512.05926 https://arxiv.org/pdf/2512.05926 https://arxiv.org/html/2512.05926
December 8, 2025 at 6:53 AM
Wenyan Luo, Dustin G. Mixon: BalLOT: Balanced $k$-means clustering with optimal transport https://arxiv.org/abs/2512.05926 https://arxiv.org/pdf/2512.05926 https://arxiv.org/html/2512.05926
Reposted by arXiv cs.DS Data Structures and Algorithms
Dehong Zheng, Zhongzhi Zhang: ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks https://arxiv.org/abs/2512.05460 https://arxiv.org/pdf/2512.05460 https://arxiv.org/html/2512.05460
December 8, 2025 at 6:34 AM
Dehong Zheng, Zhongzhi Zhang: ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks https://arxiv.org/abs/2512.05460 https://arxiv.org/pdf/2512.05460 https://arxiv.org/html/2512.05460
Reposted by arXiv cs.DS Data Structures and Algorithms
Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Giacomo Ortali: On Planar Straight-Line Dominance Drawings https://arxiv.org/abs/2512.05225 https://arxiv.org/pdf/2512.05225 https://arxiv.org/html/2512.05225
December 8, 2025 at 6:29 AM
Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Giacomo Ortali: On Planar Straight-Line Dominance Drawings https://arxiv.org/abs/2512.05225 https://arxiv.org/pdf/2512.05225 https://arxiv.org/html/2512.05225
Yonggang Jiang, Yaowei Long, Thatchaphol Saranurak, Benyu Wang: Crude Approximation of Directed Minimum Cut and Arborescence Packing in Almost Linear Time https://arxiv.org/abs/2512.05300 https://arxiv.org/pdf/2512.05300 https://arxiv.org/html/2512.05300
December 8, 2025 at 6:31 AM
Yonggang Jiang, Yaowei Long, Thatchaphol Saranurak, Benyu Wang: Crude Approximation of Directed Minimum Cut and Arborescence Packing in Almost Linear Time https://arxiv.org/abs/2512.05300 https://arxiv.org/pdf/2512.05300 https://arxiv.org/html/2512.05300
Spencer Gibson, Yun William Yu: Incorporating indel channels into average-case analysis of seed-chain-extend https://arxiv.org/abs/2512.05247 https://arxiv.org/pdf/2512.05247 https://arxiv.org/html/2512.05247
December 8, 2025 at 6:31 AM
Spencer Gibson, Yun William Yu: Incorporating indel channels into average-case analysis of seed-chain-extend https://arxiv.org/abs/2512.05247 https://arxiv.org/pdf/2512.05247 https://arxiv.org/html/2512.05247
[2025-12-08 Mon (UTC), 2 new articles found for csDS Data Structures and Algorithms]
December 8, 2025 at 6:31 AM
[2025-12-08 Mon (UTC), 2 new articles found for csDS Data Structures and Algorithms]
Reposted by arXiv cs.DS Data Structures and Algorithms
Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick: MAX BISECTION might be harder to approximate than MAX CUT https://arxiv.org/abs/2512.04951 https://arxiv.org/pdf/2512.04951 https://arxiv.org/html/2512.04951
December 5, 2025 at 6:29 AM
Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick: MAX BISECTION might be harder to approximate than MAX CUT https://arxiv.org/abs/2512.04951 https://arxiv.org/pdf/2512.04951 https://arxiv.org/html/2512.04951
Reposted by arXiv cs.DS Data Structures and Algorithms
Ioannis Karras: Optimizations and extensions for fair join pattern matching https://arxiv.org/abs/2512.04876 https://arxiv.org/pdf/2512.04876 https://arxiv.org/html/2512.04876
December 5, 2025 at 6:34 AM
Ioannis Karras: Optimizations and extensions for fair join pattern matching https://arxiv.org/abs/2512.04876 https://arxiv.org/pdf/2512.04876 https://arxiv.org/html/2512.04876
Han Dai, Shi Li, Sijin Peng: On Tight FPT Time Approximation Algorithms for k-Clustering Problems https://arxiv.org/abs/2512.04614 https://arxiv.org/pdf/2512.04614 https://arxiv.org/html/2512.04614
December 5, 2025 at 6:31 AM
Han Dai, Shi Li, Sijin Peng: On Tight FPT Time Approximation Algorithms for k-Clustering Problems https://arxiv.org/abs/2512.04614 https://arxiv.org/pdf/2512.04614 https://arxiv.org/html/2512.04614
Tatyana Benko, Rebecca Jones, Lucas Tate: A customizable inexact subgraph matching algorithm for attributed graphs https://arxiv.org/abs/2512.04280 https://arxiv.org/pdf/2512.04280 https://arxiv.org/html/2512.04280
December 5, 2025 at 6:31 AM
Tatyana Benko, Rebecca Jones, Lucas Tate: A customizable inexact subgraph matching algorithm for attributed graphs https://arxiv.org/abs/2512.04280 https://arxiv.org/pdf/2512.04280 https://arxiv.org/html/2512.04280
Itai Dinur, Alexander Golovnev: Improved Time-Space Tradeoffs for 3SUM-Indexing https://arxiv.org/abs/2512.04258 https://arxiv.org/pdf/2512.04258 https://arxiv.org/html/2512.04258
December 5, 2025 at 6:31 AM
Itai Dinur, Alexander Golovnev: Improved Time-Space Tradeoffs for 3SUM-Indexing https://arxiv.org/abs/2512.04258 https://arxiv.org/pdf/2512.04258 https://arxiv.org/html/2512.04258
[2025-12-05 Fri (UTC), 3 new articles found for csDS Data Structures and Algorithms]
December 5, 2025 at 6:31 AM
[2025-12-05 Fri (UTC), 3 new articles found for csDS Data Structures and Algorithms]
Reposted by arXiv cs.DS Data Structures and Algorithms
Kamil Khadiev, Vladislav Remidovskii, Timur Bikmullin, Aliya Khadieva: Quantum Algorithm for Searching for the Longest Segment and the Largest Empty Rectangle https://arxiv.org/abs/2512.03788 https://arxiv.org/pdf/2512.03788 https://arxiv.org/html/2512.03788
December 4, 2025 at 6:50 AM
Kamil Khadiev, Vladislav Remidovskii, Timur Bikmullin, Aliya Khadieva: Quantum Algorithm for Searching for the Longest Segment and the Largest Empty Rectangle https://arxiv.org/abs/2512.03788 https://arxiv.org/pdf/2512.03788 https://arxiv.org/html/2512.03788
Noga Alon, Sabyasachi Basu, Shweta Jain, Haim Kaplan, Jakub {\L}\k{a}cki, Blair D. Sullivan: Aggregating maximal cliques in real-world graphs https://arxiv.org/abs/2512.03960 https://arxiv.org/pdf/2512.03960 https://arxiv.org/html/2512.03960
December 4, 2025 at 6:31 AM
Noga Alon, Sabyasachi Basu, Shweta Jain, Haim Kaplan, Jakub {\L}\k{a}cki, Blair D. Sullivan: Aggregating maximal cliques in real-world graphs https://arxiv.org/abs/2512.03960 https://arxiv.org/pdf/2512.03960 https://arxiv.org/html/2512.03960
Malory Marin, Jean-Florent Raymond, R\'emi Watrigant: Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs https://arxiv.org/abs/2512.03843 https://arxiv.org/pdf/2512.03843 https://arxiv.org/html/2512.03843
December 4, 2025 at 6:31 AM
Malory Marin, Jean-Florent Raymond, R\'emi Watrigant: Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs https://arxiv.org/abs/2512.03843 https://arxiv.org/pdf/2512.03843 https://arxiv.org/html/2512.03843
Robert Ganian, Hung P. Hoang, Simon Wietheger: Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity https://arxiv.org/abs/2512.03718 https://arxiv.org/pdf/2512.03718 https://arxiv.org/html/2512.03718
December 4, 2025 at 6:31 AM
Robert Ganian, Hung P. Hoang, Simon Wietheger: Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity https://arxiv.org/abs/2512.03718 https://arxiv.org/pdf/2512.03718 https://arxiv.org/html/2512.03718
Bharat Sharman, Elkafi Hassini: Comparative algorithm performance evaluation and prediction for the maximum clique problem using instance space analysis https://arxiv.org/abs/2512.03419 https://arxiv.org/pdf/2512.03419 https://arxiv.org/html/2512.03419
December 4, 2025 at 6:31 AM
Bharat Sharman, Elkafi Hassini: Comparative algorithm performance evaluation and prediction for the maximum clique problem using instance space analysis https://arxiv.org/abs/2512.03419 https://arxiv.org/pdf/2512.03419 https://arxiv.org/html/2512.03419
Sandy Irani, Michael Luby: Singing a MIS https://arxiv.org/abs/2512.03311 https://arxiv.org/pdf/2512.03311 https://arxiv.org/html/2512.03311
December 4, 2025 at 6:31 AM
Sandy Irani, Michael Luby: Singing a MIS https://arxiv.org/abs/2512.03311 https://arxiv.org/pdf/2512.03311 https://arxiv.org/html/2512.03311
Miros{\l}aw Kowaluk, Andrzej Lingas, Mia Persson: Fast approximate $\ell$-center clustering in high dimensional spaces https://arxiv.org/abs/2512.03304 https://arxiv.org/pdf/2512.03304 https://arxiv.org/html/2512.03304
December 4, 2025 at 6:31 AM
Miros{\l}aw Kowaluk, Andrzej Lingas, Mia Persson: Fast approximate $\ell$-center clustering in high dimensional spaces https://arxiv.org/abs/2512.03304 https://arxiv.org/pdf/2512.03304 https://arxiv.org/html/2512.03304
Aditya Anand, Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Euiwoong Lee, Debmalya Panigrahi, Sijin Peng: Complexity of Local Search for CSPs Parameterized by Constraint Difference https://arxiv.org/abs/2512.03275 https://arxiv.org/pdf/2512.03275 https://arxiv.org/html/2512.03275
December 4, 2025 at 6:31 AM
Aditya Anand, Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Euiwoong Lee, Debmalya Panigrahi, Sijin Peng: Complexity of Local Search for CSPs Parameterized by Constraint Difference https://arxiv.org/abs/2512.03275 https://arxiv.org/pdf/2512.03275 https://arxiv.org/html/2512.03275
Michael Souza, J\'ulio Ara\'ujo, John Kesley Costa, Carlile Lavor: On the Complexity of the Ordered Covering Problem in Distance Geometry https://arxiv.org/abs/2512.03124 https://arxiv.org/pdf/2512.03124 https://arxiv.org/html/2512.03124
December 4, 2025 at 6:31 AM
Michael Souza, J\'ulio Ara\'ujo, John Kesley Costa, Carlile Lavor: On the Complexity of the Ordered Covering Problem in Distance Geometry https://arxiv.org/abs/2512.03124 https://arxiv.org/pdf/2512.03124 https://arxiv.org/html/2512.03124
[2025-12-04 Thu (UTC), 8 new articles found for csDS Data Structures and Algorithms]
December 4, 2025 at 6:31 AM
[2025-12-04 Thu (UTC), 8 new articles found for csDS Data Structures and Algorithms]
Reposted by arXiv cs.DS Data Structures and Algorithms
Yaroslav Alekseev, Mika G\"o\"os, Konstantin Myasnikov, Artur Riazanov, Dmitry Sokolov: Sampling Permutations with Cell Probes is Hard https://arxiv.org/abs/2512.02724 https://arxiv.org/pdf/2512.02724 https://arxiv.org/html/2512.02724
December 3, 2025 at 6:29 AM
Yaroslav Alekseev, Mika G\"o\"os, Konstantin Myasnikov, Artur Riazanov, Dmitry Sokolov: Sampling Permutations with Cell Probes is Hard https://arxiv.org/abs/2512.02724 https://arxiv.org/pdf/2512.02724 https://arxiv.org/html/2512.02724
Reposted by arXiv cs.DS Data Structures and Algorithms
Klaus Jansen, Felix Ohnesorge, Lis Pirotton: A Tight Double-Exponentially Lower Bound for High-Multiplicity Bin Packing https://arxiv.org/abs/2512.02691 https://arxiv.org/pdf/2512.02691 https://arxiv.org/html/2512.02691
December 3, 2025 at 6:29 AM
Klaus Jansen, Felix Ohnesorge, Lis Pirotton: A Tight Double-Exponentially Lower Bound for High-Multiplicity Bin Packing https://arxiv.org/abs/2512.02691 https://arxiv.org/pdf/2512.02691 https://arxiv.org/html/2512.02691
Reposted by arXiv cs.DS Data Structures and Algorithms
Hossein Nekouyan, Bo Sun, Raouf Boutaba, Xiaoqi Tan: Posted Pricing for Online Selection: Limited Price Changes and Risk Sensitivity https://arxiv.org/abs/2512.02427 https://arxiv.org/pdf/2512.02427 https://arxiv.org/html/2512.02427
December 3, 2025 at 6:31 AM
Hossein Nekouyan, Bo Sun, Raouf Boutaba, Xiaoqi Tan: Posted Pricing for Online Selection: Limited Price Changes and Risk Sensitivity https://arxiv.org/abs/2512.02427 https://arxiv.org/pdf/2512.02427 https://arxiv.org/html/2512.02427