Position:
Lecturer
Department:
Department of Mathematics (DM)
Room:
NB 628
eMail:
Phone:
+421 259 325 342
Availability:

Publications

Book

  1. A. KolesárováM. Nehéz: Proceedings of Applied Mathematics and Informatics ZAMAT 2014, Editor(s): Kolesárová, A., Nehéz, M., UIAM FCHPT STU v Bratislave, 2014.
  2. M. Nehéz: Analysis and design of information systems (in Slovak), Equilibria, s. r. o., Košice, 2013.

Chapter or pages in book

  1. M. Nehéz: On Combinatorial Properties of Kolmogorov Random Binary Matrices, In ZAMAT 2014, Proceedings of Applied Mathematics and Informatics, Editor(s): A. Kolesárová, M. Nehéz, pp. 71–79, 2014.

Article in journal

  1. M. Čerňanský – M. Nehéz – D. Chudá – I. Polický: On Using of Turing Machine Simulators in Teaching of Theoretical Computer Science. Journal of Applied Mathematics, vol. 1/2, pp. 301–312, 2008.

Article in conference proceedings

  1. N. KrivoňákováA. MaťašovskýM. Nehéz: Implementation of e-learning into mathematical subjects in the university environment. Editor(s): L. Gómez Chova, A. López Martínez, I. Candel Torres, In ICERI2020 Proceedings, IATED, pp. 4139–4143, 2020.
  2. J. Kubalcová – M. Nehéz: Protein-proein interaction networks similarity determination by the usage of graphlets and Minkowski distance (in Slovak). Editor(s): Milena Reháková, Juraj Oravec, In 22. celoslovenská študentská vedecká konferencia s medzinárodnou účasťou Chémia a technológie pre život, Slovenská chemická knižnica, Slovenská technická univerzita v Bratislave, pp. 111–112, 2020.
  3. M. Nehéz – P. Bartalos: Complexity Aspects of Unstructured Sparse Graph Representation. Editor(s): George Eleftherakis, Milena Lazarova, Adelina Aleksieva-Petrova, Antoniya Tasheva, In Proceedings of the 9th Balkan Conference on Informatics, ACM Press, New York, pp. 26:1–26:3, 2019.
  4. M. Nehéz: Probabilistic Analysis of Graphlet Frequency Distribution in Sparse E-R Random Graphs. Editor(s): Stanislav Krajči, In ITAT 2018: Information Technologies – Applications and Theory, CEUR Workshop Proceedings, vol. 2018/2203, pp. 171–175, 2018.
  5. M. Nehéz – M. Lelovský: A Graph Mining Perspective on Graphlet-Based Network Similarity. Editor(s): R. Janošcová, In 13th International Workshop on Knowledge Management 2018, Vysoká škola manažmentu v Trenčíne, 2018.
  6. M. Nehéz – D. Bernát – M. Lelovský: Estimation of the domination number in sparse random graphs and applications. Editor(s): O. Rysavy, V. Vranic, G. A. Papadopoulos, In Proceedings of the Fifth European Conference on the Engineering of Computer-Based Systems, ACM Press, New York, vol. 2017, 2017.
  7. M. Nehéz: Analysis of the Randomized Algorithm for Clique Problems. Editor(s): Richtarikova D.,Szarkova D.,Balko L., In APLIMAT 2016 - 15th Conference on Applied Mathematics 2016, Slovak University of Technology in Bratislava, pp. 867–875, 2016.
  8. M. Nehéz: Near-Optimal Dominating Sets via Random Sampling. Editor(s): R. Dondi, G. Fertin, G. Mauri, In Proceedings of the 11th Int. Conference on Algorithmic Aspects in Information and Management 2016, LNCS 9778, Springer International Publishing, pp. 162–172, 2016.
  9. M. Nehéz: On Some Combinatorial Properties of Random 2-dimensional Tori. Editor(s): B. Brejová, In Proceedings of the 16th ITAT Conference on Theory and Practice of Information Technologies, CreateSpace Independent Publishing Platform, pp. 233–233, 2016.
  10. M. Nehéz – J. Kožíková: Toward Fast Computation of Proteomic Parsimony via Bipartite Graphs. Editor(s): B. Brejová, In Proceedings of the 16th ITAT Conference on Theory and Practice of Information Technologies, CreateSpace Independent Publishing Platform, pp. 234–234, 2016.
  11. M. Nehéz – M. Lelovský: Preface - WASACNA 2016. Editor(s): B. Brejová, In Proceedings of the 16th ITAT Conference on Theory and Practice of Information Technologies, CreateSpace Independent Publishing Platform, pp. 195–196, 2016.
  12. M. Nehéz – D. Bernát – M. Klaučo: Comparison of Algorithms for Near-Optimal Dominating Sets Computation in Real-World Networks. Editor(s): B. Rachev, A. Smrikarov, In Proceedings of the 16th International Conference on Computer Systems and Technologies, Association for Computing Machinery (ACM), Dublin, Ireland, pp. 199–206, 2015.
  13. M. Nehéz: Workshop on Algorithmic Aspects of Complex Networks Analysis (Introduction). Editor(s): V. Kůrková, L. Bajer, L. Peška, P. Vojtáš, M. Holeňa, M. Nehéz, In Proceedings of the 14th Conference on Information Technologies – Applications and Theory, Institute of Computer Science AS CR, pp. 113–113, 2014.
  14. M. Nehéz – M. Lelovský – J. Bendžala – T. Blaho: On the k-center Problem in Social Networks. Editor(s): V. Kůrková, L. Bajer, L. Peška, P. Vojtáš, M. Holeňa, M. Nehéz, In Proceedings of the 14th Conference on Information Technologies – Applications and Theory, Institute of Computer Science AS CR, pp. 139–144, 2014.
  15. M. Nehéz – J. Mäsiar: On Propagation in Social Networks - A Graph Mining Approach. Editor(s): J. Kelemen, M. Nehéz, In 6th Interantional Workshop on Knowledge Management, Vysoká škola manažmentu v Trenčíne, no. 1, pp. 107–118, 2011.

Article in collection

  1. M. Nehéz – M. Tatarko – A. Maťašovský: Principles of Frequent Subgraph Mining in Networks: Methods, Related Topics and Applications. In Perspectives in Measurement, Modeling and Interpretation, Editor(s): Bernadič, Branislav, Vysoká škola manažmentu, Bratislava, Panónska cesta 17, Bratislava, 2020.
Facebook / Youtube

Facebook / Youtube

RSS