default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTatsuya Matsuoka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Tatsuya Matsuoka, Naoto Ohsaka
:
Computational complexity of normalizing constants for the product of determinantal point processes. Theor. Comput. Sci. 997: 114513 (2024)- [c8]Ken Yokoyama, Shinji Ito, Tatsuya Matsuoka, Kei Kimura, Makoto Yokoo:
Online $\textrm{L}^{\natural }$-Convex Minimization. ECML/PKDD (5) 2024: 319-336 - [i6]Ken Yokoyama, Shinji Ito, Tatsuya Matsuoka, Kei Kimura, Makoto Yokoo:
Online L♮-Convex Minimization. CoRR abs/2404.17158 (2024) - 2023
- [c7]Tatsuya Matsuoka, Shinji Ito:
Maximization of Minimum Weighted Hamming Distance between Set Pairs. ACML 2023: 895-910 - 2022
- [c6]Naoto Ohsaka, Tatsuya Matsuoka:
Reconfiguration Problems on Submodular Functions. WSDM 2022: 764-774 - 2021
- [j5]Tatsuya Matsuoka, Naoto Ohsaka:
Spanning tree constrained determinantal point processes are hard to (approximately) evaluate. Oper. Res. Lett. 49(3): 304-309 (2021) - [c5]Tatsuya Matsuoka, Naoto Ohsaka, Akihiro Yabe:
On the Convex Combination of Determinantal Point Processes. ACML 2021: 158-173 - [c4]Tatsuya Matsuoka, Naoto Ohsaka:
Maximization of Monotone k-Submodular Functions with Bounded Curvature and Non-k-Submodular Functions. ACML 2021: 1707-1722 - [c3]Tatsuya Matsuoka, Shinji Ito, Naoto Ohsaka:
Tracking Regret Bounds for Online Submodular Optimization. AISTATS 2021: 3421-3429 - [c2]Naoto Ohsaka, Tatsuya Matsuoka:
Approximation algorithm for submodular maximization under submodular cover. UAI 2021: 792-801 - [i5]Tatsuya Matsuoka, Naoto Ohsaka:
Spanning Tree Constrained Determinantal Point Processes are Hard to (Approximately) Evaluate. CoRR abs/2102.12646 (2021) - [i4]Naoto Ohsaka, Tatsuya Matsuoka:
Reconfiguration Problems on Submodular Functions. CoRR abs/2111.14030 (2021) - [i3]Naoto Ohsaka, Tatsuya Matsuoka:
Computational Complexity of Normalizing Constants for the Product of Determinantal Point Processes. CoRR abs/2111.14148 (2021) - 2020
- [j4]Tatsuya Matsuoka, Shun Sato:
Making Bidirected Graphs Strongly Connected. Algorithmica 82(4): 787-807 (2020) - [c1]Naoto Ohsaka, Tatsuya Matsuoka:
On the (In)tractability of Computing Normalizing Constants for the Product of Determinantal Point Processes. ICML 2020: 7414-7423
2010 – 2019
- 2019
- [j3]Tatsuya Matsuoka, Zoltán Szigeti:
Polymatroid-based capacitated packing of branchings. Discret. Appl. Math. 270: 190-203 (2019) - [j2]Tatsuya Matsuoka, Shin-ichi Tanigawa:
On reachability mixed arborescence packing. Discret. Optim. 32: 1-10 (2019) - 2018
- [i2]Tatsuya Matsuoka, Shin-ichi Tanigawa:
On Reachability Mixed Arborescence Packing. CoRR abs/1808.07332 (2018) - 2017
- [i1]Tatsuya Matsuoka, Shun Sato:
Making Bidirected Graphs Strongly Connected. CoRR abs/1709.00824 (2017) - 2015
- [j1]Attila Bernáth, Yusuke Kobayashi, Tatsuya Matsuoka:
The Generalized Terminal Backup Problem. SIAM J. Discret. Math. 29(3): 1764-1782 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 01:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
