- CSB - MetaPress - Google - Bing - Yahoo
 | 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 Recognition Letters 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 |
| 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 Journal on Optimization 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. Discrete Optimization 4(3-4): 349-359 (2007) |
| c2 | | |
| 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 |
Data released under the ODC-BY 1.0 license — See also our legal information page