Email: tnoguchi [at] kurims.kyoto-u.ac.jp or takashi.n.000412 [at] gmail.com
I am Takashi Noguchi, a first-year doctoral student in Discrete Optimization Group at Research Institute for Mathematical Sciences and I am fortunate to be advised by Yusuke Kobayashi. I have a interest in combinatorial optimization and graph theory.
CV
March 2023, Bachelor of Science, Kyoto University
March 2025, Master of Science, Kyoto University
April 2025-, DoGS Fellow, Kyoto University
Publications
As is the convention in theoretical computer science, authors are listed alphabetically.
An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-Cover
Yusuke Kobayashi, Takashi Noguchi.
Proceedings of International Symposium on Algorithms and Computation (ISAAC 2023), pp. 49:1-49:10.
Validating a PTAS for Triangle-Free 2-Matching via a Simple Decomposition Theorem
Yusuke Kobayashi, Takashi Noguchi.
Proceedings of Symposium on Simplicity in Algorithms (SOSA 2025), pp. 281-289.