Ján Plesnı́k
Impact in
-
- Limits and Structures in Graph Theory
- Geometry and Topology top 2%
- Graph theory and applications
Papers in
-
- Advanced Graph Theory Research 25
- Graph Labeling and Dimension Problems 10
- Complexity and Algorithms in Graphs 5
-
- Interconnection Networks and Systems 12
- Co-authors
- Mirka Miller (6 shared papers)Štefan Znám (2 shared papers)Edy Tri Baskoro (4 shared papers)Joe Ryan (2 shared papers)Ljiljana Branković (2 shared papers)Jozef Širáň (2 shared papers)
In The Last Decade
Ján Plesnı́k
35 papers receiving 704 citations
Peers
Comparison fields: 5 of 56
- Discrete Mathematics and Combinatorics 142
- Geometry and Topology 282
- Computational Theory and Mathematics 518
- Computer Graphics and Computer-Aided Design 66
- Computer Networks and Communications 302
Countries citing papers authored by Ján Plesnı́k
This map shows the geographic impact of Ján Plesnı́k'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 Plesnı́k 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 Plesnı́k more than expected).
Fields of papers citing papers by Ján Plesnı́k
This network shows the impact of papers produced by Ján Plesnı́k. 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 Plesnı́k. The network helps show where Ján Plesnı́k may publish in the future.
Co-authors
The 6 scholars most cited alongside Ján Plesnı́k, 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 38 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1984 | 198 | |
| 2 | CRITICAL GRAPHS OF GIVEN DIAMETER. | 1975 | 80 |
| 3 | 1987 | 73 | |
| 4 | A bound for the Steiner tree problem in graphs | 1981 | 52 |
| 5 | Connectivity of Regular Graphs and the Existence of 1-Factors | 1972 | 44 |
| 6 | 1981 | 40 | |
| 7 | On equality of edge-connectivity and minimum degree of a graph | 1989 | 27 |
| 8 | 1999 | 27 | |
| 9 | 1980 | 26 | |
| 10 | 1978 | 22 | |
| 11 | 1997 | 18 | |
| 12 | 1998 | 16 | |
| 13 | 1984 | 16 | |
| 14 | 1992 | 16 | |
| 15 | 1995 | 15 | |
| 16 | WORST-CASE RELATIVE PERFORMANCES OF HEURISTICS FOR THE STEINER PROBLEM IN GRAPHS | 1991 | 14 |
| 17 | 1984 | 14 | |
| 18 | Regular digraphs of diameter 2 and maximum order. | 1994 | 13 |
| 19 | Two constructions of geodetic graphs | 1977 | 11 |
| 20 | 1975 | 10 |
About Ján Plesnı́k
Ján Plesnı́k is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Electrical and Electronic Engineering, Geometry and Topology and Discrete Mathematics and Combinatorics, having authored 38 papers that have together received 803 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (25 papers), Interconnection Networks and Systems (12 papers), Graph Labeling and Dimension Problems (10 papers), Graph theory and applications (9 papers), graph theory and CDMA systems (7 papers), VLSI and FPGA Design Techniques (5 papers), Complexity and Algorithms in Graphs (5 papers) and Computational Geometry and Mesh Generation (5 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (142 citations), Geometry and Topology (282 citations), Computational Theory and Mathematics (518 citations), Computer Graphics and Computer-Aided Design (66 citations) and Computer Networks and Communications (302 citations). Ján Plesnı́k has collaborated with scholars based in Slovakia, China and Australia. Frequent co-authors include Mirka Miller, Štefan Znám, Edy Tri Baskoro, Joe Ryan, Ljiljana Branković and Jozef Širáň. Their work appears in journals such as Journal of Graph Theory, Discrete Applied Mathematics, Networks, Discrete Mathematics and Linear Algebra and its 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.