Artem Potebnia

Independent   Investigator

Official website

E-mail address for correspondence:

potebnia@mail.ua




About the Scholar
Artem Potebnia is a computer scientist with a primary focus on pursuing the frontiers of knowledge in the theory of graphs, hypergraphs, complex networks, algorithms, computational complexity, and artificial intelligence systems. His study is reflected in 12 single-authored original research articles published in the peer-reviewed international journals and conference proceedings. The contribution of these articles lies in introducing a set of new research methodologies and theoretical concepts in the above-mentioned fields along with presenting the experimental results of studying the existing systems obtained with their application. Artem has ensured the communication of his results to community by giving talks at numerous international conference venues taking place in different countries. He highly values the inclusiveness of science as a key for increasing the curiosity of society and advancing the development of technologies serving for the needs of humanity and nature. Hence, Artem has set up this academic website aimed at providing everyone in the world with the ability to easily track his research achievements.
Selected Research Articles
Method for classification of the computational problems on the basis of the multifractal division of the complexity classes
Published in: 2016 3rd International Scientific-Practical Conference Problems of Infocommunications Science and Technology

DOI: 10.1109/​INFOCOMMST.2016.​7905318

Reference: A. Potebnia, “Method for classification of the computational problems on the basis of the multifractal division of the complexity classes,” 2016 Third International Scientific-Practical Conference Problems of Infocommunications Science and Technology (PIC S&T), Kharkiv, 2016, pp. 1 – 4.

Read article at the publisher's website

View article in Scopus

View article in Google Scholar

Representation of the greedy algorithms applicability for solving the combinatorial optimization problems based on the hypergraph mathematical structure
Published in: 2017 14th International Conference the Experience of Designing and Application of CAD Systems in Microelectronics

DOI: 10.1109/​CADSM.2017.​7916145

Reference: A. Potebnia, “Representation of the greedy algorithms applicability for solving the combinatorial optimization problems based on the hypergraph mathematical structure,” 2017 14th International Conference the Experience of Designing and Application of CAD Systems in Microelectronics (CADSM), Lviv, 2017, pp. 328 – 332.

Read article at the publisher's website

View article in Scopus

View article in Google Scholar

Formation of the multifractal hypergraph structure reflecting the self-similarity properties of the computational complexity classes
Published in: 2017 IEEE 1st Ukraine Conference on Electrical and Computer Engineering

DOI: 10.1109/​UKRCON.2017.​8100392

Reference: A. Potebnia, “Formation of the multifractal hypergraph structure reflecting the self-similarity properties of the computational complexity classes,” 2017 IEEE First Ukraine Conference on Electrical and Computer Engineering (UKRCON), Kiev, 2017, pp. 953 – 958.

Read article at the publisher's website

View article in Scopus

View article in Google Scholar

Innovative concept of the strict line hypergraph as the basis for specifying the duality relation between the vertex separators and cuts
Published in: Advances in Intelligent Systems and Computing

DOI: 10.1007/​978-3-319-​70581-1_28

Reference: A. Potebnia, “Innovative concept of the strict line hypergraph as the basis for specifying the duality relation between the vertex separators and cuts,” Advances in Intelligent Systems and Computing II. CSIT 2017. Advances in Intelligent Systems and Computing, vol. 689, pp. 386 – 403, 2018.

Read article at the publisher's website

View article in Scopus

View article in Google Scholar

Creation of the mathematical apparatus for establishing the duality relation between the vertex separators and cuts in hypergraphs
Published in: 12th International Scientific and Technical Conference on Computer Science and Information Technologies

DOI: 10.1109/​STC-CSIT.2017.​8098777

Reference: A. Potebnia, “Creation of the mathematical apparatus for establishing the duality relation between the vertex separators and cuts in hypergraphs,” 2017 12th International Scientific and Technical Conference on Computer Sciences and Information Technologies (CSIT), Lviv, 2017, pp. 236 – 239.

Read article at the publisher's website

View article in Scopus

View article in Google Scholar

Construction of the comprehensive multi-layer graph model of the search spaces associated with the combinatorial optimization problems
Published in: 2017 4th International Scientific-Practical Conference Problems of Infocommunications Science and Technology

DOI: 10.1109/​INFOCOMMST.2017.​8246398

