A Study on Effectiveness of Processing in Computational Clouds Considering Its Cost. - Mariusz Fras; Jan Kwiatkowski; Michal Stas (ISAT (1), 2019)

Determining Crossing Number of Join of the Discrete Graph with Two Symmetric Graphs of Order Five. - Michal Stas (Symmetry, 2019)

On the crossing number of join product of the discrete graph with special graphs of order five. - Michal Stas (Electron. J. Graph Theory Appl., 2020)

On the Crossing Numbers of the Joining of a Specific Graph on Six Vertices with the Discrete Graph. - Michal Stas (Symmetry, 2020)

On the Crossing Numbers of the Join Products of Six Graphs of Order Six with Paths and Cycles. - Michal Stas (Symmetry, 2021)

Cyclic permutations in determining crossing numbers. - Marián Klesc; Michal Stas (Discuss. Math. Graph Theory, 2022)

The Crossing Numbers of Join of Special Disconnected Graph on Five Vertices with Discrete Graphs. - Marián Klesc; Michal Stas; Jana Petrillová (Graphs Comb., 2022)

On the problems of CF-connected graphs. - Michal Stas; Juraj Valiska (Electron. J. Graph Theory Appl., 2023)

Calculating Crossing Numbers of Graphs Using Their Redrawings. - Michal Stas (Symmetry, 2023)

Disconnected spanning subgraphs of paths in the join products with cycles. - Michal Stas; Mária Svecová (Art Discret. Appl. Math., 2023)

From the Crossing Numbers of K5 + Pn and K5 + Cn to the Crossing Numbers of Wm + Sn and Wm + Wn. - Michal Stas; Jana Fortes; Mária Svecová (Axioms, 2024)