Naoya Uematsu

Identifiers

• name variant Naoya Uematsu 0.50 · backfill

Papers (2)

1. An efficient branch-and-cut algorithm for approximately submodular function maximization cs.DS · 2019 · author #1
2. An efficient branch-and-bound algorithm for submodular function maximization cs.DS · 2018 · author #1

Mentions

No mention provenance yet.

Frequent Coauthors

• Shunji Umetani 2 shared papers
• Yoshinobu Kawahara 2 shared papers