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

小林佑輔

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

Kobayashi, Yusuke

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

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

21. A Parameterized View to the Robust Recoverable Base Problem of Matroids Under Structural Uncertainty Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke KobayashiYoshio Okamoto
Operations Research Letters (2022) Semantic Scholar
22. Linear-Time Recognition of Double-Threshold Graphs Yusuke Kobayashi; Yoshio Okamoto; Yota Otachi; Yushi Uno
Algorithmica 84: 1163 (2022) Semantic Scholar
23. Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles Yusuke Kobayashi
Mathematical Programming 192: 675 (2022) Semantic Scholar
24. Parameterized Complexity of (A, ℓ )-Path Packing. Rémy Belmonte; Tesshu Hanaka; Masaaki Kanzaki; Masashi Kiyomi (+4 著者) Yota Otachi
Algorithmica 84: 871 (2022) Semantic Scholar
25. Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. Nicolas Bousquet; Takehiro Ito; Yusuke Kobayashi; Haruka Mizuta (+2 著者) Kunihiro Wasa
STACS 15 (2022)
26. Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama (+4 著者) Kenta Ozeki
SODA 1342 (2022)
27. Rerouting Planar Curves and Disjoint Paths. Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Yusuke Kobayashi 0001 (+3 著者) Kenta Ozeki
CoRR abs/2210.11778: (2022) Semantic Scholar
28. Computing the Largest Bond and the Maximum Connected Cut of a Graph Gabriel L. Duarte; Hiroshi Eto; Tesshu Hanaka; Yasuaki Kobayashi (+4 著者) Uéverton S. Souza
Algorithmica 83: 1421 (2021) Semantic Scholar
29. Algorithms for gerrymandering over graphs Takehiro Ito; Naoyuki Kamiyama; Yusuke Kobayashi; Yoshio Okamoto
Theoretical Computer Science 868: 30 (2021) Semantic Scholar
30. Finding a maximum minimal separator: Graph classes and fixed-parameter tractability Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi; Tsuyoshi Yagita
Theoretical Computer Science 865: 131 (2021) Semantic Scholar
31. Tight Approximation for Unconstrained XOS Maximization Yuval Filmus; Yasushi Kawase; Yusuke Kobayashi; Yutaro Yamaguchi
Mathematics of Operations Research (2021) Semantic Scholar
32. Submodular reassignment problem for reallocating agents to tasks with synergy effects Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yoshio Okamoto
Discrete Optimization 44: 100631 (2021) Semantic Scholar
33. A Weighted Linear Matroid Parity Algorithm Satoru Iwata; Yusuke Kobayashi
SIAM Journal on Computing STOC17:238 (2021)
34. Market Pricing for Matroid Rank Valuations. Kristóf Bérczi; Naonori Kakimura; Yusuke Kobayashi
SIAM Journal on Discrete Mathematics 35: 2662 (2021)
35. Subgraph Isomorphism on Graph Classes that Exclude a Substructure Hans L. Bodlaender; Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi (+2 著者) Tom C. van der Zanden
Algorithmica 82: 3566 (2020) Semantic Scholar
36. Diameter of colorings under Kempe changes Marthe Bonamy; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi (+3 著者) Kunihiro Wasa
Theoretical Computer Science 838: 45 (2020) Semantic Scholar
37. On the number of edges in a graph with many two-hop disjoint paths Koki Takayama; Yusuke Kobayashi
Discrete Applied Mathematics 283: 718 (2020) Semantic Scholar
38. 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)
39. Market Pricing for Matroid Rank Valuations. Kristóf Bérczi; Naonori Kakimura; Yusuke Kobayashi 0001
CoRR abs/2007.08759: (2020)
40. 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