Two-level hub Steiner trees. Reviewed

Takuro Fukunaga, R. Ravi, Oleksandr Rudenko, Ziye Tang

Inf. Process. Lett.   174   106209 - 106209   2022

Approximation algorithm for the 2-stage stochastic matroid base problem. Reviewed

Takuro Fukunaga, R. Ravi, Oleksandr Rudenko, Ziye Tang

Operations Research Letters   50 ( 2 )   129 - 132   2022

Online Task Assignment Problems with Reusable Resources.

Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi

AAAI   5199 - 5207   2022

Approximation algorithms for a generalization of the maximum budget allocation Reviewed

Takuro Fukunaga

Journal of the Operations Research Society of Japan   64 ( 1 )   31 - 44   2021.1

End-to-End Learning for Prediction and Optimization with Gradient Boosting Reviewed

Takuya Konishi, Takuro Fukunaga

Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2020. Lecture Notes in Computer Science   12459   191 - 207   2021

Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. Reviewed

Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi

Thirty-Fifth AAAI Conference on Artificial Intelligence(AAAI)   9791 - 9798   2021

A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits Reviewed

Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi

Artificial Intelligence and Statistics (AISTATS) 2021   3367 - 3375   2021

Accurate Contention-aware Scheduling Method on Clustered Many-core Platform Reviewed

Shingo Igarashi, Takuro Fukunaga, Takuya Azumi

Journal of Information Processing   29   216 - 226   2021

Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions Reviewed

Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi

AAAI2021   abs/2101.07957   2021

Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs Reviewed

Takuro Fukunaga

IEEE/ACM Transactions on Networking   28 ( 1 )   387 - 398   2020.2

Accurate Contention Estimate Scheduling Method Using Multiple Clusters of Many-core Platform. Reviewed

Shingo Igarashi, Yuto Kitagawa, Takuro Fukunaga, Takuya Azumi

2020 28th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP)   67 - 71   2020

Delay and Cooperation in Nonstochastic Linear Bandits Reviewed

Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi

Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020   2020

Contention-Free Scheduling for Clustered Many-Core Platform. Reviewed

Ryotaro Koike, Takuro Fukunaga, Shingo Igarashi, Takuya Azumi

Proceedings of the 16th IEEE International Conference on Embedded Software and Systems (ICESS)   1 - 8   2020

Improved Regret Bounds for Bandit Combinatorial Optimization Reviewed

Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi

Advances in Neural Information Processing Systems   32   12027 - 12036   2019.12

Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback Reviewed

Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi

Advances in Neural Information Processing Systems   32   10589 - 10598   2019.12

Computing a tree having a small vertex cover Reviewed

Takuro Fukunaga, Takanori Maehara

Theoretical Computer Science   791   48 - 61   2019.10

Submodular maximization under uncertain knapsack constraints Reviewed

Yasushui Kawase, Hanna Sumita, Takuro Fukunaga

SIAM Journal on Discrete Mathematics   33 ( 3 )   1121 - 1145   2019.7

LP-based pivoting algorithm for higher-order correlation clustering Reviewed

Takuro Fukunaga

Journal of Combinatorial Optimization   37 ( 4 )   1312 - 1326   2019.5

Stochastic Submodular Maximization with Performance-Dependent Item Costs Reviewed

Takuro Fukunaga, Takuya Konishi, Sumio Fujita, Ken-ichi Kawarabayashi

Thirty-Third AAAI Conference on Artificial Intelligence   1485 - 1494   2019.1

Approximation Algorithms for Highly Connected Multi-dominating Sets in Unit Disk Graphs Reviewed

Takuro Fukunaga

Algorithmica   80 ( 11 )   3270 - 3292   2018.11

LP-Based Pivoting Algorithm for Higher-Order Correlation Clustering. Reviewed

Takuro Fukunaga

Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings   51 - 62   2018

Regret Bounds for Online Portfolio Selection with a Cardinality Constraint. Reviewed

Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi

Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, 3-8 December 2018, Montréal, Canada.   10611 - 10620   2018

Boosting PageRank Scores by Optimizing Internal Link Structure. Reviewed

Naoto Ohsaka, Tomohiro Sonobe, Naonori Kakimura, Takuro Fukunaga, Sumio Fujita, Ken-ichi Kawarabayashi

