Kiyohito Nagano
Japanese / English
Kiyohito Nagano
I am a postdoc at "Global COE: Computationism as a Foundation for the Sciences (CompView in short)",
and a member of Masakazu Kojima Laboratory.
I was a PhD student at University of Tokyo, supervised by
Prof. Kazuo Murota and
Prof. Satoru Iwata,
and a special research student at RIMS, Kyoto University.
I received a PhD in information science and technology from University of Tokyo.
Reseach Interests
- Matroids, Submodular Functions, Discrete Convex Analysis
- Approximation Algorithms
- Convex Optimization
Refereed Papers
- 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.
Technical Reports
