Jochen Harant
Impact in
-
- Limits and Structures in Graph Theory
- Advanced Combinatorial Mathematics
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 58
- Complexity and Algorithms in Graphs 8
- Graph Labeling and Dimension Problems 3
-
- Limits and Structures in Graph Theory 12
- Advanced Combinatorial Mathematics 1
- Co-authors
- Ingo Schiermeyer (10 shared papers)Dieter Rautenbach (10 shared papers)Stanislav Jendrol′ (10 shared papers)Margit Voigt (3 shared papers)Michael A. Henning (2 shared papers)Thomas J. Böhme (5 shared papers)Michal Tkáč (5 shared papers)Zdeněk Ryjáček (1 shared paper)
In The Last Decade
Jochen Harant
62 papers receiving 494 citations
Peers
Comparison fields: 5 of 19
- Discrete Mathematics and Combinatorics 128
- Computational Theory and Mathematics 435
- Geometry and Topology 53
- Numerical Analysis 19
- Statistical and Nonlinear Physics 13
Countries citing papers authored by Jochen Harant
This map shows the geographic impact of Jochen Harant'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 Jochen Harant with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jochen Harant more than expected).
Fields of papers citing papers by Jochen Harant
This network shows the impact of papers produced by Jochen Harant. 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 Jochen Harant. The network helps show where Jochen Harant may publish in the future.
Co-authors
The 18 scholars most cited alongside Jochen Harant, 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 64 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1999 | 51 | |
| 2 | 2001 | 34 | |
| 3 | 2005 | 26 | |
| 4 | 2009 | 19 | |
| 5 | 2011 | 19 | |
| 6 | 1998 | 18 | |
| 7 | 2001 | 17 | |
| 8 | 1999 | 16 | |
| 9 | 2007 | 16 | |
| 10 | 1999 | 15 | |
| 11 | 2000 | 15 | |
| 12 | 2007 | 15 | |
| 13 | 2010 | 14 | |
| 14 | 1981 | 13 | |
| 15 | 1999 | 13 | |
| 16 | 1993 | 12 | |
| 17 | 2016 | 12 | |
| 18 | 2008 | 11 | |
| 19 | 2011 | 11 | |
| 20 | 2004 | 10 |
About Jochen Harant
Jochen Harant is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Nuclear Energy and Engineering and Waste Management and Disposal, having authored 64 papers that have together received 513 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (58 papers), Limits and Structures in Graph Theory (12 papers), Graph theory and applications (9 papers), Complexity and Algorithms in Graphs (8 papers), Graph Labeling and Dimension Problems (3 papers) and Advanced Combinatorial Mathematics (1 paper). The work is most often cited by research in Discrete Mathematics and Combinatorics (128 citations), Computational Theory and Mathematics (435 citations), Geometry and Topology (53 citations), Numerical Analysis (19 citations) and Statistical and Nonlinear Physics (13 citations). Jochen Harant has collaborated with scholars based in Germany, Slovakia and Czechia. Frequent co-authors include Ingo Schiermeyer, Dieter Rautenbach, Stanislav Jendrol′, Margit Voigt, Michael A. Henning, Thomas J. Böhme, Michal Tkáč, Zdeněk Ryjáček, Maria Axenovich and Tomáš Madaras. Their work appears in journals such as Discrete Mathematics, Journal of Graph Theory, Discrete Applied Mathematics, Journal of Combinatorial Theory Series B and Journal of Graph Algorithms and Applications.
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.