热门出版物 - 学术资源搜索

h5 指数:33
h5 中位数:50

h5 指数是指在过去整整 5 年中所发表文章的 h 指数。h 指在 2018-2022 年间发表的 h 篇文章每篇至少都被引用过 h 次的最大值。隐藏

出版物的 h5 中位数，是指出版物的 h5 指数所涵盖的所有文章获得的引用次数的中位值。隐藏

#8 Theoretical Computer Science

标题/作者	引用次数	年份
Approximation Algorithms for Computing Maximin Share Allocations G Amanatidis, E Markakis, A Nikzad, A Saberi ACM Transactions on Algorithms (TALG) 13 (4), 1-28	145	2017
Heavy Hitters and the Structure of Local Privacy M Bun, J Nelson, U Stemmer ACM Transactions on Algorithms (TALG) 15 (4), 1-40	124	2019
Deterministic Algorithms for Submodular Maximization Problems N Buchbinder, M Feldman ACM Transactions on Algorithms (TALG) 14 (3), 1-20	97	2018
Faster Pseudopolynomial Time Algorithms for Subset Sum K Koiliaris, C Xu ACM Transactions on Algorithms (TALG) 15 (3), 1-20	92	2019
Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma F Eisenbrand, R Weismantel ACM Transactions on Algorithms (TALG) 16 (1), 1-14	78	2019
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth FV Fomin, D Lokshtanov, S Saurabh, MŁ Pilipczuk, M Wrochna ACM Transactions on Algorithms (TALG) 14 (3), 1-45	76	2018
On Uniform Capacitated k-Median Beyond the Natural LP Relaxation S Li ACM Transactions on Algorithms (TALG) 13 (2), 1-18	69	2017
Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier O Gold, M Sharir ACM Transactions on Algorithms (TALG) 14 (4), 1-17	66	2018
Efficient Algorithms for Constructing Very Sparse Spanners and Emulators M Elkin, O Neiman ACM Transactions on Algorithms (TALG) 15 (1), 1-29	64	2018
Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs S Cabello ACM Transactions on Algorithms (TALG) 15 (2), 1-38	59	2018
A (2+ ε)-Approximation for Maximum Weight Matching in the Semi-streaming Model A Paz, G Schwartzman ACM Transactions on Algorithms (TALG) 15 (2), 1-15	58	2018
On Problems Equivalent to (min,+)-Convolution M Cygan, M Mucha, K Węgrzycki, M Włodarczyk ACM Transactions on Algorithms (TALG) 15 (1), 1-25	56	2019
Completeness for First-order Properties on Sparse Structures with Algorithmic Applications J Gao, R Impagliazzo, A Kolokolova, R Williams ACM Transactions on Algorithms (TALG) 15 (2), 1-35	52	2018
Computing the Gromov-Hausdorff Distance for Metric Trees PK Agarwal, K Fox, A Nath, A Sidiropoulos, Y Wang ACM Transactions on Algorithms (TALG) 14 (2), 1-20	52	2018
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals Z Huang, ZG Tang, X Wu, Y Zhang ACM Transactions on Algorithms (TALG) 15 (3), 1-15	51	2019
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs D Coudert, G Ducoffe, A Popa ACM Transactions on Algorithms (TALG) 15 (3), 1-57	50	2019
Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal D Lokshtanov, D Marx, S Saurabh ACM Transactions on Algorithms (TALG) 14 (2), 1-30	50	2018
Scaling Algorithms for Weighted Matching in General Graphs R Duan, S Pettie, HH Su ACM Transactions on Algorithms (TALG) 14 (1), 1-35	50	2018
The Complexity of Independent Set Reconfiguration on Bipartite Graphs D Lokshtanov, AE Mouawad ACM Transactions on Algorithms (TALG) 15 (1), 1-19	46	2018
Deterministic Truncation of Linear Matroids D Lokshtanov, P Misra, F Panolan, S Saurabh ACM Transactions on Algorithms (TALG) 14 (2), 1-20	45	2018

1 - 20

计算机程序会自动估算并确定日期和引用次数。