Shurbevski Aleksandar ＳｈｕｒｂｅｖｓｋｉＡ

… Alternative Names

Shurbevski A シュルベフスキア

Less

Researcher Number	70750230
Other IDs
Affiliation (Current)	2025: 京都大学, 情報学研究科, 助教
Affiliation (based on the past Project Information) *help	2017 – 2022: 京都大学, 情報学研究科, 助教
Review Section/Research Field	Except Principal Investigator Basic Section 60020:Mathematical informatics-related / Theory of informatics
Keywords	Except Principal Investigator 計算量 / グラフ理論 / 離散最適化 / アルゴリズム / グラフ・ネットワーク / ケモインフォマティックス / 動的計画法 / 整数計画法 / 最適化 / 数理計画 … More / 高速コンピューティング / 情報工学 / ゲーム理論 / 経路探索 / 近似アルゴリズム / ネットワーク / 機械学習 / 人工ニューラルネットワーク / グラフ描画 / NP-困難 / データマイニング / グラフ Less

Theory design and implementation of practical optimization and enumeration algorithms over graph structure
- Principal Investigator
  
  NAGAMOCHI Hiroshi
- Project Period (FY)
  2020 – 2022
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60020:Mathematical informatics-related
- Research Institution
  Kyoto University
Design of Algorithms for Discrete Optimization Based on Graph-Theoretical Methods
- Principal Investigator
  
  NAGAMOCHI Hiroshi
- Project Period (FY)
  2017 – 2019
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Theory of informatics
- Research Institution
  Kyoto University

All 2022 2021 2020 2019 2018 2017

All Journal Article Presentation

[Journal Article] On the enumeration of minimal non-pairwise compatibility graphs2022
- Author(s)
  Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
- Journal Title
  
  Journal of Combinatorial Optimization
  
  Volume: 44 Issue: 4 Pages: 2871-2892
- DOI
  10.1007/s10878-021-00799-x
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20K11691
[Journal Article] A New Approach to the Design of Acyclic Chemical Compounds Using Skeleton Trees and Integer Linear Programming2022
- Author(s)
  F. Zhang, J. Zhu, R. Chiewvanichakorn, A. Shurbevski, H. Nagamochi, T. Akutsu
- Journal Title
  
  Applied Intelligence
  
  Volume: - Issue: 15 Pages: 17058-17072
- DOI
  10.1007/s10489-021-03088-6
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-20K11691
[Journal Article] A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming2021
- Author(s)
  Azam Naveed Ahmed、Zhu Jianshen、Sun Yanming、Shi Yu、Shurbevski Aleksandar、Zhao Liang、Nagamochi Hiroshi、Akutsu Tatsuya
- Journal Title
  
  Algorithms for Molecular Biology
  
  Volume: 16 Issue: 1 Pages: 18-18
- DOI
  10.1186/s13015-021-00197-2
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-18H04113, KAKENHI-PROJECT-20K11691
[Journal Article] A Method for Enumerating Pairwise Compatibility Graphs with a Given Number of Vertices2021
- Author(s)
  N. A. Azam, Aleksandar Shurbevski, H. Nagamochi
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume: 303 Pages: 171-185
- DOI
  10.1016/j.dam.2020.08.016
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20K11691
[Journal Article] A Novel Method for Inferring Chemical Compounds with Prescribed Topological Substructures Based on Integer Programming2021
- Author(s)
  J. Zhu, N. A. Azam, F. Zhang, A. Shurbevski, K. Haraguchi, L. Zhao, H. Nagamochi, T. Akutsu
- Journal Title
  
  Transaction on Computational Biology and Bioinformatics
  
  Volume: - Issue: 6 Pages: 3233-3245
- DOI
  10.1109/tcbb.2021.3112598
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-20K11691
[Journal Article] Enumerating tree-like graphs and polymer topologies with a given cycle rank2020
- Author(s)
  Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
- Journal Title
  
  Entropy
  
  Volume: 22 Issue: 11 Pages: 1295-1295
