Nikhil Bansal
- Full Name
- N. Bansal
- Function(s)
- Researcher - Technische Universiteit Eindhoven
- N.Bansal@cwi.nl
- Telephone
- +31 20 592 4170
- Room
- M240
- Department(s)
- Networks and Optimization
Biography
This user has not written a biography yet.
Research
This user has not created a research page yet.
Publications
-
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, & Spencer, J. (2013). Deterministic Discrepancy Minimization. Algorithmica, 67(4), 451–471.
-
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, & Nagarajan, V. (2013). On the Adaptivity Gap of Stochastic Orienteering. arXiv.org e-Print archive. Cornell University Library .