Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Countries citing papers authored by Jiřı́ Matoušek
Since
Specialization
Citations
This map shows the geographic impact of Jiřı́ Matoušek's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jiřı́ Matoušek with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jiřı́ Matoušek more than expected).
This network shows the impact of papers produced by Jiřı́ Matoušek. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jiřı́ Matoušek. The network helps show where Jiřı́ Matoušek may publish in the future.
Co-authorship network of co-authors of Jiřı́ Matoušek
This figure shows the co-authorship network connecting the top 25 collaborators of Jiřı́ Matoušek.
A scholar is included among the top collaborators of Jiřı́ Matoušek based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Jiřı́ Matoušek. Jiřı́ Matoušek is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Matoušek, Jiřı́ & Aleksandar Nikolov. (2014). Combinatorial Discrepancy for Boxes via the Ellipsoid-Infinity Norm. arXiv (Cornell University).1 indexed citations
2.
Matoušek, Jiřı́, Martin Tancer, & Uli Wagner. (2011). Hardness of embedding simplicial complexes in $\mathbb {R}^d$. Journal of the European Mathematical Society. 13(2). 259–295.4 indexed citations
3.
Matoušek, Jiřı́. (2010). The Chemical Weapons Convention and the Role of Engineers andScientists. SHILAP Revista de lepidopterología.
4.
Matoušek, Jiřı́, Anders Björner, & Günter M. Ziegler. (2008). Using the Borsuk-Ulam theorem : lectures on topological methods in combinatorics and geometry. Springer eBooks.53 indexed citations
Matoušek, Jiřı́. (1999). Geometric Discrepancy: An Illustrated Guide. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)).106 indexed citations
Matoušek, Jiřı́ & Martin Loebl. (1991). Hercules versus Hidden Hydra Helper. Commentationes Mathematicae Universitatis Carolinae. 32(4). 731–741.
18.
Matoušek, Jiřı́. (1990). Extension of Lipschitz mappings on metric trees. Commentationes Mathematicae Universitatis Carolinae. 31(1). 99–104.21 indexed citations
19.
Kratochvı́l, Jan & Jiřı́ Matoušek. (1989). NP-hardness results for intersection graphs. Commentationes Mathematicae Universitatis Carolinae. 30(4). 761–773.11 indexed citations
20.
Matoušek, Jiřı́, Jaroslav Nešetřil, & Robin D. Thomas. (1988). On polynomial time decidability of induced-minor-closed classes. Commentationes Mathematicae Universitatis Carolinae. 29(4). 703–710.12 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.