Rchr
J-GLOBAL ID：201501050962933575
Update date: Feb. 01, 2024
Shurbevski Aleksandar
シュルベフスキ アレクサンダル | Shurbevski Aleksandar
Affiliation and department：
Job title：
Assistant Professor
Homepage URL (1)：
http://www-or.amp.i.kyoto-u.ac.jp/~shurbevski
Research field (1)：
Mathematical informatics
Research theme for competitive and other funds (1)：
- 2017 - 2020 Design of Algorithms for Discrete Optimization Based on Graph-Theoretical Methods
Papers (57)：
-
Naveed Ahmed Azam, Jianshen Zhu, Umar Hayat, Aleksandar Shurbevski. Towards provably secure asymmetric image encryption schemes. Information Sciences. 2023. 631. 164-184
-
Fan Zhang, Jianshen Zhu, Rachaya Chiewvanichakorn, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu. A new approach to the design of acyclic chemical compounds using skeleton trees and integer linear programming. Applied Intelligence. 2022. 52. 15. 17058-17072
-
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi. On the enumeration of minimal non-pairwise compatibility graphs. Journal of Combinatorial Optimization. 2021. 44. 4. 2871-2892
-
Naveed Ahmed Azam, Jianshen Zhu, Yanming Sun, Yu Shi, Aleksandar Shurbevski, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu. A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming. Algorithms for Molecular Biology. 2021. 16. 1
-
Jianshen Zhu, Naveed Ahmed Azam, Fan Zhang, Aleksandar Shurbevski, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu. A Novel Method for Inferring Chemical Compounds with Prescribed Topological Substructures Based on Integer Programming. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 2021. 19. 6. 3233-3245
ｍore...
MISC (7)：
-
Kyousuke Yamashita, Ryuji Masui, Xiang Zhou, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu. Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications. 2020
-
Yuui Tamura, Yuhei Nishiyama, Chenxi Wang, Yanming Sun, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu. Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies. 2020
-
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi. Counting tree-like graphs with a given number of vertices and self-loops. 3rd International Workshop on Enumeration Problems and Applications (WEPA). 2019
-
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi. An improved method for enumerating pairwise compatibility graphs with a given number of vertices. Asian Association for Algorithms and Computation (AAAC). 2019
-
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi. Enumerating all pairwise compatibility graphs with a given number of vertices based on linear programming. 2nd International Workshop on Enumeration Problems and Applications (WEPA). 2018
ｍore...
Lectures and oral presentations (1)：
-
Efficient Algorithms for Tackling Computationally Challenging Problems
(Seminar on Informatics in Asia 2015 2015)
Professional career (2)：
- PhD in Informatics (Kyoto University)
- Master in Engineering (Kyoto Institute of Technology)
Return to Previous Page
