科言猫
学术研究的AI总结
首页
文献互助
订阅
我的收藏
科研工具
选题分析
论文总结
专利管理
专利缴费
专利查询
未登录
返回
期刊详情
A
ACM Transactions on Algorithms
IF
1.4
论文数
43
被引数
1143
相关解读
0
订阅
期刊论文
43
相关解读
0
期刊论文
43
发表时间
发表时间
IF
被引数
Finding Matchings in Dense Hypergraphs
在稠密超图中发现匹配
ACM Transactions on Algorithms
IF
1.4
2026-04-01
0
PRE
AI
Han, Jie; Keevash, Peter
分享
收藏
Faster Algorithms for Longest Common Substring
更快的最长公共子串算法
ACM Transactions on Algorithms
IF
1.4
2026-04-01
0
PRE
AI
Charalampopoulos, Panagiotis; Kociumaka, Tomasz; Radoszewski, Jakub; Pissis, Solon P.
分享
收藏
Lower Bounds for Weighted Matroid Problems
加权拟阵问题的下界
ACM Transactions on Algorithms
IF
1.4
2026-04-01
0
PRE
AI
Doron-Arad, Ilan; Kulik, Ariel; Shachnai, Hadas
分享
收藏
Computing NP-hard Repetitiveness Measures via MAX-SAT
通过MAX-SAT计算NP难可重复性度量
ACM Transactions on Algorithms
IF
1.4
2026-04-01
1
PRE
AI
Bannai, Hideo; Goto, Keisuke; Ishihata, Masakazu; Kanda, Shunsuke; Koppl, Dominik; Nishimoto, Takaaki; Subercaseaux, Bernardo
分享
收藏
Gap Amplification for Reconfiguration Problems
重构问题的间隙放大
ACM Transactions on Algorithms
IF
1.4
2026-04-01
0
PRE
AI
Ohsaka, Naoto
分享
收藏
Hierarchies of Minion Tests for PCSPs through Tensors
通过张量对PCSPs进行任务等级测试
ACM Transactions on Algorithms
IF
1.4
2026-04-01
0
PRE
AI
Ciardo, Lorenzo; Zivny, Stanislav
分享
收藏
Sparse Induced Subgraphs in P6-free Graphs
P6-free图中的稀疏诱导子图
ACM Transactions on Algorithms
IF
1.4
2026-04-01
0
PRE
AI
Chudnovsky, Maria; McCarty, Rose; Pilipczuk, Marcin; Pilipczuk, Michal; Rzazewski, Pawel
分享
收藏
Dependent Rounding with Strong Negative-Correlation, and Scheduling on Unrelated Machines to Minimize Completion
强负相关依赖舍入与异构机器上的调度以最小化完成时间
ACM Transactions on Algorithms
IF
1.4
2026-04-01
0
PRE
AI
Harris, David G.
分享
收藏
Planar Multiway Cut with Terminals on Few Faces
平面多路割问题中终端位于少数面上的情况
ACM Transactions on Algorithms
IF
1.4
2026-04-01
0
PRE
AI
Pandey, Sukanya; Van Leeuwen, Erik Jan
分享
收藏
Cut Paths and Their Remainder Structure
切割路径及其剩余结构
ACM Transactions on Algorithms
IF
1.4
2026-04-01
0
PRE
AI
Cairo, Massimo; Khan, Shahbaz; Rizzi, Romeo; Schmidt, Sebastian; Tomescu, Alexandru i.; Zirondelli, Elia c.
分享
收藏
Recognizing Completely Reachable Automata in Quadratic Time
在二次时间内识别完全可达自动机
ACM Transactions on Algorithms
IF
1.4
2026-04-01
0
PRE
AI
Ferens, Robert; Szykula, Marek
分享
收藏
A Tight Quasi-Polynomial Bound for Global Label Min-Cut
全局标签最小割的紧拟多项式界
ACM Transactions on Algorithms
IF
1.4
2026-04-01
0
PRE
AI
Jaffke, Lars; de Lima, Paloma T.; Masarik, Tomas; Pilipczuk, Marcin; Souza, Ueverton S.
分享
收藏
Fast and Small Subsampled R-indexes
快速且紧凑的子采样R-索引
ACM Transactions on Algorithms
IF
1.4
2026-01-01
0
PRE
AI
Cobas, Dustin; Gagie, Travis; Navarro, Gonzalo
分享
收藏
Improved Learning-Augmented Algorithms and (Tight) Lower Bounds for Multi-Option Ski Rental Problem
改进的多选项滑雪租赁问题的学习增强算法和(紧致)下界
ACM Transactions on Algorithms
IF
1.4
2026-01-01
0
PRE
AI
Shin, Yongho; Lee, Changyeol; Lee, Gukryeol; An, Hyung-Chan
分享
收藏
Tree Containment above Minimum Degree Is FPT
树在最低度数以上的包含问题是固定参数可解的
ACM Transactions on Algorithms
IF
1.4
2026-01-01
0
PRE
AI
Fomin, Fedor, V; Golovach, Petr A.; Sagunov, Danil; Simonov, Kirill
分享
收藏
Node-Differentially Private Estimation of the Number of Connected Components
节点差分隐私连通分量数量估计
ACM Transactions on Algorithms
IF
1.4
2026-01-01
0
PRE
AI
Kalemaj, Iden; Raskhodnikova, Sofya; Smith, Adam; Tsourakakis, Charalampos
分享
收藏
Computing Tree Decompositions with Small Independence Number
计算具有小独立数的树分解
ACM Transactions on Algorithms
IF
1.4
2026-01-01
1
PRE
AI
Dallard, Clement; Fomin, Fedor, V; Golovach, Petr A.; Korhonen, Tuukka; Milanic, Martin
分享
收藏
Long Plane Trees
ACM Transactions on Algorithms
IF
1.4
2026-01-01
1
PRE
AI
Cabello, Sergio; Hoffmann, Michael; Klost, Katharina; Mulzer, Wolfgang; Tkadlec, Josef
分享
收藏
Color Fault-Tolerant Spanners
着色容错跨度图
ACM Transactions on Algorithms
IF
1.4
2026-01-01
0
PRE
AI
Petruschka, Asaf; Sapir, Shay; Tzalik, Elad
分享
收藏
Online Coalition Formation under Random Arrival or Coalition Dissolution
ACM Transactions on Algorithms
IF
1.4
2026-01-01
1
PRE
AI
Bullinger, Martin; Romen, Rene
分享
收藏