Database and Expert Systems Applications - 29th International Conference, DEXA 2018, Regensburg, Germany, September 3-6, 2018, Proceedings, Part I   424 - 439   2018

Online Regression with Partial Information: Generalization and Linear Projection. Reviewed

Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi

International Conference on Artificial Intelligence and Statistics, AISTATS 2018, 9-11 April 2018, Playa Blanca, Lanzarote, Canary Islands, Spain   1599 - 1607   2018

Submodular Maximization with Uncertain Knapsack Capacity. Reviewed

Yasushi Kawase, Hanna Sumita, Takuro Fukunaga

13th Latin American Theoretical Informatics Symposium (LATIN 2018)   653 - 668   2018

Causal Bandits with Propagating Inference. Reviewed

Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi

Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Stockholmsmässan, Stockholm, Sweden, July 10-15, 2018   5508 - 5516   2018

Spider Covers for Prize-Collecting Network Activation Problem. Reviewed

Takuro Fukunaga

ACM Transactions on Algorithms   13 ( 4 )   49:1-49:31   2017.12

Virtual machine placement for minimizing connection cost in data center networks Reviewed

Takuro Fukunaga, Shuichi Hirahara, Hiyori Yoshikawa

DISCRETE OPTIMIZATION   26   183 - 198   2017.11

Online Optimization of Video-Ad Allocation. Reviewed

Hanna Sumita, Yasushi Kawase, Sumio Fujita, Takuro Fukunaga

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017   423 - 429   2017

Scalable Algorithm for Higher-Order Co-Clustering via Random Sampling. Reviewed

Daisuke Hatano, Takuro Fukunaga, Takanori Maehara, Ken-ichi Kawarabayashi

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA.   1992 - 1999   2017

Spider Covering Algorithms for Network Design Problems Invited

Takuro Fukunaga

Combinatorial Optimization and Graph Algorithms: Communications of NII Shonan Meetings   43 - 66   2017

Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation. Reviewed

Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi

Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 4-9 December 2017, Long Beach, CA, USA   4102 - 4111   2017

Covering problems in edge- and node-weighted graphs Reviewed

Takuro Fukunaga

DISCRETE OPTIMIZATION   20   40 - 61   2016.5

APPROXIMATING THE GENERALIZED TERMINAL BACKUP PROBLEM VIA HALF-INTEGRAL MULTIFLOW RELAXATION Reviewed

Takuro Fukunaga

SIAM JOURNAL ON DISCRETE MATHEMATICS   30 ( 2 )   777 - 800   2016

Adaptive Budget Allocation for Maximizing Influence of Advertisements. Reviewed

Daisuke Hatano, Takuro Fukunaga, Ken-ichi Kawarabayashi

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016   3600 - 3608   2016

Computing a tree having a small vertex cover Reviewed

Takuro Fukunaga, Takanori Maehara

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   10043   77 - 91   2016

Approximating the generalized terminal backup problem via half-integral multiflow relaxation Reviewed

Takuro Fukunaga

Leibniz International Proceedings in Informatics, LIPIcs   30   316 - 328   2015.2

Threshold influence model for allocating advertising budgets Reviewed

Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, Naonori Kakimura

ICML   1395 - 1404   2015

Spider covers for prize-collecting network activation problem. Reviewed

Takuro Fukunaga

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015   9 - 24   2015

Virtual Machine Placement for Minimizing Connection Cost in Data Center Networks Reviewed

Takuro Fukunaga, Shuichi Hirahara, Hiyori Yoshikawa

2015 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS)   486 - 491   2015

Lagrangian Decomposition Algorithm for Allocating Marketing Channels. Reviewed

Daisuke Hatano, Takuro Fukunaga, Takanori Maehara, Ken-ichi Kawarabayashi

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA.   1144 - 1150   2015

ITERATIVE ROUNDING APPROXIMATION ALGORITHMS FOR DEGREE-BOUNDED NODE-CONNECTIVITY NETWORK DESIGN Reviewed

Takuro Fukunaga, Zeev Nutov, R. Ravi

SIAM JOURNAL ON COMPUTING   44 ( 5 )   1202 - 1229   2015

Deliver or hold: Approximation algorithms for the periodic inventory routing problem Reviewed

Takuro Fukunaga, Afshin Nikzad, R. Ravi

