Tatsuya Matsuoka

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