| 中文标题 | 作者 | 论文ID | 分类简称 | 发布时间 |
|---|---|---|---|---|
| Zip-zip树：使Zip树更平衡、偏向、紧凑或持久化 | Ofek Gila (1), Michael T. Goodrich (1), Robert E. Tarjan (2) ((1) University of California, Irvine, (2) Princeton University) | 2307.07660 | cs.DS | 2023-07-18 |
| 计算带标签图的SEQ-IC-LCS | Yuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga | 2307.07676 | cs.DS | 2023-07-18 |
| WSRPT对于加权完成时间调度的竞争比为1.2259 | Samin Jamalabadi and Uwe Schwiegelshohn | 2307.07739 | cs.DS | 2023-07-18 |
| 加权拟阵问题的严格下界 | Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai | 2307.07773 | cs.DS | 2023-07-18 |
| Lipschitz连续算法在覆盖问题中的应用 | Soh Kumabe, Yuichi Yoshida | 2307.08213 | cs.DS | 2023-07-18 |
| 量子图绘制 | Susanna Caroppo, Giordano Da Lozzo, and Giuseppe Di Battista | 2307.08371 | cs.DS | 2023-07-18 |
| 圣诞老人与完成时间和拟阵相遇：算法与约化 | ''Etienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schl"oter | 2307.08453 | cs.DS | 2023-07-18 |
| 二分图和完全图中预算最大权独立集的严格界限 | Ilan Doron-Arad and Hadas Shachnai | 2307.08592 | cs.DS | 2023-07-18 |
| 稀疏正则表达式匹配 | Philip Bille and Inge Li G{o}rtz | 1907.04752 | cs.DS | 2023-07-17 |
| 流式算法的抗噪声转换 | Meghal Gupta and Rachel Yun Zhang | 2307.07087 | cs.DS | 2023-07-17 |
| 在完全动态模型中近似编辑距离 | Tomasz Kociumaka, Anish Mukherjee, Barna Saha | 2307.07175 | cs.DS | 2023-07-17 |
| 具有可变数量仓库的多旅行商问题的$(3/2 + \varepsilon)$-近似解 | Max Deppert and Matthias Kaul and Matthias Mnich | 2307.07180 | cs.DS | 2023-07-17 |
| 平面图中的最优容错可达性标签化 | Shiri Chechik, Shay Mozes, Oren Weimann | 2307.07222 | cs.DS | 2023-07-17 |
| 随机 Wheeler 自动机 | Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso and Nicola Prezza | 2307.07267 | cs.DS | 2023-07-17 |
| 延迟决策和预订成本 | Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith | 2307.07284 | cs.DS | 2023-07-17 |
| 一个简单的确定性近线性时间逼近方案用于具有任意正边缘成本的转运问题 | Emily Fox | 2307.07440 | cs.DS | 2023-07-17 |
| 图论中的算法视角下的Tur''{a}n定理 | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov | 2307.07456 | cs.DS | 2023-07-17 |
| 通过战略领域中核苷酸的局部分布对DNA序列进行分析 | Probir Mondal, Pratyay Banerjee and Krishnendu Basuli | 2303.14994 | cs.DS | 2023-07-14 |
| 平方最小和装箱问题的近似算法 | Rachel Vanucchi Saraiva (1) and Rafael C. S. Schouery (1) ((1) Institute of Computing, University of Campinas, Brazil) | 2307.06776 | cs.DS | 2023-07-14 |
| 平面不交路径、树宽和内核 | Micha{l} W{l}odarczyk and Meirav Zehavi | 2307.06792 | cs.DS | 2023-07-14 |
| 关于近似最大割的切割查询复杂度 | Orestis Plevrakis, Seyoon Ragavan, S. Matthew Weinberg | 2211.04506 | cs.DS | 2023-07-13 |
| 增量$(1-epsilon)$-近似动态匹配在$O(poly(1/epsilon))$更新时间中 | Joakim Blikstad and Peter Kiss | 2302.08432 | cs.DS | 2023-07-13 |
| 顶点分割到路径宽度最多为1的参数化复杂度 | Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter | 2302.14725 | cs.DS | 2023-07-12 |
| 嵌套嵌入式组合及其在异常值去除中的应用 | Shuchi Chawla and Kristin Sheridan | 2306.11604 | cs.DS | 2023-07-12 |
| 基于图分解的最短啤酒路径查询 | Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama | 2307.02787 | cs.DS | 2023-07-12 |