Aleksandar Shurbevski

Publication Activity (10 Years)

Years Active: 2011-2023
Publications (10 Years): 28

Top Topics

Chemical Compounds

Top Venues

IEICE Trans. Fundam. Electron. Commun. Comput. Sci.

J. Inf. Process.

Publications

Naveed Ahmed Azam, Jianshen Zhu, Umar Hayat, Aleksandar Shurbevski
Towards provably secure asymmetric image encryption schemes. Inf. Sci. 631 (2023)
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
On the enumeration of minimal non-pairwise compatibility graphs. J. Comb. Optim. 44 (4) (2022)
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. Appl. Intell. 52 (15) (2022)
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 Trans. Comput. Biol. Bioinform. 19 (6) (2022)
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 Mol. Biol. 16 (1) (2021)
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
A method for enumerating pairwise compatibility graphs with a given number of vertices. Discret. Appl. Math. 303 (2021)
Naveed Ahmed Azam, Rachaya Chiewvanichakorn, Fan Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility. BIOINFORMATICS (2020)
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. CoRR (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. CoRR (2020)
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
On the Enumeration of Minimal Non-pairwise Compatibility Graphs. COCOON (2020)
Rachaya Chiewvanichakorn, Chenxi Wang, Zhe Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
A Method for the Inverse QSAR/QSPR Based on Artificial Neural Networks and Mixed Integer Linear Programming. ICBBB (2020)
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank. Entropy 22 (11) (2020)
Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi
Group Strategy-proof Mechanisms for Shuttle Facility Games. J. Inf. Process. 28 (2020)
Fan Zhang, Jianshen Zhu, Rachaya Chiewvanichakorn, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
A New Integer Linear Programming Formulation to the Inverse QSAR/QSPR for Acyclic Chemical Compounds Using Skeleton Trees. IEA/AIE (2020)
Jianshen Zhu, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
A Novel Method for Inference of Chemical Compounds of Cycle Index Two with Desired Properties Based on Artificial Neural Networks and Integer Programming. Algorithms 13 (5) (2020)
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops. Entropy 22 (9) (2020)
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. CoRR (2020)
Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, Hiroshi Nagamochi
COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets. J. Graph Algorithms Appl. 23 (2) (2019)
Yuhei Nishiyama, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs. IEEE ACM Trans. Comput. Biol. Bioinform. 16 (1) (2019)
Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades
Acute Constraints in Straight-Line Drawings of Planar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2019)
Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi
λ-Group Strategy-Proof Mechanisms for the Obnoxious Facility Game in Star Networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2019)
Yuui Tamura, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
Enumerating Chemical Mono-Block 3-Augmented Trees with Two Junctions. ICBBB (2018)
Mohd Shahrizan Othman, Aleksandar Shurbevski, Hiroshi Nagamochi
Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem. IEICE Trans. Inf. Syst. (3) (2018)
Hiroaki Suto, Aleksandar Shurbevski, Hiroshi Nagamochi
The Stable Roommates Problem with Unranked Entries. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2018)
Norhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi
An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 Graphs. J. Inf. Process. 25 (2017)
Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game. J. Graph Algorithms Appl. 21 (3) (2017)
Mohd Shahrizan Othman, Aleksandar Shurbevski, Yoshiyuki Karuno, Hiroshi Nagamochi
Routing of Carrier-vehicle Systems with Dedicated Last-stretch Delivery Vehicle and Fixed Carrier Route. J. Inf. Process. 25 (2017)
Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game. WALCOM (2016)
Norhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi
A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs. JCDCGG (2015)
Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno
Approximating the Bipartite TSP and Its Biased Generalization. WALCOM (2014)
Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno
Better Approximation Algorithms for Grasp-and-Delivery Robot Routing Problems. IEICE Trans. Inf. Syst. (3) (2013)
Aleksandar Shurbevski, Noriaki Hirosue, Hiroshi Nagamochi
Optimization Techniques for Robot Path Planning. ICT Innovations (2013)
Yoshiyuki Karuno, Hiroshi Nagamochi, Aleksandar Shurbevski
An Approximation Algorithm with Factor Two for a Repetitive Routing Problem of Grasp-and-Delivery Robots. J. Adv. Comput. Intell. Intell. Informatics 15 (8) (2011)