Kiyohito Nagano

17 papers A* 4A 1B 2Journal 8Unranked 2
YearRankTypeTitle / Venue / Authors
2021 J jnl
Optimal class assignment problem: a case study at Gunma University.
CoRR
Akifumi Kira, Kiyohito Nagano, Manabu Sugiyama, Naoyuki Kamiyama
2019 J jnl
Subadditive Load Balancing.
CoRR
Kiyohito Nagano, Akihiro Kishimoto
2016 A* conf
Evaluation of Auction-Based Multi-Robot Routing by Parallel Simulation.
ICAPS
Akihiro Kishimoto, Kiyohito Nagano
2014 J jnl
Optimization for Centralized and Decentralized Cognitive Radio Networks.
Proc. IEEE
Mikio Hasegawa, Hiroshi Hirai, Kiyohito Nagano, Hiroshi Harada, Kazuyuki Aihara
2013 A conf
Structured Convex Optimization under Submodular Constraints.
UAI
Kiyohito Nagano, Yoshinobu Kawahara
2013 J jnl
Structured Convex Optimization under Submodular Constraints.
CoRR
Kiyohito Nagano, Yoshinobu Kawahara
2012 B conf
Online Prediction under Submodular Constraints.
ALT
Daiki Suehiro, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Kiyohito Nagano
2011 A* conf
Size-constrained Submodular Minimization through Minimum Norm Base.
ICML
Kiyohito Nagano, Yoshinobu Kawahara, Kazuyuki Aihara
2011 J jnl
Submodular fractional programming for balanced clustering.
Pattern Recognit. Lett.
Yoshinobu Kawahara, Kiyohito Nagano, Yoshio Okamoto
2010 — conf
Minimum Average Cost Clustering.
NIPS
Kiyohito Nagano, Yoshinobu Kawahara, Satoru Iwata
2009 J jnl
A Structure Theory for the Parametric Submodular Intersection Problem.
Math. Oper. Res.
Satoru Fujishige, Kiyohito Nagano
2009 J jnl
Minimizing Continuous Extensions of Discrete Convex Functions with Linear Inequality Constraints.
SIAM J. Optim.
Satoru Fujishige, Takumi Hayashi, Kiyohito Nagano
2009 A* conf
Submodular Function Minimization under Covering Constraints.
FOCS
Satoru Iwata, Kiyohito Nagano
2009 — conf
Submodularity Cuts and Applications.
NIPS
Yoshinobu Kawahara, Kiyohito Nagano, Koji Tsuda, Jeff A. Bilmes
2007 J jnl
A strongly polynomial algorithm for line search in submodular polyhedra.
Discret. Optim.
Kiyohito Nagano
2007 A* conf
Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization.
SODA
Fabián A. Chudak, Kiyohito Nagano
2007 B conf
On Convex Minimization over Base Polytopes.
IPCO
Kiyohito Nagano