Research theme for competitive and other funds (13):
2024 - 2028 Establishing Basic Theory toward End-to-End Combinatorial Optimization
2021 - 2026 Theory and algorithms for combinatorial optimization under uncertainty
2021 - 2026 Theory and algorithms for combinatorial optimization under uncertainty
2020 - 2025 New computational models for algorithms and discrete optimization
2021 - 2024 Study on network design theory for advanced computer communication
2017 - 2021 Adaptive optimization for decision making from dynamic and uncertain data
2017 - 2020 Development of practical combinatorial optimization algorithms by speeding up the continuous relaxation method
2013 - 2016 Approximation algorithms based on the iterative rounding method
2011 - 2013 Algorithm design techniques based on transformation into network structure
2011 - 2012 離散最適化問題に対する効率的なアルゴリズムの研究
2008 - 2012 Research on algorithms for general network design problems
2008 - 2010 Construction of Plat-form Models for the Problemof Packing Geometrical Objects
2007 - 2008 Algorithms on the set-connectivity of graphs
Show all
Papers (77):
Kensuke Oowa, Peter Fulla, Takuro Fukunaga. A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering. Algorithms and Complexity. CIAC 2025. Lecture Notes in Computer Science. 2025. 15680. 104-120
Koji Ichikawa, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi. New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem. AAAI. 2024. 12708-12716
Koji Ichikawa, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi. New classes of the greedy-applicable arm feature distributions in the sparse linear bandit problem. CoRR. 2023. abs/2312.12400
Takuro Fukunaga. Integrality Gap of Time-Indexed Linear Programming Relaxation for Coflow Scheduling. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022), Leibniz International Proceedings in Informatics (LIPIcs). 2022. 245. 36:1-36:13