The Generalized Terminal Backup Problem. - Attila Bernáth; Yusuke Kobayashi 001; Tatsuya Matsuoka (SIAM J. Discret. Math., 2015)

Polymatroid-based capacitated packing of branchings. - Tatsuya Matsuoka; Zoltán Szigeti (Discret. Appl. Math., 2019)

On reachability mixed arborescence packing. - Tatsuya Matsuoka; Shin-ichi Tanigawa (Discret. Optim., 2019)

On the (In)tractability of Computing Normalizing Constants for the Product of Determinantal Point Processes. - Naoto Ohsaka; Tatsuya Matsuoka (ICML, 2020)

Making Bidirected Graphs Strongly Connected. - Tatsuya Matsuoka; Shun Sato 001 (Algorithmica, 2020)

Maximization of Monotone k-Submodular Functions with Bounded Curvature and Non-k-Submodular Functions. - Tatsuya Matsuoka; Naoto Ohsaka (ACML, 2021)

On the Convex Combination of Determinantal Point Processes. - Tatsuya Matsuoka; Naoto Ohsaka; Akihiro Yabe (ACML, 2021)

Tracking Regret Bounds for Online Submodular Optimization. - Tatsuya Matsuoka; Shinji Ito; Naoto Ohsaka (AISTATS, 2021)

Approximation algorithm for submodular maximization under submodular cover. - Naoto Ohsaka; Tatsuya Matsuoka (UAI, 2021)

Spanning tree constrained determinantal point processes are hard to (approximately) evaluate. - Tatsuya Matsuoka; Naoto Ohsaka (Oper. Res. Lett., 2021)

Reconfiguration Problems on Submodular Functions. - Naoto Ohsaka; Tatsuya Matsuoka (WSDM, 2022)

Maximization of Minimum Weighted Hamming Distance between Set Pairs. - Tatsuya Matsuoka; Shinji Ito (ACML, 2023)

Online $ textrm{L}^{ atural }$-Convex Minimization. - Ken Yokoyama; Shinji Ito; Tatsuya Matsuoka; Kei Kimura; Makoto Yokoo (ECML/PKDD (5), 2024)

Online L♮-Convex Minimization. - Ken Yokoyama; Shinji Ito; Tatsuya Matsuoka; Kei Kimura; Makoto Yokoo (CoRR, 2024)

Computational complexity of normalizing constants for the product of determinantal point processes. - Tatsuya Matsuoka; Naoto Ohsaka (Theor. Comput. Sci., 2024)