| Tight bounds for online vector scheduling S Im, N Kell, J Kulkarni, D Panigrahi 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 525-544, 2015 | 37 | 2015 |
| Improved upper bounds for online malleable job scheduling N Kell, J Havill Journal of Scheduling 18 (4), 393-410, 2015 | 13 | 2015 |
| Tight bounds for online vector scheduling S Im, N Kell, J Kulkarni, D Panigrahi SIAM Journal on Computing 48 (1), 93-121, 2019 | 11 | 2019 |
| Online budgeted allocation with general budgets N Kell, D Panigrahi Proceedings of the 2016 ACM Conference on Economics and Computation, 419-436, 2016 | 6 | 2016 |
| Online load balancing on related machines S Im, N Kell, D Panigrahi, M Shadloo Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 5 | 2018 |
| Approximations for Allocating Indivisible Items with Concave-Additive Valuations N Kell, K Sun arXiv preprint arXiv:2109.00081, 2021 | 1 | 2021 |
| Primal-dual algorithms for indivisible concave allocation with bounded local curvature N Kell, K Sun arXiv preprint arXiv:2109.00081, 2021 | 1 | 2021 |
| Approximations for indivisible concave allocations with applications to nash welfare maximization N Kell, K Sun Proceedings of the AAAI Conference on Artificial Intelligence 37 (5), 5705-5713, 2023 | | 2023 |
| Algorithms for Allocation Problems in Online Settings N Kell Duke University, 2018 | | 2018 |
