Tatsuya Matsuoka

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 18

Top Topics

Point Processes

Submodular Functions

Top Venues

Discret. Optim.

Publications

Ken Yokoyama, Shinji Ito, Tatsuya Matsuoka, Kei Kimura, Makoto Yokoo
-Convex Minimization. CoRR (2024)
Tatsuya Matsuoka, Naoto Ohsaka
Computational complexity of normalizing constants for the product of determinantal point processes. Theor. Comput. Sci. 997 (2024)
Tatsuya Matsuoka, Shinji Ito
Maximization of Minimum Weighted Hamming Distance between Set Pairs. ACML (2023)
Naoto Ohsaka, Tatsuya Matsuoka
Reconfiguration Problems on Submodular Functions. WSDM (2022)
Tatsuya Matsuoka, Naoto Ohsaka
Maximization of Monotone k-Submodular Functions with Bounded Curvature and Non-k-Submodular Functions. ACML (2021)
Tatsuya Matsuoka, Naoto Ohsaka, Akihiro Yabe
On the Convex Combination of Determinantal Point Processes. ACML (2021)
Tatsuya Matsuoka, Naoto Ohsaka
Spanning Tree Constrained Determinantal Point Processes are Hard to (Approximately) Evaluate. CoRR (2021)
Naoto Ohsaka, Tatsuya Matsuoka
Reconfiguration Problems on Submodular Functions. CoRR (2021)
Naoto Ohsaka, Tatsuya Matsuoka
Computational Complexity of Normalizing Constants for the Product of Determinantal Point Processes. CoRR (2021)
Naoto Ohsaka, Tatsuya Matsuoka
Approximation algorithm for submodular maximization under submodular cover. UAI (2021)
Tatsuya Matsuoka, Shinji Ito, Naoto Ohsaka
Tracking Regret Bounds for Online Submodular Optimization. AISTATS (2021)
Tatsuya Matsuoka, Naoto Ohsaka
Spanning tree constrained determinantal point processes are hard to (approximately) evaluate. Oper. Res. Lett. 49 (3) (2021)
Naoto Ohsaka, Tatsuya Matsuoka
On the (In)tractability of Computing Normalizing Constants for the Product of Determinantal Point Processes. ICML (2020)
Tatsuya Matsuoka, Shun Sato
Making Bidirected Graphs Strongly Connected. Algorithmica 82 (4) (2020)
Tatsuya Matsuoka, Shin-ichi Tanigawa
On reachability mixed arborescence packing. Discret. Optim. 32 (2019)
Tatsuya Matsuoka, Zoltán Szigeti
Polymatroid-based capacitated packing of branchings. Discret. Appl. Math. 270 (2019)
Tatsuya Matsuoka, Shin-ichi Tanigawa
On Reachability Mixed Arborescence Packing. CoRR (2018)
Tatsuya Matsuoka, Shun Sato
Making Bidirected Graphs Strongly Connected. CoRR (2017)
Attila Bernáth, Yusuke Kobayashi, Tatsuya Matsuoka
The Generalized Terminal Backup Problem. SIAM J. Discret. Math. 29 (3) (2015)