Aleksandar Shurbevski

34 papers B 2C 1Misc 1Journal 24Unranked 5
YearRankTypeTitle / Venue / Authors
2023 J jnl
Towards provably secure asymmetric image encryption schemes.
Inf. Sci.
Naveed Ahmed Azam, Jianshen Zhu, Umar Hayat, Aleksandar Shurbevski
2022 J jnl
A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming.
IEEE ACM Trans. Comput. Biol. Bioinform.
Jianshen Zhu, Naveed Ahmed Azam, Fan Zhang, Aleksandar Shurbevski, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2022 J jnl
A new approach to the design of acyclic chemical compounds using skeleton trees and integer linear programming.
Appl. Intell.
Fan Zhang, Jianshen Zhu, Rachaya Chiewvanichakorn, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
2022 J jnl
On the enumeration of minimal non-pairwise compatibility graphs.
J. Comb. Optim.
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
2021 J jnl
A method for enumerating pairwise compatibility graphs with a given number of vertices.
Discret. Appl. Math.
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
2021 J jnl
A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming.
Algorithms Mol. Biol.
Naveed Ahmed Azam, Jianshen Zhu, Yanming Sun, Yu Shi, Aleksandar Shurbevski, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2020 — conf
A Method for the Inverse QSAR/QSPR Based on Artificial Neural Networks and Mixed Integer Linear Programming.
ICBBB
Rachaya Chiewvanichakorn, Chenxi Wang, Zhe Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
2020 C conf
A New Integer Linear Programming Formulation to the Inverse QSAR/QSPR for Acyclic Chemical Compounds Using Skeleton Trees.
IEA/AIE
Fan Zhang, Jianshen Zhu, Rachaya Chiewvanichakorn, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
2020 J jnl
A Novel Method for Inference of Acyclic Chemical Compounds with Bounded Branch-height Based on Artificial Neural Networks and Integer Programming.
CoRR
Naveed Ahmed Azam, Jianshen Zhu, Yanming Sun, Yu Shi, Aleksandar Shurbevski, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2020 J jnl
A Novel Method for Inference of Chemical Compounds of Cycle Index Two with Desired Properties Based on Artificial Neural Networks and Integer Programming.
Algorithms
Jianshen Zhu, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
2020 — conf
A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility.
BIOINFORMATICS
Naveed Ahmed Azam, Rachaya Chiewvanichakorn, Fan Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
2020 J jnl
An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops.
Entropy
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
2020 J jnl
Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies.
CoRR
Yuui Tamura, Yuhei Nishiyama, Chenxi Wang, Yanming Sun, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
2020 J jnl
Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications.
CoRR
Kyousuke Yamashita, Ryuji Masui, Xiang Zhou, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
2020 J jnl
Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank.
Entropy
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
2020 J jnl
Group Strategy-proof Mechanisms for Shuttle Facility Games.
J. Inf. Process.
Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi
2020 Misc conf
On the Enumeration of Minimal Non-pairwise Compatibility Graphs.
COCOON
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
2019 J jnl
Acute Constraints in Straight-Line Drawings of Planar Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades
2019 J jnl
COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets.
J. Graph Algorithms Appl.
Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, Hiroshi Nagamochi
2019 J jnl
Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs.
IEEE ACM Trans. Comput. Biol. Bioinform.
Yuhei Nishiyama, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
2019 J jnl
λ-Group Strategy-Proof Mechanisms for the Obnoxious Facility Game in Star Networks.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi
2018 — conf
Enumerating Chemical Mono-Block 3-Augmented Trees with Two Junctions.
ICBBB
Yuui Tamura, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
2018 J jnl
Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem.
IEICE Trans. Inf. Syst.
Mohd Shahrizan Othman, Aleksandar Shurbevski, Hiroshi Nagamochi
2018 J jnl
The Stable Roommates Problem with Unranked Entries.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Hiroaki Suto, Aleksandar Shurbevski, Hiroshi Nagamochi
2017 J jnl
An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 Graphs.
J. Inf. Process.
Norhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi
2017 J jnl
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game.
J. Graph Algorithms Appl.
Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi
2017 J jnl
Routing of Carrier-vehicle Systems with Dedicated Last-stretch Delivery Vehicle and Fixed Carrier Route.
J. Inf. Process.
Mohd Shahrizan Othman, Aleksandar Shurbevski, Yoshiyuki Karuno, Hiroshi Nagamochi
2016 B conf
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game.
WALCOM
Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi
2015 — conf
A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs.
JCDCGG
Norhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi
2014 — —
An Approximation Framework for Sequencing Problems with Bipartite Structure.
Aleksandar Shurbevski
2014 B conf
Approximating the Bipartite TSP and Its Biased Generalization.
WALCOM
Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno
2013 J jnl
Better Approximation Algorithms for Grasp-and-Delivery Robot Routing Problems.
IEICE Trans. Inf. Syst.
Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno
2013 — conf
Optimization Techniques for Robot Path Planning.
ICT Innovations
Aleksandar Shurbevski, Noriaki Hirosue, Hiroshi Nagamochi
2011 J jnl
An Approximation Algorithm with Factor Two for a Repetitive Routing Problem of Grasp-and-Delivery Robots.
J. Adv. Comput. Intell. Intell. Informatics
Yoshiyuki Karuno, Hiroshi Nagamochi, Aleksandar Shurbevski