Aleksandar Shurbevski

According to our database, Aleksandar Shurbevski authored at least 31 papers between 2011 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Towards provably secure asymmetric image encryption schemes.

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

Inf. Sci., 2023

2022

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 Trans. Comput. Biol. Bioinform., 2022

On the enumeration of minimal non-pairwise compatibility graphs.

Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi

J. Comb. Optim., 2022

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

Appl. Intell., 2022

2021

A method for enumerating pairwise compatibility graphs with a given number of vertices.

Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi

Discret. Appl. Math., 2021

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 Mol. Biol., 2021

2020

Group Strategy-proof Mechanisms for Shuttle Facility Games.

Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi

J. Inf. Process., 2020

Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank.

Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi

Entropy, 2020

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, 2020

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

CoRR, 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

CoRR, 2020

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, 2020

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

Proceedings of the Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices, 2020

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 ICBBB 2020: 10th International Conference on Bioscience, 2020

A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility.

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

Proceedings of the 13th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2020), 2020

2019

Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs.

Yuhei Nishiyama, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu

IEEE ACM Trans. Comput. Biol. Bioinform., 2019

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

Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, Hiroshi Nagamochi

J. Graph Algorithms Appl., 2019

Acute Constraints in Straight-Line Drawings of Planar Graphs.

Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades

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

λ-Group Strategy-Proof Mechanisms for the Obnoxious Facility Game in Star Networks.

Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi

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

2018

The Stable Roommates Problem with Unranked Entries.

Hiroaki Suto, Aleksandar Shurbevski, Hiroshi Nagamochi

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

Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem.

Mohd Shahrizan Othman, Aleksandar Shurbevski, Hiroshi Nagamochi

IEICE Trans. Inf. Syst., 2018

Enumerating Chemical Mono-Block 3-Augmented Trees with Two Junctions.

Yuui Tamura, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu

Proceedings of the 8th International Conference on Bioscience, 2018

2017

An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 Graphs.

Norhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi

J. Inf. Process., 2017

Routing of Carrier-vehicle Systems with Dedicated Last-stretch Delivery Vehicle and Fixed Carrier Route.

Mohd Shahrizan Othman, Aleksandar Shurbevski, Yoshiyuki Karuno, Hiroshi Nagamochi

J. Inf. Process., 2017

Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game.

Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi

J. Graph Algorithms Appl., 2017

2015

A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs.

Norhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2014

An Approximation Framework for Sequencing Problems with Bipartite Structure.

Aleksandar Shurbevski

PhD thesis, 2014

Approximating the Bipartite TSP and Its Biased Generalization.

Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno

Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

2013

Better Approximation Algorithms for Grasp-and-Delivery Robot Routing Problems.

Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno

IEICE Trans. Inf. Syst., 2013

Optimization Techniques for Robot Path Planning.

Aleksandar Shurbevski, Noriaki Hirosue, Hiroshi Nagamochi

Proceedings of the ICT Innovations 2013, 2013

2011

An Approximation Algorithm with Factor Two for a Repetitive Routing Problem of Grasp-and-Delivery Robots.

Yoshiyuki Karuno, Hiroshi Nagamochi, Aleksandar Shurbevski

J. Adv. Comput. Intell. Intell. Informatics, 2011