Takuro Fukunaga

88 papers A* 18A 4B 8C 3Misc 3Journal 42Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam. CoRR Taisei Otsuji, Peter Fulla, Takuro Fukunaga
2025	—	`conf`	A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering. CIAC (2) Kensuke Oowa, Peter Fulla, Takuro Fukunaga
2024	—	`conf`	NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam. COCOON (1) Taisei Otsuji, Peter Fulla, Takuro Fukunaga
2024	A*	`conf`	New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem. AAAI Koji Ichikawa, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2023	A*	`conf`	Bandit Task Assignment with Unknown Processing Time. NeurIPS Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2023	J	`jnl`	New classes of the greedy-applicable arm feature distributions in the sparse linear bandit problem. CoRR Koji Ichikawa, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2022	J	`jnl`	Approximation algorithm for the 2-stage stochastic matroid base problem. Oper. Res. Lett. Takuro Fukunaga, R. Ravi, Oleksandr Rudenko, Ziye Tang
2022	A	`conf`	Integrality Gap of Time-Indexed Linear Programming Relaxation for Coflow Scheduling. APPROX/RANDOM Takuro Fukunaga
2022	A*	`conf`	Online Task Assignment Problems with Reusable Resources. AAAI Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2022	J	`jnl`	Online Task Assignment Problems with Reusable Resources. CoRR Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2022	J	`jnl`	Two-level hub Steiner trees. Inf. Process. Lett. Takuro Fukunaga, R. Ravi, Oleksandr Rudenko, Ziye Tang
2021	A	`conf`	A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits. AISTATS Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2021	J	`jnl`	Accurate Contention-aware Scheduling Method on Clustered Many-core Platform. J. Inf. Process. Shingo Igarashi, Takuro Fukunaga, Takuya Azumi
2021	A*	`conf`	Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. AAAI Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2021	J	`jnl`	Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. CoRR Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2020	C	`conf`	Accurate Contention Estimate Scheduling Method Using Multiple Clusters of Many-core Platform. PDP Shingo Igarashi, Yuto Kitagawa, Takuro Fukunaga, Takuya Azumi
2020	J	`jnl`	Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs. IEEE/ACM Trans. Netw. Takuro Fukunaga
2020	—	`conf`	Contention-Free Scheduling for Clustered Many-Core Platform. ICESS Ryotaro Koike, Takuro Fukunaga, Shingo Igarashi, Takuya Azumi
2020	A*	`conf`	Delay and Cooperation in Nonstochastic Linear Bandits. NeurIPS Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2020	—	`conf`	End-to-End Learning for Prediction and Optimization with Gradient Boosting. ECML/PKDD (3) Takuya Konishi, Takuro Fukunaga
2019	J	`jnl`	Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs. CoRR Takuro Fukunaga
2019	J	`jnl`	Computing a tree having a small vertex cover. Theor. Comput. Sci. Takuro Fukunaga, Takanori Maehara
2019	A*	`conf`	Improved Regret Bounds for Bandit Combinatorial Optimization. NeurIPS Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2019	J	`jnl`	LP-based pivoting algorithm for higher-order correlation clustering. J. Comb. Optim. Takuro Fukunaga
2019	A*	`conf`	Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback. NeurIPS Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2019	A*	`conf`	Stochastic Submodular Maximization with Performance-Dependent Item Costs. AAAI Takuro Fukunaga, Takuya Konishi, Sumio Fujita, Ken-ichi Kawarabayashi
2019	J	`jnl`	Submodular Maximization with Uncertain Knapsack Capacity. SIAM J. Discret. Math. Yasushi Kawase, Hanna Sumita, Takuro Fukunaga
2018	J	`jnl`	Approximation Algorithms for Highly Connected Multi-dominating Sets in Unit Disk Graphs. Algorithmica Takuro Fukunaga
2018	—	`conf`	Boosting PageRank Scores by Optimizing Internal Link Structure. DEXA (1) Naoto Ohsaka, Tomohiro Sonobe, Naonori Kakimura, Takuro Fukunaga, Sumio Fujita, Ken-ichi Kawarabayashi
2018	A*	`conf`	Causal Bandits with Propagating Inference. ICML Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi
2018	J	`jnl`	Causal Bandits with Propagating Inference. CoRR Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi
2018	Misc	`conf`	LP-Based Pivoting Algorithm for Higher-Order Correlation Clustering. COCOON Takuro Fukunaga
2018	A	`conf`	Online Regression with Partial Information: Generalization and Linear Projection. AISTATS Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2018	A*	`conf`	Regret Bounds for Online Portfolio Selection with a Cardinality Constraint. NeurIPS Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2018	B	`conf`	Submodular Maximization with Uncertain Knapsack Capacity. LATIN Yasushi Kawase, Hanna Sumita, Takuro Fukunaga
2018	J	`jnl`	Submodular maximization with uncertain knapsack capacity. CoRR Yasushi Kawase, Hanna Sumita, Takuro Fukunaga
2017	J	`jnl`	Computing a tree having a small vertex cover. CoRR Takuro Fukunaga, Takanori Maehara
2017	—	`conf`	Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation. NIPS Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2017	A*	`conf`	Online Optimization of Video-Ad Allocation. IJCAI Hanna Sumita, Yasushi Kawase, Sumio Fujita, Takuro Fukunaga
2017	A*	`conf`	Scalable Algorithm for Higher-Order Co-Clustering via Random Sampling. AAAI Daisuke Hatano, Takuro Fukunaga, Takanori Maehara, Ken-ichi Kawarabayashi
2017	J	`jnl`	Spider Covers for Prize-Collecting Network Activation Problem. ACM Trans. Algorithms Takuro Fukunaga
2017	J	`jnl`	Virtual machine placement for minimizing connection cost in data center networks. Discret. Optim. Takuro Fukunaga, Shuichi Hirahara, Hiyori Yoshikawa
2016	A*	`conf`	Adaptive Budget Allocation for Maximizing Influence of Advertisements. IJCAI Daisuke Hatano, Takuro Fukunaga, Ken-ichi Kawarabayashi
2016	J	`jnl`	Approximating the Generalized Terminal Backup Problem via Half-Integral Multiflow Relaxation. SIAM J. Discret. Math. Takuro Fukunaga
2016	C	`conf`	Computing a Tree Having a Small Vertex Cover. COCOA Takuro Fukunaga, Takanori Maehara
2016	J	`jnl`	Covering problems in edge- and node-weighted graphs. Discret. Optim. Takuro Fukunaga
2016	J	`jnl`	Current Trends in Combinatorial Optimization (NII Shonan Meeting 2016-7). NII Shonan Meet. Rep. Takuro Fukunaga, R. Ravi, László A. Végh
2015	A	`conf`	Approximating the Generalized Terminal Backup Problem via Half-integral Multiflow Relaxation. STACS Takuro Fukunaga
2015	J	`jnl`	Constant-approximation algorithms for highly connected multi-dominating sets in unit disk graphs. CoRR Takuro Fukunaga
2015	J	`jnl`	Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design. SIAM J. Comput. Takuro Fukunaga, Zeev Nutov, R. Ravi
2015	A*	`conf`	Lagrangian Decomposition Algorithm for Allocating Marketing Channels. AAAI Daisuke Hatano, Takuro Fukunaga, Takanori Maehara, Ken-ichi Kawarabayashi
2015	A*	`conf`	Spider covers for prize-collecting network activation problem. SODA Takuro Fukunaga
2015	A*	`conf`	Threshold Influence Model for Allocating Advertising Budgets. ICML Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, Naonori Kakimura
2015	—	`conf`	Virtual machine placement for minimizing connection cost in data center networks. INFOCOM Workshops Takuro Fukunaga, Shuichi Hirahara, Hiyori Yoshikawa
2014	J	`jnl`	Approximating the generalized terminal backup problem via half-integral multiflow relaxation. CoRR Takuro Fukunaga
2014	—	`conf`	Covering Problems in Edge- and Node-Weighted Graphs. SWAT Takuro Fukunaga
2014	J	`jnl`	Covering problems in edge- and node-weighted graphs. CoRR Takuro Fukunaga
2014	—	`conf`	Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem. APPROX-RANDOM Takuro Fukunaga, Afshin Nikzad, R. Ravi
2014	J	`jnl`	Unranking of small combinations from large sets. J. Discrete Algorithms Toshihiro Shimizu, Takuro Fukunaga, Hiroshi Nagamochi
2013	J	`jnl`	Approximating minimum cost source location problems with local vertex-connectivity demands. J. Discrete Algorithms Takuro Fukunaga
2013	J	`jnl`	Computing minimum multiway cuts in hypergraphs. Discret. Optim. Takuro Fukunaga
2013	J	`jnl`	FPTASs for trimming weighted trees. Theor. Comput. Sci. Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi
2013	J	`jnl`	Spider covers for prize-collecting network activation problem. CoRR Takuro Fukunaga
2012	J	`jnl`	Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. Algorithmica Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi
2012	J	`jnl`	Graph orientations with set connectivity requirements. Discret. Math. Takuro Fukunaga
2012	A*	`conf`	Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design. FOCS Takuro Fukunaga, R. Ravi
2012	J	`jnl`	Iterative rounding approximation algorithms for degree-bounded node-connectivity network design CoRR Takuro Fukunaga, R. Ravi
2011	J	`jnl`	All 4-Edge-Connected HHD-Free Graphs are \mathbb Graphs Comb. Takuro Fukunaga
2011	J	`jnl`	An Approximation Algorithm for Locating Maximal Disks within Convex Polygons. Int. J. Comput. Geom. Appl. Hirofumi Aota, Takuro Fukunaga, Hiroshi Nagamochi
2011	C	`conf`	Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands. TAMC Takuro Fukunaga
2010	B	`conf`	Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings. IPCO Takuro Fukunaga
2010	Misc	`conf`	FPTAS's for Some Cut Problems in Weighted Trees. FAW Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi
2010	J	`jnl`	Network design with weighted degree constraints. Discret. Optim. Takuro Fukunaga, Hiroshi Nagamochi
2009	B	`conf`	Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. ISAAC Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi
2009	J	`jnl`	Eulerian detachments with local edge-connectivity. Discret. Appl. Math. Takuro Fukunaga, Hiroshi Nagamochi
2009	B	`conf`	Graph Orientations with Set Connectivity Requirements. ISAAC Takuro Fukunaga
2009	J	`jnl`	Network Design with Edge-Connectivity and Degree Constraints. Theory Comput. Syst. Takuro Fukunaga, Hiroshi Nagamochi
2009	B	`conf`	Network Design with Weighted Degree Constraints. WALCOM Takuro Fukunaga, Hiroshi Nagamochi
2008	B	`ed.`	Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings ISAAC Seok-Hee Hong, Hiroshi Nagamochi, Takuro Fukunaga
2008	A*	`conf`	Robust cost colorings. SODA Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi
2007	—	`conf`	"Rent-or-Buy" Scheduling and Cost Coloring Problems. FSTTCS Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi
2007	J	`jnl`	Approximability of the capacitated b-edge dominating set problem. Theor. Comput. Sci. André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh
2007	J	`jnl`	Approximating a Generalization of Metric TSP. IEICE Trans. Inf. Syst. Takuro Fukunaga, Hiroshi Nagamochi
2007	J	`jnl`	Generalizing the induced matching by edge capacity constraints. Discret. Optim. Takuro Fukunaga, Hiroshi Nagamochi
2007	B	`conf`	The Set Connector Problem in Graphs. IPCO Takuro Fukunaga, Hiroshi Nagamochi
2006	B	`conf`	Network Design with Edge-Connectivity and Degree Constraints. WAOA Takuro Fukunaga, Hiroshi Nagamochi
2006	J	`jnl`	Some Theorems on Detachments Preserving Local-Edge-Connectivity. Electron. Notes Discret. Math. Takuro Fukunaga, Hiroshi Nagamochi
2005	Misc	`conf`	Approximation Algorithms for the COCOON Takuro Fukunaga, Hiroshi Nagamochi