- DOI
  10.3390/e22111295
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-20K11691, KAKENHI-PROJECT-18J23484
[Journal Article] A novel method for inference of chemical compounds of cycle index two with desired properties based on artificial neural networks and integer programming2020
- Author(s)
  Jianshen Zhu, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi,Tatsuya Akutsu
- Journal Title
  
  Algorithms
  
  Volume: 13 Issue: 5 Pages: 124-124
- DOI
  10.3390/a13050124
- NAID
  120006993972
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-20K11691, KAKENHI-PROJECT-18H04113
[Journal Article] Group Strategy-proof Mechanisms for Shuttle Facility Games2020
- Author(s)
  Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi
- Journal Title
  
  Journal of Information Processing
  
  Volume: 28 Issue: 0 Pages: 976-986
- DOI
  10.2197/ipsjjip.28.976
- NAID
  130007956357
- ISSN
  1882-6652
- Language
  English
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-20K11691
[Journal Article] An efficient algorithm to count tree-like graphs with a given number of vertices and self-loops2020
- Author(s)
  Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
- Journal Title
  
  Entropy
  
  Volume: 22 Issue: 9 Pages: 923-923
- DOI
  10.3390/e22090923
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-20K11691, KAKENHI-PROJECT-18J23484
[Journal Article] Acute Constraints in Straight-Line Drawings of Planar Graphs2019
- Author(s)
  Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades
- Journal Title
  
  IEICE Trans. Fundamentals
  
  Volume: E102.A Issue: 9 Pages: 994-1001
- DOI
  10.1587/transfun.E102.A.994
- NAID
  130007699537
- ISSN
  0916-8508, 1745-1337
- Year and Date
  2019-09-01
- Language
  English
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-17K00014
[Journal Article] COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets2019
- Author(s)
  Haraguchi Kazuya、Momoi Yusuke、Shurbevski Aleksandar、Nagamochi Hiroshi
- Journal Title
  
  Journal of Graph Algorithms and Applications
  
  Volume: 23 Issue: 2 Pages: 434-458
- DOI
  10.7155/jgaa.00497
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-17K00014
[Journal Article] Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs2019
- Author(s)
  Yuhei Nishiyama, Aleksandar Shurbevski , Hiroshi Nagamochi, Tatsuya Akutsu
- Journal Title
  
  IEEE/ACM Transactions on Computational Biology and Bioinformatics
  
  Volume: 16 Issue: 1 Pages: 77-90
- DOI
  10.1109/tcbb.2018.2832061
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18H04113, KAKENHI-PROJECT-17K00014
[Journal Article] λ-Group Strategy-Proof Mechanisms for the Obnoxious Facility Game in Star Networks2019
- Author(s)
  Yuhei Fuki, Aleksandar Shurbevski, Hiroshi Nagamochi
- Journal Title
  
  IEICE Trans. Fundamentals
  
  Volume: E102.A Issue: 9 Pages: 1179-1186
- DOI
  10.1587/transfun.E102.A.1179
- NAID
  130007699484
- ISSN
  0916-8508, 1745-1337
- Year and Date
  2019-09-01
- Language
  English
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-17K00014
[Journal Article] The Stable Roommates Problem with Unranked Entries2018
- Author(s)
  H. Suto, A. Shurbevski, H. Nagamochi
- Journal Title
  
  IEICE Trans. Fundamentals
  
  Volume: E101.A Issue: 9 Pages: 1412-1419
- DOI
  10.1587/transfun.E101.A.1412
- NAID
  130007479450
- ISSN
  0916-8508, 1745-1337
- Year and Date
  2018-09-01
- Language
  English
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-17K00014
[Journal Article] Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem2018
- Author(s)
  M. S. Othman, A. Shurbevski, H. Nagamochi
- Journal Title
  
  IEICE Trans. Inf. & Syst.
  
  Volume: E101.D Issue: 3 Pages: 611-612
- DOI
  10.1587/transinf.2017FCL0003
- NAID
  130006414060
- ISSN
  0916-8532, 1745-1361
