Researchers Information System

日本語に切り替えるswitch to english

Shurbevski, Aleksandar

Graduate School of Informatics, Department of Applied Mathematics and Physics Assistant Professor

Shurbevski, Aleksandar
list
    Last Updated :2022/05/14

    Basic Information

    Faculty

    • 工学部 工学部 システム工学実験

    Academic Degree

    • 修士(工学)(京都工芸繊維大学)
    • 博士(情報学)(京都大学)

    Academic Resume (Graduate Schools)

    • University of St.Cyril and Methodius, Faculty of Electrical Engineering and Information Technologies,Computer System Engineering and Automation Study Program, 単位修得退学
    • 京都工芸繊維大学, 大学院工芸科学研究科博士前期課程機械システム工学専攻, 修了
    • 京都大学, 大学院情報学研究科博士後期課程数理工学専攻, 修了

    Academic Resume (Undergraduate School/Majors)

    • University of St.Cyril and Methodius, Faculty of Electrical Engineering and Information Technologies,Computer System Engineering and Automation Course, 卒業

    Language of Instruction

    • English

    ID,URL

    Website(s) (URL(s))

    researchmap URL

    list
      Last Updated :2022/05/14

      Research

      Research Areas

      • Informatics, Mathematical informatics

      Papers

      • 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 for Molecular Biology, Dec. 2021
      • 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 Transactions on Computational Biology and Bioinformatics, 2021
      • Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank
        Naveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi Nagamochi
        Entropy, 13 Nov. 2020, Peer-reviewed
      • Group Strategy-proof Mechanisms for Shuttle Facility Games
        Yuhei Fukui; Aleksandar Shurbevski; Hiroshi Nagamochi
        Journal of Information Processing, Sep. 2020, Peer-reviewed, Corresponding author
      • 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
        Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices, Sep. 2020, Peer-reviewed
      • 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, 22 Aug. 2020, Peer-reviewed
      • On the Enumeration of Minimal Non-pairwise Compatibility Graphs
        Naveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi Nagamochi
        Lecture Notes in Computer Science, Aug. 2020, Peer-reviewed
      • A method for enumerating pairwise compatibility graphs with a given number of vertices
        Naveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi Nagamochi
        Discrete Applied Mathematics, Aug. 2020, Peer-reviewed
      • 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 2020 10th International Conference on Bioscience, Biochemistry and Bioinformatics, 19 Jan. 2020, Peer-reviewed
      • A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility
        Naveed Azam; Rachaya Chiewvanichakorn; Fan Zhang; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu
        Proceedings of the 13th International Joint Conference on Biomedical Engineering Systems and Technologies, 2020, Peer-reviewed
      • 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, Peer-reviewed
      • λ-Group Strategy-Proof Mechanisms for the Obnoxious Facility Game in Star Networks
        Yuhei Fukui; Aleksandar Shurbevski; Hiroshi Nagamochi
        IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, Sep. 2019, Peer-reviewed
      • Acute Constraints in Straight-Line Drawings of Planar Graphs
        Akane Seto; Aleksandar Shurbevski; Hiroshi Nagamochi; Peter Eades
        IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, Sep. 2019, Peer-reviewed
      • An iterative ILP-based algorithm for the prize-collecting TSP
        Tsuyoshi Saito; Aleksandar Shurbevski
        Proceedings of International Symposium on Scheduling 2019, Jul. 2019, Peer-reviewed
      • COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets
        Kazuya Haraguchi; Yusuke Momoi; Aleksandar Shurbevski; Hiroshi Nagamochi
        Journal of Graph Algorithms and Applications, Jul. 2019, Peer-reviewed
      • Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-like Chemical Graphs
        Yuhei Nishiyama; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu
        IEEE/ACM Transactions on Computational Biology and Bioinformatics, Jan. 2019, Peer-reviewed
      • A Truck Scheduling Problem with Boomerang Drone Delivery
        Akane Seto; Aleksandar Shurbevski; Hiroshi Nagamochi
        Proceedings of the Scheduling Symposium 2018, Sep. 2018
      • The Stable Roommates Problem with Unranked Entries
        Hiroaki Suto; Aleksandar Shurbevski; Hiroshi Nagamochi
        IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, Sep. 2018, Peer-reviewed
      • Algorithms for the 2-Layer Crossing Minimization Problem
        Yue Song; Aleksandar Shurbevski; Hiroshi Nagamochi
        13th International Symposium on Operations Research and its Applications (ISORA), Aug. 2018, Peer-reviewed
      • Acute Constraints in Straight-Line Drawings of Planar Graphs
        Akane Seto; Aleksandar Shurbevski; Hiroshi Nagamochi; Peter Eades
        21st Korea-Japan Joint Workshop on Algorithms and Computation, WAAC 2018, Aug. 2018, Peer-reviewed
      • λ Group Strategy Proof Mechanisms for the Obnoxious Facility Game in Star Networks
        Yuhei Fukui; Aleksandar Shurbevski; Hiroshi Nagamochi
        21st Korea-Japan Joint Workshop on Algorithms and Computation, WAAC 2018, Aug. 2018, Peer-reviewed
      • Polynomial-space exact algorithms for the bipartite traveling salesman problem
        Mohd Shahrizan Othman; Aleksandar Shurbevski; Hiroshi Nagamochi
        IEICE Transactions on Information and Systems, 01 Mar. 2018, Peer-reviewed
      • Enumerating chemical mono-block 3-augmented trees with two junctions
        Yuui Tamura; Hiroshi Nagamochi; Aleksandar Shurbevski; Tatsuya Akutsu
        ACM International Conference Proceeding Series, 18 Jan. 2018, Peer-reviewed
      • Approximation Algorithms for the Traveling Salesman with a Drone
        Mohd Shahrizan; bin Othman; Aleksandar Shurbevski; Hiroshi Nagamochi
        164th Algorithm Research Meeting, Sep. 2017
      • A New ILP for Two-layer Crossing Minimization for Bipartite Graphs
        Yue Song; Aleksandar Shurbevski; Seok-Hee Hong; Hiroshi Nagamochi
        20th Korea-Japan Joint Workshop on Algorithms and Computation, WAAC 2017, Sep. 2017, Peer-reviewed
      • An improved-time polynomial-space exact algorithm for TSP in degree-5 graphs
        Norhazwani Md Yunos; Aleksandar Shurbevski; Hiroshi Nagamochi
        Journal of Information Processing, 01 Aug. 2017, Peer-reviewed
      • Routing of carrier-vehicle systems with dedicated last-stretch delivery vehicle and fixed carrier route
        Mohd Shahrizan Bin Othman; Aleksandar Shurbevski; Yoshiyuki Karuno; Hiroshi Nagamochi
        Journal of Information Processing, 01 Aug. 2017, Peer-reviewed
      • The Stable Roommates Problem with Unranked Entries
        Hiroaki Suto; Aleksandar Shurbevski; Hiroshi Nagamochi
        JCDCG^3, Aug. 2017, Peer-reviewed
      • Routing of Carrier-Vehicle Systems with Dedicated Last-Stretch Delivery Vehicle
        Mohd Shahrizan; bin Othman; Aleksandar Shurbevski; Hiroshi Nagamochi
        International Symposium on Scheduling (ISS 2017), Jun. 2017, Peer-reviewed
      • λ Group Strategy Proof Mechanisms for the Obnoxious Facility Game in Star Networks
        Yuhei Fukui; Aleksandar Shurbevski; Hiroshi Nagamochi
        IEICE Technical Report, May 2017
      • Acute Constrains in Straight-Line Drawings of Planar Graphs
        Akane Seto; Aleksandar Shurbevski; Hiroshi Nagamochi
        IEICE Technical Report, May 2017
      • Approximation Algorithms for the Traveling Salesman with a Drone
        Mohd Shahrizan; bin Othman; Aleksandar Shurbevski; Hiroshi Nagamochi
        AAAC 2017, May 2017, Peer-reviewed
      • Parameterization of strategy-proof mechanisms in the obnoxious facility game
        Morito Oomine; Aleksandar Shurbevski; Hiroshi Nagamochi
        Journal of Graph Algorithms and Applications, 2017, Peer-reviewed
      • Routing Problems with Last-Stretch Delivery
        Mohd Shahrizan Bin Othman; Aleksandar Shurbevski; Yoshiyuki Karuno; Hiroshi Nagamochi
        JCDCG^3, Sep. 2016, Peer-reviewed
      • Exact Algorithms for the Bipartite Traveling Salesman Problem
        Mohd Shahrizan Bin Othman; Aleksandar Shurbevski; Hiroshi Nagamochi
        AAAC 2016, May 2016, Peer-reviewed
      • Parameterization of strategy-proof mechanisms in the obnoxious facility game
        Morito Oomine; Aleksandar Shurbevski; Hiroshi Nagamochi
        Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2016, Peer-reviewed
      • A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs
        Norhazwani Md Yunos; Aleksandar Shurbevski; Hiroshi Nagamochi
        DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 2016, Peer-reviewed
      • Approximation algorithms for a sequencing problem with a biased bipartite structure
        Aleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki Karuno
        JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2016, Peer-reviewed
      • Approximation algorithms for a sequencing problem with a biased bipartite structure
        Aleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki Karuno
        JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2016, Peer-reviewed
      • A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs
        Norhazwani Md Yunos; Aleksandar Shurbevski; Hiroshi Nagamochi
        The 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2015), Sep. 2015, Peer-reviewed
      • A Polynomial-Space Exact Algorithm for TSP in Degree-5 Graphs
        Norhazwani Md Yunos; Aleksandar Shurbevski; Hiroshi Nagamochi
        ISORA2015, Aug. 2015, Peer-reviewed
      • An Approximation Framework for Sequencing Problems with Bipartite Structure
        Aleksandar Shurbevski
        Kyoto University, Sep. 2014
      • Optimization Techniques for Robot Path Planning
        Aleksandar Shurbevski; Noriaki Hirosue; Hiroshi Nagamochi
        ICT INNOVATIONS 2013: ICT INNOVATIONS AND EDUCATION, 2014, Peer-reviewed
      • Approximating the Bipartite TSP and Its Biased Generalization
        Aleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki Karuno
        ALGORITHMS AND COMPUTATION, WALCOM 2014, 2014, Peer-reviewed
      • The Repetitive Routing Problem Revisited
        Aleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki Karuno
        ETAI 2013, Sep. 2013, Peer-reviewed
      • Better approximation algorithms for grasp-and-delivery robot routing problems
        Aleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki Karuno
        IEICE Transactions on Information and Systems, 2013, Peer-reviewed
      • Constant factor approximation algorithms for repetitive routing problems of grasp-and-delivery robots in production of printed circuit boards
        Yoshiyuki Karuno; Aleksandar Shurbevski; Hiroshi Nagamochi
        Journal of the Operations Research Society of Japan, Sep. 2012, Peer-reviewed
      • Improved Approximation Ratio Algorithms for Grasp-and-Delivery Robot Routing Problems
        Aleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki Karuno
        WAAC 2012, Jul. 2012
      • A Dynamic Programming Based Improvement Heuristic for a Repetitive Routing Problem of Grasp-and-Delivery Robots
        Aleksandar Shurbevski; Yoshiyuki Karuno; Hiroshi Nagamochi
        JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2012, Peer-reviewed
      • Heuristics for a Repetitive Routing Problem of a Single Grasp-and-Delivery Robot With an Asymmetric Edge Cost Function
        Aleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki Karuno
        ETAI 2011, Sep. 2011, Peer-reviewed
      • Improved Implementation of an Approximation Algorithm with Factor Two for a Cyclic Routing Problem of Grasp-and-Delivery Robots
        Aleksandar Shurbevski; Yoshiyuki Karuno; Hiroshi Nagamochi
        ISS 2011, Jul. 2011, Peer-reviewed
      • Approximating Cyclic Routing Problems of Grasp-and-Delivery Robots in Production of Printed Circuit Boards
        Yoshiyuki Karuno; Aleksandar Shurbevski; Hiroshi Nagamochi
        ISS 2011, Jul. 2011, Peer-reviewed
      • An Approximation Algorithm with Factor Two for a Repetitive Routing Problem of Grasp-and-Delivery Robots.
        Yoshiyuki Karuno; Hiroshi Nagamochi; Aleksandar Shurbevski
        JACIII, 2011, Peer-reviewed
      • Approximation Algorithms for a Cyclic Routing Problem of Grasp-and-Delivery Robots
        Yoshiyuki Karuno; Aleksandar Shurbevski; Hiroshi Nagamochi
        SCIS & ISIS 2010, Oct. 2010, Peer-reviewed

      Misc.

      • 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
        18 Apr. 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
        14 Apr. 2020
      • Counting tree-like graphs with a given number of vertices and self-loops
        Naveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi Nagamochi
        3rd International Workshop on Enumeration Problems and Applications (WEPA), Oct. 2019, Peer-reviewed
      • An improved method for enumerating pairwise compatibility graphs with a given number of vertices
        Naveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi Nagamochi
        Asian Association for Algorithms and Computation (AAAC), 2019, Peer-reviewed
      • Enumerating all pairwise compatibility graphs with a given number of vertices based on linear programming
        Naveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi Nagamochi
        2nd International Workshop on Enumeration Problems and Applications (WEPA), Nov. 2018, Peer-reviewed
      • A dynamic programming based algorithm for enumerating unlabeled unrooted trees
        増井 隆治; シュルベフスキ アレクサンダル; 永持 仁
        電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 18 Aug. 2017
      • Parameterization of strategy-proof mechanisms in the obnoxious facility game
        Morito Oomine; Aleksandar Shurbevski; Hiroshi Nagamochi
        Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2016

      Presentations

      • Efficient Algorithms for Tackling Computationally Challenging Problems
        Aleksandar Shurbevski
        Seminar on Informatics in Asia 2015, 15 Sep. 2015, Invited

      Awards

      • 14 Oct. 2020
        Japan Association for Chemical Innovation, The 9th Research Encouragement Award for Chemical Innovation

      External funds: Kakenhi

      • グラフ構造に対する実用的な最適化・列挙アルゴリズムの理論設計と実装開発
        Grant-in-Aid for Scientific Research (C)
        Basic Section 60020:Mathematical informatics-related
        Kyoto University
        永持 仁
        From 01 Apr. 2020, To 31 Mar. 2023, Granted
        離散最適化;グラフ理論;アルゴリズム;整数計画法;動的計画法;グラフ・ネットワーク;計算量
      • Design of Algorithms for Discrete Optimization Based on Graph-Theoretical Methods
        Grant-in-Aid for Scientific Research (C)
        Kyoto University
        Hiroshi NAGAMOCHI
        From 01 Apr. 2017, To 31 Mar. 2020, Project Closed
        アルゴリズム;離散最適化;グラフ;データマイニング;NP-困難;グラフ描画;人工ニューラルネットワーク;機械学習;グラフ理論;ネットワーク;計算量;近似アルゴリズム;経路探索;ゲーム理論;情報工学;高速コンピューティング;数理計画;最適化

      External funds: others

      • Novel Models and Solution Methods for Collaborative Routing Problems
        京都大学教育研究振興財団
        From 01 Jun. 2017, To 31 Mar. 2018
        Aleksandar Shurbevski
      list
        Last Updated :2022/05/14

        Education

        Teaching subject(s)

        • From Apr. 2015, To Mar. 2016
          Seminar on Applied Mathematics and Physics
          Fall, 工学部
        • From Apr. 2015, To Mar. 2016
          Applied Mathematics and Physics Laboratory
          Fall, 工学部
        • From Apr. 2016, To Mar. 2017
          Seminar on Applied Mathematics and Physics
          Fall, 工学部
        • From Apr. 2016, To Mar. 2017
          Operations Research, Advanced
          Fall, 情報学研究科
        • From Apr. 2017, To Mar. 2018
          Seminar on Applied Mathematics and Physics
          Fall, 工学部
        • From Apr. 2017, To Mar. 2018
          Applied Mathematics and Physics Laboratory
          Fall, 工学部
        • From Apr. 2017, To Mar. 2018
          Operations Research, Advanced
          Fall, 情報学研究科
        • From Apr. 2018, To Mar. 2019
          Applied Mathematics and Physics Laboratory
          Fall, 工学部
        • From Apr. 2018, To Mar. 2019
          Operations Research, Advanced
          Fall, 情報学研究科
        • From Apr. 2019, To Mar. 2020
          Seminar on Applied Mathematics and Physics
          Fall, 工学部
        • From Apr. 2019, To Mar. 2020
          Applied Mathematics and Physics Laboratory
          Fall, 工学部
        • From Apr. 2019, To Mar. 2020
          Operations Research, Advanced
          Fall, 情報学研究科
        • From Apr. 2020, To Mar. 2021
          Applied Mathematics and Physics Laboratory
          Fall, 工学部
        • From Apr. 2020, To Mar. 2021
          Applied Mathematics and Physics Laboratory
          Fall, 工学部
        • From Apr. 2020, To Mar. 2021
          Operations Research, Advanced
          Fall, 情報学研究科
        • From Apr. 2021, To Mar. 2022
          Applied Mathematics and Physics Laboratory
          Fall, 工学部
        • From Apr. 2021, To Mar. 2022
          Applied Mathematics and Physics Laboratory
          Fall, 工学部
        • From Apr. 2021, To Mar. 2022
          Seminar on Applied Mathematics and Physics
          Fall, 工学部

        Student achievements: Awards

        • Best Theory Paper
          Fan Zhang, 33rd International Conference on Industrial, Engineering & Other Applications of Applied Intelligent Systems, Sep. 2020
        • Best Presentation Award
          Rachaya Chiewvanichakorn, ICBBB20, Jan. 2020
        • Best Poster Award
          Mohd Shahrizan bin Othman, ICT Innovations @ Kyoto University, 23 Feb. 2017
        list
          Last Updated :2022/05/14

          Administration

          Faculty management (title, position)

          • From 01 Apr. 2015, To 31 Mar. 2017
            広報WG委員
          • From 01 Apr. 2018, To 31 Mar. 2019
            情報セキュリティWG委員
          • From 01 Apr. 2018, To 31 Mar. 2019
            システム運用WG委員
          • From 01 Apr. 2019, To 31 Mar. 2021
            図書WG委員(兼任 数理コース)

          ページ上部へ戻る