Shurbevski Aleksandar

Last Update: 2019/09/05 08:38:44

Print

Name(Kanji/Kana/Abecedarium Latinum)
Shurbevski Aleksandar/シュルベフスキ アレクサンダル/Shurbevski, Aleksandar
Primary Affiliation(Org1/Job title)
Graduate Schools Informatics/Assistant Professor
Faculty
Org1 Job title
工学部
E-mail Address
E-mail address
shurbevski @ i.kyoto-u.ac.jp
shurbevski @ amp.i.kyoto-u.ac.jp
Academic Organizations Overaseas You are Affiliated to
Organization name Country
IEEE International
Academic Degree
Field(Japanese) Field(English) University(Japanese) University(English) Method
修士(工学) 京都工芸繊維大学
博士(情報学) 京都大学
Graduate School
University(Japanese) University(English) Faculty(Japanese) Faculty(English) Major(Japanese) Major(English) Degree
University of St.Cyril and Methodius Faculty of Electrical Engineering and Information Technologies,Computer System Engineering and Automation Study Program 単位修得退学
京都工芸繊維大学 大学院工芸科学研究科博士前期課程機械システム工学専攻 修了
京都大学 大学院情報学研究科博士後期課程数理工学専攻 修了
Undergraduate School / Major(s)
University(Japanese) University(English) Faculty(Japanese) Faculty(English) Major(s)(Japanese) Major(s)(English) Degree
University of St.Cyril and Methodius Faculty of Electrical Engineering and Information Technologies,Computer System Engineering and Automation Course 卒業
Language of Instruction
Language
English
Personal Website(s) (URL(s))
URL
u.kyoto-u.jp/alex
www-or.amp.i.kyoto-u.ac.jp/~shurbevski
www-or.amp.i.kyoto-u.ac.jp/members/shurbevski
ORCID ID
https://orcid.org/0000-0001-9224-6929
researchmap URL
https://researchmap.jp/shurbevski
Published Papers
Author Author(Japanese) Author(English) Title Title(Japanese) Title(English) Bibliography Bibliography(Japanese) Bibliography(English) Publication date Refereed paper Language Publishing type Disclose
Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades Acute Constraints in Straight-Line Drawings of Planar Graphs Acute Constraints in Straight-Line Drawings of Planar Graphs Acute Constraints in Straight-Line Drawings of Planar Graphs IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E102-A, 9, 994-1001 IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E102-A, 9, 994-1001 IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E102-A, 9, 994-1001 2019/09 Refereed English Research paper(scientific journal) Disclose to all
Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi λ-Group Strategy-Proof Mechanisms for the Obnoxious Facility Game in Star Networks λ-Group Strategy-Proof Mechanisms for the Obnoxious Facility Game in Star Networks λ-Group Strategy-Proof Mechanisms for the Obnoxious Facility Game in Star Networks IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E102-A, 9, 1179-1186 IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E102-A, 9, 1179-1186 IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E102-A, 9, 1179-1186 2019/09 Refereed English Research paper(scientific journal) Disclose to all
Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, and Hiroshi Nagamochi Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, and Hiroshi Nagamochi Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, and Hiroshi Nagamochi COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets Journal of Graph Algorithms and Applications, 23, 2, 434-458 Journal of Graph Algorithms and Applications, 23, 2, 434-458 Journal of Graph Algorithms and Applications, 23, 2, 434-458 2019/07 Refereed English Research paper(scientific journal) Disclose to all
Tsuyoshi Saito and Aleksandar Shurbevski Tsuyoshi Saito and Aleksandar Shurbevski Tsuyoshi Saito and Aleksandar Shurbevski An iterative ILP-based algorithm for the prize-collecting TSP An iterative ILP-based algorithm for the prize-collecting TSP An iterative ILP-based algorithm for the prize-collecting TSP Proceedings of International Symposium on Scheduling 2019, 232-237 Proceedings of International Symposium on Scheduling 2019, 232-237 Proceedings of International Symposium on Scheduling 2019, 232-237 2019/07 Refereed English Research paper(international conference proceedings) Disclose to all
Yuhei Nishiyama, Aleksandar Shurbevski, Hiroshi Nagamochi, and Tatsuya Akutsu Yuhei Nishiyama, Aleksandar Shurbevski, Hiroshi Nagamochi, and Tatsuya Akutsu Yuhei Nishiyama, Aleksandar Shurbevski, Hiroshi Nagamochi, and Tatsuya Akutsu Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-like Chemical Graphs Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-like Chemical Graphs Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-like Chemical Graphs IEEE/ACM Transactions on Computational Biology and Bioinformatics, 16, 1, 77-90 IEEE/ACM Transactions on Computational Biology and Bioinformatics, 16, 1, 77-90 IEEE/ACM Transactions on Computational Biology and Bioinformatics, 16, 1, 77-90 2019/01 Refereed English Research paper(scientific journal) Disclose to all
Hiroaki Suto, Aleksandar Shurbevski, Hiroshi Nagamochi Hiroaki Suto, Aleksandar Shurbevski, Hiroshi Nagamochi Hiroaki Suto, Aleksandar Shurbevski, Hiroshi Nagamochi The Stable Roommates Problem with Unranked Entries The Stable Roommates Problem with Unranked Entries The Stable Roommates Problem with Unranked Entries IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E101-A, 9, 1412-1419 IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E101-A, 9, 1412-1419 IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E101-A, 9, 1412-1419 2018/09 Refereed English Research paper(scientific journal) Disclose to all
Akane Seto, Aleksandar Shurbevski, and Hiroshi Nagamochi Akane Seto, Aleksandar Shurbevski, and Hiroshi Nagamochi Akane Seto, Aleksandar Shurbevski, and Hiroshi Nagamochi A Truck Scheduling Problem with Boomerang Drone Delivery A Truck Scheduling Problem with Boomerang Drone Delivery A Truck Scheduling Problem with Boomerang Drone Delivery Proceedings of the Scheduling Symposium 2018, 113-118 Proceedings of the Scheduling Symposium 2018, 113-118 Proceedings of the Scheduling Symposium 2018, 113-118 2018/09 English Research paper(research society, symposium materials, etc.) Disclose to all
Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades Acute Constraints in Straight-Line Drawings of Planar Graphs Acute Constraints in Straight-Line Drawings of Planar Graphs Acute Constraints in Straight-Line Drawings of Planar Graphs 21st Korea-Japan Joint Workshop on Algorithms and Computation, WAAC 2018 21st Korea-Japan Joint Workshop on Algorithms and Computation, WAAC 2018 21st Korea-Japan Joint Workshop on Algorithms and Computation, WAAC 2018 2018/08 Refereed English Research paper(international conference proceedings) Disclose to all
Yue Song, Aleksandar Shurbevski, Hiroshi Nagamochi Yue Song, Aleksandar Shurbevski, Hiroshi Nagamochi Yue Song, Aleksandar Shurbevski, Hiroshi Nagamochi Algorithms for the 2-Layer Crossing Minimization Problem Algorithms for the 2-Layer Crossing Minimization Problem Algorithms for the 2-Layer Crossing Minimization Problem 13th International Symposium on Operations Research and its Applications (ISORA) 13th International Symposium on Operations Research and its Applications (ISORA) 13th International Symposium on Operations Research and its Applications (ISORA) 2018/08 Refereed Disclose to all
Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi λ Group Strategy Proof Mechanisms for the Obnoxious Facility Game in Star Networks λ Group Strategy Proof Mechanisms for the Obnoxious Facility Game in Star Networks λ Group Strategy Proof Mechanisms for the Obnoxious Facility Game in Star Networks 21st Korea-Japan Joint Workshop on Algorithms and Computation, WAAC 2018 21st Korea-Japan Joint Workshop on Algorithms and Computation, WAAC 2018 21st Korea-Japan Joint Workshop on Algorithms and Computation, WAAC 2018 2018/08 Refereed English Research paper(international conference proceedings) Disclose to all
Mohd Shahrizan Othman, Aleksandar Shurbevski, Hiroshi Nagamochi Mohd Shahrizan Othman, Aleksandar Shurbevski, Hiroshi Nagamochi Mohd Shahrizan Othman, Aleksandar Shurbevski, Hiroshi Nagamochi Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem IEICE TRANSACTIONS on Information and Systems, E101-D, 3, 611-612 IEICE TRANSACTIONS on Information and Systems, E101-D, 3, 611-612 IEICE TRANSACTIONS on Information and Systems, E101-D, 3, 611-612 2018/03 Refereed English Research paper(scientific journal) Disclose to all
Yuui Tamura, Aleksandar Shurbevski, Hiroshi Nagamochi, and Tatsuya Akutsu Yuui Tamura, Aleksandar Shurbevski, Hiroshi Nagamochi, and Tatsuya Akutsu Yuui Tamura, Aleksandar Shurbevski, Hiroshi Nagamochi, and Tatsuya Akutsu Enumerating Chemical Mono-Block 3-Augmented Trees with Two Junctions Enumerating Chemical Mono-Block 3-Augmented Trees with Two Junctions Enumerating Chemical Mono-Block 3-Augmented Trees with Two Junctions 8th International Conference on Bioscience, Biochemistry and Bioinformatics, 48-55 8th International Conference on Bioscience, Biochemistry and Bioinformatics, 48-55 8th International Conference on Bioscience, Biochemistry and Bioinformatics, 48-55 2018/01 Refereed English Research paper(international conference proceedings) Disclose to all
Yue Song, Aleksandar Shurbevski, Seok-Hee Hong, and Hiroshi Nagamochi Yue Song, Aleksandar Shurbevski, Seok-Hee Hong, and Hiroshi Nagamochi Yue Song, Aleksandar Shurbevski, Seok-Hee Hong, and Hiroshi Nagamochi A New ILP for Two-layer Crossing Minimization for Bipartite Graphs A New ILP for Two-layer Crossing Minimization for Bipartite Graphs A New ILP for Two-layer Crossing Minimization for Bipartite Graphs 20th Korea-Japan Joint Workshop on Algorithms and Computation, WAAC 2017 20th Korea-Japan Joint Workshop on Algorithms and Computation, WAAC 2017 20th Korea-Japan Joint Workshop on Algorithms and Computation, WAAC 2017 2017/09 Refereed English Research paper(international conference proceedings) Disclose to all
Hiroaki Suto, Aleksandar Shurbevski and Hiroshi Nagamochi Hiroaki Suto, Aleksandar Shurbevski and Hiroshi Nagamochi Hiroaki Suto, Aleksandar Shurbevski and Hiroshi Nagamochi The Stable Roommates Problem with Unranked Entries The Stable Roommates Problem with Unranked Entries The Stable Roommates Problem with Unranked Entries JCDCG^3, 118-119 JCDCG^3, 118-119 JCDCG^3, 118-119 2017/08 Refereed English Research paper(international conference proceedings) Disclose to all
Mohd Shahrizan bih Othman, Aleksandar Shurbevski, Yoshiyuki Karuno, and Hiroshi Nagamochi Mohd Shahrizan bih Othman, Aleksandar Shurbevski, Yoshiyuki Karuno, and Hiroshi Nagamochi Mohd Shahrizan bih Othman, Aleksandar Shurbevski, Yoshiyuki Karuno, and Hiroshi Nagamochi Routing of Carrier-vehicle Systems with Dedicated Last-stretch Vehicle and Fixed Carrier Route Routing of Carrier-vehicle Systems with Dedicated Last-stretch Vehicle and Fixed Carrier Route Routing of Carrier-vehicle Systems with Dedicated Last-stretch Vehicle and Fixed Carrier Route Journal of Information Processing, 25, 655-666 Journal of Information Processing, 25, 655-666 Journal of Information Processing, 25, 655-666 2017/08 Refereed English Research paper(scientific journal) Disclose to all
Norhazwani Md Yunos, Aleksandar Shurbevski, and Hiroshi Nagamochi Norhazwani Md Yunos, Aleksandar Shurbevski, and Hiroshi Nagamochi Norhazwani Md Yunos, Aleksandar Shurbevski, and Hiroshi Nagamochi An Improved-time Polynomial-space Exact Algorithms for TSP in Degree-5 Graphs An Improved-time Polynomial-space Exact Algorithms for TSP in Degree-5 Graphs An Improved-time Polynomial-space Exact Algorithms for TSP in Degree-5 Graphs Journal of Information Processing, 25, 635-654 Journal of Information Processing, 25, 635-654 Journal of Information Processing, 25, 635-654 2017/08 Refereed English Research paper(scientific journal) Disclose to all
Mohd Shahrizan bin Othman, Aleksandar Shurbevski, Hiroshi Nagamochi Mohd Shahrizan bin Othman, Aleksandar Shurbevski, Hiroshi Nagamochi Mohd Shahrizan bin Othman, Aleksandar Shurbevski, Hiroshi Nagamochi Routing of Carrier-Vehicle Systems with Dedicated Last-Stretch Delivery Vehicle Routing of Carrier-Vehicle Systems with Dedicated Last-Stretch Delivery Vehicle Routing of Carrier-Vehicle Systems with Dedicated Last-Stretch Delivery Vehicle International Symposium on Scheduling (ISS 2017), 51-56 International Symposium on Scheduling (ISS 2017), 51-56 International Symposium on Scheduling (ISS 2017), 51-56 2017/06 Refereed English Research paper(international conference proceedings) Disclose to all
Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi Acute Constrains in Straight-Line Drawings of Planar Graphs Acute Constrains in Straight-Line Drawings of Planar Graphs Acute Constrains in Straight-Line Drawings of Planar Graphs IEICE Technical Report, 117, 28, 31-38 信学技報, 117, 28, 31-38 IEICE Technical Report, 117, 28, 31-38 2017/05 English Research paper(research society, symposium materials, etc.) Disclose to all
Yuhei Fukui, Aleksandar Shurbevski, and Hiroshi Nagamochi Yuhei Fukui, Aleksandar Shurbevski, and Hiroshi Nagamochi Yuhei Fukui, Aleksandar Shurbevski, and Hiroshi Nagamochi λ Group Strategy Proof Mechanisms for the Obnoxious Facility Game in Star Networks λ Group Strategy Proof Mechanisms for the Obnoxious Facility Game in Star Networks λ Group Strategy Proof Mechanisms for the Obnoxious Facility Game in Star Networks IEICE Technical Report, 117, 28, 61-68 信学技報, 117, 28, 61-68 IEICE Technical Report, 117, 28, 61-68 2017/05 English Research paper(research society, symposium materials, etc.) Disclose to all
Mohd Shahrizan bin Othman, Aleksandar Shurbevski, Hiroshi Nagamochi Mohd Shahrizan bin Othman, Aleksandar Shurbevski, Hiroshi Nagamochi Mohd Shahrizan bin Othman, Aleksandar Shurbevski, Hiroshi Nagamochi Approximation Algorithms for the Traveling Salesman with a Drone Approximation Algorithms for the Traveling Salesman with a Drone Approximation Algorithms for the Traveling Salesman with a Drone AAAC 2017 AAAC 2017 AAAC 2017 2017/05 Refereed English Research paper(international conference proceedings) Disclose to all
Morito Oomine, Aleksandar Shurbevski, and Hiroshi Nagamochi Morito Oomine, Aleksandar Shurbevski, and Hiroshi Nagamochi Morito Oomine, Aleksandar Shurbevski, and Hiroshi Nagamochi Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game Journal of Graph Algorithms and Applications, 21, 3, 247-263 Journal of Graph Algorithms and Applications, 21, 3, 247-263 Journal of Graph Algorithms and Applications, 21, 3, 247-263 2017/02 Refereed English Research paper(scientific journal) Disclose to all
Mohd Shahrizan Bin Othman, Aleksandar Shurbevski, Yoshiyuki Karuno and Hiroshi Nagamochi Mohd Shahrizan Bin Othman, Aleksandar Shurbevski, Yoshiyuki Karuno and Hiroshi Nagamochi Mohd Shahrizan Bin Othman, Aleksandar Shurbevski, Yoshiyuki Karuno and Hiroshi Nagamochi Routing Problems with Last-Stretch Delivery Routing Problems with Last-Stretch Delivery Routing Problems with Last-Stretch Delivery JCDCG^3 JCDCG^3 JCDCG^3 2016/09 Refereed English Research paper(international conference proceedings) Disclose to all
Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno Approximation algorithms for a sequencing problem with a biased bipartite structure Approximation algorithms for a sequencing problem with a biased bipartite structure Approximation algorithms for a sequencing problem with a biased bipartite structure Journal of Advanced Mechanical Design, Systems, and Manufacturing, 10, 3, 1-12 Journal of Advanced Mechanical Design, Systems, and Manufacturing, 10, 3, 1-12 Journal of Advanced Mechanical Design, Systems, and Manufacturing, 10, 3, 1-12 2016/07 Refereed English Research paper(scientific journal) Disclose to all
Norhazwani Md Yunos, Aleksandar Shurbevski and Hiroshi Nagamochi Norhazwani Md Yunos, Aleksandar Shurbevski and Hiroshi Nagamochi Norhazwani Md Yunos, Aleksandar Shurbevski and Hiroshi Nagamochi A Polynomial-space Exact Algorithm for the TSP in Degree-7 Graphs A Polynomial-space Exact Algorithm for the TSP in Degree-7 Graphs A Polynomial-space Exact Algorithm for the TSP in Degree-7 Graphs AAAC 2016 AAAC 2016 AAAC 2016 2016/05 Refereed English Research paper(international conference proceedings) Disclose to all
Mohd Shahrizan Bin Othman, Aleksandar Shurbevski and Hiroshi Nagamochi Mohd Shahrizan Bin Othman, Aleksandar Shurbevski and Hiroshi Nagamochi Mohd Shahrizan Bin Othman, Aleksandar Shurbevski and Hiroshi Nagamochi Exact Algorithms for the Bipartite Traveling Salesman Problem Exact Algorithms for the Bipartite Traveling Salesman Problem Exact Algorithms for the Bipartite Traveling Salesman Problem AAAC 2016 AAAC 2016 AAAC 2016 2016/05 Refereed English Research paper(international conference proceedings) Disclose to all
Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi Morito Oomine, Aleksandar Shurbevski, Hiroshi NagamochiMorito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game Lecture Notes in Computer Science, 9627, 286-297 Lecture Notes in Computer Science, 9627, 286-297 Lecture Notes in Computer Science, 9627, 286-297 2016/03 Refereed English Research paper(international conference proceedings) Disclose to all
Norhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi Norhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi Norhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs The 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2015), 102-103 The 1The 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2015)8th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2015), 102-103 The 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2015), 102-103 2015/09 Refereed English Research paper(international conference proceedings) Disclose to all
Norhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi Norhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi Norhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi A Polynomial-Space Exact Algorithm for TSP in Degree-5 Graphs A Polynomial-Space Exact Algorithm for TSP in Degree-5 Graphs A Polynomial-Space Exact Algorithm for TSP in Degree-5 Graphs ISORA2015, 45-58 ISORA2015, 45-58 ISORA2015, 45-58 2015/08 Refereed English Research paper(international conference proceedings) Disclose to all
Aleksandar Shurbevski, Hiroshi Nagamochi and Yoshiyuki Karuno Aleksandar Shurbevski, Hiroshi Nagamochi and Yoshiyuki Karuno Aleksandar Shurbevski, Hiroshi Nagamochi and Yoshiyuki Karuno Approximation algorithms for a sequencing problem with biased bipartite structure Approximation algorithms for a sequencing problem with biased bipartite structure Approximation algorithms for a sequencing problem with biased bipartite structure Proceedings of International Symposium on Scheduling 2015 (ISS2015), 214-219 Proceedings of International Symposium on Scheduling 2015 (ISS2015), 214-219 Proceedings of International Symposium on Scheduling 2015 (ISS2015), 214-219 2015/07 Refereed English Research paper(international conference proceedings) Disclose to all
Aleksandar Shurbevski Aleksandar Shurbevski Aleksandar Shurbevski An Approximation Framework for Sequencing Problems with Bipartite Structure An Approximation Framework for Sequencing Problems with Bipartite Structure An Approximation Framework for Sequencing Problems with Bipartite Structure Kyoto University Kyoto University Kyoto University 2014/09 English Doctoral Thesis Disclose to all
Aleksandar Shurbevski,Hiroshi Nagamochi,Yoshiyuki Karuno Aleksandar Shurbevski,Hiroshi Nagamochi,Yoshiyuki Karuno Aleksandar Shurbevski,Hiroshi Nagamochi,Yoshiyuki Karuno Approximating the Bipartite TSP and Its Biased Generalization. Approximating the Bipartite TSP and Its Biased Generalization. Approximating the Bipartite TSP and Its Biased Generalization. Algorithms and Computation - 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings, 56-67 Algorithms and Computation - 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings, 56-67 Algorithms and Computation - 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings, 56-67 2014/02 Refereed English Research paper(international conference proceedings) Disclose to all
Aleksandar Shurbevski, Noriaki Hirosue, Hiroshi Nagamochi Aleksandar Shurbevski, Noriaki Hirosue, Hiroshi Nagamochi Aleksandar Shurbevski, Noriaki Hirosue, Hiroshi Nagamochi Optimization Techniques for Robot Path Planning Optimization Techniques for Robot Path Planning Optimization Techniques for Robot Path Planning Advances in Intelligent Systems and Computing, 231, 111-120 Advances in Intelligent Systems and Computing, 231, 111-120 Advances in Intelligent Systems and Computing, 231, 111-120 2013/09 Refereed English Research paper(international conference proceedings) Disclose to all
Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno The Repetitive Routing Problem Revisited The Repetitive Routing Problem Revisited The Repetitive Routing Problem Revisited ETAI 2013, A1-2 ETAI 2013, A1-2 ETAI 2013, A1-2 2013/09 Refereed English Research paper(international conference proceedings) Disclose to all
Aleksandar Shurbevski, Hiroshi Nagamochi, and Yoshiyuki Karuno Aleksandar Shurbevski, Hiroshi Nagamochi, and Yoshiyuki Karuno Aleksandar Shurbevski, Hiroshi Nagamochi, and Yoshiyuki Karuno Better Approximation Algorithms for Grasp-and-Delivery Robot Routing Problems. Better Approximation Algorithms for Grasp-and-Delivery Robot Routing Problems. Better Approximation Algorithms for Grasp-and-Delivery Robot Routing Problems. IEICE Transactions, 96-D, 3, 450-456 IEICE Transactions, 96-D, 3, 450-456 IEICE Transactions, 96-D, 3, 450-456 2013 Refereed English Disclose to all
Yoshiyuki Karuno, Aleksandar Shurbevski, Hiroshi Nagamochi Yoshiyuki Karuno, Aleksandar Shurbevski, Hiroshi Nagamochi Yoshiyuki Karuno, Aleksandar Shurbevski, Hiroshi Nagamochi Constant factor approximation algorithms for repetitive routing problems of grasp-and-delivery robots in production of printed circuit boards Constant factor approximation algorithms for repetitive routing problems of grasp-and-delivery robots in production of printed circuit boards Constant factor approximation algorithms for repetitive routing problems of grasp-and-delivery robots in production of printed circuit boards Journal of the Operations Research Society of Japan, 55, 3, 181-191 Journal of the Operations Research Society of Japan, 55, 3, 181-191 Journal of the Operations Research Society of Japan, 55, 3, 181-191 2012/09 Refereed English Research paper(scientific journal) Disclose to all
Aleksandar Shurbevski, Yoshiyuki Karuno, Hiroshi Nagamochi Aleksandar Shurbevski, Yoshiyuki Karuno, Hiroshi Nagamochi Aleksandar Shurbevski, Yoshiyuki Karuno, Hiroshi Nagamochi A Dynamic Programming Based Improvement Heuristic for a Repetitive Routing Problem of Grasp-and-Delivery Robots A Dynamic Programming Based Improvement Heuristic for a Repetitive Routing Problem of Grasp-and-Delivery Robots A Dynamic Programming Based Improvement Heuristic for a Repetitive Routing Problem of Grasp-and-Delivery Robots Journal of Advanced Mechanical Design, Systems, and Manufacturing, 6, 5, 611-621 Journal of Advanced Mechanical Design, Systems, and Manufacturing, 6, 5, 611-621 Journal of Advanced Mechanical Design, Systems, and Manufacturing, 6, 5, 611-621 2012/07 Refereed English Research paper(scientific journal) Disclose to all
Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno Improved Approximation Ratio Algorithms for Grasp-and-Delivery Robot Routing Problems Improved Approximation Ratio Algorithms for Grasp-and-Delivery Robot Routing Problems Improved Approximation Ratio Algorithms for Grasp-and-Delivery Robot Routing Problems WAAC 2012, 9-16 WAAC 2012, 9-16 WAAC 2012, 9-16 2012/07 English Research paper(research society, symposium materials, etc.) Disclose to all
Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno Heuristics for a Repetitive Routing Problem of a Single Grasp-and-Delivery Robot With an Asymmetric Edge Cost Function Heuristics for a Repetitive Routing Problem of a Single Grasp-and-Delivery Robot With an Asymmetric Edge Cost Function Heuristics for a Repetitive Routing Problem of a Single Grasp-and-Delivery Robot With an Asymmetric Edge Cost Function ETAI 2011, A1-1 ETAI 2011, A1-1 ETAI 2011, A1-1 2011/09 Refereed English Research paper(international conference proceedings) Disclose to all
Yoshiyuki Karuno, Aleksandar Shurbevski, Hiroshi Nagamochi Yoshiyuki Karuno, Aleksandar Shurbevski, Hiroshi Nagamochi Yoshiyuki Karuno, Aleksandar Shurbevski, Hiroshi Nagamochi Approximating Cyclic Routing Problems of Grasp-and-Delivery Robots in Production of Printed Circuit Boards Approximating Cyclic Routing Problems of Grasp-and-Delivery Robots in Production of Printed Circuit Boards Approximating Cyclic Routing Problems of Grasp-and-Delivery Robots in Production of Printed Circuit Boards ISS 2011, 247-252 ISS 2011, 247-252 ISS 2011, 247-252 2011/07 Refereed English Research paper(international conference proceedings) Disclose to all
Aleksandar Shurbevski, Yoshiyuki Karuno, Hiroshi Nagamochi Aleksandar Shurbevski, Yoshiyuki Karuno, Hiroshi Nagamochi Aleksandar Shurbevski, Yoshiyuki Karuno, Hiroshi Nagamochi Improved Implementation of an Approximation Algorithm with Factor Two for a Cyclic Routing Problem of Grasp-and-Delivery Robots Improved Implementation of an Approximation Algorithm with Factor Two for a Cyclic Routing Problem of Grasp-and-Delivery Robots Improved Implementation of an Approximation Algorithm with Factor Two for a Cyclic Routing Problem of Grasp-and-Delivery Robots ISS 2011, 235-240 ISS 2011, 235-240 ISS 2011, 235-240 2011/07 Refereed English Research paper(international conference proceedings) Disclose to all
Yoshiyuki Karuno, Hiroshi Nagamochi, and Aleksandar Shurbevski Yoshiyuki Karuno, Hiroshi Nagamochi, and Aleksandar Shurbevski Yoshiyuki Karuno, Hiroshi Nagamochi, and Aleksandar Shurbevski An Approximation Algorithm with Factor Two for a Repetitive Routing Problem of Grasp-and-Delivery Robots. An Approximation Algorithm with Factor Two for a Repetitive Routing Problem of Grasp-and-Delivery Robots. An Approximation Algorithm with Factor Two for a Repetitive Routing Problem of Grasp-and-Delivery Robots. JACIII, 15, 8, 1103-1108 JACIII, 15, 8, 1103-1108 JACIII, 15, 8, 1103-1108 2011 Refereed English Research paper(scientific journal) Disclose to all
Yoshiyuki Karuno, Aleksandar Shurbevski, Hiroshi Nagamochi Yoshiyuki Karuno, Aleksandar Shurbevski, Hiroshi Nagamochi Yoshiyuki Karuno, Aleksandar Shurbevski, Hiroshi Nagamochi Approximation Algorithms for a Cyclic Routing Problem of Grasp-and-Delivery Robots Approximation Algorithms for a Cyclic Routing Problem of Grasp-and-Delivery Robots Approximation Algorithms for a Cyclic Routing Problem of Grasp-and-Delivery Robots SCIS & ISIS 2010, 94-99 SCIS & ISIS 2010, 94-99 SCIS & ISIS 2010, 94-99 2010/10 Refereed English Research paper(international conference proceedings) Disclose to all

  • <<
  • >>
