default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKiyohito Nagano
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i3]Akifumi Kira, Kiyohito Nagano, Manabu Sugiyama, Naoyuki Kamiyama:
Optimal class assignment problem: a case study at Gunma University. CoRR abs/2103.16879 (2021)
2010 – 2019
- 2019
- [i2]Kiyohito Nagano, Akihiro Kishimoto:
Subadditive Load Balancing. CoRR abs/1908.09135 (2019) - 2016
- [c9]Akihiro Kishimoto, Kiyohito Nagano:
Evaluation of Auction-Based Multi-Robot Routing by Parallel Simulation. ICAPS 2016: 495-503 - 2014
- [j5]Mikio Hasegawa
, Hiroshi Hirai, Kiyohito Nagano, Hiroshi Harada, Kazuyuki Aihara:
Optimization for Centralized and Decentralized Cognitive Radio Networks. Proc. IEEE 102(3): 574-584 (2014) - 2013
- [c8]Kiyohito Nagano, Yoshinobu Kawahara:
Structured Convex Optimization under Submodular Constraints. UAI 2013 - [i1]Kiyohito Nagano, Yoshinobu Kawahara:
Structured Convex Optimization under Submodular Constraints. CoRR abs/1309.6850 (2013) - 2012
- [c7]Daiki Suehiro, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Kiyohito Nagano:
Online Prediction under Submodular Constraints. ALT 2012: 260-274 - 2011
- [j4]Yoshinobu Kawahara, Kiyohito Nagano, Yoshio Okamoto:
Submodular fractional programming for balanced clustering. Pattern Recognit. Lett. 32(2): 235-243 (2011) - [c6]Kiyohito Nagano, Yoshinobu Kawahara, Kazuyuki Aihara:
Size-constrained Submodular Minimization through Minimum Norm Base. ICML 2011: 977-984 - 2010
- [c5]Kiyohito Nagano, Yoshinobu Kawahara, Satoru Iwata:
Minimum Average Cost Clustering. NIPS 2010: 1759-1767
2000 – 2009
- 2009
- [j3]Satoru Fujishige, Kiyohito Nagano:
A Structure Theory for the Parametric Submodular Intersection Problem. Math. Oper. Res. 34(3): 513-521 (2009) - [j2]Satoru Fujishige, Takumi Hayashi, Kiyohito Nagano:
Minimizing Continuous Extensions of Discrete Convex Functions with Linear Inequality Constraints. SIAM J. Optim. 20(2): 856-867 (2009) - [c4]Satoru Iwata, Kiyohito Nagano:
Submodular Function Minimization under Covering Constraints. FOCS 2009: 671-680 - [c3]Yoshinobu Kawahara, Kiyohito Nagano, Koji Tsuda, Jeff A. Bilmes:
Submodularity Cuts and Applications. NIPS 2009: 916-924 - 2007
- [j1]Kiyohito Nagano:
A strongly polynomial algorithm for line search in submodular polyhedra. Discret. Optim. 4(3-4): 349-359 (2007) - [c2]Kiyohito Nagano:
On Convex Minimization over Base Polytopes. IPCO 2007: 252-266 - [c1]Fabián A. Chudak, Kiyohito Nagano:
Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization. SODA 2007: 79-88
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-25 05:51 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:
