If you made any changes in Pure these will be visible here soon.

Personal profile

Research profile

Nikhil Bansal is a Full Professor and Chair of Combinatorial Optimization in the Department of Mathematics and Computer Science at Eindhoven University of Technology (TU/e).  Nikhil’s main research interests are theoretical computer science with emphasis on design and analysis of algorithms for discrete optimization problems.  He also works in related areas such as discrete math, complexity theory, machine learning and probability.

Nikhil Bansal’s VICI-funded reserch, ‘Making discrete decisions in a continuous way’ explores the interface between continuous and discrete mathematics. The aim is to design a variety of new and powerful algorithmic techniques that find an arrangement or structure in discrete objects, which is in some sense optimal and applicable to a wide variety of problems.

Academic background

Nikhil Bansal received his BSc in Computer Science from IIT Mumbai (1999) and obtained his PhD from Carnegie Mellon University in 2003. He worked at the IBM T.J. Watson Research Center until 2011, where he also managed the Algorithms group. He has received several best paper awards for his work and is the recipient of the NWO VIDI, TOP and VICI grants, and an ERC consolidator grant.

In addition to his work at TU/e, Nikhil is also a researcher at CWI, the Dutch National Research Institute for Mathematics and Computer Science in Amsterdam. He has served or is active on several Editorial Boards (Journal of the ACM, SIAM  Journal on Computing, Mathematics of  Operations Research) and Program Committees: FOCS 2018, HALG 2018, ICALP,  Approx, IPCO, SPAA, IPDPS 2017, WAOA, ITCS, ESA (chair 2015), STOC 2014 and FOCS. He has also organized and participate at workshops at CWI Amsterdam, UC Berkeley and HIM, Bonn.

Fingerprint Fingerprint is based on mining the text of the person's scientific documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

  • 1 Similar Profiles
Approximation algorithms Engineering & Materials Science
Approximation Algorithms Mathematics
Scheduling Engineering & Materials Science
Servers Engineering & Materials Science
Polynomials Engineering & Materials Science
Approximation Mathematics
Independent Set Mathematics
Discrepancy Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 1999 2018

Algorithms for combinatorial discrepancy

Garg, S., 10 Oct 2018, Eindhoven: Technische Universiteit Eindhoven. 139 p.

Research output: ThesisPhd Thesis 1 (Research TU/e / Graduation TU/e)Academic

Open Access
File

Algorithms for k-server problems

Koumoutsos, G., 6 Sep 2018, Eindhoven: Technische Universiteit Eindhoven. 91 p.

Research output: ThesisPhd Thesis 1 (Research TU/e / Graduation TU/e)Academic

Open Access
File

Algorithms for some metrical service systems

Elias, M., 17 Sep 2018, Eindhoven: Technische Universiteit Eindhoven. 90 p.

Research output: ThesisPhd Thesis 1 (Research TU/e / Graduation TU/e)Academic

Open Access
File
1 Citations

Competitive algorithms for generalized k-server in uniform metrics.

Bansal, N., Elias, M., Koumoutsos, G. & Nederlof, J., 2018, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 7-10 January 2018, New Orleans, Louisiana. s.l.: Society for Industrial and Applied Mathematics (SIAM), p. 992-1001

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Open Access
File
Servers
Polynomials

Faster space-efficient algorithms for subset sum, k -sum, and related problems

Bansal, N., Garg, S., Nederlof, J. & Vyas, N., 1 Jan 2018, In : SIAM Journal on Computing. 47, 5, p. 1755-1777 23 p.

Research output: Contribution to journalArticleAcademicpeer-review

Subset Sum
Set theory
Efficient Algorithms
Polynomials
Integer programming

Prizes

Algorithms for coping with uncertainty and intractability

Nikhil Bansal (Recipient), 2013

Recognition: ERCConsolidatorScientific

Combinatorial optimization
Approximation algorithms
Computer science
Uncertainty
Optimum design

NWO Vici Award : Continuous Methods in Discrete Optimization

Nikhil Bansal (Recipient), 2018

Recognition: NWOViciScientific

Discrete Optimization
Rounding
Discrepancy
Computer Science
Stable Polynomials

NWO Vidi Award : Coping with an unknown future

Nikhil Bansal (Recipient), 2011

Recognition: NWOVidiScientific

Decision making

Press / Media

ACUITY: Algorithms for coping with uncertainty and intractability

Nikhil Bansal

8/11/16

1 item of media coverage

Press/Media: Expert Comment

General Electric : U.S. Patents Awarded to Inventors in Illinois (Jan. 29)

Nikhil Bansal

29/01/15

1 item of media coverage

Press/Media: Expert Comment

U.S. Patents Awarded to Inventors in New York (March 27)

Nikhil Bansal

27/03/14

5 items of media coverage

Press/Media: Expert Comment

U.S. Patents Awarded to Inventors in California (March 27)

Nikhil Bansal

27/03/14

1 item of media coverage

Press/Media: Expert Comment

Student theses

An instance for the Polacek-Svensson algorithm with a quasi-plynomial running time

Author: den Toonder, R., 31 Aug 2013

Supervisor: Bansal, N. (Supervisor 1)

Student thesis: Master

File

A second look at the asymptotic PTAS for square packing

Author: Ficker, A., 31 Dec 2013

Supervisor: Bansal, N. (Supervisor 1)

Student thesis: Master

File

Counting matroids

Author: van der Pol, J., 30 Jun 2013

Supervisor: Bansal, N. (Supervisor 1), van der Hofstad, R. (Supervisor 2) & Pendavingh, R. (Supervisor 2)

Student thesis: Master

File

Improved algorithms for clustering ASML event log data: fast hierarchical clustering by a combination of cosine similarity and Fiedler vectors

Author: Slenders, T., 31 Aug 2014

Supervisor: Bansal, N. (Supervisor 1) & Hamer, van den, P. (External person) (External coach)

Student thesis: Master

File

On local search and LP and SDP relaxations for k-set packing

Author: Oosterwijk, T., 31 Oct 2013

Supervisor: Bansal, N. (Supervisor 1)

Student thesis: Master

File