- Position:
- Department:
- Department of Mathematics (DM)
- Room:
- NB 628
- eMail:
- Phone:
- +421 259 325 342
- Availability:
Citations
- Total citations 10
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.
- Number of citations 1
- Andrej Jursa – Mária Markošová: Analyzing and modelling functional brain networks. Univerzita Komenského v Bratislave, In Kognícia a umelý život 2019, ISBN 978-80-223-4720-4, pp. 48-53, 2019.
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.
- Number of citations 2
- Andrej Jursa – Mária Markošová: Clique number estimate in uncorrelated scale-free networks. In 18th Conference on Applied Mathematics, APLIMAT 2019, pp. 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, no. 4, vol. 12, pp. 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(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.
- Number of citations 4
- David Chalupa: An order-based algorithm for minimum dominating set with application in graph mining. Information Sciences, no. Supplement C, vol. 426, pp. 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, no. 12, vol. 7, 2019.
- Pethaperumal, D. – Peng, Y. – Qin, H.: Budget-Hub: A low cost IoT hub selection and neighbor assignment scheme. In IEEE World Forum on Internet of Things, WF-IoT 2018 - Proceedings, pp. 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, no. 1, vol. 1, pp. 1-20, 2019.
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.
- Number of citations 2
- Martin Čajági: Problém dominantnej množiny v reálnych sieťach. Zeithamlová Milena Ing. - Agentura Action M, In Kognice a umělý život XII, Vršovická 68, Praha, pp. 38-43, 2012.
- D. Bernát: Measurement Based Analysis of the Internet Topology. Amazon Distribution GmbH, Leipzig, In Proceedings of the 14th Conference on Information Technologies – Applications and Theory, pp. 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, vol. 1/2, pp. 301–312, 2008.
- Number of citations 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, no. 5, vol. 27, pp. 1064-1072, 2019.
