Approximation Algorithms for the b-Edge Dominating Set Problem and Its Related Problems. - Takuro Fukunaga; Hiroshi Nagamochi (COCOON, 2005)

Some Theorems on Detachments Preserving Local-Edge-Connectivity. - Takuro Fukunaga; Hiroshi Nagamochi (Electron. Notes Discret. Math., 2006)

"Rent-or-Buy" Scheduling and Cost Coloring Problems. - Takuro Fukunaga; Magnús M. Halldórsson; Hiroshi Nagamochi (FSTTCS, 2007)

The Set Connector Problem in Graphs. - Takuro Fukunaga; Hiroshi Nagamochi (IPCO, 2007)

Generalizing the induced matching by edge capacity constraints. - Takuro Fukunaga; Hiroshi Nagamochi (Discret. Optim., 2007)

Approximating a Generalization of Metric TSP. - Takuro Fukunaga; Hiroshi Nagamochi (IEICE Trans. Inf. Syst., 2007)

Approximability of the capacitated b-edge dominating set problem. - André Berger; Takuro Fukunaga; Hiroshi Nagamochi; Ojas Parekh (Theor. Comput. Sci., 2007)

Robust cost colorings. - Takuro Fukunaga; Magnús M. Halldórsson; Hiroshi Nagamochi (SODA, 2008)

Eulerian detachments with local edge-connectivity. - Takuro Fukunaga; Hiroshi Nagamochi (Discret. Appl. Math., 2009)

Network Design with Edge-Connectivity and Degree Constraints. - Takuro Fukunaga; Hiroshi Nagamochi (Theory Comput. Syst., 2009)

FPTAS's for Some Cut Problems in Weighted Trees. - Mingyu Xiao 001; Takuro Fukunaga; Hiroshi Nagamochi (FAW, 2010)

Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings. - Takuro Fukunaga (IPCO, 2010)

Network design with weighted degree constraints. - Takuro Fukunaga; Hiroshi Nagamochi (Discret. Optim., 2010)

All 4-Edge-Connected HHD-Free Graphs are mathbbZ3-Connected. - Takuro Fukunaga (Graphs Comb., 2011)

An Approximation Algorithm for Locating Maximal Disks within Convex Polygons. - Hirofumi Aota; Takuro Fukunaga; Hiroshi Nagamochi (Int. J. Comput. Geom. Appl., 2011)

Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design. - Takuro Fukunaga; R. Ravi 001 (FOCS, 2012)

Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. - Kazumasa Okumoto; Takuro Fukunaga; Hiroshi Nagamochi (Algorithmica, 2012)

Graph orientations with set connectivity requirements. - Takuro Fukunaga (Discret. Math., 2012)

Computing minimum multiway cuts in hypergraphs. - Takuro Fukunaga (Discret. Optim., 2013)

Approximating minimum cost source location problems with local vertex-connectivity demands. - Takuro Fukunaga (J. Discrete Algorithms, 2013)

FPTASs for trimming weighted trees. - Mingyu Xiao 001; Takuro Fukunaga; Hiroshi Nagamochi (Theor. Comput. Sci., 2013)

Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem. - Takuro Fukunaga; Afshin Nikzad; R. Ravi 001 (APPROX-RANDOM, 2014)

Unranking of small combinations from large sets. - Toshihiro Shimizu; Takuro Fukunaga; Hiroshi Nagamochi (J. Discrete Algorithms, 2014)

Lagrangian Decomposition Algorithm for Allocating Marketing Channels. - Daisuke Hatano; Takuro Fukunaga; Takanori Maehara; Ken-ichi Kawarabayashi (AAAI, 2015)

Threshold Influence Model for Allocating Advertising Budgets. - Atsushi Miyauchi 001; Yuni Iwamasa; Takuro Fukunaga; Naonori Kakimura (ICML, 2015)

Constant-approximation algorithms for highly connected multi-dominating sets in unit disk graphs. - Takuro Fukunaga (CoRR, 2015)

Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design. - Takuro Fukunaga; Zeev Nutov; R. Ravi 001 (SIAM J. Comput., 2015)

Adaptive Budget Allocation for Maximizing Influence of Advertisements. - Daisuke Hatano; Takuro Fukunaga; Ken-ichi Kawarabayashi (IJCAI, 2016)

Covering problems in edge- and node-weighted graphs. - Takuro Fukunaga (Discret. Optim., 2016)

Current Trends in Combinatorial Optimization (NII Shonan Meeting 2016-7). - Takuro Fukunaga; R. Ravi 001; László A. Végh (NII Shonan Meet. Rep., 2016)

Approximating the Generalized Terminal Backup Problem via Half-Integral Multiflow Relaxation. - Takuro Fukunaga (SIAM J. Discret. Math., 2016)