Title language:
Misc
Author Author(Japanese) Author(English) Title Title(Japanese) Title(English) Bibliography Bibliography(Japanese) Bibliography(English) Publication date Refereed paper Language Publishing type Disclose
Mohd Shahrizan bin Othman, Aleksandar Shurbevski, Hiroshi Nagamochi Mohd Shahrizan bin Othman, Aleksandar Shurbevski, Hiroshi Nagamochi Mohd Shahrizan bin Othman, Aleksandar Shurbevski, Hiroshi Nagamochi Approximation Algorithms for the Traveling Salesman with a Drone Approximation Algorithms for the Traveling Salesman with a Drone Approximation Algorithms for the Traveling Salesman with a Drone 164th Algorithm Research Meeting 第164回アルゴリズム研究会 164th Algorithm Research Meeting 2017/09 English Research paper Disclose to all
Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game Summer LA 2016 夏のLA 2016 Summer LA 2016 2016/07/21 English Summary of the papers read (national conference and other science council) Disclose to all
Title language:
Conference Activities & Talks
Title Title(Japanese) Title(English) Conference Conference(Japanese) Conference(English) Promotor Promotor(Japanese) Promotor(English) Date Language Assortment Disclose
Efficient Algorithms for Tackling Computationally Challenging Problems[Invited] Efficient Algorithms for Tackling Computationally Challenging Problems [Invited] Efficient Algorithms for Tackling Computationally Challenging Problems [Invited] Seminar on Informatics in Asia 2015 Seminar on Informatics in Asia 2015 2015/09/15 English Oral presentation(general) Disclose to all
Title language:
External funds: competitive funds and Grants-in-Aid for Scientific Research (Kakenhi)
Type Position Title(Japanese) Title(English) Period
基盤研究 Assignment グラフ理論的手法に基づく離散最適化アルゴリズムの設計 Design of Combinatorial Optimization Algorithms Based on Graph Theory 2017/04/01-2020/03/31
External funds: other than those above
System Main person Title(Japanese) Title(English) Period
京都大学教育研究振興財団 Aleksandar Shurbevski 協調的ルーティング問題に対する新規モデルと解法の構築 Novel Models and Solution Methods for Collaborative Routing Problems 2017/06/01-2018/03/31
Teaching subject(s)
Name(Japanese) Name(English) Term Department Period
数理工学セミナー Seminar on Applied Mathematics and Physics 後期 工学部 2015/04-2016/03
数理工学実験 Applied Mathematics and Physics Laboratory 後期 工学部 2015/04-2016/03
数理工学セミナー Seminar on Applied Mathematics and Physics 後期 工学部 2016/04-2017/03
計画数学通論 Operations Research, Advanced 後期 情報学研究科 2016/04-2017/03
数理工学セミナー Seminar on Applied Mathematics and Physics 後期 工学部 2017/04-2018/03
数理工学実験 Applied Mathematics and Physics Laboratory 後期 工学部 2017/04-2018/03
計画数学通論 Operations Research, Advanced 後期 情報学研究科 2017/04-2018/03
数理工学実験 Applied Mathematics and Physics Laboratory 後期 工学部 2018/04-2019/03
計画数学通論 Operations Research, Advanced 後期 情報学研究科 2018/04-2019/03
数理工学セミナー Seminar on Applied Mathematics and Physics 後期 工学部 2019/04-2020/03
数理工学実験 Applied Mathematics and Physics Laboratory 後期 工学部 2019/04-2020/03
計画数学通論 Operations Research, Advanced 後期 情報学研究科 2019/04-2020/03

  • <<
  • >>
