Ján Katrenič
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 9
- Complexity and Algorithms in Graphs 6
- Graph Labeling and Dimension Problems 3
-
- Optimization and Search Problems 3
- Interconnection Networks and Systems 1
- Co-authors
- František Kardoš (2 shared papers)Gabriel Semanišin (6 shared papers)Boštjan Brešar (2 shared papers)Ingo Schiermeyer (2 shared papers)
In The Last Decade
Ján Katrenič
10 papers receiving 229 citations
Peers
Comparison fields: 5 of 23
- Discrete Mathematics and Combinatorics 54
- Computational Theory and Mathematics 199
- Computer Graphics and Computer-Aided Design 29
- Computer Networks and Communications 103
- Geometry and Topology 26
Countries citing papers authored by Ján Katrenič
This map shows the geographic impact of Ján Katrenič'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 Ján Katrenič with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ján Katrenič more than expected).
Fields of papers citing papers by Ján Katrenič
This network shows the impact of papers produced by Ján Katrenič. 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 Ján Katrenič. The network helps show where Ján Katrenič may publish in the future.
Co-authors
The 4 scholars most cited alongside Ján Katrenič, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2011 | 94 | |
| 2 | 2011 | 55 | |
| 3 | 2013 | 36 | |
| 4 | 2015 | 25 | |
| 5 | 2013 | 9 | |
| 6 | 2010 | 6 | |
| 7 | 2010 | 5 | |
| 8 | 2012 | 4 | |
| 9 | Complexity of ascent finding problem. | 2008 | 1 |
| 10 | 2016 | 1 |
About Ján Katrenič
Ján Katrenič is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Discrete Mathematics and Combinatorics, Genetics and Electrical and Electronic Engineering, having authored 10 papers that have together received 236 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (9 papers), Complexity and Algorithms in Graphs (6 papers), Optimization and Search Problems (3 papers), Limits and Structures in Graph Theory (3 papers), Graph Labeling and Dimension Problems (3 papers), Interconnection Networks and Systems (1 paper), Scheduling and Optimization Algorithms (1 paper) and Optimization and Packing Problems (1 paper). The work is most often cited by research in Discrete Mathematics and Combinatorics (54 citations), Computational Theory and Mathematics (199 citations), Computer Graphics and Computer-Aided Design (29 citations), Computer Networks and Communications (103 citations) and Geometry and Topology (26 citations). Ján Katrenič has collaborated with scholars based in Slovakia, Germany and Slovenia. Frequent co-authors include František Kardoš, Gabriel Semanišin, Boštjan Brešar and Ingo Schiermeyer. Their work appears in journals such as Discrete Applied Mathematics, Theoretical Computer Science, Algorithmica, Information Processing Letters 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.