Ladislav Stacho

1.1k total citations
67 papers, 348 citations indexed

About

Ladislav Stacho is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Networks and Communications. According to data from OpenAlex, Ladislav Stacho has authored 67 papers receiving a total of 348 indexed citations (citations by other indexed papers that have themselves been cited), including 40 papers in Computational Theory and Mathematics, 20 papers in Discrete Mathematics and Combinatorics and 18 papers in Computer Networks and Communications. Recurrent topics in Ladislav Stacho's work include Advanced Graph Theory Research (34 papers), Limits and Structures in Graph Theory (20 papers) and Graph Labeling and Dimension Problems (13 papers). Ladislav Stacho is often cited by papers focused on Advanced Graph Theory Research (34 papers), Limits and Structures in Graph Theory (20 papers) and Graph Labeling and Dimension Problems (13 papers). Ladislav Stacho collaborates with scholars based in Canada, Slovakia and United States. Ladislav Stacho's co-authors include Ján Maňuch, Arvind Gupta, Daniel Král͏̌, Steven Pelech, Pavol Hell, Mikael Hammar, Luisa Gargano, Ugo Vaccaro, Imrich Vrt’o and Evangelos Kranakis and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Networks.

In The Last Decade

Ladislav Stacho

63 papers receiving 330 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Ladislav Stacho Canada	9	170	142	64	51	47	67	348
Alexandru I. Tomescu Finland	11	121 0.7×	236 1.7×	34 0.5×	11 0.2×	11 0.2×	68	437
Ján Maňuch Canada	9	70 0.4×	199 1.4×	19 0.3×	9 0.2×	20 0.4×	50	281
Isabella Novik United States	10	140 0.8×	95 0.7×	6 0.1×	172 3.4×	12 0.3×	38	381
Gregory J. Puleo United States	8	69 0.4×	86 0.6×	22 0.3×	21 0.4×	17 0.4×	23	202
Tero Harju Finland	13	554 3.3×	340 2.4×	22 0.3×	36 0.7×	29 0.6×	115	733
Béla Csaba Hungary	10	120 0.7×	46 0.3×	25 0.4×	104 2.0×	34 0.7×	58	293
Boting Yang Canada	6	65 0.4×	29 0.2×	32 0.5×	12 0.2×	18 0.4×	28	115
Aaron Williams Canada	11	193 1.1×	65 0.5×	10 0.2×	42 0.8×	86 1.8×	57	348
Irena Rusu France	9	99 0.6×	189 1.3×	27 0.4×	27 0.5×	10 0.2×	45	365
Sarah K. Merz United States	7	67 0.4×	200 1.4×	22 0.3×	12 0.2×	8 0.2×	15	286

Countries citing papers authored by Ladislav Stacho

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Ladislav Stacho

This figure shows the co-authorship network connecting the top 25 collaborators of Ladislav Stacho. A scholar is included among the top collaborators of Ladislav Stacho based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Ladislav Stacho. Ladislav Stacho is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Dobrev, Stefan, Evangelos Kranakis, Danny Kriz̧anc, et al.. (2019). Weak Coverage of a Rectangular Barrier. Algorithmica. 82(4). 721–746. 2 indexed citations

Maňuch, Ján, et al.. (2016). Combinatorial RNA Design: Designability and Structure-Approximating Algorithm in Watson–Crick and Nussinov–Jacobson Energy Models. Algorithmica. 79(3). 835–856. 3 indexed citations

Gupta, Arvind, Ján Maňuch, Ladislav Stacho, & Xiao Hong Zhao. (2012). Algorithm for Haplotype Inference via Galled-Tree Networks with Simple Galls. Journal of Computational Biology. 19(4). 439–454. 2 indexed citations

Král͏̌, Daniel, et al.. (2011). Cyclic colorings of plane graphs with independent faces. European Journal of Combinatorics. 33(3). 294–301. 5 indexed citations

Maňuch, Ján, et al.. (2011). Prediction of 492 human protein kinase substrate specificities. Proteome Science. 9(Suppl 1). S6–S6. 61 indexed citations

Liestman, Arthur L., Dana Richards, & Ladislav Stacho. (2009). Broadcasting from multiple originators. Discrete Applied Mathematics. 157(13). 2886–2891. 1 indexed citations

Gupta, Arvind, Ján Maňuch, Ladislav Stacho, & Xiao Hong Zhao. (2008). Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices. Discrete Applied Mathematics. 157(10). 2310–2324. 4 indexed citations

Adams, Peter D., et al.. (2008). Spanning cubic graph designs. Discrete Mathematics. 309(18). 5781–5788. 1 indexed citations

Liestman, Arthur L., Thomas C. Shermer, & Ladislav Stacho. (2008). Edge-disjoint spanners in tori. Discrete Mathematics. 309(8). 2239–2249. 4 indexed citations

10.

Clote, Peter, Evangelos Kranakis, Danny Kriz̧anc, & Ladislav Stacho. (2006). Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov–Jacobson energy model. Discrete Applied Mathematics. 155(6-7). 759–787. 8 indexed citations

11.

Fertin, Guillaume, Arthur L. Liestman, Thomas C. Shermer, & Ladislav Stacho. (2005). Edge-disjoint spanners in Cartesian products of graphs. Discrete Mathematics. 296(2-3). 167–186. 3 indexed citations

12.

Gargano, Luisa, Mikael Hammar, Pavol Hell, Ladislav Stacho, & Ugo Vaccaro. (2004). Spanning spiders and light-splitting switches. Discrete Mathematics. 285(1-3). 83–95. 31 indexed citations

13.

Alon, Noga, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, & Ladislav Stacho. (2003). Factor d-domatic colorings of graphs. Discrete Mathematics. 262(1-3). 17–25. 1 indexed citations

14.

Stacho, Ladislav. (2002). A NOTE ON UPPER BOUND FOR CHROMATIC NUMBER OF A GRAPH. 1 indexed citations

15.

Stacho, Ladislav. (2000). Cycles through specified vertices in 1-tough graphs.. Ars Combinatoria. 56. 4 indexed citations

16.

Horák, Peter & Ladislav Stacho. (2000). A lower bound on the number of hamiltonian cycles. Discrete Mathematics. 222(1-3). 275–280. 4 indexed citations

17.

Stacho, Ladislav. (1999). Locally Pancyclic Graphs. Journal of Combinatorial Theory Series B. 76(1). 22–40. 6 indexed citations

18.

Stacho, Ladislav. (1998). Non-Isomorphic Smallest Maximally Non-Hamiltonian Graphs.. Ars Combinatoria. 48. 2 indexed citations

19.

Stacho, Ladislav & Imrich Vrt’o. (1998). Bisection width of transposition graphs. Discrete Applied Mathematics. 84(1-3). 221–235. 9 indexed citations

20.

Stacho, Ladislav. (1995). On minimal outerplanar graphs of given diameter.. Australas. J Comb.. 12. 67–76. 1 indexed citations

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.

Explore authors with similar magnitude of impact