Takuro Fukunaga

发表

Dynamic Programming Based Approximation Scheme for Locating Disks within Convex Polygons ∗

H. Nagamochi, Hirofumi Aota, Takuro Fukunaga, 2010 .

A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits

Ken-ichi Kawarabayashi, Takuro Fukunaga, Naonori Kakimura, 2021, AISTATS.

Delay and Cooperation in Nonstochastic Linear Bandits

Ken-ichi Kawarabayashi, Takuro Fukunaga, Naonori Kakimura, 2020, NeurIPS.

TR-2006-009 Capacitated b-Edge Dominating Set and Related Problems

Ojas D. Parekh, Ojas Parekh, H. Nagamochi, 2007 .

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

Takuro Fukunaga, Takuya Azumi, Shingo Igarashi, 2021, J. Inf. Process..

All 4-Edge-Connected HHD-Free Graphs are Z3 -Connected

Takuro Fukunaga, 2011 .

APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS( the 50th Anniversary of the Operations Research Society of Japan)

Takuro Fukunaga, Hiroshi Nagamochi, H. Nagamochi, 2007 .

Contention-Free Scheduling for Clustered Many-Core Platform

R. Koike, Takuya Azumi, Takuro Fukunaga, 2020, 2020 IEEE International Conference on Embedded Software and Systems (ICESS).

Design Problems with Weighted Degree

H. Nagamochi, Takuro Fukunaga, 2021 .

Online Optimization of Video-Ad Allocation

Takuro Fukunaga, Yasushi Kawase, Sumio Fujita, 2017, IJCAI.

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

Ken-ichi Kawarabayashi, Takuro Fukunaga, Naonori Kakimura, 2017, NIPS.

Robust cost colorings

Takuro Fukunaga, Hiroshi Nagamochi, Magnús M. Halldórsson, 2008, SODA '08.

Approximation algorithms to the network design problems

Takuro Fukunaga, Takuro Fukunaga, 2007 .

Defects of Silicon Substrates Caused by Electro-Static Discharge in Single Wafer Cleaning Process

H. Iwamoto, Y. Hagimoto, Takuro Fukunaga, 2009 .

"Rent-or-Buy" Scheduling and Cost Coloring Problems

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

Network Design with Edge-Connectivity and Degree Constraints

Takuro Fukunaga, Hiroshi Nagamochi, H. Nagamochi, 2006, Theory of Computing Systems.

Online Regression with Partial Information: Generalization and Linear Projection

Ken-ichi Kawarabayashi, Takuro Fukunaga, Naonori Kakimura, 2018, AISTATS.

Causal Bandits with Propagating Inference pdf

Ken-ichi Kawarabayashi, Takuro Fukunaga, Naonori Kakimura, 2018, ICML.

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

Takuro Fukunaga, Takuya Konishi, 2020, ECML/PKDD.

Covering problems in edge- and node-weighted graphs

Takuro Fukunaga, Takuro Fukunaga, 2014, Discret. Optim..

Approximability of the capacitated b-edge dominating set problem

Ojas Parekh, Takuro Fukunaga, Hiroshi Nagamochi, 2007, Theor. Comput. Sci..

Capacitated b-Edge Dominating Set and Related Problems

Ojas D. Parekh, H. Nagamochi, A. Berger, 2007 .

Threshold Influence Model for Allocating Advertising Budgets

Takuro Fukunaga, Yuni Iwamasa, Naonori Kakimura, 2015, ICML.

APPROXIMATION ALGORITHMS FOR A GENERALIZATION OF THE MAXIMUM BUDGET ALLOCATION

Takuro Fukunaga, Takuro Fukunaga, 2021 .

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

Takuro Fukunaga, Takuro Fukunaga, 2011, J. Discrete Algorithms.

Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback

Ken-ichi Kawarabayashi, Takuro Fukunaga, Naonori Kakimura, 2019, NeurIPS.

Lagrangian Decomposition Algorithm for Allocating Marketing Channels

Ken-ichi Kawarabayashi, Takuro Fukunaga, Takanori Maehara, 2015, AAAI.

Improved Regret Bounds for Bandit Combinatorial Optimization

Ken-ichi Kawarabayashi, Takuro Fukunaga, Naonori Kakimura, 2019, NeurIPS.

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

Ken-ichi Kawarabayashi, Takuro Fukunaga, Naonori Kakimura, 2021, AAAI.

The Set Connector Problem in Graphs

Takuro Fukunaga, Hiroshi Nagamochi, H. Nagamochi, 2007, IPCO.

APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS( the 50th Anniversary of the Operations Research Society of Japan)

Takuro Fukunaga, Hiroshi Nagamochi, H. Nagamochi, 2007 .

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

Takuro Fukunaga, Takuro Fukunaga, 2014, SIAM J. Discret. Math..

Network design with weighted degree constraints

H. Nagamochi, Takuro Fukunaga, 2009, Discret. Optim..

Virtual machine placement for minimizing connection cost in data center networks

Takuro Fukunaga, Shuichi Hirahara, Hiyori Yoshikawa, 2015, 2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

Combinatorial Optimization and Graph Algorithms

Ken-ichi Kawarabayashi, Takuro Fukunaga, K. Kawarabayashi, 2017, Springer Singapore.

All 4-Edge-Connected HHD-Free Graphs are $${\mathbb{Z}_3}$$-Connected

Takuro Fukunaga, Takuro Fukunaga, 2011, Graphs Comb..

Computing minimum multiway cuts in hypergraphs

Takuro Fukunaga, Takuro Fukunaga, 2013, Discret. Optim..

Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings

Takuro Fukunaga, Takuro Fukunaga, 2010, IPCO.

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

Takuro Fukunaga, Hiroshi Nagamochi, Kazumasa Okumoto, 2009, Algorithmica.

Unranking of small combinations from large sets

Takuro Fukunaga, Hiroshi Nagamochi, Toshihiro Shimizu, 2014, J. Discrete Algorithms.