Faculty management (title, position)
Title Period
広報WG委員 2015/04/01-2017/03/31
情報セキュリティWG委員 2018/04/01-2019/03/31
システム運用WG委員 2018/04/01-2019/03/31
図書WG委員(兼任 数理コース) 2019/04/01-2020/03/31
Academic organizations (editor, editing team)
Organization name(Japanese) Organization name(English) Journal name(Japanese) Journal name(English) Title Period
日本オペレーションズ・リサーチ学会 The Operation Research Society of Japan Journal of the Operations Research Society of Japan Journal of the Operations Research Society of Japan Associate Editor 2017/04/01-2019/03/31
Academic organizaions (peer-reviewer)
Organization name(Japanese) Organization name(English) Journal name(Japanese) Journal name(English) Period
The European Journal of Operational Research (EJOR) The European Journal of Operational Research (EJOR) 2015-
International Symposium on Algorithms and Computation (ISAAC) International Symposium on Algorithms and Computation (ISAAC) 2015-
Theory of Computing Systems (TOCS) Theory of Computer Systems (TOCS) 2016-
Academic organizaions (conference administrator)
Organization name Group name Title Period
日本オペレーションズ・リサーチ学会 日本オペレーションズ・リサーチ学会 2020年春季研究発表会 実行委員 2018-2020
CBEES ICoMS 2019 Technical Program Committee 2018-2019
FCSE, St. Cyril and Methodius University CIIT 2019 Program Committee 2019-2019
CBEES ICoMS 2018 Technical Program Committee 2018-2018
FCSE, St. Cyril and Methodius University CIIT 2018 Program Committee 2018-2018
Academic organizaions (conference chair)
Organization name Group name Date
IEEE International Conference on Logistics, Informatics and Service Sciences (LISS'2017) 2017/07/
IEEE International Conference on Industrial Economics System and Industrial Security Engineering (IEIS'2017) 2017/07/
Other activities (primary and secondary education)
Title Activity School Prefecture Date
Super Science High School Program Scientific Advisor 膳所高等学校 滋賀県 2019/01/