Leibniz International Proceedings in Informatics, LIPIcs   28   209 - 225   2014.9

Covering Problems in Edge- and Node-Weighted Graphs Reviewed

Takuro Fukunaga

Algorithm Theory - SWAT 2014   8503   217 - 228   2014

Unranking of small combinations from large sets Reviewed

Toshihiro Shimizu, Takuro Fukunagaa, Hiroshi Nagamochi

Journal of Discrete Algorithms   29 ( C )   8 - 20   2014

Computing minimum multiway cuts in hypergraphs Reviewed

Takuro Fukunaga

DISCRETE OPTIMIZATION   10 ( 4 )   371 - 382   2013.11

Approximating minimum cost source location problems with local vertex-connectivity demands Reviewed

Takuro Fukunaga

Journal of Discrete Algorithms   19   30 - 38   2013.3

Graph orientations with set connectivity requirements Reviewed

Takuro Fukunaga

DISCRETE MATHEMATICS   312 ( 15 )   2349 - 2355   2012.8

Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems Reviewed

Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi

ALGORITHMICA   62 ( 3-4 )   787 - 806   2012.4

Iterative rounding approximation algorithms for degree-bounded node-connectivity network design Reviewed

Takuro Fukunaga, R. Ravi

2012 IEEE 53RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS)   263 - 272   2012

AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS Reviewed

Hirofumi Aota, Takuro Fukunaga, Hiroshi Nagamochi

INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS   21 ( 6 )   661 - 684   2011.12

All 4-Edge-Connected HHD-Free Graphs are Z(3)-Connected Reviewed

Takuro Fukunaga

GRAPHS AND COMBINATORICS   27 ( 5 )   647 - 659   2011.9

Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands Reviewed

Takuro Fukunaga

THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2011   6648   428 - 439   2011

Network design with weighted degree constraints Reviewed

Takuro Fukunaga, Hiroshi Nagamochi

DISCRETE OPTIMIZATION   7 ( 4 )   246 - 255   2010.11

FPTAS's for Some Cut Problems in Weighted Trees Reviewed

Takuro Fukunaga

4th International Frontiers of Algorithmics Workshop   210 - 221   2010

Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings Reviewed

Takuro Fukunaga

INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS   6080   15 - 28   2010

Network Design with Edge-Connectivity and Degree Constraints Reviewed

Takuro Fukunaga, Hiroshi Nagamochi

THEORY OF COMPUTING SYSTEMS   45 ( 3 )   512 - 532   2009.10

Eulerian detachments with local edge-connectivity Reviewed

Takuro Fukunaga, Hiroshi Nagamochi

DISCRETE APPLIED MATHEMATICS   157 ( 4 )   691 - 698   2009.2

Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems Reviewed

Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi

20th International Symposium on Algorithms and Computation   5878   55 - 64   2009

Network Design with Weighted Degree Constraints Reviewed

Takuro Fukunaga, Hiroshi Nagamochi

WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS   5431   214 - 225   2009

Graph Orientations with Set Connectivity Requirements Reviewed

Takuro Fukunaga

ALGORITHMS AND COMPUTATION, PROCEEDINGS   5878   265 - 274   2009

Robust cost colorings Reviewed

Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi

ACM-SIAM Symposium on Discrete Mathematics   2008

Approximability of the capacitated b-edge dominating set problem Reviewed

Andre Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh

THEORETICAL COMPUTER SCIENCE   385 ( 1-3 )   202 - 213   2007.10

Generalizing the induced matching by edge capacity constraints Reviewed

Takuro Fukunaga, Hiroshi Nagamochi

DISCRETE OPTIMIZATION   4 ( 2 )   198 - 205   2007.6

Approximating a generalization of metric TSP Reviewed

Takuro Fukunaga, Hiroshi Nagamochi

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E90D ( 2 )   432 - 439   2007.2

Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds Reviewed

Takuro Fukunaga, Hiroshi Nagamochi

Journal of the Operations Research Society of Japan   50 ( 4 )   339 - 350   2007

The set connector problem in graphs Reviewed

Takuro Fukunaga, Hiroshi Nagamochi

12th Conference on Integer Programming and Combinatorial Optimization   484 - 498   2007

Rent-or-buy scheduling and cost coloring problems Reviewed

Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi

Foundations of Software Technology and Theoretical Computer Science   84 - 95   2007

