default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSatoko Moriguchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j10]Sena Safarina
, Satoko Moriguchi, Tim J. Mullin, Makoto Yamashita:
Conic relaxation approaches for equal deployment problems. Discret. Appl. Math. 275: 111-125 (2020)- [j9]Satoko Moriguchi, Kazuo Murota, Akihisa Tamura, Fabio Tardella:
Discrete Midpoint Convexity. Math. Oper. Res. 45(1): 99-128 (2020)
2010 – 2019
- 2019
- [j8]Satoko Moriguchi, Kazuo Murota:
Projection and convolution operations for integrally convex functions. Discret. Appl. Math. 255: 283-298 (2019) - [j7]Satoko Moriguchi, Kazuo Murota, Akihisa Tamura, Fabio Tardella:
Scaling, proximity, and optimization of integrally convex functions. Math. Program. 175(1-2): 119-154 (2019) - 2016
- [c4]Satoko Moriguchi, Kazuo Murota, Akihisa Tamura, Fabio Tardella:
Scaling and Proximity Properties of Integrally Convex Functions. ISAAC 2016: 57:1-57:13 - 2011
- [j6]Satoko Moriguchi, Akiyoshi Shioura, Nobuyuki Tsuchimura:
M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm. SIAM J. Optim. 21(3): 633-668 (2011) - [c3]Soichiro Ushio, Yuka Ito, Kazunori Okada, Tomoki Kitahara, Hidenori Tsuji, Satoko Moriguchi, Masahiko Narita, Yuka Kato:
The Digital Travel Diary System Using the Network Service Platform. AINA Workshops 2011: 890-895 - [c2]Soichiro Ushio, Kazunori Okada, Yasuhiko Kido, Tomoki Kitahara, Hidenori Tsuji, Satoko Moriguchi, Masahiko Narita, Yuka Kato:
A Home Security Service Robot System Using the Network Service Platform and Its Implementation. SAINT 2011: 402-407
2000 – 2009
- 2005
- [j5]Satoko Moriguchi, Kazuo Murota:
Discrete Hessian Matrix for L-Convex Functions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(5): 1104-1108 (2005) - [j4]Satoru Iwata, Satoko Moriguchi, Kazuo Murota:
A capacity scaling algorithm for M-convex submodular flow. Math. Program. 103(1): 181-202 (2005) - 2004
- [j3]Satoko Moriguchi, Akiyoshi Shioura:
On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem. Math. Oper. Res. 29(2): 394-397 (2004) - [c1]Satoru Iwata, Satoko Moriguchi, Kazuo Murota:
A Capacity Scaling Algorithm for M-convex Submodular Flow. IPCO 2004: 352-367 - 2003
- [j2]Satoko Moriguchi, Kazuo Murota:
Capacity scaling algorithm for scalable M-convex submodular flow problems. Optim. Methods Softw. 18(2): 207-218 (2003) - 2002
- [j1]Satoko Moriguchi, Kazuo Murota, Akiyoshi Shioura:
Scaling Algorithms for M-Convex Function Minimization. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(5): 922-929 (2002)
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-04-24 22:55 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:
