Yusuke Kobayashi

Yusuke Kobayashi is an Associate Professor at the Research Institute for Mathematical Sciences (RIMS), Kyoto University. His research focuses on graph algorithms, combinatorial optimization, and discrete structures such as matroids, jump systems, and discrete convex functions. He has contributed to problems involving network design, disjoint paths, and fair allocation of indivisible goods.

• Education:
  • Bachelor, Master, and Ph.D. in Information Science and Technology from the University of Tokyo (2005, 2007, 2010).
• Research Interests:
  • Graph Algorithms: Network design, disjoint paths, and reconfiguration problems.
  • Discrete Structures: Matroid theory, jump systems, and discrete convexity.
  • Combinatorial Optimization: Applications to fair division, social welfare, and graph connectivity.
• Article Trends:

  Kobayashi’s recent work spans reconfiguration problems (e.g., colorings, matchings), fair allocation (EFX criteria), and quantum routing. His research often bridges graph theory with algorithmic applications, emphasizing structural properties like planarity and 4-edge-connectedness.

• Scientific Awards:
  • Japan Operations Research Society Student Paper Award (2005).
  • University of Tokyo Dean’s Award (2010).
  • STOC Best Paper Award (2017).
  • MEXT Young Scientists' Award (2020).
  • Operations Research Society of Japan Research Award (2023).
• Grants and Collaborations:

  His work has been supported by the Japan Society for the Promotion of Science (JSPS) and involves collaborations with researchers in Japan and Hungary (e.g., Kristóf Bérczi, Naonori Kakimura).