Robert Šámal
Impact in
-
- Limits and Structures in Graph Theory
- Finite Group Theory Research
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in ⓘ
-
- Advanced Graph Theory Research 21
- Complexity and Algorithms in Graphs 5
-
- Limits and Structures in Graph Theory 15
- Co-authors
- Bojan Mohar (11 shared papers)Matt DeVos (7 shared papers)Zdenĕk Dvořák (3 shared papers)Luis Goddyn (2 shared papers)Jaroslav Nešetřil (3 shared papers)Jiřı́ Matoušek (3 shared papers)Ron Aharoni (1 shared paper)Daniel Král͏̌ (4 shared papers)
In The Last Decade
Robert Šámal
32 papers receiving 158 citations
Peers
Comparison fields: 5 of 22
- Discrete Mathematics and Combinatorics 98
- Computational Theory and Mathematics 133
- Geometry and Topology 66
- Computer Graphics and Computer-Aided Design 18
- Mathematical Physics 8
Countries citing papers authored by Robert Šámal
This map shows the geographic impact of Robert Šámal'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 Robert Šámal with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Robert Šámal more than expected).
Fields of papers citing papers by Robert Šámal
This network shows the impact of papers produced by Robert Šámal. 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 Robert Šámal. The network helps show where Robert Šámal may publish in the future.
Co-authors
The 21 scholars most cited alongside Robert Šámal, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 34 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2008 | 29 | |
| 2 | 2012 | 24 | |
| 3 | 2020 | 20 | |
| 4 | 2010 | 11 | |
| 5 | 2008 | 9 | |
| 6 | 2015 | 8 | |
| 7 | On XY Mappings | 2006 | 7 |
| 8 | 2003 | 6 | |
| 9 | 2008 | 5 | |
| 10 | 2011 | 4 | |
| 11 | 2008 | 4 | |
| 12 | 2004 | 3 | |
| 13 | 2019 | 3 | |
| 14 | 2014 | 3 | |
| 15 | 2005 | 3 | |
| 16 | 2007 | 3 | |
| 17 | 2005 | 3 | |
| 18 | 2011 | 2 | |
| 19 | 2012 | 2 | |
| 20 | 2017 | 2 |
About Robert Šámal
Robert Šámal is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Computer Networks and Communications and Electrical and Electronic Engineering, having authored 34 papers that have together received 165 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (21 papers), Limits and Structures in Graph Theory (15 papers), graph theory and CDMA systems (6 papers), Computational Geometry and Mesh Generation (6 papers), Graph theory and applications (5 papers), Complexity and Algorithms in Graphs (5 papers), Advanced Topology and Set Theory (4 papers) and Optimization and Search Problems (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (98 citations), Computational Theory and Mathematics (133 citations), Geometry and Topology (66 citations), Computer Graphics and Computer-Aided Design (18 citations) and Mathematical Physics (8 citations). Robert Šámal has collaborated with scholars based in Czechia, Canada and Singapore. Frequent co-authors include Bojan Mohar, Matt DeVos, Zdenĕk Dvořák, Luis Goddyn, Jaroslav Nešetřil, Jiřı́ Matoušek, Ron Aharoni, Daniel Král͏̌, David E. Roberson and Simone Severini. Their work appears in journals such as Journal of Graph Theory, European Journal of Combinatorics, COMBINATORICA, Journal of Combinatorial Theory Series B and Discrete & Computational Geometry.
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.