Scalable Algorithm for Higher-Order Co-Clustering via Random Sampling. - Daisuke Hatano; Takuro Fukunaga; Takanori Maehara; Ken-ichi Kawarabayashi (AAAI, 2017)

Online Optimization of Video-Ad Allocation. - Hanna Sumita; Yasushi Kawase; Sumio Fujita; Takuro Fukunaga (IJCAI, 2017)

Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Akihiro Yabe; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NIPS, 2017)

Virtual machine placement for minimizing connection cost in data center networks. - Takuro Fukunaga; Shuichi Hirahara; Hiyori Yoshikawa (Discret. Optim., 2017)

Spider Covers for Prize-Collecting Network Activation Problem. - Takuro Fukunaga (ACM Trans. Algorithms, 2017)

Online Regression with Partial Information: Generalization and Linear Projection. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Akihiro Yabe; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (AISTATS, 2018)

Boosting PageRank Scores by Optimizing Internal Link Structure. - Naoto Ohsaka; Tomohiro Sonobe; Naonori Kakimura; Takuro Fukunaga; Sumio Fujita; Ken-ichi Kawarabayashi (DEXA (1), 2018)

Causal Bandits with Propagating Inference. - Akihiro Yabe; Daisuke Hatano; Hanna Sumita; Shinji Ito; Naonori Kakimura; Takuro Fukunaga; Ken-ichi Kawarabayashi (ICML, 2018)

Regret Bounds for Online Portfolio Selection with a Cardinality Constraint. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Akihiro Yabe; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NeurIPS, 2018)

Approximation Algorithms for Highly Connected Multi-dominating Sets in Unit Disk Graphs. - Takuro Fukunaga (Algorithmica, 2018)

Stochastic Submodular Maximization with Performance-Dependent Item Costs. - Takuro Fukunaga; Takuya Konishi; Sumio Fujita; Ken-ichi Kawarabayashi (AAAI, 2019)

Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Kei Takemura; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NeurIPS, 2019)

Improved Regret Bounds for Bandit Combinatorial Optimization. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Kei Takemura; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NeurIPS, 2019)

LP-based pivoting algorithm for higher-order correlation clustering. - Takuro Fukunaga (J. Comb. Optim., 2019)

Submodular Maximization with Uncertain Knapsack Capacity. - Yasushi Kawase; Hanna Sumita; Takuro Fukunaga (SIAM J. Discret. Math., 2019)

Computing a tree having a small vertex cover. - Takuro Fukunaga; Takanori Maehara (Theor. Comput. Sci., 2019)

Contention-Free Scheduling for Clustered Many-Core Platform. - Ryotaro Koike; Takuro Fukunaga; Shingo Igarashi; Takuya Azumi (ICESS, 2020)

Delay and Cooperation in Nonstochastic Linear Bandits. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Kei Takemura; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NeurIPS, 2020)

Accurate Contention Estimate Scheduling Method Using Multiple Clusters of Many-core Platform. - Shingo Igarashi; Yuto Kitagawa; Takuro Fukunaga; Takuya Azumi (PDP, 2020)

End-to-End Learning for Prediction and Optimization with Gradient Boosting. - Takuya Konishi; Takuro Fukunaga (ECML/PKDD (3), 2020)

Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs. - Takuro Fukunaga (IEEE/ACM Trans. Netw., 2020)

Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. - Kei Takemura; Shinji Ito; Daisuke Hatano; Hanna Sumita; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (AAAI, 2021)

A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits. - Kei Takemura; Shinji Ito; Daisuke Hatano; Hanna Sumita; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (AISTATS, 2021)

Accurate Contention-aware Scheduling Method on Clustered Many-core Platform. - Shingo Igarashi; Takuro Fukunaga; Takuya Azumi (J. Inf. Process., 2021)

Online Task Assignment Problems with Reusable Resources. - Hanna Sumita; Shinji Ito; Kei Takemura; Daisuke Hatano; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (AAAI, 2022)

Integrality Gap of Time-Indexed Linear Programming Relaxation for Coflow Scheduling. - Takuro Fukunaga (APPROX/RANDOM, 2022)

Two-level hub Steiner trees. - Takuro Fukunaga; R. Ravi 001; Oleksandr Rudenko; Ziye Tang (Inf. Process. Lett., 2022)

Approximation algorithm for the 2-stage stochastic matroid base problem. - Takuro Fukunaga; R. Ravi 001; Oleksandr Rudenko; Ziye Tang (Oper. Res. Lett., 2022)

Bandit Task Assignment with Unknown Processing Time. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Kei Takemura; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NeurIPS, 2023)

New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem. - Koji Ichikawa; Shinji Ito; Daisuke Hatano; Hanna Sumita; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (AAAI, 2024)

NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam. - Taisei Otsuji; Peter Fulla; Takuro Fukunaga (COCOON (1), 2024)

A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering. - Kensuke Oowa; Peter Fulla; Takuro Fukunaga (CIAC (2), 2025)