| Introduction to algorithms TH Cormen, CE Leiserson, RL Rivest, C Stein MIT press, 2022 | 69875 | 2022 |
| A new approach to the minimum cut problem DR Karger, C Stein Journal of the ACM (JACM) 43 (4), 601-640, 1996 | 641 | 1996 |
| Algoritmos: teoria e prática TH Cormen, CE Leiserson, RL Rivest, C Stein Editora Campus 2, 296, 2002 | 610 | 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 | 541 | 1997 |
| Introduction to algorithms. 2001 TH Cormen, CE Leiserson, RL Rivest, C Stein MIT press: Cambridge, US, 2009 | 522 | 2009 |
| 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 | 361 | 1991 |
| Approximation techniques for average completion time scheduling C Chekuri, R Motwani, B Natarajan, C Stein SIAM Journal on Computing 31 (1), 146-166, 2001 | 287 | 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 | 284 | 2010 |
| Wprowadzenie do algorytmĂłw TH Cormen, CE Leiserson, RL Rivest, C Stein Wydawnictwo Naukowe PWN SA, 2020 | 279 | 2020 |
| Improved approximation algorithms for shop scheduling problems DB Shmoys, C Stein, J Wein SIAM Journal on Computing 23 (3), 617-632, 1994 | 279 | 1994 |
| Algorithmen-Eine Einführung TH Cormen, CE Leiserson, R Rivest, C Stein Walter de Gruyter GmbH & Co KG, 2017 | 277 | 2017 |
| Scheduling algorithms. DR Karger, C Stein, J Wein Algorithms and theory of computation handbook 1, 20-20, 1999 | 276 | 1999 |
| 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 | 260 | 1999 |
| Section 24.3: Dijkstra's algorithm TH Cormen Introduction to algorithms, 595-601, 2001 | 258 | 2001 |
| Greedy algorithms TH Cormen, CE Leiserson, RL Rivest, C Stein Introduction to algorithms 1, 329-355, 2001 | 239 | 2001 |
| 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 |
| Minimizing average completion time in the presence of release dates C Phillips, C Stein, J Wein Mathematical Programming 82 (1), 199-223, 1998 | 229 | 1998 |
| Improved algorithms for bipartite network flow RK Ahuja, JB Orlin, C Stein, RE Tarjan SIAM Journal on Computing 23 (5), 906-933, 1994 | 222 | 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 | 217 | 2007 |
| Speed scaling for weighted flow time N Bansal, K Pruhs, C Stein SIAM Journal on Computing 39 (4), 1294-1308, 2010 | 214 | 2010 |
