Standout Papers

A shortest augmenting path algorithm for dense and sparse linear assignment problems 1987 2026 2000 2013 635
  1. A shortest augmenting path algorithm for dense and sparse linear assignment problems (1987)
    R. Jonker, A. Volgenant Computing

Immediate Impact

6 by Nobel laureates 11 from Science/Nature 55 standout
Sub-graph 1 of 23

Citing Papers

Profiling cell identity and tissue architecture with single-cell and spatial transcriptomics
2024 Standout
CREST—A program for the exploration of low-energy molecular chemical space
2024 Standout
2 intermediate papers

Works of R. Jonker being referenced

A shortest augmenting path algorithm for dense and sparse linear assignment problems
1987 Standout

Author Peers

Author Last Decade Papers Cites
R. Jonker 109 130 55 195 171 7 688
Yilin Yan 28 98 60 216 353 10 828
Zongben Xu 33 36 44 172 158 12 601
S. J. Hong 72 86 65 157 168 14 708
Stephen Warshall 81 230 112 81 198 2 840
Boris V. Cherkassky 119 216 152 118 122 8 709
C.M.H. Kuijpers 188 55 50 80 484 4 773
Philip Bachman 26 114 21 186 437 13 837
R. S. Ramakrishna 84 185 84 105 288 24 760
Hamed Shah‐Hosseini 112 138 46 204 455 19 807
Kuk-Hyun Han 71 149 13 68 429 6 799

All Works

Loading papers...

Rankless by CCL
2026