default search action
Aleksandar Shurbevski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j21]Naveed Ahmed Azam, Jianshen Zhu
, Umar Hayat, Aleksandar Shurbevski
Towards provably secure asymmetric image encryption schemes. Inf. Sci. 631: 164-184 (2023) - 2022
- [j20]Fan Zhang, Jianshen Zhu
A new approach to the design of acyclic chemical compounds using skeleton trees and integer linear programming. Appl. Intell. 52(15): 17058-17072 (2022) - [j19]Naveed Ahmed Azam
On the enumeration of minimal non-pairwise compatibility graphs. J. Comb. Optim. 44(4): 2871-2892 (2022) - [j18]Jianshen Zhu
A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming. IEEE ACM Trans. Comput. Biol. Bioinform. 19(6): 3233-3245 (2022) - 2021
- [j17]Naveed Ahmed Azam, Jianshen Zhu
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): 18 (2021) - [j16]Naveed Ahmed Azam
A method for enumerating pairwise compatibility graphs with a given number of vertices. Discret. Appl. Math. 303: 171-185 (2021) - 2020
- [j15]Jianshen Zhu
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): 124 (2020) - [j14]Naveed Ahmed Azam
An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops. Entropy 22(9): 923 (2020) - [j13]Naveed Ahmed Azam
Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank. Entropy 22(11): 1295 (2020) - [j12]Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi:
Group Strategy-proof Mechanisms for Shuttle Facility Games. J. Inf. Process. 28: 976-986 (2020) - [c9]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: 101-108 - [c8]Naveed Ahmed Azam
On the Enumeration of Minimal Non-pairwise Compatibility Graphs. COCOON 2020: 372-383 - [c7]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: 40-46 - [c6]Fan Zhang, Jianshen Zhu
A New Integer Linear Programming Formulation to the Inverse QSAR/QSPR for Acyclic Chemical Compounds Using Skeleton Trees. IEA/AIE 2020: 433-444 - [i3]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 abs/2004.06367 (2020) - [i2]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 abs/2004.08381 (2020) - [i1]Naveed Ahmed Azam, Jianshen Zhu, Yanming Sun, Yu Shi, Aleksandar Shurbevski, Liang Zhao
A Novel Method for Inference of Acyclic Chemical Compounds with Bounded Branch-height Based on Artificial Neural Networks and Integer Programming. CoRR abs/2009.09646 (2020)
2010 – 2019
- 2019
- [j11]Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades:
Acute Constraints in Straight-Line Drawings of Planar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 994-1001 (2019) - [j10]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. 102-A(9): 1179-1186 (2019) - [j9]Kazuya Haraguchi
COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets. J. Graph Algorithms Appl. 23(2): 434-458 (2019) - [j8]Yuhei Nishiyama, Aleksandar Shurbevski
Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs. IEEE ACM Trans. Comput. Biol. Bioinform. 16(1): 77-90 (2019) - 2018
- [j7]Mohd Shahrizan Othman, Aleksandar Shurbevski
Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem. IEICE Trans. Inf. Syst. 101-D(3): 611-612 (2018) - [j6]Hiroaki Suto, Aleksandar Shurbevski, Hiroshi Nagamochi:
The Stable Roommates Problem with Unranked Entries. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1412-1419 (2018) - [c5]Yuui Tamura, Aleksandar Shurbevski
Enumerating Chemical Mono-Block 3-Augmented Trees with Two Junctions. ICBBB 2018: 48-55 - 2017
- [j5]Morito Oomine, Aleksandar Shurbevski
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game. J. Graph Algorithms Appl. 21(3): 247-263 (2017) - [j4]Norhazwani Md Yunos, Aleksandar Shurbevski
An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 Graphs. J. Inf. Process. 25: 639-654 (2017) - [j3]Mohd Shahrizan Othman, Aleksandar Shurbevski
Routing of Carrier-vehicle Systems with Dedicated Last-stretch Delivery Vehicle and Fixed Carrier Route. J. Inf. Process. 25: 655-666 (2017) - 2016
- [c4]Morito Oomine, Aleksandar Shurbevski
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game. WALCOM 2016: 286-297 - 2015
- [c3]Norhazwani Md Yunos, Aleksandar Shurbevski
A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs. JCDCGG 2015: 228-240 - 2014
- [b1]Aleksandar Shurbevski:
An Approximation Framework for Sequencing Problems with Bipartite Structure. Kyoto University, Japan, 2014 - [c2]Aleksandar Shurbevski
Approximating the Bipartite TSP and Its Biased Generalization. WALCOM 2014: 56-67 - 2013
- [j2]Aleksandar Shurbevski
Better Approximation Algorithms for Grasp-and-Delivery Robot Routing Problems. IEICE Trans. Inf. Syst. 96-D(3): 450-456 (2013) - [c1]Aleksandar Shurbevski
Optimization Techniques for Robot Path Planning. ICT Innovations 2013: 111-120 - 2011
- [j1]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): 1103-1108 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: