What is he best known for?
The fields of study he is best known for:
- Artificial intelligence
- Algorithm
- Gene
Pankaj K. Agarwal mainly investigates Combinatorics, Discrete mathematics, Algorithm, Computational geometry and Set.
Many of his studies on Combinatorics involve topics that are commonly interrelated, such as Plane.
His studies deal with areas such as Rectangle, Ball, Interval, Euclidean geometry and Point as well as Discrete mathematics.
Pankaj K. Agarwal interconnects Experimental data, Extrapolation, Data structure and Consistency in the investigation of issues within Algorithm.
His study in Set is interdisciplinary in nature, drawing from both Data mining and Index.
His Heuristics research includes themes of Genetics and Computational biology.
His most cited work include:
- Initial sequencing and comparative analysis of the mouse genome. (5789 citations)
- Davenport–Schinzel Sequences and their Geometric Applications (869 citations)
- Simplification envelopes (490 citations)
What are the main themes of his work throughout his whole career to date?
His primary scientific interests are in Combinatorics, Discrete mathematics, Set, Algorithm and Data structure.
His Combinatorics study frequently draws parallels with other fields, such as Plane.
His studies in Discrete mathematics integrate themes in fields like Rectangle and Constant.
He combines subjects such as Range, Point and Space with his study of Set.
The Data structure study combines topics in areas such as Computational geometry and Theoretical computer science.
Pankaj K. Agarwal performs multidisciplinary study on Randomized algorithm and Running time in his works.
He most often published in these fields:
- Combinatorics (51.76%)
- Discrete mathematics (20.22%)
- Set (18.37%)
What were the highlights of his more recent work (between 2014-2021)?
- Combinatorics (51.76%)
- Set (18.37%)
- Data structure (14.47%)
In recent papers he was focusing on the following fields of study:
The scientist’s investigation covers issues in Combinatorics, Set, Data structure, Point and Time complexity.
His research on Combinatorics frequently links to adjacent areas such as Kinetic data structure.
His Set research is multidisciplinary, relying on both Range, Algorithm, Tuple and Cluster analysis.
His Data structure study combines topics from a wide range of disciplines, such as Computational geometry and Terrain.
His Point study incorporates themes from Discrete mathematics, Dynamic time warping, Shortest path problem, k-nearest neighbors algorithm and Rectangle.
His Time complexity research incorporates elements of Complement and Metric space.
Between 2014 and 2021, his most popular works were:
- Sharp Upper and Lower Bounds on the Length of General Davenport-Schinzel Sequences (154 citations)
- Computational Fact Checking through Query Perturbations (24 citations)
- Systematic Analysis of Drug Targets Confirms Expression in Disease-Relevant Tissues (19 citations)
In his most recent research, the most cited papers focused on:
- Artificial intelligence
- Algorithm
- Statistics
Pankaj K. Agarwal spends much of his time researching Combinatorics, Set, Algorithm, Approximation algorithm and Data structure.
Pankaj K. Agarwal has included themes like Rectangle, Upper and lower bounds and Metric in his Combinatorics study.
The study incorporates disciplines such as Cluster analysis, Data mining and Greedy algorithm in addition to Set.
The concepts of his Algorithm study are interwoven with issues in Prior probability and Markov chain.
The study incorporates disciplines such as Probability distribution and Theory of computation in addition to Approximation algorithm.
Pankaj K. Agarwal focuses mostly in the field of Data structure, narrowing it down to matters related to Computational geometry and, in some cases, Simplex, Series and Family of sets.
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.
