- Pracovné zaradenie:
- Oddelenie:
- Oddelenie matematiky (OM)
- Miestnosť:
- NB 628
- eMail:
- Telefón:
- +421 259 325 342
- Vedecká činnosť:
- Dostupnosť:
Publikácie
Kniha
- A. Kolesárová – M. Nehéz: Proceedings of Applied Mathematics and Informatics ZAMAT 2014, Editor(i): Kolesárová, A., Nehéz, M., UIAM FCHPT STU v Bratislave, 2014.
- M. Nehéz: Analýza a návrh informačných systémov, Equilibria, s. r. o., Košice, 2013.
Kapitola alebo strany v knihe
- M. Nehéz: On Combinatorial Properties of Kolmogorov Random Binary Matrices, V ZAMAT 2014, Proceedings of Applied Mathematics and Informatics, Editor(i): A. Kolesárová, M. Nehéz, str. 71–79, 2014.
Článok v časopise
- 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, zv. 1/2, str. 301–312, 2008.
Príspevok na konferencii
- N. Krivoňáková – P. Jánoš – M. Nehéz: On size of dominating sets in power-law graphs. Editor(i): Tomáš Madaras, V Abstracts of the 58th Czech and Slovak Conference on Graph Theory 2003, str. 15–15, 2024.
- N. Krivoňáková – A. Maťašovský – M. Nehéz: Implementation of e-learning into mathematical subjects in the university environment. Editor(i): L. Gómez Chova, A. López Martínez, I. Candel Torres, V ICERI2020 Proceedings, IATED, str. 4139–4143, 2020.
- J. Kubalcová – M. Nehéz: Určovanie podobnosti proteínových sietí s využitím grafletov a Minkowského vzdialenosti. Editor(i): Milena Reháková, Juraj Oravec, V 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, str. 111–112, 2020.
- M. Nehéz – P. Bartalos: Complexity Aspects of Unstructured Sparse Graph Representation. Editor(i): George Eleftherakis, Milena Lazarova, Adelina Aleksieva-Petrova, Antoniya Tasheva, V Proceedings of the 9th Balkan Conference on Informatics, ACM Press, New York, str. 26:1–26:3, 2019.
- M. Nehéz: Probabilistic Analysis of Graphlet Frequency Distribution in Sparse E-R Random Graphs. Editor(i): Stanislav Krajči, V ITAT 2018: Information Technologies – Applications and Theory, CEUR Workshop Proceedings, zv. 2018/2203, str. 171–175, 2018.
- M. Nehéz – M. Lelovský: A Graph Mining Perspective on Graphlet-Based Network Similarity. Editor(i): R. Janošcová, V 13th International Workshop on Knowledge Management 2018, Vysoká škola manažmentu v Trenčíne, 2018.
- M. Nehéz – D. Bernát – M. Lelovský: Estimation of the domination number in sparse random graphs and applications. Editor(i): O. Rysavy, V. Vranic, G. A. Papadopoulos, V Proceedings of the Fifth European Conference on the Engineering of Computer-Based Systems, ACM Press, New York, zv. 2017, 2017.
- M. Nehéz: Analysis of the Randomized Algorithm for Clique Problems. Editor(i): Richtarikova D.,Szarkova D.,Balko L., V APLIMAT 2016 - 15th Conference on Applied Mathematics 2016, Slovak University of Technology in Bratislava, str. 867–875, 2016.
- M. Nehéz: Near-Optimal Dominating Sets via Random Sampling. Editor(i): R. Dondi, G. Fertin, G. Mauri, V Proceedings of the 11th Int. Conference on Algorithmic Aspects in Information and Management 2016, LNCS 9778, Springer International Publishing, str. 162–172, 2016.
- M. Nehéz: On Some Combinatorial Properties of Random 2-dimensional Tori. Editor(i): B. Brejová, V Proceedings of the 16th ITAT Conference on Theory and Practice of Information Technologies, CreateSpace Independent Publishing Platform, str. 233–233, 2016.
- M. Nehéz – J. Kožíková: Toward Fast Computation of Proteomic Parsimony via Bipartite Graphs. Editor(i): B. Brejová, V Proceedings of the 16th ITAT Conference on Theory and Practice of Information Technologies, CreateSpace Independent Publishing Platform, str. 234–234, 2016.
- M. Nehéz – M. Lelovský: Preface - WASACNA 2016. Editor(i): B. Brejová, V Proceedings of the 16th ITAT Conference on Theory and Practice of Information Technologies, CreateSpace Independent Publishing Platform, str. 195–196, 2016.
- M. Nehéz – D. Bernát – M. Klaučo: Comparison of Algorithms for Near-Optimal Dominating Sets Computation in Real-World Networks. Editor(i): B. Rachev, A. Smrikarov, V Proceedings of the 16th International Conference on Computer Systems and Technologies, Association for Computing Machinery (ACM), Dublin, Ireland, str. 199–206, 2015.
- M. Nehéz: Workshop on Algorithmic Aspects of Complex Networks Analysis (Introduction). Editor(i): V. Kůrková, L. Bajer, L. Peška, P. Vojtáš, M. Holeňa, M. Nehéz, V Proceedings of the 14th Conference on Information Technologies – Applications and Theory, Institute of Computer Science AS CR, str. 113–113, 2014.
- M. Nehéz – M. Lelovský – J. Bendžala – T. Blaho: On the k-center Problem in Social Networks. Editor(i): V. Kůrková, L. Bajer, L. Peška, P. Vojtáš, M. Holeňa, M. Nehéz, V Proceedings of the 14th Conference on Information Technologies – Applications and Theory, Institute of Computer Science AS CR, str. 139–144, 2014.
- M. Nehéz – J. Mäsiar: On Propagation in Social Networks - A Graph Mining Approach. Editor(i): J. Kelemen, M. Nehéz, V 6th Interantional Workshop on Knowledge Management, Vysoká škola manažmentu v Trenčíne, č. 1, str. 107–118, 2011.
Článok v kolekcii
- M. Nehéz – M. Tatarko – A. Maťašovský: Principles of Frequent Subgraph Mining in Networks: Methods, Related Topics and Applications. V Perspectives in Measurement, Modeling and Interpretation, Editor(i): Bernadič, Branislav, Vysoká škola manažmentu, Bratislava, Panónska cesta 17, Bratislava, str. 38–51, 2020.
Ústav informatizácie, automatizácie a matematiky vznikol 1.1.2006 spojením Katedry informatizácie a riadenia procesov a Katedry matematiky.
Najnovšie príspevky
- Priemyselná rada kybernetika STU3.12.2024 10:30
- Termíny skúšok ZS24/2526.11.2024 9:56
- Pracovná ponuka12.11.2024 16:25
Kontakt
Radlinského 9
812 37 Bratislava
Tel.: +421 259 325 366
Fax: +421 259 325 340
Mobil: +421 918 674 366
e-mail: office@uiam.sk
6. poschodie, Blok C NB
2024 © All Rights Reserved. UIAM FCHPT STU | webmaster@uiam.sk