According to our database1, Martin Nehéz
Legend:Book In proceedings Article PhD thesis Other
Estimation of the domination number in sparse random graphs and applications.
Proceedings of the Fifth European Conference on the Engineering of Computer-Based Systems, 2017
Near-Optimal Dominating Sets via Random Sampling.
Proceedings of the Algorithmic Aspects in Information and Management, 2016
Comparison of algorithms for near-optimal dominating sets computation in real-world networks.
Proceedings of the 16th International Conference on Computer Systems and Technologies, 2015
A Detailed Study of the Dominating Cliques Phase Transition in Random Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2012
On using of random access machine simulators in teaching of theoretical computer science.
Proceedings of the 2009 International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing, 2009
On Emergence of Dominating Cliques in Random Graphs
Interval routing in reliability networks.
Theor. Comput. Sci., 2005
An Improved Interval Routing Scheme for Almost All Networks Based on Dominating Cliques.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
On Communication Protocols in Unreliable Mesh Networks and their Relation to Phase Transitions.
Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, 2004
Stochastic cooperative distributed grammar systems and random graphs.
Acta Inf., 2003
Interval Routing in Reliability Networks.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003