What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Algebra
- Discrete mathematics
Combinatorics, Discrete mathematics, Combinatorial optimization, Optimization problem and Linear programming are his primary areas of study.
Discrete mathematics is closely attributed to Branch and price in his research.
His research in Combinatorial optimization focuses on subjects like Matroid intersection, which are connected to Total dual integrality.
His Quadratic assignment problem study in the realm of Optimization problem connects with subjects such as Ellipsoid method.
He has included themes like Matroid polytope, Weighted matroid, Cutting-plane method and Polymatroid in his Polyhedron study.
His Integer programming study incorporates themes from Linear-fractional programming, Criss-cross algorithm and System of linear equations.
His most cited work include:
- Theory of Linear and Integer Programming (5875 citations)
- Geometric Algorithms and Combinatorial Optimization (3230 citations)
- Combinatorial Optimization (2568 citations)
What are the main themes of his work throughout his whole career to date?
Alexander Schrijver focuses on Combinatorics, Discrete mathematics, Graph, Disjoint sets and Bipartite graph.
His research ties Upper and lower bounds and Combinatorics together.
His studies deal with areas such as Graph theory, Semidefinite programming and Submodular set function as well as Discrete mathematics.
His biological study spans a wide range of topics, including Matching and Matroid.
His research in Matching tackles topics such as State which are related to areas like Linear programming.
His Algebra research is multidisciplinary, incorporating elements of Time complexity and Combinatorial optimization.
He most often published in these fields:
- Combinatorics (76.65%)
- Discrete mathematics (53.30%)
- Graph (14.10%)
What were the highlights of his more recent work (between 2009-2019)?
- Combinatorics (76.65%)
- Discrete mathematics (53.30%)
- Graph (14.10%)
In recent papers he was focusing on the following fields of study:
His primary areas of investigation include Combinatorics, Discrete mathematics, Graph, Vertex and Algebra.
His Combinatorics research includes themes of Upper and lower bounds and Bounded function.
His Discrete mathematics study frequently links to adjacent areas such as Series.
His Graph research includes themes of Complex number, Matrix, Eigenvalues and eigenvectors and Spin model.
The Vertex study combines topics in areas such as Chord diagram, Vertex model, Circulant graph and Lie algebra.
Semidefinite programming and Symmetry is closely connected to Coding theory in his research, which is encompassed under the umbrella topic of Algebra.
Between 2009 and 2019, his most popular works were:
- The Traveling Salesman Problem (72 citations)
- Invariant semidefinite programs (48 citations)
- Invariant semidefinite programs (48 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Algebra
- Real number
Alexander Schrijver mostly deals with Combinatorics, Discrete mathematics, Invariant, Semidefinite programming and Polynomial optimization.
His Combinatorics study frequently involves adjacent topics like Upper and lower bounds.
He combines subjects such as Travelling salesman problem and Series with his study of Discrete mathematics.
His Invariant research incorporates elements of Binary Golay code, Comparability, Binary code, Hamming distance and Symmetric matrix.
His research integrates issues of Symmetry and Coding theory in his study of Polynomial optimization.
The various areas that he examines in his Graph partition study include Partition function, Circulant graph, Regular graph, Vertex and Vertex model.
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.
