Ladislav Stacho
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 34
- Graph Labeling and Dimension Problems 13
-
- Limits and Structures in Graph Theory 20
- Co-authors
- Ján Maňuch (26 shared papers)Arvind Gupta (9 shared papers)Daniel Král͏̌ (6 shared papers)Steven Pelech (2 shared papers)Pavol Hell (2 shared papers)Ugo Vaccaro (1 shared paper)Mikael Hammar (1 shared paper)Luisa Gargano (1 shared paper)
- Journals
- Journal of Graph Theory (8 papers)Discrete Mathematics (8 papers)Discrete Applied Mathematics (5 papers)Journal of Computational Biology (4 papers)Graphs and Combinatorics (3 papers)
- Partner nations
- CanadaSlovakiaUnited States
In The Last Decade
Ladislav Stacho
63 papers receiving 334 citations
Peers
Comparison fields: 5 of 69
- Discrete Mathematics and Combinatorics 51
- Computational Theory and Mathematics 165
- Computer Graphics and Computer-Aided Design 29
- Geometry and Topology 41
- Computer Networks and Communications 64
Countries citing papers authored by Ladislav Stacho
This map shows the geographic impact of Ladislav Stacho'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 Ladislav Stacho with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ladislav Stacho more than expected).
Fields of papers citing papers by Ladislav Stacho
This network shows the impact of papers produced by Ladislav Stacho. 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 Ladislav Stacho. The network helps show where Ladislav Stacho may publish in the future.
Co-authors
The 25 scholars most cited alongside Ladislav Stacho, 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 67 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2011 | 62 | |
| 2 | 2004 | 31 | |
| 3 | 2009 | 26 | |
| 4 | 2005 | 22 | |
| 5 | 2009 | 16 | |
| 6 | 2001 | 13 | |
| 7 | 2010 | 12 | |
| 8 | 1998 | 9 | |
| 9 | 2007 | 8 | |
| 10 | 2006 | 8 | |
| 11 | 2010 | 6 | |
| 12 | 2009 | 6 | |
| 13 | 1999 | 6 | |
| 14 | 2012 | 5 | |
| 15 | 2011 | 5 | |
| 16 | 2003 | 5 | |
| 17 | Cycles through specified vertices in 1-tough graphs. | 2000 | 4 |
| 18 | 1997 | 4 | |
| 19 | 2008 | 4 | |
| 20 | 2005 | 4 |
About Ladislav Stacho
Ladislav Stacho is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Computer Networks and Communications, Molecular Biology and Electrical and Electronic Engineering, having authored 67 papers that have together received 351 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (34 papers), Limits and Structures in Graph Theory (20 papers), Graph Labeling and Dimension Problems (13 papers), Computational Geometry and Mesh Generation (10 papers), Graph theory and applications (9 papers), Interconnection Networks and Systems (9 papers), graph theory and CDMA systems (8 papers) and RNA and protein synthesis mechanisms (7 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (51 citations), Computational Theory and Mathematics (165 citations), Computer Graphics and Computer-Aided Design (29 citations), Geometry and Topology (41 citations) and Computer Networks and Communications (64 citations). Ladislav Stacho has collaborated with scholars based in Canada, Slovakia and United States. Frequent co-authors include Ján Maňuch, Arvind Gupta, Daniel Král͏̌, Steven Pelech, Pavol Hell, Ugo Vaccaro, Mikael Hammar, Luisa Gargano, Imrich Vrt’o and Evangelos Kranakis. Their work appears in journals such as Journal of Graph Theory, Discrete Mathematics, Discrete Applied Mathematics, Journal of Computational Biology and Graphs and Combinatorics.
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.