- Pracovné zaradenie:
- Oddelenie:
- Oddelenie matematiky (OM)
- Miestnosť:
- NB 628
- eMail:
- Telefón:
- +421 259 325 342
- Vedecká činnosť:
- Dostupnosť:
Citácie
- Celkový počet citácií 10
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.
- Počet citácií 1
- Andrej Jursa – Mária Markošová: Analyzing and modelling functional brain networks. Univerzita Komenského v Bratislave, V Kognícia a umelý život 2019, ISBN 978-80-223-4720-4, str. 48-53, 2019.
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.
- Počet citácií 2
- Andrej Jursa – Mária Markošová: Clique number estimate in uncorrelated scale-free networks. V 18th Conference on Applied Mathematics, APLIMAT 2019, str. 601-608, 2019.
- Doležalová, J. – Burian, J. – Popelka, S.: SimUrb – software for identifying similar municipalities by comparing Urban indices using a graph algorithm. Earth Science Informatics, č. 4, zv. 12, str. 699-714, 2019.
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.
- Počet citácií 4
- David Chalupa: An order-based algorithm for minimum dominating set with application in graph mining. Information Sciences, č. Supplement C, zv. 426, str. 101 - 116, 2018.
- Li, R. – Hu, S. – Liu, H. – Li, R. – Ouyang, D. – Yin, M.: Multi-start local search algorithm for the minimum connected dominating set problems. Mathematics, č. 12, zv. 7, 2019.
- Pethaperumal, D. – Peng, Y. – Qin, H.: Budget-Hub: A low cost IoT hub selection and neighbor assignment scheme. V IEEE World Forum on Internet of Things, WF-IoT 2018 - Proceedings, str. 700-705, 2018.
- Adel A. Alofairi – Rashad Ismail – Ibrahim E. Elsemman – Eamad Mabrouk: COMPARATIVE ANALYSIS OF INTEGER LINEAR PROGRAMMING AND META-HEURISTIC METHODS FOR MINIMUM DOMINATING SET PROBLEM. Assiut University Journal of Mathematics and Computer Science, č. 1, zv. 1, str. 1-20, 2019.
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.
- Počet citácií 2
- Martin Čajági: Problém dominantnej množiny v reálnych sieťach. Zeithamlová Milena Ing. - Agentura Action M, V Kognice a umělý život XII, Vršovická 68, Praha, str. 38-43, 2012.
- D. Bernát: Measurement Based Analysis of the Internet Topology. Amazon Distribution GmbH, Leipzig, V Proceedings of the 14th Conference on Information Technologies – Applications and Theory, str. 115-119, 2014.
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.
- Počet citácií 1
- Singh, Tuhina – Afreen, Simra – Chakraborty, Pinaki – Raj, Rashmi – Yadav, Savita – Jain, Dipika: Automata Simulator: A mobile app to teach theory of computation. Computer Applications in Engineering Education, č. 5, zv. 27, str. 1064-1072, 2019.
