Search for faculty members
Shurbevski, Aleksandar
Graduate School of Informatics, Department of Applied Mathematics and Physics Assistant Professor
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
ID,URL
J-Global ID
Researcher number
70750230External link
Website(s) (URL(s))
researchmap URL
list
Last Updated :2022/05/14
Research
Research Areas
Papers
- A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programmingNaveed Ahmed Azam; Jianshen Zhu; Yanming Sun; Yu Shi; Aleksandar Shurbevski; Liang Zhao; Hiroshi Nagamochi; Tatsuya AkutsuAlgorithms for Molecular Biology, Dec. 2021
- A Novel Method for Inferring Chemical Compounds with Prescribed Topological Substructures Based on Integer ProgrammingJianshen Zhu; Naveed Ahmed Azam; Fan Zhang; Aleksandar Shurbevski; Kazuya Haraguchi; Liang Zhao; Hiroshi Nagamochi; Tatsuya AkutsuIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2021
- Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle RankNaveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi NagamochiEntropy, 13 Nov. 2020, Peer-reviewed
- Group Strategy-proof Mechanisms for Shuttle Facility GamesYuhei Fukui; Aleksandar Shurbevski; Hiroshi NagamochiJournal 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 TreesFan Zhang; Jianshen Zhu; Rachaya Chiewvanichakorn; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya AkutsuTrends 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-LoopsNaveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi NagamochiEntropy, 22 Aug. 2020, Peer-reviewed
- On the Enumeration of Minimal Non-pairwise Compatibility GraphsNaveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi NagamochiLecture Notes in Computer Science, Aug. 2020, Peer-reviewed
- A method for enumerating pairwise compatibility graphs with a given number of verticesNaveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi NagamochiDiscrete Applied Mathematics, Aug. 2020, Peer-reviewed
- A Method for the Inverse QSAR/QSPR Based on Artificial Neural Networks and Mixed Integer Linear ProgrammingRachaya Chiewvanichakorn; Chenxi Wang; Zhe Zhang; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya AkutsuProceedings 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 AdmissibilityNaveed Azam; Rachaya Chiewvanichakorn; Fan Zhang; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya AkutsuProceedings 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 AkutsuAlgorithms, 2020, Peer-reviewed
- λ-Group Strategy-Proof Mechanisms for the Obnoxious Facility Game in Star NetworksYuhei Fukui; Aleksandar Shurbevski; Hiroshi NagamochiIEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, Sep. 2019, Peer-reviewed
- Acute Constraints in Straight-Line Drawings of Planar GraphsAkane Seto; Aleksandar Shurbevski; Hiroshi Nagamochi; Peter EadesIEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, Sep. 2019, Peer-reviewed
- An iterative ILP-based algorithm for the prize-collecting TSPTsuyoshi Saito; Aleksandar ShurbevskiProceedings of International Symposium on Scheduling 2019, Jul. 2019, Peer-reviewed
- Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-like Chemical GraphsYuhei Nishiyama; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya AkutsuIEEE/ACM Transactions on Computational Biology and Bioinformatics, Jan. 2019, Peer-reviewed
- A Truck Scheduling Problem with Boomerang Drone DeliveryAkane Seto; Aleksandar Shurbevski; Hiroshi NagamochiProceedings of the Scheduling Symposium 2018, Sep. 2018
- The Stable Roommates Problem with Unranked EntriesHiroaki Suto; Aleksandar Shurbevski; Hiroshi NagamochiIEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, Sep. 2018, Peer-reviewed
- Algorithms for the 2-Layer Crossing Minimization ProblemYue Song; Aleksandar Shurbevski; Hiroshi Nagamochi13th International Symposium on Operations Research and its Applications (ISORA), Aug. 2018, Peer-reviewed
- Acute Constraints in Straight-Line Drawings of Planar GraphsAkane Seto; Aleksandar Shurbevski; Hiroshi Nagamochi; Peter Eades21st 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 NetworksYuhei Fukui; Aleksandar Shurbevski; Hiroshi Nagamochi21st Korea-Japan Joint Workshop on Algorithms and Computation, WAAC 2018, Aug. 2018, Peer-reviewed
- Polynomial-space exact algorithms for the bipartite traveling salesman problemMohd Shahrizan Othman; Aleksandar Shurbevski; Hiroshi NagamochiIEICE Transactions on Information and Systems, 01 Mar. 2018, Peer-reviewed
- Enumerating chemical mono-block 3-augmented trees with two junctionsYuui Tamura; Hiroshi Nagamochi; Aleksandar Shurbevski; Tatsuya AkutsuACM International Conference Proceeding Series, 18 Jan. 2018, Peer-reviewed
- Approximation Algorithms for the Traveling Salesman with a DroneMohd Shahrizan; bin Othman; Aleksandar Shurbevski; Hiroshi Nagamochi164th Algorithm Research Meeting, Sep. 2017
- Routing of Carrier-Vehicle Systems with Dedicated Last-Stretch Delivery VehicleMohd Shahrizan; bin Othman; Aleksandar Shurbevski; Hiroshi NagamochiInternational Symposium on Scheduling (ISS 2017), Jun. 2017, Peer-reviewed
- Approximation Algorithms for the Traveling Salesman with a DroneMohd Shahrizan; bin Othman; Aleksandar Shurbevski; Hiroshi NagamochiAAAC 2017, May 2017, Peer-reviewed
- Parameterization of strategy-proof mechanisms in the obnoxious facility gameMorito Oomine; Aleksandar Shurbevski; Hiroshi NagamochiJournal of Graph Algorithms and Applications, 2017, Peer-reviewed
- Routing Problems with Last-Stretch DeliveryMohd Shahrizan Bin Othman; Aleksandar Shurbevski; Yoshiyuki Karuno; Hiroshi NagamochiJCDCG^3, Sep. 2016, Peer-reviewed
- Exact Algorithms for the Bipartite Traveling Salesman ProblemMohd Shahrizan Bin Othman; Aleksandar Shurbevski; Hiroshi NagamochiAAAC 2016, May 2016, Peer-reviewed
- Parameterization of strategy-proof mechanisms in the obnoxious facility gameMorito Oomine; Aleksandar Shurbevski; Hiroshi NagamochiLecture 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 GraphsNorhazwani Md Yunos; Aleksandar Shurbevski; Hiroshi NagamochiDISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 2016, Peer-reviewed
- Approximation algorithms for a sequencing problem with a biased bipartite structureAleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki KarunoJOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2016, Peer-reviewed
- Approximation algorithms for a sequencing problem with a biased bipartite structureAleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki KarunoJOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2016, Peer-reviewed
- A Polynomial-Space Exact Algorithm for TSP in Degree-6 GraphsNorhazwani Md Yunos; Aleksandar Shurbevski; Hiroshi NagamochiThe 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 GraphsNorhazwani Md Yunos; Aleksandar Shurbevski; Hiroshi NagamochiISORA2015, Aug. 2015, Peer-reviewed
- An Approximation Framework for Sequencing Problems with Bipartite StructureAleksandar ShurbevskiKyoto University, Sep. 2014
- Optimization Techniques for Robot Path PlanningAleksandar Shurbevski; Noriaki Hirosue; Hiroshi NagamochiICT INNOVATIONS 2013: ICT INNOVATIONS AND EDUCATION, 2014, Peer-reviewed
- Approximating the Bipartite TSP and Its Biased GeneralizationAleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki KarunoALGORITHMS AND COMPUTATION, WALCOM 2014, 2014, Peer-reviewed
- The Repetitive Routing Problem RevisitedAleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki KarunoETAI 2013, Sep. 2013, Peer-reviewed
- Better approximation algorithms for grasp-and-delivery robot routing problemsAleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki KarunoIEICE Transactions on Information and Systems, 2013, Peer-reviewed
- Improved Approximation Ratio Algorithms for Grasp-and-Delivery Robot Routing ProblemsAleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki KarunoWAAC 2012, Jul. 2012
- A Dynamic Programming Based Improvement Heuristic for a Repetitive Routing Problem of Grasp-and-Delivery RobotsAleksandar Shurbevski; Yoshiyuki Karuno; Hiroshi NagamochiJOURNAL 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 FunctionAleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki KarunoETAI 2011, Sep. 2011, Peer-reviewed
- Improved Implementation of an Approximation Algorithm with Factor Two for a Cyclic Routing Problem of Grasp-and-Delivery RobotsAleksandar Shurbevski; Yoshiyuki Karuno; Hiroshi NagamochiISS 2011, Jul. 2011, Peer-reviewed
- Approximating Cyclic Routing Problems of Grasp-and-Delivery Robots in Production of Printed Circuit BoardsYoshiyuki Karuno; Aleksandar Shurbevski; Hiroshi NagamochiISS 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 ShurbevskiJACIII, 2011, Peer-reviewed
- Approximation Algorithms for a Cyclic Routing Problem of Grasp-and-Delivery RobotsYoshiyuki Karuno; Aleksandar Shurbevski; Hiroshi NagamochiSCIS & ISIS 2010, Oct. 2010, Peer-reviewed
Misc.
- Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency SpecificationsKyousuke Yamashita; Ryuji Masui; Xiang Zhou; Chenxi Wang; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu18 Apr. 2020
- Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path FrequenciesYuui Tamura; Yuhei Nishiyama; Chenxi Wang; Yanming Sun; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu14 Apr. 2020
- Counting tree-like graphs with a given number of vertices and self-loopsNaveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi Nagamochi3rd 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 verticesNaveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi NagamochiAsian Association for Algorithms and Computation (AAAC), 2019, Peer-reviewed
- Enumerating all pairwise compatibility graphs with a given number of vertices based on linear programmingNaveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi Nagamochi2nd 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 gameMorito Oomine; Aleksandar Shurbevski; Hiroshi NagamochiLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2016
Presentations
- Efficient Algorithms for Tackling Computationally Challenging ProblemsAleksandar ShurbevskiSeminar on Informatics in Asia 2015, 15 Sep. 2015, Invited
Awards
- 14 Oct. 2020Japan 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-relatedKyoto University永持 仁From 01 Apr. 2020, To 31 Mar. 2023, Granted離散最適化;グラフ理論;アルゴリズム;整数計画法;動的計画法;グラフ・ネットワーク;計算量
- Design of Algorithms for Discrete Optimization Based on Graph-Theoretical MethodsGrant-in-Aid for Scientific Research (C)Kyoto UniversityHiroshi NAGAMOCHIFrom 01 Apr. 2017, To 31 Mar. 2020, Project Closedアルゴリズム;離散最適化;グラフ;データマイニング;NP-困難;グラフ描画;人工ニューラルネットワーク;機械学習;グラフ理論;ネットワーク;計算量;近似アルゴリズム;経路探索;ゲーム理論;情報工学;高速コンピューティング;数理計画;最適化
External funds: others
list
Last Updated :2022/05/14
Education
Teaching subject(s)
- From Apr. 2015, To Mar. 2016Seminar on Applied Mathematics and PhysicsFall, 工学部
- From Apr. 2015, To Mar. 2016Applied Mathematics and Physics LaboratoryFall, 工学部
- From Apr. 2016, To Mar. 2017Seminar on Applied Mathematics and PhysicsFall, 工学部
- From Apr. 2016, To Mar. 2017Operations Research, AdvancedFall, 情報学研究科
- From Apr. 2017, To Mar. 2018Seminar on Applied Mathematics and PhysicsFall, 工学部
- From Apr. 2017, To Mar. 2018Applied Mathematics and Physics LaboratoryFall, 工学部
- From Apr. 2017, To Mar. 2018Operations Research, AdvancedFall, 情報学研究科
- From Apr. 2018, To Mar. 2019Applied Mathematics and Physics LaboratoryFall, 工学部
- From Apr. 2018, To Mar. 2019Operations Research, AdvancedFall, 情報学研究科
- From Apr. 2019, To Mar. 2020Seminar on Applied Mathematics and PhysicsFall, 工学部
- From Apr. 2019, To Mar. 2020Applied Mathematics and Physics LaboratoryFall, 工学部
- From Apr. 2019, To Mar. 2020Operations Research, AdvancedFall, 情報学研究科
- From Apr. 2020, To Mar. 2021Applied Mathematics and Physics LaboratoryFall, 工学部
- From Apr. 2020, To Mar. 2021Applied Mathematics and Physics LaboratoryFall, 工学部
- From Apr. 2020, To Mar. 2021Operations Research, AdvancedFall, 情報学研究科
- From Apr. 2021, To Mar. 2022Applied Mathematics and Physics LaboratoryFall, 工学部
- From Apr. 2021, To Mar. 2022Applied Mathematics and Physics LaboratoryFall, 工学部
- From Apr. 2021, To Mar. 2022Seminar on Applied Mathematics and PhysicsFall, 工学部
Student achievements: Awards
- Best Theory PaperFan Zhang, 33rd International Conference on Industrial, Engineering & Other Applications of Applied Intelligent Systems, Sep. 2020
- Best Presentation AwardRachaya Chiewvanichakorn, ICBBB20, Jan. 2020
- Best Poster AwardMohd Shahrizan bin Othman, ICT Innovations @ Kyoto University, 23 Feb. 2017
