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

小林佑輔

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

Kobayashi, Yusuke

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

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

41. 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
42. Market Pricing for Matroid Rank Valuations Kristóf Bérczi; Naonori Kakimura; Yusuke Kobayashi
Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC 2020) 39:1 (2020) Semantic Scholar
43. Reconfiguration of Spanning Trees with Many or Few Leaves Nicolas Bousquet; Takehiro Ito; Yusuke Kobayashi; Haruka Mizuta (+2 著者) Kunihiro Wasa
Proceedings of the 28th European Symposium on Algorithms (ESA 2020) 24:1 (2020) Semantic Scholar
44. Shortest Reconfiguration of Colorings Under Kempe Changes. Marthe Bonamy; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi (+3 著者) Kunihiro Wasa
Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020) 35:1 (2020) Semantic Scholar
45. Finding a path with two labels forbidden in group-labeled graphs. Yasushi Kawase; Yusuke Kobayashi; Yutaro Yamaguchi
J. Comb. Theory, Ser. B 143: 65 (2020) Semantic Scholar
46. Linear min-max relation between the treewidth of an H-minor-free graph and its largest grid minor. Ken-ichi Kawarabayashi; Yusuke Kobayashi
J. Comb. Theory, Ser. B 141: 165 (2020) Semantic Scholar
47. A strongly polynomial time algorithm for the maximum supply rate problem on trees. Koki Takayama; Yusuke Kobayashi
Theor. Comput. Sci. 806: 323 (2020) Semantic Scholar
48. Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles. Yusuke Kobayashi
Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO 2020) 280 (2020) Semantic Scholar
49. Complexity of the multi-service center problem. Takehiro Ito; Naonori Kakimura; Yusuke Kobayashi 0001
Theor. Comput. Sci. 842: 18 (2020) Semantic Scholar
50. The Steiner Problem for Count Matroids Tibor Jordán; Yusuke Kobayashi; Ryoga Mahara; Kazuhisa Makino
Proceedings of the 31st International Workshop on Combinatorial Algorithms (IWOCA 2020) 330 (2020) Semantic Scholar
51. Parameterized Complexity of (A, ℓ )-Path Packing Rémy Belmonte; Tesshu Hanaka; Masaaki Kanzaki; Masashi Kiyomi (+4 著者) Yota Otachi
Proceedings of the 31st International Workshop on Combinatorial Algorithms (IWOCA 2020) 43 (2020) Semantic Scholar
52. An FPT Algorithm for Minimum Additive Spanner Problem. Yusuke Kobayashi
Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020) 11:1 (2020) Semantic Scholar
53. 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
54. 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
55. 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)
56. 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
57. Two disjoint shortest paths problem with non-negative edge length. Yusuke Kobayashi 0001; Ryo Sako
Oper. Res. Lett. 47: 66 (2019) Semantic Scholar
58. Minimum-Cost b-Edge Dominating Sets on Trees. Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke KobayashiYoshio Okamoto
Algorithmica 81: 343 (2019) Semantic Scholar
59. 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
60. 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