关于调查员
波泰布纳 阿尔乔姆 (POTEBNIA Artem) 是数学和计算机科学领域的研究员。他感兴趣的主要领域是图和超图论，复杂网络，算法，计算复杂性和人工智能系统。他的研究总结在12篇研究文章中。这些文章发表在同行评审的国际期刊和会议记录中。他们介绍了上述领域的新研究方法和理论概念。此外，这些文章还介绍了使用提出的概念和方法在现有系统上进行的实验研究。阿尔乔姆相信科学的包容性对于社会发展和技术进步至关重要。因此，他打开了这个网站，以便每个人都可以访问他的发现。
精选研究论文
Method for classification of the computational problems on the basis of the multifractal division of the complexity classes
出版于： 2016 3rd International Scientific-Practical Conference Problems of Infocommunications Science and TechnologyDOI号： 10.1109/INFOCOMMST.2016.7905318引文： 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.在发布者的网站上阅读本文在Scopus中查看此文章在Google学术搜索中查看此文章
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 MicroelectronicsDOI号： 10.1109/CADSM.2017.7916145引文： 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.在发布者的网站上阅读本文在Scopus中查看此文章在Google学术搜索中查看此文章
Formation of the multifractal hypergraph structure reflecting the self-similarity properties of the computational complexity classes
出版于： 2017 IEEE 1st Ukraine Conference on Electrical and Computer EngineeringDOI号： 10.1109/UKRCON.2017.8100392引文： 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.在发布者的网站上阅读本文在Scopus中查看此文章在Google学术搜索中查看此文章
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 ComputingDOI号： 10.1007/978-3-319-70581-1_28引文： 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.在发布者的网站上阅读本文在Scopus中查看此文章在Google学术搜索中查看此文章
Creation of the mathematical apparatus for establishing the duality relation between the vertex separators and cuts in hypergraphs
出版于： 12th International Scientific and Technical Conference on Computer Science and Information TechnologiesDOI号： 10.1109/STC-CSIT.2017.8098777引文： 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.在发布者的网站上阅读本文在Scopus中查看此文章在Google学术搜索中查看此文章
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 TechnologyDOI号： 10.1109/INFOCOMMST.2017.8246398引文： 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.在发布者的网站上阅读本文在Scopus中查看此文章在Google学术搜索中查看此文章
Algebra for transforming the structure of the search spaces associated with the combinatorial optimization problems
出版于： Journal of Theoretical and Applied Information TechnologyScopus EID: 2-s2.0-85027582982引文： 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.在发布者的网站上阅读本文在Scopus中查看此文章在Google学术搜索中查看此文章
Innovative metrics for assessing the catastrophic collapse of the complex networks under the greedy attacks on their most important vertices and edges
出版于： 14th International Conference on Advanced Trends in Radioelectronics, Telecommunications and Computer EngineeringDOI号： 10.1109/TCSET.2018.8336265引文： 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.在发布者的网站上阅读本文在Scopus中查看此文章在Google学术搜索中查看此文章
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 ApplicationsDOI号： 10.14569/IJACSA.2018.090906引文： 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.在发布者的网站上阅读本文在Scopus中查看此文章在Google学术搜索中查看此文章
Comprehensive method for discovering and assessing the rich-club organization in multihypergraphs
出版于： Journal of Theoretical and Applied Information TechnologyScopus EID: 2-s2.0-85058716496引文： 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.在发布者的网站上阅读本文在Scopus中查看此文章在Google学术搜索中查看此文章
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 TechnologiesDOI号： 10.1109/ICCCNT.2018.8493693引文： 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.在发布者的网站上阅读本文在Scopus中查看此文章在Google学术搜索中查看此文章
Устойчивость сложных систем к структурным атакам на основе формирования вершинных сечений, 用俄语写 [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”]引文： 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].在发布者的网站上阅读本文在Google学术搜索中查看此文章
以下页面还提供了阿尔乔姆的出版物清单：
| “亲爱的读者，非常感谢您对我的工作感兴趣！” 波泰布纳 阿尔乔姆 |
| ARTEM.PP.UA是波泰布纳阿尔乔姆的科学网站。该站点包含他在数学和计算机科学方面的学术著作。电子邮件： potebnia@mail.ua ©版權 2021 波泰布纳 阿尔乔姆 (POTEBNIA Artem) 版权所有 |
