小林 佑輔

J-GLOBALへ         更新日: 19/06/03 08:51
 
アバター
研究者氏名
小林 佑輔
URL
http://www.kurims.kyoto-u.ac.jp/~yusuke/
所属
京都大学
部署
数理解析研究所
職名
准教授
学位
博士(情報理工学)(東京大学)
科研費研究者番号
40581591
ORCID ID
0000-0001-9478-7307

経歴

 
 
   
 
京都大学 数理解析研究所 准教授
 

論文

 
Algorithms for gerrymandering over graphs
Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019)   1413-1421   2019年   [査読有り]
Reconfiguration of maximum-weight b-matchings in a graph
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
Journal of Combinatorial Optimization   37 454-464   2019年   [査読有り]
Two disjoint shortest paths problem with non-negative edge length
Yusuke Kobayashi and Ryo Sako
Operations Research Letters   47 66-69   2019年   [査読有り]
Minimum-cost b-edge dominating sets on trees
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
Algorithmica   81 343-366   2019年   [査読有り]
NP-hardness and fixed-parameter tractability of the minimum spanner problem
Yusuke Kobayashi
Theoretical Computer Science   746 88-97   2018年   [査読有り]
All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs
Ken-ichi Kawarabayashi and Yusuke Kobayashi
SIAM Journal on Computing   47 1483-1504   2018年   [査読有り]
The parity Hamiltonian cycle problem
Hiroshi Nishiyama, Yusuke Kobayashi, Yukiko Yamauchi, Shuji Kijima, and Masafumi Yamashita
Discrete Mathematics   341 606-626   2018年   [査読有り]
Than Nguyen Hau, Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi, Tatsuya Matsuoka, Yu Yokoi
Journal of the Operations Research Society of Japan   61 197-216   2018年   [査読有り]
A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees.
Koki Takayama,Yusuke Kobayashi
Proceedings of the 12th International Frontiers of Algorithmics Workshop (FAW 2018)   54-67   2018年   [査読有り]
Finding a shortest non-zero path in group-labeled graphs via permanent computation
Yusuke Kobayashi and Sho Toyooka
Algorithmica   77 1128-1142   2017年   [査読有り]
Packing edge-disjoint odd Eulerian subgraphs through prescribed vertices in 4-edge-connected graphs
Naonori Kakimura, Ken-ichi Kawarabayashi, and Yusuke Kobayashi
SIAM Journal on Discrete Mathematics   31 766-782   2017年   [査読有り]
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
Theoretical Computer Science   677 69-82   2017年   [査読有り]
Kristóf Bérczi and Yusuke Kobayashi
Discrete Applied Mathematics   226 10-16   2017年   [査読有り]
Yusuke Kobayashi and Kenjiro Takazawa
Theoretical Computer Science   699 53-62   2017年   [査読有り]
Complexity of the multi-service center problem
Takehiro Ito, Naonori Kakimura, and Yusuke Kobayashi
Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017)   48:1-48:12   2017年   [査読有り]
The directed disjoint shortest paths problem
Kristóf Bérczi and Yusuke Kobayashi
Proceedings of the 25th European Symposium on Algorithms (ESA 2017)   13:1-13:13   2017年   [査読有り]
Tight approximability of the server allocation problem for real-time applications
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, and Taichi Shiitada
Proceedings of the 3rd International Workshop on Algorithmic Aspects of Cloud Computing (Algocloud 2017)   41-55   2017年   [査読有り]
Reconfiguration of maximum-weight b-matchings in a graph
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
Proceedings of the 23rd Annual International Computing and Combinatorics Conference (COCOON 2017)   287-296   2017年   [査読有り]
A weighted linear matroid parity algorithm
Satoru Iwata and Yusuke Kobayashi
Proceedings of the 49th ACM Symposium on Theory of Computing (STOC 2017)   264-276   2017年   [査読有り]
Ken-ichi Kawarabayashi and Yusuke Kobayashi
ACM Transactions on Algorithms   13 no. 5   2016年   [査読有り]