Aleksandar Shurbevski

Profile Information

Affiliation: Assistant Professor, Graduate School of Informatics Department of Applied Mathematics and Physis, Kyoto University

Degree: PhD in Informatics(Kyoto University)
Master in Engineering(Kyoto Institute of Technology)

Researcher number: 70750230
J-GLOBAL ID: 201501050962933575
researchmap Member ID: B000245502

External link: http://www-or.amp.i.kyoto-u.ac.jp/~shurbevski

Research Areas

Informatics / Mathematical informatics /

Papers

Towards provably secure asymmetric image encryption schemes

Naveed Ahmed Azam, Jianshen Zhu, Umar Hayat, Aleksandar Shurbevski

Information Sciences, 631 164-184, Jun, 2023 Peer-reviewed
40

A new approach to the design of acyclic chemical compounds using skeleton trees and integer linear programming

Fan Zhang, Jianshen Zhu, Rachaya Chiewvanichakorn, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu

Applied Intelligence, 52(15) 17058-17072, Mar 25, 2022 Peer-reviewed
On the enumeration of minimal non-pairwise compatibility graphs

Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi

Journal of Combinatorial Optimization, 44(4) 2871-2892, Sep 1, 2021 Peer-reviewed
A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming

Naveed Ahmed Azam, Jianshen Zhu, Yanming Sun, Yu Shi, Aleksandar Shurbevski, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu

Algorithms for Molecular Biology, 16(1), Aug, 2021 Peer-reviewed
A Novel Method for Inferring Chemical Compounds with Prescribed Topological Substructures Based on Integer Programming

Jianshen Zhu, Naveed Ahmed Azam, Fan Zhang, Aleksandar Shurbevski, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu

IEEE/ACM Transactions on Computational Biology and Bioinformatics, 19(6) 3233-3245, 2021 Peer-reviewed
Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank

Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi

Entropy, 22(11) 1295-1295, Nov 13, 2020 Peer-reviewed
Group Strategy-proof Mechanisms for Shuttle Facility Games

Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi

Journal of Information Processing, 28 976-986, Sep, 2020 Peer-reviewedCorresponding author
A New Integer Linear Programming Formulation to the Inverse QSAR/QSPR for Acyclic Chemical Compounds Using Skeleton Trees

Fan Zhang, Jianshen Zhu, Rachaya Chiewvanichakorn, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu

Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices, 12144 433-444, Sep, 2020 Peer-reviewed
An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops

Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi

Entropy, 22(9) 923-923, Aug 22, 2020 Peer-reviewed
On the Enumeration of Minimal Non-pairwise Compatibility Graphs

Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi

Lecture Notes in Computer Science, 12273 372-383, Aug, 2020 Peer-reviewed
A method for enumerating pairwise compatibility graphs with a given number of vertices

Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi

Discrete Applied Mathematics, Aug, 2020 Peer-reviewed
A Method for the Inverse QSAR/QSPR Based on Artificial Neural Networks and Mixed Integer Linear Programming

Rachaya Chiewvanichakorn, Chenxi Wang, Zhe Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu

Proceedings of the 2020 10th International Conference on Bioscience, Biochemistry and Bioinformatics, 40-46, Jan 19, 2020 Peer-reviewed
A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility

Naveed Azam, Rachaya Chiewvanichakorn, Fan Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu

Proceedings of the 13th International Joint Conference on Biomedical Engineering Systems and Technologies, 101-108, 2020 Peer-reviewed
A Novel Method for Inference of Chemical Compounds of Cycle Index Two with Desired Properties Based on Artificial Neural Networks and Integer Programming.

Jianshen Zhu, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu

Algorithms, 13(5) 124-124, 2020 Peer-reviewed
λ-Group Strategy-Proof Mechanisms for the Obnoxious Facility Game in Star Networks

Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E102-A(9) 1179-1186, Sep, 2019 Peer-reviewed
Acute Constraints in Straight-Line Drawings of Planar Graphs

Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E102-A(9) 994-1001, Sep, 2019 Peer-reviewed
An iterative ILP-based algorithm for the prize-collecting TSP

Tsuyoshi Saito, Aleksandar Shurbevski

Proceedings of International Symposium on Scheduling 2019, 232-237, Jul, 2019 Peer-reviewed
116

COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets

Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, Hiroshi Nagamochi

Journal of Graph Algorithms and Applications, 23(2) 434-458, Jul, 2019 Peer-reviewed
Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-like Chemical Graphs

Yuhei Nishiyama, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu

IEEE/ACM Transactions on Computational Biology and Bioinformatics, 16(1) 77-90, Jan, 2019 Peer-reviewed
A Truck Scheduling Problem with Boomerang Drone Delivery

Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi

Proceedings of the Scheduling Symposium 2018, 113-118, Sep, 2018

Misc.

Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications

Kyousuke Yamashita, Ryuji Masui, Xiang Zhou, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu

Apr 18, 2020
Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies

Yuui Tamura, Yuhei Nishiyama, Chenxi Wang, Yanming Sun, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu

Apr 14, 2020
Counting tree-like graphs with a given number of vertices and self-loops

Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi

3rd International Workshop on Enumeration Problems and Applications (WEPA), Oct, 2019 Peer-reviewed
An improved method for enumerating pairwise compatibility graphs with a given number of vertices

Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi

Asian Association for Algorithms and Computation (AAAC), 2019 Peer-reviewed
Enumerating all pairwise compatibility graphs with a given number of vertices based on linear programming

Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi

2nd International Workshop on Enumeration Problems and Applications (WEPA), Nov, 2018 Peer-reviewed
A dynamic programming based algorithm for enumerating unlabeled unrooted trees

117(176) 33-40, Aug 18, 2017
Parameterization of strategy-proof mechanisms in the obnoxious facility game

Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9627 286-297, 2016

Presentations

Efficient Algorithms for Tackling Computationally Challenging Problems

Aleksandar Shurbevski

Seminar on Informatics in Asia 2015, Sep 15, 2015 Invited

Teaching Experience

Research Projects

Design of Algorithms for Discrete Optimization Based on Graph-Theoretical Methods

Grants-in-Aid for Scientific Research, Grant-in-Aid for Scientific Research (C), Japan Society for the Promotion of Science, Apr, 2017 - Mar, 2020

NAGAMOCHI Hiroshi

Profile Information

Research Areas

Papers

Misc.

Presentations

Teaching Experience

Research Projects

Menu

Coauthors