Yusuke Kobayashi

Profile Information

Affiliation: Associate Professor, Research Institute for Mathematical Sciences, Kyoto University

Degree: 博士（情報理工学）(東京大学)

Researcher number: 40581591
ORCID ID: https://orcid.org/0000-0001-9478-7307
J-GLOBAL ID: 201701001400401915
researchmap Member ID: B000281981

External link: http://www.kurims.kyoto-u.ac.jp/~yusuke/

Research Areas

Informatics / Mathematical informatics /

Research History

Associate Professor, Kyoto University Research Institute for Mathematical Sciences

Papers

125

On reachable assignments under dichotomous preferences

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki

Theoretical Computer Science, 979 114196-114196, Nov, 2023
Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints.

Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi 0001, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa

Algorithmica, 85(9) 2779-2816, Sep, 2023
Fixed-parameter algorithms for graph constraint logic.

Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi 0001, Moritz Mühlenthaler, Akira Suzuki

Theor. Comput. Sci., 959 113863-113863, May, 2023
Algorithmic Theory of Qubit Routing.

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Yoshio Okamoto

WADS, 533-546, 2023
Optimal General Factor Problem and Jump System Intersection.

Yusuke Kobayashi 0001

Integer Programming and Combinatorial Optimization - 24th International Conference(IPCO), 291-305, 2023
Reconfiguration of Time-Respecting Arborescences.

Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi 0001, Shun-ichi Maezawa, Akira Suzuki

WADS, 521-532, 2023
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems.

Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi 0001, Kazuhiro Kurita, Yota Otachi

AAAI, 3968-3976, 2023
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra.

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto

ICALP, 82-17, 2023
Rerouting Planar Curves and Disjoint Paths.

Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi 0001, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki

ICALP, 81-19, 2023
Reconfiguration of Colorings in Triangulations of the Sphere.

Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi 0001, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki

SoCG, 43-16, 2023
Trade-offs among degree, diameter, and number of paths.

Toshimasa Ishii, Akitoshi Kawamura, Yusuke Kobayashi, Kazuhisa Makino

Discret. Appl. Math., 327 96-100, 2023 Peer-reviewed
On Reachable Assignments Under Dichotomous Preferences

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki

PRIMA 2022: Principles and Practice of Multi-Agent Systems, 650-658, 2023 Peer-reviewed
Reforming an Envy-Free Matching

Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki

Proceedings of the AAAI Conference on Artificial Intelligence, 36(5) 5084-5091, Jun 28, 2022 Peer-reviewed
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

SIAM Journal on Discrete Mathematics, 36(2) 1102-1123, Jun, 2022 Peer-reviewed
A Parameterized View to the Robust Recoverable Base Problem of Matroids Under Structural Uncertainty

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

Operations Research Letters, May, 2022 Peer-reviewed
Linear-Time Recognition of Double-Threshold Graphs

Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno

Algorithmica, 84(4) 1163-1181, Apr, 2022 Peer-reviewed
Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles

Yusuke Kobayashi

Mathematical Programming, 192(1-2) 675-702, Mar, 2022 Peer-reviewed
Parameterized Complexity of (A, ℓ )-Path Packing.

Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi

Algorithmica, 84(4) 871-895, 2022 Peer-reviewed
Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint.

Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa

STACS, 15-21, 2022 Peer-reviewed
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams.

Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki

SODA, 1342-1355, 2022 Peer-reviewed

Misc.

無制約XOS関数最大化に対する最適近似アルゴリズム

河瀬康志, 小林佑輔, 山口勇太郎

日本応用数理学会年会講演予稿集(CD-ROM), 2019, 2019

Research Projects

Graph Algorithms and Optimization: Theory and Scalable Algorithms

Grants-in-Aid for Scientific Research, Grant-in-Aid for Scientific Research (S), Japan Society for the Promotion of Science, Apr, 2022 - Mar, 2027
Development of Combinatorial Reconfiguration by Mathematics Approach: From Examples to New Methods

Grants-in-Aid for Scientific Research, Grant-in-Aid for Transformative Research Areas (B), Japan Society for the Promotion of Science, Oct, 2020 - Mar, 2023
走行税課金による道路インフラ維持管理－ＥＶ化と車両認証のデジタル時代を迎えて－

科学研究費助成事業, 挑戦的研究(開拓), 日本学術振興会, Apr, 2020 - Mar, 2023

大澤義明, 城所幸弘, 栗野盛光, 小林佑輔, 櫻井一宏, 小林隆史, 和田健太郎, 高野祐一

Profile Information

Research Areas

Research History

Papers

Misc.

Research Projects

Menu

Coauthors