Navigation

Nikhil Bansal

Full Name: Prof.dr. N. Bansal
Function(s): Researcher

Email: N.Bansal@cwi.nl
Telephone: +31 20 592 4386
Room: M237
Department(s): Networks and Optimization

Publications

Bansal, N, Kamphorst, B, & Zwart, A.P. (2018). Achievable performance of blind policies in heavy traffic. Mathematics of Operations Research, 43(3), 949–964. doi:10.1287/moor.2017.0890
Bansal, N, Gupta, A, & Guruganesh, G. (2018). On the Lovász theta function for independent sets in sparse graphs. SIAM Journal on Computing, 47(3), 1039–1055. doi:10.1137/15M1051002
Bansal, N, Böhm, M, Eliáš, M, Koumoutsos, G, & Umboh, S.W. (2018). Nested convex bodies are chaseable. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1253–1260). doi:10.1137/1.9781611975031.81
Bansal, N, Dadush, D.N, & Garg, S. (2016). An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound. In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS (pp. 788–799). doi:10.1109/FOCS.2016.89
Bansal, N, Dadush, D.N, & Garg, S. (2016). An algorithm for Komlós Conjecture matching Banaszczyk’s Bound. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science 2016 (FOCS 57).
Bansal, N, Khandekar, R, Könemann, J, Nagarajan, V, & Peis, B. (2013). On generalizations of network design problems with degree bounds. Mathematical Programming, 141(1-2), 479–506.
Bansal, N, Chan, H-O, & Pruhs, K. (2013). Speed Scaling with an Arbitrary Power Function. ACM Transactions on Algorithms, 9(2).
Bansal, N, Pendavingh, R, & van der Pol, J.G. (2013). On the number of matroids. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms 2013 (SODA 0) (pp. 451–471).
Bansal, N, Han, X, Iwama, K, Sviridenko, M, & Zhang, G. (2013). A Harmonic Algorithm for the 3D Strip Packing Problem. SIAM Journal on Computing, 42(2), 579–592.
Bansal, N, & Spencer, J. (2013). Deterministic Discrepancy Minimization. Algorithmica, 67(4), 451–471.

Current projects with external funding

Continuous Methods in Discrete Optimization