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

Chen, J.-J, Bansal, N, Chakraborty, S, & von der Brüggen, G. (2018). Packing sporadic real-time tasks on identical multiprocessor systems. In 29th International Symposium on Algorithms and Computation (pp. 71:1–71:14). doi:10.4230/LIPIcs.ISAAC.2018.71
Bansal, N, Dadush, D.N, Garg, S, & Lovett, S. (2018). The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018 (pp. 587–597). doi:10.1145/3188745.3188850
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, Eliáš, M, Jeż, Ł, Koumoutsos, G, & Pruhs, K. (2018). Tight bounds for Double Coverage against weak adversaries. Theory of Computing Systems, 62(2), 349–365.
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, Eliáš, M, Koumoutsos, G, & Nederlof, J. (2018). Competitive algorithms for generalized K-server in uniform metrics. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 992–1001). doi:10.1137/1.9781611975031.64
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, Garg, S, Nederlof, J, & Vyas, N. (2014). Faster space-efficient algorithms for Subset Sum, k -Sum, and related problems. In SIAM Journal on Computing (Vol. 47, pp. 1755–1777). doi:10.1137/17M1158203

Current projects with external funding

Continuous Methods in Discrete Optimization

Grants

Vici (2018)