ホーム > 小林佑輔/ Kobayashi, Yusuke

小林佑輔

ALUMNI 2025年8月現在、筑波大学が主たる所属機関ではありません

Kobayashi, Yusuke

京都大学 , 数理解析研究所 , 准教授
Kyoto University , Research Institute for Mathematical Sciences , Associate Professor

オープンアクセス版の論文は「つくばリポジトリ」で読むことができます。

61. Fixed-Parameter Algorithms for Graph Constraint Logic Tatsuhiko Hatanaka; Felix Hommelsheim; Takehiro Ito; Yusuke Kobayashi (+1 著者) Akira Suzuki
Proceedings of the 15th International Symposium on Parameterized and Exact Computation (IPEC 2020) 15:1 (2020) Semantic Scholar
62. Linear-Time Recognition of Double-Threshold Graphs Yusuke Kobayashi; Yoshio Okamoto; Yota Otachi; Yushi Uno
Proceedings of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2020) 286 (2020) Semantic Scholar
63. Market Pricing for Matroid Rank Valuations. Kristóf Bérczi; Naonori Kakimura; Yusuke Kobayashi 0001
CoRR abs/2007.08759: (2020)
64. An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. Yuuki Aoike; Tatsuya Gima; Tesshu Hanaka; Masashi Kiyomi (+3 著者) Yota Otachi
CoRR abs/2012.04910: (2020)
65. Minimum-Cost b-Edge Dominating Sets on Trees. Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke KobayashiYoshio Okamoto
Algorithmica 81: 343 (2019) Semantic Scholar
66. Two disjoint shortest paths problem with non-negative edge length. Yusuke Kobayashi 0001; Ryo Sako
Oper. Res. Lett. 47: 66 (2019) Semantic Scholar
67. Reconfiguration of maximum-weight b-matchings in a graph. Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke KobayashiYoshio Okamoto
J. Comb. Optim. 37: 454 (2019) Semantic Scholar
68. Algorithms for Gerrymandering over Graphs. Takehiro Ito; Naoyuki Kamiyama; Yusuke Kobayashi 0001; Yoshio Okamoto
Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019) 1413 (2019)
69. Diameter of Colorings Under Kempe Changes. Marthe Bonamy; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi 0001 (+3 著者) Kunihiro Wasa
Proceedings of the 25th Annual International Computing and Combinatorics Conference (COCOON 2019) 52 (2019) Semantic Scholar
70. An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number. Yasuaki Kobayashi; Yusuke Kobayashi; Shuichi Miyazaki; Suguru Tamaki
Proceedings of the 30th International Workshop on Combinatorial Algorithms (IWOCA 2019) 327 (2019) Semantic Scholar
71. The Perfect Matching Reconfiguration Problem. Marthe Bonamy; Nicolas Bousquet; Marc Heinrich; Takehiro Ito (+3 著者) Kunihiro Wasa
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) 80 (2019) Semantic Scholar
72. Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke KobayashiYoshio Okamoto
Proceedings of the 27th European Symposium on Algorithms (ESA 2019) 61 (2019) Semantic Scholar
73. Parameterized Algorithms for Maximum Cut with Connectivity Constraints. Hiroshi Eto; Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi
Proceedings of the 14th International Symposium on Parameterized and Exact Computation (IPEC 2019) 13:1 (2019) Semantic Scholar
74. Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. Yoichi Iwata; Yusuke Kobayashi
Proceedings of the 14th International Symposium on Parameterized and Exact Computation (IPEC 2019) 22:1 (2019) Semantic Scholar
75. Optimal cache placement for an academic backbone network Than Nguyen Hau; Naonori Kakimura; Ken-Ichi Kawarabayashi; Yusuke Kobayashi (+1 著者) Yu Yokoi
Journal of the Operations Research Society of Japan 61: 197 (2018) Semantic Scholar
76. All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs Ken-ichi Kawarabayashi; Yusuke Kobayashi
SIAM Journal on Computing 47: 1483 (2018)
77. NP-hardness and fixed-parameter tractability of the minimum spanner problem Yusuke Kobayashi
Theoretical Computer Science 746: 88 (2018)
78. 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 (2018)
79. Tight Approximability of the Server Allocation Problem for Real-Time Applications Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi (+1 著者) Taichi Shiitada
Algorithmic Aspects of Cloud Computing 41 (2018) Semantic Scholar
80. The parity Hamiltonian cycle problem Hiroshi Nishiyama; Yusuke Kobayashi; Yukiko Yamauchi; Shuji KijimaMasafumi Yamashita
Discrete Mathematics 341: 606 (2018) Semantic Scholar