Tatsuya Matsuoka

Orcid: 0000-0002-7677-0576

According to our database1, Tatsuya Matsuoka authored at least 12 papers between 2015 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Reconfiguration Problems on Submodular Functions.
Proceedings of the WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining, Virtual Event / Tempe, AZ, USA, February 21, 2022

2021
Spanning tree constrained determinantal point processes are hard to (approximately) evaluate.
Oper. Res. Lett., 2021

Computational Complexity of Normalizing Constants for the Product of Determinantal Point Processes.
CoRR, 2021

Approximation algorithm for submodular maximization under submodular cover.
Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

Tracking Regret Bounds for Online Submodular Optimization.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

On the Convex Combination of Determinantal Point Processes.
Proceedings of the Asian Conference on Machine Learning, 2021

Maximization of Monotone k-Submodular Functions with Bounded Curvature and Non-k-Submodular Functions.
Proceedings of the Asian Conference on Machine Learning, 2021

2020
Making Bidirected Graphs Strongly Connected.
Algorithmica, 2020

On the (In)tractability of Computing Normalizing Constants for the Product of Determinantal Point Processes.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
On reachability mixed arborescence packing.
Discret. Optim., 2019

Polymatroid-based capacitated packing of branchings.
Discret. Appl. Math., 2019

2015
The Generalized Terminal Backup Problem.
SIAM J. Discret. Math., 2015


  Loading...