Jochen Harant
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 56
- Graph Labeling and Dimension Problems 30
- Complexity and Algorithms in Graphs 5
-
- Limits and Structures in Graph Theory 29
- Co-authors
- Ingo Schiermeyer (9 shared papers)Stanislav Jendrol′ (10 shared papers)Dieter Rautenbach (9 shared papers)Michael A. Henning (2 shared papers)Margit Voigt (3 shared papers)Thomas Böhme (6 shared papers)Michal Tkáč (5 shared papers)Jakub Przybyło (1 shared paper)
In The Last Decade
Jochen Harant
59 papers receiving 423 citations
Peers
Comparison fields: 5 of 38
- Discrete Mathematics and Combinatorics 151
- Computational Theory and Mathematics 408
- Computer Graphics and Computer-Aided Design 64
- Geometry and Topology 112
- Computer Networks and Communications 68
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 22 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 62 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1999 | 38 | |
| 2 | 2001 | 31 | |
| 3 | 2005 | 23 | |
| 4 | 1998 | 18 | |
| 5 | 2009 | 16 | |
| 6 | 1999 | 15 | |
| 7 | 2011 | 15 | |
| 8 | 2007 | 15 | |
| 9 | 2007 | 13 | |
| 10 | 2000 | 13 | |
| 11 | 1999 | 13 | |
| 12 | 2001 | 13 | |
| 13 | 1981 | 12 | |
| 14 | 2010 | 12 | |
| 15 | 1993 | 11 | |
| 16 | 1999 | 11 | |
| 17 | 2004 | 10 | |
| 18 | 2016 | 10 | |
| 19 | 2008 | 10 | |
| 20 | 2011 | 10 |
About Jochen Harant
Jochen Harant is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Computer Graphics and Computer-Aided Design and Electrical and Electronic Engineering, having authored 62 papers that have together received 448 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (56 papers), Graph Labeling and Dimension Problems (30 papers), Limits and Structures in Graph Theory (29 papers), Graph theory and applications (20 papers), Computational Geometry and Mesh Generation (17 papers), graph theory and CDMA systems (8 papers), Complexity and Algorithms in Graphs (5 papers) and Optimization and Search Problems (4 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (151 citations), Computational Theory and Mathematics (408 citations), Computer Graphics and Computer-Aided Design (64 citations), Geometry and Topology (112 citations) and Computer Networks and Communications (68 citations). Jochen Harant has collaborated with scholars based in Germany, Slovakia and Belarus. Frequent co-authors include Ingo Schiermeyer, Stanislav Jendrol′, Dieter Rautenbach, Michael A. Henning, Margit Voigt, Thomas Böhme, Michal Tkáč, Jakub Przybyło, Tomáš Madaras and Roman Soták. Their work appears in journals such as Discrete Mathematics, Journal of Graph Theory, Discrete Applied Mathematics, Journal of Combinatorial Theory Series B and Discussiones Mathematicae Graph Theory.
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.