default search action
Takuro Fukunaga
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c43]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 - 2023
- [c42]Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Bandit Task Assignment with Unknown Processing Time. NeurIPS 2023 - [i13]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 abs/2312.12400 (2023) - 2022
- [j28]Takuro Fukunaga, R. Ravi, Oleksandr Rudenko
, Ziye Tang
Two-level hub Steiner trees. Inf. Process. Lett. 174: 106209 (2022) - [j27]Takuro Fukunaga, R. Ravi
Approximation algorithm for the 2-stage stochastic matroid base problem. Oper. Res. Lett. 50(2): 129-132 (2022) - [c41]Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Online Task Assignment Problems with Reusable Resources. AAAI 2022: 5199-5207 - [c40]Takuro Fukunaga
Integrality Gap of Time-Indexed Linear Programming Relaxation for Coflow Scheduling. APPROX/RANDOM 2022: 36:1-36:13 - [i12]Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Online Task Assignment Problems with Reusable Resources. CoRR abs/2203.07605 (2022) - 2021
- [j26]Shingo Igarashi, Takuro Fukunaga, Takuya Azumi:
Accurate Contention-aware Scheduling Method on Clustered Many-core Platform. J. Inf. Process. 29: 216-226 (2021) - [c39]Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. AAAI 2021: 9791-9798 - [c38]Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits. AISTATS 2021: 3367-3375 - [i11]Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. CoRR abs/2101.07957 (2021) - 2020
- [j25]Takuro Fukunaga
Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs. IEEE/ACM Trans. Netw. 28(1): 387-398 (2020) - [c37]Ryotaro Koike, Takuro Fukunaga, Shingo Igarashi, Takuya Azumi:
Contention-Free Scheduling for Clustered Many-Core Platform. ICESS 2020: 1-8 - [c36]Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Delay and Cooperation in Nonstochastic Linear Bandits. NeurIPS 2020 - [c35]Shingo Igarashi, Yuto Kitagawa, Takuro Fukunaga, Takuya Azumi:
Accurate Contention Estimate Scheduling Method Using Multiple Clusters of Many-core Platform. PDP 2020: 67-71 - [c34]Takuya Konishi, Takuro Fukunaga:
End-to-End Learning for Prediction and Optimization with Gradient Boosting. ECML/PKDD (3) 2020: 191-207
2010 – 2019
- 2019
- [j24]Takuro Fukunaga
LP-based pivoting algorithm for higher-order correlation clustering. J. Comb. Optim. 37(4): 1312-1326 (2019) - [j23]Yasushi Kawase, Hanna Sumita, Takuro Fukunaga
Submodular Maximization with Uncertain Knapsack Capacity. SIAM J. Discret. Math. 33(3): 1121-1145 (2019) - [j22]Takuro Fukunaga, Takanori Maehara:
Computing a tree having a small vertex cover. Theor. Comput. Sci. 791: 48-61 (2019) - [c33]Takuro Fukunaga, Takuya Konishi, Sumio Fujita, Ken-ichi Kawarabayashi:
Stochastic Submodular Maximization with Performance-Dependent Item Costs. AAAI 2019: 1485-1494 - [c32]Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback. NeurIPS 2019: 10589-10598 - [c31]Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Improved Regret Bounds for Bandit Combinatorial Optimization. NeurIPS 2019: 12027-12036 - [i10]Takuro Fukunaga:
Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs. CoRR abs/1912.12665 (2019) - 2018
- [j21]Takuro Fukunaga
Approximation Algorithms for Highly Connected Multi-dominating Sets in Unit Disk Graphs. Algorithmica 80(11): 3270-3292 (2018) - [c30]Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Online Regression with Partial Information: Generalization and Linear Projection. AISTATS 2018: 1599-1607 - [c29]Takuro Fukunaga:
LP-Based Pivoting Algorithm for Higher-Order Correlation Clustering. COCOON 2018: 51-62 - [c28]Naoto Ohsaka
Boosting PageRank Scores by Optimizing Internal Link Structure. DEXA (1) 2018: 424-439 - [c27]Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi:
Causal Bandits with Propagating Inference. ICML 2018: 5508-5516 - [c26]Yasushi Kawase, Hanna Sumita, Takuro Fukunaga:
Submodular Maximization with Uncertain Knapsack Capacity. LATIN 2018: 653-668 - [c25]Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Regret Bounds for Online Portfolio Selection with a Cardinality Constraint. NeurIPS 2018: 10611-10620 - [i9]Yasushi Kawase, Hanna Sumita, Takuro Fukunaga:
Submodular maximization with uncertain knapsack capacity. CoRR abs/1803.02565 (2018) - [i8]Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi:
Causal Bandits with Propagating Inference. CoRR abs/1806.02252 (2018) - 2017
- [j20]Takuro Fukunaga
Virtual machine placement for minimizing connection cost in data center networks. Discret. Optim. 26: 183-198 (2017) - [j19]Takuro Fukunaga
Spider Covers for Prize-Collecting Network Activation Problem. ACM Trans. Algorithms 13(4): 49:1-49:31 (2017) - [c24]Daisuke Hatano, Takuro Fukunaga, Takanori Maehara, Ken-ichi Kawarabayashi:
Scalable Algorithm for Higher-Order Co-Clustering via Random Sampling. AAAI 2017: 1992-1999 - [c23]Hanna Sumita, Yasushi Kawase, Sumio Fujita, Takuro Fukunaga:
Online Optimization of Video-Ad Allocation. IJCAI 2017: 423-429 - [c22]Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation. NIPS 2017: 4099-4108 - [i7]Takuro Fukunaga, Takanori Maehara:
Computing a tree having a small vertex cover. CoRR abs/1701.08897 (2017) - 2016
- [j18]Takuro Fukunaga
Covering problems in edge- and node-weighted graphs. Discret. Optim. 20: 40-61 (2016) - [j17]Takuro Fukunaga
Approximating the Generalized Terminal Backup Problem via Half-Integral Multiflow Relaxation. SIAM J. Discret. Math. 30(2): 777-800 (2016) - [c21]Takuro Fukunaga
Computing a Tree Having a Small Vertex Cover. COCOA 2016: 77-91 - [c20]Daisuke Hatano, Takuro Fukunaga, Ken-ichi Kawarabayashi:
Adaptive Budget Allocation for Maximizing Influence of Advertisements. IJCAI 2016: 3600-3608 - [i6]Takuro Fukunaga, R. Ravi, László A. Végh:
Current Trends in Combinatorial Optimization (NII Shonan Meeting 2016-7). NII Shonan Meet. Rep. 2016 (2016) - 2015
- [j16]Takuro Fukunaga
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design. SIAM J. Comput. 44(5): 1202-1229 (2015) - [c19]Daisuke Hatano, Takuro Fukunaga, Takanori Maehara, Ken-ichi Kawarabayashi:
Lagrangian Decomposition Algorithm for Allocating Marketing Channels. AAAI 2015: 1144-1150 - [c18]Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, Naonori Kakimura:
Threshold Influence Model for Allocating Advertising Budgets. ICML 2015: 1395-1404 - [c17]Takuro Fukunaga
Virtual machine placement for minimizing connection cost in data center networks. INFOCOM Workshops 2015: 486-491 - [c16]Takuro Fukunaga:
Spider covers for prize-collecting network activation problem. SODA 2015: 9-24 - [c15]Takuro Fukunaga
Approximating the Generalized Terminal Backup Problem via Half-integral Multiflow Relaxation. STACS 2015: 316-328 - [i5]Takuro Fukunaga:
Constant-approximation algorithms for highly connected multi-dominating sets in unit disk graphs. CoRR abs/1511.09156 (2015) - 2014
- [j15]Toshihiro Shimizu, Takuro Fukunaga
Unranking of small combinations from large sets. J. Discrete Algorithms 29: 8-20 (2014) - [c14]Takuro Fukunaga
Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem. APPROX-RANDOM 2014: 209-225 - [c13]Takuro Fukunaga
Covering Problems in Edge- and Node-Weighted Graphs. SWAT 2014: 217-228 - [i4]Takuro Fukunaga:
Covering problems in edge- and node-weighted graphs. CoRR abs/1404.4123 (2014) - [i3]Takuro Fukunaga:
Approximating the generalized terminal backup problem via half-integral multiflow relaxation. CoRR abs/1409.5561 (2014) - 2013
- [j14]Takuro Fukunaga
Computing minimum multiway cuts in hypergraphs. Discret. Optim. 10(4): 371-382 (2013) - [j13]Takuro Fukunaga
Approximating minimum cost source location problems with local vertex-connectivity demands. J. Discrete Algorithms 19: 30-38 (2013) - [j12]Mingyu Xiao, Takuro Fukunaga
FPTASs for trimming weighted trees. Theor. Comput. Sci. 469: 105-118 (2013) - [i2]Takuro Fukunaga:
Spider covers for prize-collecting network activation problem. CoRR abs/1310.5422 (2013) - 2012
- [j11]Kazumasa Okumoto, Takuro Fukunaga
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. Algorithmica 62(3-4): 787-806 (2012) - [j10]Takuro Fukunaga
Graph orientations with set connectivity requirements. Discret. Math. 312(15): 2349-2355 (2012) - [c12]Takuro Fukunaga
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design. FOCS 2012: 263-272 - [i1]Takuro Fukunaga, R. Ravi:
Iterative rounding approximation algorithms for degree-bounded node-connectivity network design. CoRR abs/1203.3578 (2012) - 2011
- [j9]Takuro Fukunaga
All 4-Edge-Connected HHD-Free Graphs are \mathbbZ3-Connected. Graphs Comb. 27(5): 647-659 (2011) - [j8]Hirofumi Aota, Takuro Fukunaga, Hiroshi Nagamochi:
An Approximation Algorithm for Locating Maximal Disks within Convex Polygons. Int. J. Comput. Geom. Appl. 21(6): 661-684 (2011) - [c11]Takuro Fukunaga
Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands. TAMC 2011: 428-439 - 2010
- [j7]Takuro Fukunaga
Network design with weighted degree constraints. Discret. Optim. 7(4): 246-255 (2010) - [c10]Mingyu Xiao, Takuro Fukunaga
FPTAS's for Some Cut Problems in Weighted Trees. FAW 2010: 210-221 - [c9]Takuro Fukunaga
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings. IPCO 2010: 15-28
2000 – 2009
- 2009
- [j6]Takuro Fukunaga
Eulerian detachments with local edge-connectivity. Discret. Appl. Math. 157(4): 691-698 (2009) - [j5]Takuro Fukunaga
Network Design with Edge-Connectivity and Degree Constraints. Theory Comput. Syst. 45(3): 512-532 (2009) - [c8]Kazumasa Okumoto, Takuro Fukunaga
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. ISAAC 2009: 55-64 - [c7]Takuro Fukunaga
Graph Orientations with Set Connectivity Requirements. ISAAC 2009: 265-274 - [c6]Takuro Fukunaga
Network Design with Weighted Degree Constraints. WALCOM 2009: 214-225 - 2008
- [c5]Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi:
Robust cost colorings. SODA 2008: 1204-1212 - [e1]Seok-Hee Hong, Hiroshi Nagamochi, Takuro Fukunaga:
Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings. Lecture Notes in Computer Science 5369, Springer 2008, ISBN 978-3-540-92181-3 [contents] - 2007
- [j4]Takuro Fukunaga
Generalizing the induced matching by edge capacity constraints. Discret. Optim. 4(2): 198-205 (2007) - [j3]Takuro Fukunaga
Approximating a Generalization of Metric TSP. IEICE Trans. Inf. Syst. 90-D(2): 432-439 (2007) - [j2]André Berger, Takuro Fukunaga
Approximability of the capacitated b-edge dominating set problem. Theor. Comput. Sci. 385(1-3): 202-213 (2007) - [c4]Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi:
"Rent-or-Buy" Scheduling and Cost Coloring Problems. FSTTCS 2007: 84-95 - [c3]Takuro Fukunaga, Hiroshi Nagamochi:
The Set Connector Problem in Graphs. IPCO 2007: 484-498 - 2006
- [j1]Takuro Fukunaga
Some Theorems on Detachments Preserving Local-Edge-Connectivity. Electron. Notes Discret. Math. 24: 173-180 (2006) - [c2]Takuro Fukunaga, Hiroshi Nagamochi:
Network Design with Edge-Connectivity and Degree Constraints. WAOA 2006: 188-201 - 2005
- [c1]Takuro Fukunaga, Hiroshi Nagamochi:
Approximation Algorithms for the b-Edge Dominating Set Problem and Its Related Problems. COCOON 2005: 747-756
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: