Kiyohito Nagano

According to our database1, Kiyohito Nagano authored at least 16 papers between 2007 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Optimal class assignment problem: a case study at Gunma University.
CoRR, 2021

2019
Subadditive Load Balancing.
CoRR, 2019

2016
Evaluation of Auction-Based Multi-Robot Routing by Parallel Simulation.
Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

2014
Optimization for Centralized and Decentralized Cognitive Radio Networks.
Proc. IEEE, 2014

2013
Structured Convex Optimization under Submodular Constraints.
Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, 2013

2012
Online Prediction under Submodular Constraints.
Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

2011
Submodular fractional programming for balanced clustering.
Pattern Recognit. Lett., 2011

Size-constrained Submodular Minimization through Minimum Norm Base.
Proceedings of the 28th International Conference on Machine Learning, 2011

2010
Minimum Average Cost Clustering.
Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

2009
Minimizing Continuous Extensions of Discrete Convex Functions with Linear Inequality Constraints.
SIAM J. Optim., 2009

A Structure Theory for the Parametric Submodular Intersection Problem.
Math. Oper. Res., 2009

Submodularity Cuts and Applications.
Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, 2009

Submodular Function Minimization under Covering Constraints.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2007
A strongly polynomial algorithm for line search in submodular polyhedra.
Discret. Optim., 2007

Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

On Convex Minimization over Base Polytopes.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007


  Loading...