Als u wijzigingen in Pure hebt gemaakt, zullen deze hier binnenkort zichtbaar zijn.

Persoonlijk profiel

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.

Vingerafdruk Duik in de onderzoeksthema's waar Nikhil Bansal actief is. Deze onderwerplabels komen voort uit het werk van deze persoon. Samen vormen ze een unieke vingerafdruk.

  • 3 Vergelijkbare profielen
Approximation algorithms Engineering en materiaalwetenschappen
Approximation Algorithms Rekenkunde
Polynomials Engineering en materiaalwetenschappen
Discrepancy Rekenkunde
Scheduling Engineering en materiaalwetenschappen
Approximation Rekenkunde
Servers Engineering en materiaalwetenschappen
Independent Set Rekenkunde

Netwerk Recente externe samenwerking op landenniveau. Duik in de details door op de stippen te klikken.

Onderzoeksoutput 1999 2019

2 Citaties (Scopus)
16 Downloads (Pure)

An algorithm for komlós conjecture matching Banaszczyk's bound

Bansal, N., Dadush, D. & Garg, S., 30 apr 2019, In : SIAM Journal on Computing. 48, 2, blz. 534-553 20 blz.

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Open Access
Bestand
Coloring
Colouring
Discrepancy
Set Systems
Efficient Algorithms

On a generalization of iterated and randomized rounding

Bansal, N., 23 jun 2019, STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Charikar, M. & Cohen, E. (redactie). New York: Association for Computing Machinery, Inc, blz. 1125-1135 11 blz.

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

On the discrepancy of random low degree set systems

Bansal, N. & Meka, R., 2019, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. Chan, T. M. (redactie). New York: Association for Computing Machinery, Inc, blz. 2557-2564 8 blz.

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

Open Access
Set Systems
Coloring
Discrepancy
Random Systems
Random Sets

The (H, k)-server problem on bounded depth trees

Bansal, N., Eliáš, M., Jeż, Ł. & Koumoutsos, G., 1 feb 2019, In : ACM Transactions on Algorithms. 15, 2, 26 blz., 28.

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Server
Competitive Ratio
Online Algorithms
Metric
Resource Augmentation
1 Citaat (Scopus)

Achievable performance of blind policies in heavy traffic

Bansal, N., Kamphorst, B. & Zwart, B., 1 aug 2018, In : Mathematics of Operations Research. 43, 3, blz. 949-964 16 blz.

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Heavy Traffic
Applied Probability
Competitive Analysis
Sojourn Time
Queue

Prijzen

Algorithms for coping with uncertainty and intractability

N. Bansal (Ontvanger), 2013

Prijs: ERCConsolidatorWetenschappelijk

Combinatorial optimization
Approximation algorithms
Computer science
Uncertainty
Optimum design

NWO Vici Award : Continuous Methods in Discrete Optimization

N. Bansal (Ontvanger), 2018

Prijs: NWOViciWetenschappelijk

Discrete Optimization
Rounding
Discrepancy
Computer Science
Stable Polynomials

NWO Vidi Award : Coping with an unknown future

N. Bansal (Ontvanger), 2011

Prijs: NWOVidiWetenschappelijk

Decision making

Pers/media

ACUITY: Algorithms for coping with uncertainty and intractability

N. Bansal

8/11/16

1 item van Media-aandacht

Pers / media: Vakinhoudelijk commentaar

Are mobile apps the future? Highlights from Myntra’s mobile hack day

Nikhil Bansal

29/04/15

1 item van Media-aandacht

Pers / media: Vakinhoudelijk commentaar

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

N. Bansal

29/01/15

1 item van Media-aandacht

Pers / media: Vakinhoudelijk commentaar

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

N. Bansal

27/03/14

1 item van Media-aandacht

Pers / media: Vakinhoudelijk commentaar

Scriptie

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

Auteur: den Toonder, R., 31 aug 2013

Begeleider: Bansal, N. (Afstudeerdocent 1)

Scriptie/masterproef: Master

Bestand

A second look at the asymptotic PTAS for square packing

Auteur: Ficker, A., 31 dec 2013

Begeleider: Bansal, N. (Afstudeerdocent 1)

Scriptie/masterproef: Master

Bestand

Counting matroids

Auteur: van der Pol, J., 30 jun 2013

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

Scriptie/masterproef: Master

Bestand

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

Auteur: Slenders, T., 31 aug 2014

Begeleider: Bansal, N. (Afstudeerdocent 1) & Hamer, van den, P. (Externe persoon) (Externe coach)

Scriptie/masterproef: Master

Bestand

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

Auteur: Oosterwijk, T., 31 okt 2013

Begeleider: Bansal, N. (Afstudeerdocent 1)

Scriptie/masterproef: Master

Bestand