Martin Nehéz

According to our database, Martin Nehéz authored at least 13 papers between 2003 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2020

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

2019

Complexity Aspects of Unstructured Sparse Graph Representation.

Martin Nehéz, Peter Bartalos

Proceedings of the 9th Balkan Conference on Informatics, 2019

2018

Probabilistic Analysis of Graphlets in Sparse E-R Random Graphs.

Martin Nehéz

Proceedings of the 18th Conference Information Technologies, 2018

2017

Estimation of the domination number in sparse random graphs and applications.

Martin Nehéz, Dusan Bernát, Marek Lelovský

Proceedings of the Fifth European Conference on the Engineering of Computer-Based Systems, 2017

2016

Near-Optimal Dominating Sets via Random Sampling.

Martin Nehéz

Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015

Comparison of algorithms for near-optimal dominating sets computation in real-world networks.

Martin Nehéz, Dusan Bernát, Martin Klauco

Proceedings of the 16th International Conference on Computer Systems and Technologies, 2015

2012

A Detailed Study of the Dominating Cliques Phase Transition in Random Graphs.

Martin Nehéz, Daniel Olejár, Michal Demetrian

Proceedings of the Theory and Applications of Models of Computation, 2012

2009

On using of random access machine simulators in teaching of theoretical computer science.

Daniela Chudá, Martin Nehéz, Michal Cernanský

Proceedings of the 2009 International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing, 2009

2008

On Emergence of Dominating Cliques in Random Graphs

Martin Nehéz, Daniel Olejár, Michal Demetrian

CoRR, 2008

2005

Interval routing in reliability networks.

Cyril Gavoille, Martin Nehéz

Theor. Comput. Sci., 2005

An Improved Interval Routing Scheme for Almost All Networks Based on Dominating Cliques.

Martin Nehéz, Daniel Olejár

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

On Communication Protocols in Unreliable Mesh Networks and their Relation to Phase Transitions.

Martin Nehéz, Dusan Bernát

Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, 2004

2003

Stochastic cooperative distributed grammar systems and random graphs.

Ján Gaso, Martin Nehéz

Acta Informatica, 2003