Reference: A. Potebnia, “Construction of the comprehensive multi-layer graph model of the search spaces associated with the combinatorial optimization problems,” 2017 4th International Scientific-Practical Conference Problems of Infocommunications. Science and Technology (PIC S&T), Kharkiv, 2017, pp. 281 – 286.

Read article at the publisher's website

View article in Scopus

View article in Google Scholar

Algebra for transforming the structure of the search spaces associated with the combinatorial optimization problems
Published in: Journal of Theoretical and Applied Information Technology

Scopus EID: 2-s2.0-​85027582982

Reference: A. Potebnia, “Algebra for transforming the structure of the search spaces associated with the combinatorial optimization problems,” Journal of Theoretical and Applied Information Technology, vol. 95, no. 15, pp. 3644 – 3651, 2017.

Read article at the publisher's website

View article in Scopus

View article in Google Scholar

Innovative metrics for assessing the catastrophic collapse of the complex networks under the greedy attacks on their most important vertices and edges
Published in: 14th International Conference on Advanced Trends in Radioelectronics, Telecommunications and Computer Engineering

DOI: 10.1109/​TCSET.2018.​8336265

Reference: A. Potebnia, “Innovative metrics for assessing the catastrophic collapse of the complex networks under the greedy attacks on their most important vertices and edges,” 2018 14th International Conference on Advanced Trends in Radioelecrtronics, Telecommunications and Computer Engineering (TCSET), Slavske, 2018, pp. 564 – 569.

Read article at the publisher's website

View article in Scopus

View article in Google Scholar

Method of graph mining based on the topological anomaly matrix and its application for discovering the structural peculiarities of complex networks
Published in: International Journal of Advanced Computer Science and Applications

DOI: 10.14569/​IJACSA.2018.​090906

Reference: A. Potebnia, “Method of graph mining based on the topological anomaly matrix and its application for discovering the structural peculiarities of complex networks,” International Journal of Advanced Computer Science and Applications, vol. 9, no. 9, pp. 42 – 48, 2018.

Read article at the publisher's website

View article in Scopus

View article in Google Scholar

Comprehensive method for discovering and assessing the rich-club organization in multihypergraphs
Published in: Journal of Theoretical and Applied Information Technology

Scopus EID: 2-s2.0-​85058716496

Reference: A. Potebnia, “Comprehensive method for discovering and assessing the rich-club organization in multihypergraphs,” Journal of Theoretical and Applied Information Technology, vol. 96, no. 23, pp. 8045 – 8070, 2018.

Read article at the publisher's website

View article in Scopus

View article in Google Scholar

New method for estimating the tree-likeness of graphs and its application for tracing the robustness of complex networks
Published in: 2018 9th International Conference on Computing, Communication and Networking Technologies

DOI: 10.1109/​ICCCNT.2018.​8493693

Reference: A. Potebnia, “New method for estimating the tree-likeness of graphs and its application for tracing the robustness of complex networks,” 2018 9th International Conference on Computing, Communication and Networking Technologies (ICCCNT), Bangalore, 2018, pp. 1 – 7.

Read article at the publisher's website

View article in Scopus

View article in Google Scholar

Устойчивость сложных систем к структурным атакам на основе формирования вершинных сечений [Resistance of complex systems to structural attacks based on the formation of vertex cuts, in Russian]
Published in: Материалы международной научной конференции “Информационные технологии и системы 2016” [Proceedings of the International Conference “Information Technologies and Systems 2016”]

Reference: A. Potebnia, “Устойчивость сложных систем к структурным атакам на основе формирования вершинных сечений [Resistance of complex systems to structural attacks based on the formation of vertex cuts],” Материалы международной научной конференции “Информационные технологии и системы 2016” [Proceedings of the International Conference “Information Technologies and Systems 2016”], Minsk, BSUIR, 2016, pp. 128 – 129 [in Russian].

Read article at the publisher's website

View article in Google Scholar

The works of Artem Potebnia are also discoverable through his author pages listed below:

«Respected Reader, please accept the deepest gratitude for having interest in my scientific findings!»

Artem Potebnia

ARTEM.PP.UA is an official website of Artem Potebnia intended for presenting his scholarly works in the fields of computer science and mathematics to the worldwide audience and supporting the open access to knowledge.

E-mail:   potebnia@mail.ua

Copyright © 2020 Artem Potebnia.

All rights reserved.



DMCA.com Protection Status
Copyrighted.com Registered & Protected