What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Algorithm
- Operating system
Nikhil Bansal spends much of his time researching Combinatorics, Mathematical optimization, Approximation algorithm, Discrete mathematics and Scheduling.
The concepts of his Combinatorics study are interwoven with issues in Correlation clustering and Cluster analysis.
His study in Mathematical optimization is interdisciplinary in nature, drawing from both Queue, Energy, Competitive analysis and Quality of service.
His Approximation algorithm study integrates concerns from other disciplines, such as Edge cover, Bin packing problem, 3-dimensional matching and Linear programming, Linear programming relaxation.
His Discrete mathematics study incorporates themes from Vehicle routing problem, Subroutine and Fuzzy clustering.
His Scheduling research incorporates themes from Workload, Web server, Distributed computing and Response time.
His most cited work include:
- Correlation Clustering (806 citations)
- Speed scaling to manage energy and temperature (328 citations)
- Capacity, delay and mobility in wireless ad-hoc networks (327 citations)
What are the main themes of his work throughout his whole career to date?
Combinatorics, Discrete mathematics, Mathematical optimization, Approximation algorithm and Scheduling are his primary areas of study.
His studies deal with areas such as Upper and lower bounds, Competitive analysis, Bounded function and Set as well as Combinatorics.
His research integrates issues of Square packing in a square, Bin packing problem and Generalization in his study of Discrete mathematics.
The various areas that Nikhil Bansal examines in his Mathematical optimization study include Energy and Job shop scheduling.
His studies deal with areas such as Linear programming, Linear programming relaxation, Minimum spanning tree and Rounding as well as Approximation algorithm.
In his study, Computer network is inextricably linked to Distributed computing, which falls within the broad field of Scheduling.
He most often published in these fields:
- Combinatorics (44.36%)
- Discrete mathematics (25.82%)
- Mathematical optimization (21.82%)
What were the highlights of his more recent work (between 2016-2021)?
- Combinatorics (44.36%)
- Discrete mathematics (25.82%)
- Conjecture (6.18%)
In recent papers he was focusing on the following fields of study:
His primary areas of investigation include Combinatorics, Discrete mathematics, Conjecture, Online algorithm and Upper and lower bounds.
His study looks at the relationship between Combinatorics and fields such as Bounded function, as well as how they intersect with chemical problems.
His Discrete mathematics study integrates concerns from other disciplines, such as Generalization, Polynomial, Rounding and Knapsack problem.
His study in Conjecture is interdisciplinary in nature, drawing from both Element, Set and Vertex cover.
His Online algorithm research includes themes of Sign and Omega.
His research integrates issues of Cover, Approximation algorithm and Greedy algorithm in his study of Linear programming relaxation.
Between 2016 and 2021, his most popular works were:
- Algorithmic discrepancy beyond partial coloring (25 citations)
- The Gram-Schmidt walk: a cure for the Banaszczyk blues (23 citations)
- Potential-function proofs for first-order methods (19 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Algorithm
- Operating system
Nikhil Bansal mainly focuses on Combinatorics, Discrete mathematics, Competitive analysis, Bounded function and Upper and lower bounds.
His studies in Combinatorics integrate themes in fields like Norm and Random walk.
His Discrete mathematics research is multidisciplinary, incorporating elements of Generalization and Polynomial.
In his study, Multiplicative function is strongly linked to Constant, which falls under the umbrella field of Bounded function.
He has included themes like Sequence, Metric space, Online algorithm and Exponential function in his Upper and lower bounds study.
His Queue research focuses on subjects like Mathematical optimization, which are linked to Schedule.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
