| Iterative rounding approximation algorithms for degree-bounded node-connectivity network design T Fukunaga, Z Nutov, R Ravi SIAM Journal on Computing 44 (5), 1202-1229, 2015 | 33 | 2015 |
| Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems K Okumoto, T Fukunaga, H Nagamochi Algorithmica 62 (3), 787-806, 2012 | 32 | 2012 |
| Computing minimum multiway cuts in hypergraphs T Fukunaga Discrete Optimization 10 (4), 371-382, 2013 | 21* | 2013 |
| Robust cost colorings. T Fukunaga, MM Halldórsson, H Nagamochi SODA 8, 1204-1212, 2008 | 21 | 2008 |
| Approximation algorithms for highly connected multi-dominating sets in unit disk graphs T Fukunaga Algorithmica 80 (11), 3270-3292, 2018 | 19 | 2018 |
| Causal bandits with propagating inference A Yabe, D Hatano, H Sumita, S Ito, N Kakimura, T Fukunaga, ... International Conference on Machine Learning, 5512-5520, 2018 | 17 | 2018 |
| Algorithms and Computation SH Hong, H Nagamochi, T Fukunaga Springer, 2008 | 17 | 2008 |
| Threshold influence model for allocating advertising budgets A Miyauchi, Y Iwamasa, T Fukunaga, N Kakimura International Conference on Machine Learning, 1395-1404, 2015 | 16 | 2015 |
| Network design with weighted degree constraints T Fukunaga, H Nagamochi Discrete Optimization 7 (4), 246-255, 2010 | 16 | 2010 |
| Virtual machine placement for minimizing connection cost in data center networks T Fukunaga, S Hirahara, H Yoshikawa Discrete Optimization 26, 183-198, 2017 | 13 | 2017 |
| Adaptive Budget Allocation for Maximizing Influence of Advertisements. D Hatano, T Fukunaga, K Kawarabayashi IJCAI, 3600-3608, 2016 | 13 | 2016 |
| Spider covers for prize-collecting network activation problem T Fukunaga ACM Transactions on Algorithms (TALG) 13 (4), 1-31, 2017 | 12 | 2017 |
| Unranking of small combinations from large sets T Shimizu, T Fukunaga, H Nagamochi Journal of Discrete Algorithms 29, 8-20, 2014 | 12 | 2014 |
| Deliver or hold: approximation algorithms for the periodic inventory routing problem T Fukunaga, A Nikzad, R Ravi Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014 | 11 | 2014 |
| Lagrangian decomposition algorithm for allocating marketing channels D Hatano, T Fukunaga, T Maehara, K Kawarabayashi Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015 | 10 | 2015 |
| Network design with edge-connectivity and degree constraints T Fukunaga, H Nagamochi Theory of Computing Systems 45 (3), 512-532, 2009 | 10 | 2009 |
| APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS (< Special Issue> the 50th Anniversary of the Operations Research Society of Japan) T Fukunaga, H Nagamochi Journal of the Operations Research Society of Japan 50 (4), 339-349, 2007 | 10 | 2007 |
| Delay and cooperation in nonstochastic linear bandits S Ito, D Hatano, H Sumita, K Takemura, T Fukunaga, N Kakimura, ... Advances in Neural Information Processing Systems 33, 4872-4883, 2020 | 9 | 2020 |
| Online Optimization of Video-Ad Allocation. H Sumita, Y Kawase, S Fujita, T Fukunaga, RA Center IJCAI, 423-429, 2017 | 9 | 2017 |
| Approximating the generalized terminal backup problem via half-integral multiflow relaxation T Fukunaga SIAM Journal on Discrete Mathematics 30 (2), 777-800, 2016 | 9 | 2016 |
Ken-ichi KawarabayashiVerified email at nii.ac.jp
