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

h5 指数:25
h5 中位数:32

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

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

#10 Discrete Mathematics
#14 Pure & Applied Mathematics

标题/作者	引用次数	年份
Almost Envy-Freeness with General Valuations B Plaut, T Roughgarden SIAM Journal on Discrete Mathematics 34 (2), 1039-1068	182	2020
On the Diameter of Hyperbolic Random Graphs T Friedrich, A Krohmer SIAM Journal on Discrete Mathematics 32 (2), 1314-1334	68	2018
Ollivier--Ricci Idleness Functions of Graphs DP Bourne, D Cushing, S Liu, F Münch, N Peyerimhoff SIAM Journal on Discrete Mathematics 32 (2), 1408-1424	48	2018
On e-Positivity and e-Unimodality of Chromatic Quasi-symmetric Functions S Cho, JS Huh SIAM Journal on Discrete Mathematics 33 (4), 2286-2315	45	2019
Approximation and Kernelization for Chordal Vertex Deletion BMP Jansen, M Pilipczuk SIAM Journal on Discrete Mathematics 32 (3), 2258-2301	44	2018
Lollipop and Lariat Symmetric Functions S Dahlberg, S van Willigenburg SIAM Journal on Discrete Mathematics 32 (2), 1029-1039	41	2018
Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts SE Huang, S Pettie SIAM Journal on Discrete Mathematics 35 (3), 2129-2144	38	2021
Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence M Bouvel, V Guerrini, A Rechnitzer, S Rinaldi SIAM Journal on Discrete Mathematics 32 (4), 2795-2819	37	2018
The Densest k-Subhypergraph Problem E Chlamtáč, M Dinitz, C Konrad, G Kortsarz, G Rabanca SIAM Journal on Discrete Mathematics 32 (2), 1458-1477	36	2018
Perfect Codes in Cayley Graphs H Huang, B Xia, S Zhou SIAM Journal on Discrete Mathematics 32 (1), 548-559	35	2018
Near-Linear Time Algorithm for n-Fold ILPs via Color Coding K Jansen, A Lassota, L Rohwedder SIAM Journal on Discrete Mathematics 34 (4), 2282-2299	33	2020
Lossy Kernels for Connected Dominating Set on Sparse Graphs E Eiben, M Kumar, AE Mouawad, F Panolan, S Siebertz SIAM Journal on Discrete Mathematics 33 (3), 1743-1771	32	2019
Refined Vertex Sparsifiers of Planar Graphs R Krauthgamer, HI Rika SIAM Journal on Discrete Mathematics 34 (1), 101-129	32	2020
LP Relaxation and Tree Packing for Minimum k-Cut C Chekuri, K Quanrud, C Xu SIAM Journal on Discrete Mathematics 34 (2), 1334-1353	31	2020
The Price of Connectivity in Fair Division X Bei, A Igarashi, X Lu, W Suksompong SIAM Journal on Discrete Mathematics 36 (2), 1156-1186	30	2022
The Typical Structure of Gallai Colorings and Their Extremal Graphs J Balogh, L Li SIAM Journal on Discrete Mathematics 33 (4), 2416-2443	29	2019
Coloring and Covering Nowhere Dense Graphs M Grohe, S Kreutzer, R Rabinovich, S Siebertz, K Stavropoulos SIAM Journal on Discrete Mathematics 32 (4), 2467-2481	29	2018
Finer Tight Bounds for Coloring on Clique-Width M Lampis SIAM Journal on Discrete Mathematics 34 (3), 1538-1558	28	2020
Shorter Labeling Schemes for Planar Graphs M Bonamy, C Gavoille, M Pilipczuk SIAM Journal on Discrete Mathematics 36 (3), 2082-2099	28	2022
Optimization over Degree Sequences A Deza, A Levin, SM Meesum, S Onn SIAM Journal on Discrete Mathematics 32 (3), 2067-2079	28	2018

1 - 20

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