- Language
  English
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-17K00014
[Journal Article] Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game2017
- Author(s)
  Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi
- Journal Title
  
  Journal of Graph Algorithms and Applications
  
  Volume: 21(3) Pages: 247-263
- DOI
  10.1007/978-3-319-30139-6_23
- ISBN
  9783319301389, 9783319301396
- Peer Reviewed / Acknowledgement Compliant / Open Access
- Data Source
  KAKENHI-PROJECT-26330012, KAKENHI-PROJECT-17K00014
[Presentation] A novel method for the inverse QSAR/QSPR to monocyclic chemical compounds based on artificial neural networks and integer programming2020
- Author(s)
  Ren Ito, Naveed Ahmed Azam, Chenxi Wang, Aleksandar Shurbevski,Hiroshi Nagamochi, Tatsuya Akutsu
- Organizer
  The 21st International Conference on Bioinformatics & Computational Biology
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-20K11691
[Presentation] A method for the inverse QSAR/QSPR based on artificial neuralnetworks and mixed integer linear programming2020
- Author(s)
  N. A. Azam, R. Chiewvanichakorn, F. Zhang, A. Shurbevski, H. Nagamochi T. Akutsu
- Organizer
  BIOINFORMATICS2020
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00014
[Presentation] A new integer linear programming formulation to the inverse QSAR/QSPR for acyclic chemical compounds using skeleton trees2020
- Author(s)
  F. Zhang, J. Zhu, R. Chiewvanichakorn, A. Shurbevski, H. Nagamochi,T. Akutsu
- Organizer
  The 33rd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-20K11691
[Presentation] A new integer linear programming formulationto the inverse QSAR/QSPR for acyclic chemical compoundsusing skeleton trees2020
- Author(s)
  F. Zhang, J. Zhu, R. Chiewvanichakorn, A. Shurbevski, H. Nagamochi,T. Akutsu
- Organizer
  The 33rd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00014
[Presentation] A method for the inverse QSAR/QSPR based on artificial neural networks and mixed integer linear programming2020
- Author(s)
  R. Chiewvanichakorn, C. Wang, Z. Zhang, A. Shurbevski, H. Nagamochi, T. Akutsu
- Organizer
  10th International Conference on Bioscience,Biochemistry and Bioinformatics
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00014
[Presentation] On the enumeration of minimal non-pairwise compatibility graphs2020
- Author(s)
  Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
- Organizer
  The 26th International Computing and Combinatorics Conference
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-20K11691
[Presentation] An Improved Method for Enumerating Pairwise Compatibility Graphs with a Given Number of Vertices2019
- Author(s)
  Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
- Organizer
  The 12th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00014
[Presentation] A Routing Problem in Warehouse Graphs2019
- Author(s)
  Xinhu Lan, Aleksandar Shurbevski, Hiroshi Nagamochi
- Organizer
  The 22nd Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2019)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00014
[Presentation] Counting Tree-Like Graphs with a Given Number of Vertices and Self-loops2019
- Author(s)
  Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
- Organizer
  the Third International Workshop on Enumeration Problems and Applications (WEPA2019)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00014
[Presentation] Algorithms for the 2-Layer Crossing Minimization Problem2018
- Author(s)
  Y. Song, A. Shurbevski, H. Nagamochi
- Organizer
  The Thirteenth International Symposium on Operations Research and Its Applications
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00014
[Presentation] λ Group Strategy Proof Mechanisms for the Obnoxious Facility Game in Star Networks2018
- Author(s)
  Y. Fukui, A. Shurbevski, H. Nagamochi
- Organizer
  In the 21st Korea-Japan Joint Workshop on Algorithms and Computation
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00014
[Presentation] Enumerating All Pairwise Compatibility Graphs with a Given Number of Vertices Based on Linear Programming2018
- Author(s)
  N. A. Azam, M. Ito, A. Shurbevski, H. Nagamochi
- Organizer
  WEPA 2018
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00014
[Presentation] COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets2018
- Author(s)
  K. Haraguchi, Y. Momoi, A. Shurbevski, H. Nagamochi
