Standout Papers

Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms 1974 2026 1991 2008 504
  1. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms (1974)
    D. S. Johnson, Alan Demers et al. SIAM Journal on Computing

Immediate Impact

2 from Science/Nature 55 standout
Sub-graph 1 of 23

Citing Papers

EDN: Salient Object Detection via Extremely-Downsampled Network
2022 Standout
Provably efficient machine learning for quantum many-body problems
2022 StandoutScience
2 intermediate papers

Works of D. S. Johnson being referenced

The Complexity of Multiterminal Cuts
1994
The Planar Hamiltonian Circuit Problem is NP-Complete
1976

Author Peers

Author Last Decade Papers Cites
D. S. Johnson 396 438 41 459 6 1.0k
Oded Kariv 257 371 88 536 6 1.2k
L. E. Trotter 648 238 26 466 28 1.2k
Mechthild Stoer 352 326 15 279 10 866
Naveen Garg 599 599 59 264 43 1.2k
Michael Jünger 488 227 38 387 28 1.2k
Reuven Bar-Yehuda 589 748 33 213 46 1.3k
Serge Plotkin 579 792 34 249 45 1.2k
Kenneth J. Supowit 323 253 132 242 25 1.1k
Clifford Stein 355 729 35 461 61 1.2k
Bernhard Körte 449 257 36 166 34 985

All Works

Loading papers...

Rankless by CCL
2026