According to our database1, Naoyuki Kamiyama authored at least 46 papers between 2006 and 2019.
Legend:Book In proceedings Article PhD thesis Other
Minimum-Cost b-Edge Dominating Sets on Trees.
A Note on Submodular Function Minimization with Covering Type Linear Constraints.
The b-Branching Problem in Digraphs.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018
On the Complexity of Stable Fractional Hypergraph Matching.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018
A note on the submodular vertex cover problem with submodular penalties.
Theor. Comput. Sci., 2017
Popular Matchings with Ties and Matroid Constraints.
SIAM J. Discrete Math., 2017
Strategic issues in college admissions with score-limits.
Oper. Res. Lett., 2017
Submodular Function Minimization with Submodular Set Covering Constraints and Precedence Constraints.
Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017
Modeling and Managing Airport Passenger Flow Under Uncertainty: A Case of Fukuoka Airport in Japan.
Proceedings of the Social Informatics, 2017
Reconfiguration of Maximum-Weight b-Matchings in a Graph.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017
Tight Approximability of the Server Allocation Problem for Real-Time Applications.
Proceedings of the Algorithmic Aspects of Cloud Computing - Third International Workshop, 2017
Extended formulations for sparsity matroids.
Math. Program., 2016
Exact and Approximation Algorithms for Weighted Matroid Intersection.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
The Mixed Evacuation Problem.
Proceedings of the Combinatorial Optimization and Applications, 2016
Efficient Stabilization of Cooperative Matching Games.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016
The nucleolus of arborescence games in directed acyclic graphs.
Oper. Res. Lett., 2015
On packing arborescences in temporal networks.
Inf. Process. Lett., 2015
Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints.
Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015
An inductive construction of minimally rigid body-hinge simple graphs.
Theor. Comput. Sci., 2014
A New Approach to the Pareto Stable Matching Problem.
Math. Oper. Res., 2014
The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths.
Discrete Applied Mathematics, 2014
Minimum-Cost b -Edge Dominating Sets on Trees.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014
The Popular Matching and Condensation Problems Under Matroid Constraints.
Proceedings of the Combinatorial Optimization and Applications, 2014
A note on the serial dictatorship with project closures.
Oper. Res. Lett., 2013
Independent arborescences in directed graphs.
Discrete Mathematics, 2013
On Total Unimodularity of Edge-Edge Adjacency Matrices.
An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2013
The root location problem for arc-disjoint arborescences.
Discrete Applied Mathematics, 2012
A matroid approach to stable matchings with lower quotas.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem.
Inf. Process. Lett., 2011
Improved Approximation Algorithms for Firefighter Problem on Trees.
IEICE Transactions, 2011
Submodular Function Minimization under a Submodular Set Covering Constraint.
Proceedings of the Theory and Applications of Models of Computation, 2011
Robustness of Minimum Cost Arborescences.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011
On Totally Unimodularity of Edge-Edge Adjacency Matrices.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011
Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking.
Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011
The Prize-Collecting Edge Dominating Set Problem in Trees.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010
A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph.
Inf. Process. Lett., 2009
Computational Complexities of University Interview Timetabling.
IEICE Transactions, 2009
An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths.
Discrete Applied Mathematics, 2009
A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
Arc-disjoint in-trees in directed graphs.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
The Minimum Weight In-Tree Cover Problem.
Proceedings of the Modelling, 2008
Covering Directed Graphs by In-Trees.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008
An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths.
Proceedings of the Algorithmic Aspects in Information and Management, 2007
An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity.
IEICE Transactions, 2006
An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity.
Proceedings of the Algorithmic Aspects in Information and Management, 2006