| Introduction to algorithms TH Cormen, CE Leiserson, RL Rivest, C Stein MIT press, 2022 | 67233 | 2022 |
| A new approach to the minimum cut problem DR Karger, C Stein Journal of the ACM (JACM) 43 (4), 601-640, 1996 | 592 | 1996 |
| Algoritmos: teoria e prática TH Cormen, CE Leiserson, RL Rivest, C Stein Editora Campus 2, 296, 2002 | 576 | 2002 |
| Optimal time-critical scheduling via resource augmentation CA Phillips, C Stein, E Torng, J Wein Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997 | 518 | 1997 |
| Fast approximation algorithms for multicommodity flow problems T Leighton, C Stein, F Makedon, É Tardos, S Plotkin, S Tragoudas Proceedings of the twenty-third annual ACM symposium on Theory of Computing …, 1991 | 357 | 1991 |
| Introduction to Algorithms, chapter 11 TH Cormen, CE Leiserson, RL Rivest, C Stein The MIT Press, McGraw-Hill Book Company,, 2001 | 320 | 2001 |
| Approximation techniques for average completion time scheduling C Chekuri, R Motwani, B Natarajan, C Stein SIAM Journal on Computing 31 (1), 146-166, 2001 | 283 | 2001 |
| Online stochastic packing applied to display ad allocation J Feldman, M Henzinger, N Korula, VS Mirrokni, C Stein European Symposium on Algorithms, 182-194, 2010 | 271 | 2010 |
| Wprowadzenie do algorytmĂłw TH Cormen, CE Leiserson, RL Rivest, C Stein, K Diks, A Malinowski, ... Wydawnictwo Naukowe PWN, 2015 | 270 | 2015 |
| Improved approximation algorithms for shop scheduling problems DB Shmoys, C Stein, J Wein SIAM Journal on Computing 23 (3), 617-632, 1994 | 268 | 1994 |
| Algorithmen-Eine Einführung TH Cormen, CE Leiserson, R Rivest, C Stein Walter de Gruyter GmbH & Co KG, 2017 | 262 | 2017 |
| Section 24.3: Dijkstra's algorithm TH Cormen Introduction to algorithms, 595-601, 2001 | 259 | 2001 |
| Approximation schemes for minimizing average weighted completion time with release dates F Afrati, E Bampis, C Chekuri, D Karger, C Kenyon, S Khanna, I Milis, ... 40th annual symposium on foundations of computer science (Cat. No. 99CB37039 …, 1999 | 251 | 1999 |
| On the capacity of secure network coding J Feldman, T Malkin, C Stein, RA Servedio Proc. 42nd Annual Allerton Conference on Communication, Control, and …, 2004 | 234 | 2004 |
| Greedy algorithms TH Cormen, CE Leiserson, RL Rivest, C Stein Introduction to algorithms 1, 329-355, 2001 | 234 | 2001 |
| Minimizing average completion time in the presence of release dates C Phillips, C Stein, J Wein Mathematical Programming 82 (1-2), 199-223, 1998 | 221 | 1998 |
| Improved algorithms for bipartite network flow RK Ahuja, JB Orlin, C Stein, RE Tarjan SIAM Journal on Computing 23 (5), 906-933, 1994 | 216 | 1994 |
| Budget optimization in search-based advertising auctions J Feldman, S Muthukrishnan, M Pal, C Stein Proceedings of the 8th ACM conference on Electronic commerce, 40-49, 2007 | 207 | 2007 |
| Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts P Klein, S Plotkin, C Stein, E Tardos SIAM Journal on Computing 23 (3), 466-487, 1994 | 207 | 1994 |
| Rounding algorithms for a geometric embedding of minimum multiway cut DR Karger, P Klein, C Stein, M Thorup, NE Young Proceedings of the thirty-first annual ACM symposium on Theory of Computing …, 1999 | 201 | 1999 |
