永野清仁 (Kiyohito Nagano)

東京工業大学情報理工学研究科
グローバルCOEプログラム『計算世界観の深化と展開』
ポスドク研究員

E-mail:

日本オペレーションズ・リサーチ学会第23回学生論文賞受賞 (2005年)
情報処理学会コンピュータサイエンス領域奨励賞受賞 (2007年)

Yoshinobu Kawahara, Kiyohito Nagano, Koji Tsuda, and Jeff Bilmes:
Submodularity Cuts and Applications.
To appear in the 23rd Annual Conference on Neural Information Processing Systems (NIPS 2009 ).
Satoru Iwata and Kiyohito Nagano:
Submodular function minimization under covering constraints.
To appear in Proceedings of the 50th Annual Symposium on Foundations of Computer Science (FOCS 2009 ).
(Refer also to RIMS Preprint 1668, Kyoto University, April 2009.)
Satoru Fujishige and Kiyohito Nagano:
A structure theory for the parametric submodular intersection problem.
Mathematics of Operations Research, 34 (2009), pp. 513-521.
Satoru Fujishige, Takumi Hayashi, and Kiyohito Nagano:
Minimizing discrete convex functions with linear inequality constraints.
SIAM Journal on Optimization, 20 (2009), pp. 856-867.
Kiyohito Nagano:
On convex minimization over base polytopes.
Proceedings of the 12th IPCO Conference, Lecture Notes in Computer Science, LNCS 4513, Springer-Verlag (2007), pp. 252-266.
Fabián Chudak and Kiyohito Nagano:
Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization.
Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 79-88.
Kiyohito Nagano:
A strongly polynomial algorithm for line search in submodular polyhedra.
Discrete Optimization 4 (2007), pp. 349-359.

劣モジュラ性多面体上の最適化アルゴリズムの研究 .
東京大学, 2005年 (指導教員 : 松井知己).

Combinatorial Algorithms for Continuous Optimization with Submodular Structure.
東京大学, 2008年(指導教員 : 室田一雄，岩田覚).

Kiyohito Nagano: On convex minimization over base polytopes.
The 12th IPCO Conference, New York, USA, June 2007.
Fabián Chudak and Kiyohito Nagano: Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization.
The 18th ACM-SIAM Symposium on Discrete Algorithms, New Orleans, USA, January 2007.
Fabián Chudak and Kiyohito Nagano: Approximation Algorithms for Facility Locations with Submodular Penalties and Generalized Set Covering Problems.
The 19th International Symposium on Mathematical Programming, Rio de Janeiro, Brazil, July-August 2006.
Kiyohito Nagano: A strongly polynomial algorithm for line search in submodular polyhedra.
The 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Budapest, Hungary, June 2005.

永野 清仁 (Kiyohito Nagano)