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

h5 指数:25
h5 中位数:30

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

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

#11 Discrete Mathematics
#15 Theoretical Computer Science

标题/作者	引用次数	年份
Seeded graph matching via large neighborhood statistics E Mossel, J Xu Random Structures & Algorithms 57 (3), 570-611	63	2020
The Johansson‐Molloy theorem for DP‐coloring A Bernshteyn Random Structures & Algorithms 54 (4), 653-664	58	2019
Scaling limits of random bipartite planar maps with a prescribed degree sequence C Marzouk Random Structures & Algorithms 53 (3), 448-503	56	2018
Universality for bounded degree spanning trees in randomly perturbed graphs J Böttcher, J Han, Y Kohayakawa, R Montgomery, O Parczyk, Y Person Random Structures & Algorithms 55 (4), 854-864	53	2019
Efficient algorithms for discrepancy minimization in convex sets R Eldan, M Singh Random Structures & Algorithms 53 (2), 289-307	42	2018
Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs R Nenadov, N Škorić Random Structures & Algorithms 54 (1), 187-208	36	2019
Powers of tight Hamilton cycles in randomly perturbed hypergraphs W Bedenknecht, J Han, Y Kohayakawa, GO Mota Random Structures & Algorithms 55 (4), 795-807	36	2019
Optimization on sparse random hypergraphs and spin glasses S Sen Random Structures & Algorithms 53 (3), 504-536	35	2018
Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu J Han, P Morris, A Treglown Random Structures & Algorithms 58 (3), 480-516	33	2021
Powers of Hamiltonian cycles in randomly augmented graphs A Dudek, C Reiher, A Ruciński, M Schacht Random Structures & Algorithms 56 (1), 122-141	32	2020
Permutations with fixed pattern densities R Kenyon, D Král', C Radin, P Winkler Random Structures & Algorithms 56 (1), 220-250	32	2020
Spanning trees in randomly perturbed graphs F Joos, J Kim Random Structures & Algorithms 56 (1), 169-219	31	2020
Modularity of Erdős‐Rényi random graphs C McDiarmid, F Skerman Random Structures & Algorithms 57 (1), 211-243	30	2020
Hypergraph coloring up to condensation P Ayre, A Coja‐Oghlan, C Greenhill Random Structures & Algorithms 54 (4), 615-652	30	2019
Efficient sampling and counting algorithms for the Potts model on DOUBLE-STRUCK CAPITAL Z (d) at all temperatures C Borgs, J Chayes, T Helmuth, W Perkins, P Tetali RANDOM STRUCTURES & ALGORITHMS	29	2022
The probability of avoiding consecutive patterns in the Mallows distribution H Crane, S DeSalvo, S Elizalde Random Structures & Algorithms 53 (3), 417-447	29	2018
Cover time and mixing time of random walks on dynamic graphs C Avin, M Koucký, Z Lotker Random Structures & Algorithms 52 (4), 576-596	29	2018
A graphon approach to limiting spectral distributions of Wigner‐type matrices Y Zhu Random Structures & Algorithms 56 (1), 251-279	28	2020
Geometry of the uniform infinite half‐planar quadrangulation A Caraceni, N Curien Random Structures & Algorithms 52 (3), 454-494	28	2018
Complex martingales and asymptotic enumeration M Isaev, BD McKay Random Structures & Algorithms 52 (4), 617-661	28	2018

1 - 20

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