Network design with edge-connectivity and degree constraints Reviewed

Takuro Fukunaga, Hiroshi Nagamochi

APPROXIMATION AND ONLINE ALGORITHMS   4368   188 - 201   2006

Knowledge based support vector machines Reviewed

T Fukunaga, T Ibaraki

ENGINEERING INTELLIGENT SYSTEMS FOR ELECTRICAL ENGINEERING AND COMMUNICATIONS   13 ( 4 )   259 - 267   2005.12

Approximation algorithms for the b-edge dominating set problem and its related problems Reviewed

T Fukunaga, H Nagamochi

COMPUTING AND COMBINATORICS, PROCEEDINGS   3595   747 - 756   2005

Contention-Free Schedulingf or Clustered Many-Core Platform Reviewed

Ryotaro Koike, Takuro Fukunaga, Shingo Igarashi, Takuya Azumi

IEEE International Conference on Embedded Software and Systems (ICESS)   1900

Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs Invited

福永拓郎

電子情報通信学会コンピュテーション研究会  2020.9 

確率的組合せ最適化問題に対する適応的アルゴリズム Invited

福永 拓郎

日本OR学会研究部会「最適化とその応用」  ( 中央大学，東京 )   2019.3 

Stochastic Submodular Maximization with Performance-Dependent Item Costs International conference

Takuro Fukunaga

Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-19)  ( Honolulu, Hawaii, USA )   2019.1 

適応的最適化による推測・変動データからの意思決定,

福永 拓郎

さきがけ研究者交流会  ( 東京 )   2019.1  科学技術振興機構

Stochastic Submodular Maximization with Performance-Dependent Item Costs International conference

Takuro Fukunaga

NUS SoC – RIKEN AIP Workshop on Artificial Intelligence  ( National University of Singapore, Singapore )   2018.9 

LP-Based Pivoting Algorithm for Higher-Order Correlation Clustering International conference

Takuro Fukunaga

24th International Computing and Combinatorics Conference  ( Qingdao, China )   2018.7 

適応的最適化による推測・変動データからの意思決定

福永 拓郎

さきがけ研究者交流会  ( 東京 )   2018.6  科学技術振興機構

単位円グラフ上での高連結度支配集合問題に対する主双対近似アルゴリズム

福永 拓郎

第16回情報科学技術フォーラム(FIT2017)  ( 2017年9月12日-14日，東京大学本郷キャンパス )   2017.9 

Recent progress on the network activation problem Invited International conference

Takuro Fukunaga

10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications  ( Budapest, Hungary, May 22-25, 2017 )   2017.5 

ハイパーグラフ上の相関クラスタリングに対する近似アルゴリズム

福永 拓郎

情報処理学会第163回アルゴリズム研究会  ( 2017年5月12日-13日，長崎県建設総合会館 )   2017.5 

頂点被覆重み最小化シュタイナー木問題

福永 拓郎

日本オペレーションズ・リサーチ学会 2017年春季研究発表会  ( 2017年3月15日-17日，沖縄県市町村自治会館 )   2017.3 

Scalable algorithm for higher-order co-clustering via random sampling International conference

Takuro Fukunaga

Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)  ( Hilton San Francisco, San Francisco, California, USA, February 4-9, 2017 )   2017.2 

Computing a tree having a small vertex cover International conference

Takuro Fukunaga

10th Annual International Conference on Combinatorial Optimization and Applications (COCOA16)  ( City University of Hong Kong, Hong Kong, China, December 16-18 )   2016.12 

Network optimization on unit disk graphs Invited International conference

Takuro Fukunaga

Japanese Conference on Combinatorics and its Applications (JCCA2016), Mini-symposium on Discrete Convexity and Combinatorial Optimization  ( Kyoto University, Japan, May 21-25, 2016 )   2016.5 

線形計画緩和を利用した近似アルゴリズム Invited

福永 拓郎

第28回 回路とシステムワークショップ  ( 淡路夢舞台国際会議場，2015年8月3日-4日 )   2015.8 

Approximating the Generalized Terminal Backup Problem via Half-Integral Multiflow Relaxation International conference

Takuro Fukunaga

9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications  ( Nishijin Plaza, Fukuoka, Japan, June 2-5, 2015 )   2015.6 

