- Home
- Best Scientists - Mathematics
- Jiří Matoušek

Discipline name
H-index
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
40
Citations
7,399
129
World Ranking
4476
National Ranking
6

Mathematics
D-index
44
Citations
9,731
150
World Ranking
807
National Ranking
5

- Combinatorics
- Geometry
- Real number

Jiří Matoušek mainly investigates Combinatorics, Discrete mathematics, Upper and lower bounds, Bounded function and Computational geometry. He combines subjects such as Measure and Point with his study of Combinatorics. His Discrete mathematics study integrates concerns from other disciplines, such as Simplex, Simple and Plane.

His research in Upper and lower bounds intersects with topics in Embedding and Metric space. His Bounded function study combines topics from a wide range of disciplines, such as Subdivision, Algebraic curve, Crossing number, Polynomial and Spanning tree. His study in Computational geometry is interdisciplinary in nature, drawing from both Computational complexity theory and Deterministic algorithm.

- Graduate Texts in Mathematics (7753 citations)
- Using the Borsuk-Ulam Theorem (509 citations)
- On the L 2 -discrepancy for anchored boxes (231 citations)

His primary scientific interests are in Combinatorics, Discrete mathematics, Upper and lower bounds, Regular polygon and Plane. His research on Combinatorics frequently links to adjacent areas such as Bounded function. His Discrete mathematics research incorporates elements of Linear programming and Convex set.

His study in Upper and lower bounds is interdisciplinary in nature, drawing from both Measure and Integer. He works mostly in the field of Plane, limiting it down to concerns involving Computational geometry and, occasionally, Deterministic algorithm. Jiří Matoušek usually deals with Simplicial complex and limits it to topics linked to Embedding and Metric space.

- Combinatorics (80.40%)
- Discrete mathematics (46.00%)
- Upper and lower bounds (24.40%)

- Combinatorics (80.40%)
- Discrete mathematics (46.00%)
- Upper and lower bounds (24.40%)

Jiří Matoušek mainly focuses on Combinatorics, Discrete mathematics, Upper and lower bounds, Disjoint sets and Simplicial complex. He works on Combinatorics which deals in particular with Time complexity. In his study, Fixed point and Voronoi diagram is inextricably linked to Metric space, which falls within the broad field of Time complexity.

As part of the same scientific family, Jiří Matoušek usually focuses on Discrete mathematics, concentrating on Homotopy and intersecting with Undecidable problem. His Upper and lower bounds study which covers Measure that intersects with Venn diagram. His Disjoint sets research incorporates elements of Pointwise and Square.

- Hardness of embedding simplicial complexes in Rd (74 citations)
- Simple Proofs of Classical Theorems in Discrete Geometry via the Guth–Katz Polynomial Partitioning Technique (62 citations)
- Lower bounds for weak epsilon-nets and stair-convexity (47 citations)

- Combinatorics
- Geometry
- Mathematical analysis

Jiří Matoušek spends much of his time researching Combinatorics, Discrete mathematics, Upper and lower bounds, Simplicial complex and Disjoint sets. Jiří Matoušek studies Combinatorics, focusing on Dimension in particular. His Discrete mathematics study integrates concerns from other disciplines, such as Structure, Homotopy and Minor.

His Upper and lower bounds research is multidisciplinary, incorporating perspectives in Plane, Graph of a function and Convex set. His Simplicial complex study incorporates themes from Novikov self-consistency principle, Piecewise linear function, Decidability and Graph. His research in Disjoint sets intersects with topics in Geometric proof, Cardinality, Pointwise and Existential quantification.

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.

Graduate Texts in Mathematics

Rajendra Bhatia;Glen Bredon;Wolfgang Walter;Joseph J. Rotman.

**(1977)**

23307 Citations

Using the Borsuk-Ulam theorem : lectures on topological methods in combinatorics and geometry

Jiří Matoušek;Anders Björner;Gunter M Ziegler.

**(2008)**

937 Citations

Using the Borsuk-Ulam Theorem

Jiří Matoušek.

**(2003)**

781 Citations

Understanding and Using Linear Programming

Jiří Matoušek;Bernd Gärtner.

**(2007)**

505 Citations

On the L 2 -discrepancy for anchored boxes

Jiří Matoušek.

Journal of Complexity **(1998)**

349 Citations

Reporting points in halfspaces

Jiří Matoušek.

Computational Geometry: Theory and Applications **(1992)**

323 Citations

Ray shooting and parametric search

Pankaj K. Agarwal;Jiří Matoušek.

SIAM Journal on Computing **(1993)**

306 Citations

Approximations and optimal geometric divide-and-conquer

Jiří Matoušek.

symposium on the theory of computing **(1991)**

243 Citations

On the complexity of finding iso- and other morphisms for partial k -trees

Jiří Matoušek;Robin Thomas.

Discrete Mathematics **(1992)**

226 Citations

On embedding expanders into ℓp spaces

Jiří Matoušek.

Israel Journal of Mathematics **(1997)**

181 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Tel Aviv University

Charles University

University College London

ETH Zurich

Duke University

Eindhoven University of Technology

Georgia Institute of Technology

Japan Advanced Institute of Science and Technology

Hebrew University of Jerusalem

Alfréd Rényi Institute of Mathematics

Something went wrong. Please try again later.