H-Index & Metrics Best Publications

H-Index & Metrics

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

Overview

What is he best known for?

The fields of study he is best known for:

  • 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.

His most cited work include:

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

What are the main themes of his work throughout his whole career to date?

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.

He most often published in these fields:

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

What were the highlights of his more recent work (between 2009-2018)?

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

In recent papers he was focusing on the following fields of study:

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.

Between 2009 and 2018, his most popular works were:

  • 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)

In his most recent research, the most cited papers focused on:

  • 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.

Best Publications

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

Best Scientists Citing Jiří Matoušek

Micha Sharir

Micha Sharir

Tel Aviv University

Publications: 156

Pankaj K. Agarwal

Pankaj K. Agarwal

Duke University

Publications: 80

Timothy M. Chan

Timothy M. Chan

University of Illinois at Urbana-Champaign

Publications: 77

János Pach

János Pach

Alfréd Rényi Institute of Mathematics

Publications: 74

Sariel Har-Peled

Sariel Har-Peled

University of Illinois at Urbana-Champaign

Publications: 62

Assaf Naor

Assaf Naor

Princeton University

Publications: 55

Boris Aronov

Boris Aronov

New York University

Publications: 43

Bernard Chazelle

Bernard Chazelle

Princeton University

Publications: 42

Günter M. Ziegler

Günter M. Ziegler

Freie Universität Berlin

Publications: 40

Hans L. Bodlaender

Hans L. Bodlaender

Utrecht University

Publications: 35

Mark de Berg

Mark de Berg

Eindhoven University of Technology

Publications: 32

David Eppstein

David Eppstein

University of California, Irvine

Publications: 32

Jacob Fox

Jacob Fox

Stanford University

Publications: 32

Noga Alon

Noga Alon

Tel Aviv University

Publications: 30

Jeff Erickson

Jeff Erickson

University of Illinois at Urbana-Champaign

Publications: 30

David M. Mount

David M. Mount

University of Maryland, College Park

Publications: 28

Something went wrong. Please try again later.