整数格子劣モジュラ関数の適応的最大化

福永 拓郎

情報処理学会第153回アルゴリズム研究会  ( 北海道札幌市定山渓ビューホテル, 2015年6月12-13日 )   2015.6 

Virtual machine placement for minimizing connection cost in data center networks International conference

Takuro Fukunaga

The International Workshop of Software-Defined Data Communications and Storage (SDDCS)  ( in conjunction with IEEE INFOCOM 2015, Hong Kong, April 27, 2015 )   2015.4 

Approximating the generalized terminal backup problem via half-integral multiflow relaxation International conference

Takuro Fukunaga

32nd Symposium on Theoretical Aspects of Computer Science (STACS)  ( Munich, Germany, March 4-7, 2015 )   2015.3 

Spider covers for prize-collecting network activation problem International conference

Takuro Fukunaga

ACM-SIAM Symposium on Discrete Algorthms (SODA)  ( Westin San Diego Gaslamp Quarter, San Diego, California, USA, January 4-6, 2015 )   2015.1 

スパイダー被覆によるネットワークアクティベーションアルゴリズム Invited

福永 拓郎

日本オペレーションズ・リサーチ学会「最適化の理論と応用」研究部会 (SOTA)  ( 2014年12月13日，東京大学 )   2014.12 

Deliver or hold: Approximation algorithms for the periodic inventory routing problem International conference

Takuro Fukunaga

17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)  ( UPC Barcelona, Barcelona, Spain, September 4-6, 2014 )   2014.9 

Covering problems in edge- and node-weighted graphs International conference

Takuro Fukunaga

14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT)  ( July 2-4 2014, Copenhagen, Denmark )   2014.7 

賞金収集ネットワークアクティベーション問題に対する近似アルゴリズム

福永 拓郎

情報処理学会アルゴリズム研究会  ( 2014年3月3日-4日，中央大学 )   2014.3 

反復丸めアルゴリズム Invited

福永 拓郎

組合せ最適化セミナー  ( 京都大学数理解析研究所, 2013年7月24日-26日 )   2013.7 

Iterative Rounding Approximation Algorithms for Degree-bounded Node-connectivity Network Design International conference

Takuro Fukunaga

Workshop on Flexible Network Design  ( July 29-August 2, 2013, Fields Institute, Toronto, Canada )   2013.7 

Recent progress on iterative rounding algorithms for degree-bounded network design Invited International conference

Takuro Fukunaga

8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications  ( June 4-7, 2013, Pannon University, Veszprem, Hungary )   2013.6 

次数制約付き点連結度ネットワーク設計問題に対する反復丸め近似アルゴリズム Invited

福永 拓郎

コンピュテーション研究会  ( 2012年12月10日, 九州大学 )   2012.12 

Iterative rounding approximation algorithms for degree-bounded node-connectivity network design International conference

Takuro Fukunaga

53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS)  ( October 20-23, 2012, Hyatt Regency, New Brunswick, New Jersey, USA )   2012.10 

Approximation algorithms based on the iterative rounding method

2013.4 - 2016.3

Japan Society for the Promotion of Science  KAKENHI  Grant-in-Aid for Young Scientists (B) 

福永 拓郎

Algorithm design techniques based on transformation into network structure

Grant number：23500015  2011 - 2013

Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for Scientific Research (C)  Kyoto University

NAGAMOCHI Hiroshi, ZHAO Liang, FUKUNAGA Takuro

離散最適化問題に対する効率的なアルゴリズムの研究

2011.9 - 2012.8

京都大学教育研究振興財団  在外研究長期助成 

福永 拓郎

Research on algorithms for general network design problems

Grant number：20700008  2008.4 - 2012.3

Japan Society for the Promotion of Science  KAKENHI  Grant-in-Aid for Young Scientists (B)  Kyoto University

Takuro Fukunaga

Construction of Plat-form Models for the Problemof Packing Geometrical Objects

Grant number：20500012  2008 - 2010

Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for Scientific Research (C)  Kyoto University

NAGAMOCHI Hiroshi, FUKUNAGA Takuro

Algorithms on the set-connectivity of graphs

Grant number：19800017  2007.10 - 2008.3

Japan Society for the Promotion of Science  KAKENHI  Grant-in-Aid for Young Scientists (Start-up) 

Takuro Fukunaga