研究者
J-GLOBAL ID：201501050962933575   更新日: 2024年02月01日

シュルベフスキ アレクサンダル

シュルベフスキ アレクサンダル | Shurbevski Aleksandar
所属機関・部署：
京都大学 大学院情報学研究科数理工学専攻

京都大学 大学院情報学研究科数理工学専攻 について


職名： 助教
ホームページURL (1件)： http://www-or.amp.i.kyoto-u.ac.jp/~shurbevski
研究分野 (1件)： 数理情報学
競争的資金等の研究課題 (1件)：
  • 2017 - 2020 グラフ理論的手法に基づく離散最適化アルゴリズムの設計
論文 (57件)：
  • Naveed Ahmed Azam, Jianshen Zhu, Umar Hayat, Aleksandar Shurbevski. Towards provably secure asymmetric image encryption schemes. 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. 2021. 19. 6. 3233-3245
もっと見る
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
もっと見る
講演・口頭発表等 (1件)：
  • Efficient Algorithms for Tackling Computationally Challenging Problems
    (2015)
学位 (2件)：
  • PhD in Informatics (Kyoto University)
  • Master in Engineering (Kyoto Institute of Technology)
※　J-GLOBALの研究者情報は、researchmapの登録情報に基づき表示しています。 登録・更新については、こちらをご覧ください。

前のページに戻る

TOP

BOTTOM