Stochastic cooperative distributed grammar systems and random graphs. - Ján Gaso; Martin Nehéz (Acta Informatica, 2003)

On Communication Protocols in Unreliable Mesh Networks and their Relation to Phase Transitions. - Martin Nehéz; Dusan Bernát (PDCS, 2004)

An Improved Interval Routing Scheme for Almost All Networks Based on Dominating Cliques. - Martin Nehéz; Daniel Olejár (ISAAC, 2005)

Interval routing in reliability networks. - Cyril Gavoille; Martin Nehéz (Theor. Comput. Sci., 2005)

On Emergence of Dominating Cliques in Random Graphs - Martin Nehéz; Daniel Olejár; Michal Demetrian (CoRR, 2008)

On using of random access machine simulators in teaching of theoretical computer science. - Daniela Chudá; Martin Nehéz; Michal Cernanský (CompSysTech, 2009)

A Detailed Study of the Dominating Cliques Phase Transition in Random Graphs. - Martin Nehéz; Daniel Olejár; Michal Demetrian (TAMC, 2012)

Comparison of algorithms for near-optimal dominating sets computation in real-world networks. - Martin Nehéz; Dusan Bernát; Martin Klauco (CompSysTech, 2015)

Near-Optimal Dominating Sets via Random Sampling. - Martin Nehéz (AAIM, 2016)

Estimation of the domination number in sparse random graphs and applications. - Martin Nehéz; Dusan Bernát; Marek Lelovský (ECBS, 2017)

Probabilistic Analysis of Graphlets in Sparse E-R Random Graphs. - Martin Nehéz (ITAT, 2018)

Complexity Aspects of Unstructured Sparse Graph Representation. - Martin Nehéz; Peter Bartalos (BCI, 2019)

The most common issues in development of causal-loop diagrams and stock-and-flow diagrams. - Vladimír Bures; Tereza Otcenásková; Marek Zanker; Martin Nehéz (Int. J. Intell. Eng. Informatics, 2020)

Social Pattern Discovery for GPS Datasets. - Maros Cavojsky; Martin Drozda; Martin Nehéz (KES, 2024)