What is he best known for?
The fields of study he is best known for:
- Computer network
- Artificial intelligence
- Combinatorics
MohammadTaghi Hajiaghayi spends much of his time researching Combinatorics, Discrete mathematics, Approximation algorithm, Treewidth and 1-planar graph.
His work on Combinatorics is being expanded to include thematically relevant topics such as Upper and lower bounds.
His research investigates the link between Discrete mathematics and topics such as Bounded function that cross with problems in Modular decomposition and Satisfiability.
The study incorporates disciplines such as Algorithm design and Travelling salesman problem in addition to Approximation algorithm.
The Treewidth study combines topics in areas such as Tree decomposition, Chordal graph and Planar graph.
His studies in Mathematical optimization integrate themes in fields like Mathematical economics, Competitive analysis and Subadditivity.
His most cited work include:
- Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs (259 citations)
- Improved Approximation Algorithms for Minimum Weight Vertex Separators (204 citations)
- Algorithmic graph minor theory: Decomposition, approximation, and coloring (202 citations)
What are the main themes of his work throughout his whole career to date?
Combinatorics, Discrete mathematics, Approximation algorithm, Mathematical optimization and Upper and lower bounds are his primary areas of study.
His research in 1-planar graph, Pathwidth, Chordal graph, Partial k-tree and Tree-depth are components of Discrete mathematics.
His research integrates issues of Time complexity, Vertex, Graph and Parameterized complexity in his study of Approximation algorithm.
His work on Facility location problem, Online algorithm and Optimization problem as part of his general Mathematical optimization study is frequently connected to Rounding, thereby bridging the divide between different branches of science.
His work on Competitive analysis as part of general Upper and lower bounds research is frequently linked to Price of anarchy, bridging the gap between disciplines.
His Treewidth research incorporates elements of Bidimensionality and Graph minor.
He most often published in these fields:
- Combinatorics (47.11%)
- Discrete mathematics (36.84%)
- Approximation algorithm (25.26%)
What were the highlights of his more recent work (between 2017-2021)?
- Discrete mathematics (36.84%)
- Combinatorics (47.11%)
- Approximation algorithm (25.26%)
In recent papers he was focusing on the following fields of study:
His primary areas of study are Discrete mathematics, Combinatorics, Approximation algorithm, Upper and lower bounds and Mathematical economics.
MohammadTaghi Hajiaghayi combines subjects such as Tree, Streaming algorithm and Edit distance with his study of Discrete mathematics.
His work on Vertex and Graph as part of general Combinatorics research is often related to Planar, Random order and SIMPLE algorithm, thus linking different fields of science.
The concepts of his Approximation algorithm study are interwoven with issues in Cardinality and Matroid.
His Upper and lower bounds study incorporates themes from Sorting, Radix sort and Sorting algorithm.
His work in Mathematical economics covers topics such as Bounded function which are related to areas like Vertex and Binary logarithm.
Between 2017 and 2021, his most popular works were:
- Fair Allocation of Indivisible Goods: Improvements and Generalizations (53 citations)
- Prophet secretary for combinatorial auctions and matroids (44 citations)
- Approximating edit distance in truly subquadratic time: quantum and mapreduce (36 citations)
In his most recent research, the most cited papers focused on:
- Computer network
- Artificial intelligence
- Algorithm
The scientist’s investigation covers issues in Bounded function, Mathematical economics, Discrete mathematics, Sublinear function and Matching.
His Mathematical economics research focuses on Time complexity and how it relates to Subadditivity, Mathematical optimization and Cluster analysis.
His study in the field of Bipartite graph is also linked to topics like Simple.
His Sublinear function study introduces a deeper knowledge of Combinatorics.
His research in Combinatorics is mostly focused on Edge.
His research in Matching intersects with topics in Arboricity and Treewidth.
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.