- Organizer
  WEPA 2018
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00014
[Presentation] Acute Constraints in Straight-Line Drawings of Planar Graphs2018
- Author(s)
  A. Seto, A. Shurbevski, H. Nagamochi, P. Eades
- Organizer
  In the 21st Korea-Japan Joint Workshop on Algorithms and Computation
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00014
[Presentation] A Truck Scheduling Problem with Boomerang Drone Delivery2018
- Author(s)
  A. Seto, A. Shurbevski, H. Nagamochi
- Organizer
  Scheduling Symposium 2018
- Data Source
  KAKENHI-PROJECT-17K00014
[Presentation] The Stable Roommates Problem with Unranked Entries2017
- Author(s)
  H. Suto, A. Shurbevski, H. Nagamochi
- Organizer
  In The 20th Japan Conference on Discrete and Computational Geometry, Graphs and Games
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00014
[Presentation] Approximation Algorithms for the Traveling Salesman with a Drone2017
- Author(s)
  S. Othman, A. Shurbevski, H. Nagamochi
- Organizer
  The 10th Annual Meeting of the Asian Association for Algorithms and Computation
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00014
[Presentation] A New ILP for Two-layer Crossing Minimization for Bipartite Graphs2017
- Author(s)
  Y. Song, A. Shurbevski, S.-H. Hong, H. Nagamochi
- Organizer
  in The 20th Korea-Japan Joint Workshop on Algorithms and Computation
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00014
[Presentation] Routing of Carrier-Vehicle Systems with Dedicated Last-Stretch Delivery Vehicle2017
- Author(s)
  S. Othman, A. Shurbevski, H. Nagamochi
- Organizer
  International Symposium on Scheduling
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00014

1. NAGAMOCHI Hiroshi (70202231)

# of Collaborated Projects: 2 results

# of Collaborated Products: 30 results
2. 阿久津達也

# of Collaborated Projects: 0 results

# of Collaborated Products: 2 results

Shurbevski Aleksandar Ｓｈｕｒｂｅｖｓｋｉ Ａ

Shurbevski A シュルベフスキ ア

Research Projects

Research Products

Co-Researchers

Theory design and implementation of practical optimization and enumeration algorithms over graph structure

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

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

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

[Journal Article] On the enumeration of minimal non-pairwise compatibility graphs2022

Author(s)

Journal Title

DOI

Data Source

[Journal Article] A New Approach to the Design of Acyclic Chemical Compounds Using Skeleton Trees and Integer Linear Programming2022

Author(s)

Journal Title

DOI

Data Source

[Journal Article] A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming2021

Author(s)

Journal Title

DOI

Data Source

[Journal Article] A Method for Enumerating Pairwise Compatibility Graphs with a Given Number of Vertices2021

Author(s)

Journal Title

DOI

Data Source

[Journal Article] A Novel Method for Inferring Chemical Compounds with Prescribed Topological Substructures Based on Integer Programming2021

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Enumerating tree-like graphs and polymer topologies with a given cycle rank2020

Author(s)

Journal Title

DOI

Data Source

[Journal Article] A novel method for inference of chemical compounds of cycle index two with desired properties based on artificial neural networks and integer programming2020

Author(s)

Journal Title

DOI

NAID

Data Source

[Journal Article] Group Strategy-proof Mechanisms for Shuttle Facility Games2020

Author(s)

Journal Title

DOI

NAID

ISSN

Language

Data Source

[Journal Article] An efficient algorithm to count tree-like graphs with a given number of vertices and self-loops2020

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Acute Constraints in Straight-Line Drawings of Planar Graphs2019

Author(s)

Journal Title

DOI

NAID

ISSN

Year and Date

Language

Data Source

[Journal Article] COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets2019

Author(s)

Journal Title

DOI

Data Source

Shurbevski Aleksandar ＳｈｕｒｂｅｖｓｋｉＡ

Shurbevski A シュルベフスキア