If you made any changes in Pure these will be visible here soon.

Research Output 2006 2020

  • 199 Citations
  • 7 h-Index
  • 39 Article
  • 24 Conference contribution
  • 1 Chapter
Article
Matching problem
Bipartite graph
Polynomials
4 Citations (Scopus)

A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph

Bérczi, K., Fujishige, S. & Kamiyama, N., Nov 15 2009, In : Information Processing Letters. 109, 23-24, p. 1227-1231 5 p.

Research output: Contribution to journalArticle

Directed Acyclic Graph
Directed graphs
Linear-time Algorithm
Computational complexity
Disjoint
14 Citations (Scopus)

A matroid approach to stable matchings with lower quotas

Fleiner, T. & Kamiyama, N., May 2016, In : Mathematics of Operations Research. 41, 2, p. 734-744 11 p.

Research output: Contribution to journalArticle

Stable Matching
Matroid
Matching Problem
Assignment
Polynomials
5 Citations (Scopus)

An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem

Matsumoto, Y., Kamiyama, N. & Imai, K., Apr 30 2011, In : Information Processing Letters. 111, 10, p. 465-468 4 p.

Research output: Contribution to journalArticle

Edge Coloring
Approximation algorithms
Coloring
Matching Problem
Approximation Algorithms
21 Citations (Scopus)

An efficient algorithm for evacuation problem in dynamic network flows with uniform arc capacity

Kamiyama, N., Katoh, N. & Takizawa, A., Jan 1 2006, In : IEICE Transactions on Information and Systems. E89-D, 8, p. 2372-2379 8 p.

Research output: Contribution to journalArticle

Directed graphs
13 Citations (Scopus)

An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths

Kamiyama, N., Katoh, N. & Takizawa, A., Oct 28 2009, In : Discrete Applied Mathematics. 157, 17, p. 3665-3677 13 p.

Research output: Contribution to journalArticle

Evacuation
Path Length
Efficient Algorithms
Arc of a curve
Polynomials
7 Citations (Scopus)

A new approach to the pareto stable matching problem

Kamiyama, N., Aug 2014, In : Mathematics of Operations Research. 39, 3, p. 851-862 12 p.

Research output: Contribution to journalArticle

Stable Matching
Matching Problem
Pareto
Many to many
Polynomials

An improved algorithm for testing substitutability of weak preferences

Kawanaka, S. & Kamiyama, N., May 1 2019, In : Mathematical Social Sciences. 99, p. 1-4 4 p.

Research output: Contribution to journalArticle

Testing
Substitutability
time
Generalization
Class
1 Citation (Scopus)

An inductive construction of minimally rigid body-hinge simple graphs

Kobayashi, Y., Higashikawa, Y., Katoh, N. & Kamiyama, N., Jan 1 2014, In : Theoretical Computer Science. 556, C, p. 2-12 11 p.

Research output: Contribution to journalArticle

Hinges
Simple Graph
Rigid Body
Graph in graph theory
Subspace
1 Citation (Scopus)

A note on balanced flows in equality networks

Kamiyama, N., May 1 2019, In : Information Processing Letters. 145, p. 74-76 3 p.

Research output: Contribution to journalArticle

Equality
Market
3 Citations (Scopus)

A Note on Submodular Function Minimization with Covering Type Linear Constraints

Kamiyama, N., Oct 1 2018, In : Algorithmica. 80, 10, p. 2957-2971 15 p.

Research output: Contribution to journalArticle

Function Minimization
Submodular Function
Approximation algorithms
Linear Constraints
Approximation Algorithms
8 Citations (Scopus)

A note on the serial dictatorship with project closures

Kamiyama, N., Aug 26 2013, In : Operations Research Letters. 41, 5, p. 559-561 3 p.

Research output: Contribution to journalArticle

Closure
Pareto
Dictatorship
Serials
Strategy
1 Citation (Scopus)

A note on the submodular vertex cover problem with submodular penalties

Kamiyama, N., Jan 10 2017, In : Theoretical Computer Science. 659, p. 95-97 3 p.

Research output: Contribution to journalArticle

Vertex Cover
Approximation algorithms
Penalty
Approximation Algorithms
19 Citations (Scopus)

Arc-disjoint in-trees in directed graphs

Kamiyama, N., Katoh, N. & Takizawa, A., Mar 1 2009, In : Combinatorica. 29, 2, p. 197-214 18 p.

Research output: Contribution to journalArticle

Directed graphs
Directed Graph
Disjoint
Arc of a curve
Necessary Conditions

Computational complexities of university interview timetabling

Kamiyama, N., Kiyonari, Y., Miyano, E., Miyazaki, S. & Yamanaka, K., Jan 1 2009, In : IEICE Transactions on Information and Systems. E92-D, 2, p. 130-140 11 p.

Research output: Contribution to journalArticle

Computational complexity
Students

Covering directed graphs by in-trees

Kamiyama, N. & Katoh, N., Jan 1 2011, In : Journal of Combinatorial Optimization. 21, 1, p. 2-18 17 p.

Research output: Contribution to journalArticle

Covering Graph
Directed graphs
Directed Graph
Polynomials
Covering

Discrete Newton methods for the evacuation problem

Kamiyama, N., Nov 26 2019, In : Theoretical Computer Science. 795, p. 510-519 10 p.

Research output: Contribution to journalArticle

Evacuation
Dynamic Networks
Newton-Raphson method
Newton Methods
Vertex of a graph
5 Citations (Scopus)

Efficient stabilization of cooperative matching games

Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., May 16 2017, In : Theoretical Computer Science. 677, p. 69-82 14 p.

Research output: Contribution to journalArticle

Stabilization
Game
Bargaining
NP-complete problem
Vertex of a graph

Exact and approximation algorithms for weighted matroid intersection

Huang, C. C., Kakimura, N. & Kamiyama, N., Sep 1 2019, In : Mathematical Programming. 177, 1-2, p. 85-112 28 p.

Research output: Contribution to journalArticle

Matroid Intersection
Approximation algorithms
Exact Algorithms
Approximation Algorithms
Decomposition Techniques
2 Citations (Scopus)

Extended formulations for sparsity matroids

Iwata, S., Kamiyama, N., Katoh, N., Kijima, S. & Okamoto, Y., Jul 1 2016, In : Mathematical Programming. 158, 1-2, p. 565-574 10 p.

Research output: Contribution to journalArticle

Extended Formulations
Matroid
Sparsity
Polynomials
Polytope
17 Citations (Scopus)

Improved approximation algorithms for firefighter problem on trees

Iwaikawa, Y., Kamiyama, N. & Matsui, T., Feb 2011, In : IEICE Transactions on Information and Systems. E94-D, 2, p. 196-199 4 p.

Research output: Contribution to journalArticle

Approximation algorithms
Computer viruses
Fires

Independent arborescences in directed graphs

Frank, A., Fujishige, S., Kamiyama, N. & Katoh, N., Jan 1 2013, In : Discrete Mathematics. 313, 4, p. 453-459 7 p.

Research output: Contribution to journalArticle

Directed graphs
Directed Graph
Disjoint
Vertex of a graph
Walk

Lexicographically optimal earliest arrival flows

Kamiyama, N., Jan 1 2020, In : Networks. 75, 1, p. 18-33 16 p.

Research output: Contribution to journalArticle

Polynomials
Directed graphs

Many-to-many stable matchings with ties in trees

Nakamura, K. & Kamiyama, N., Jan 1 2016, In : Journal of the Operations Research Society of Japan. 59, 3, p. 225-240 16 p.

Research output: Contribution to journalArticle

Stable matching
Matching problem
NP-hard
Matching markets
Polynomials

Minimum-Cost b-Edge Dominating Sets on Trees

Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., Jan 15 2019, In : Algorithmica. 81, 1, p. 343-366 24 p.

Research output: Contribution to journalArticle

Dominating Set
Polynomials
Costs
Polynomial-time Algorithm
Linear programming
7 Citations (Scopus)

Netal: High-performance implementation of network analysis library considering computer memory hierarchy

Yasui, Y., Fujisawa, K., Goto, K., Kamiyama, N. & Talcamatsu, M., Dec 2011, In : Journal of the Operations Research Society of Japan. 54, 4, p. 259-280 22 p.

Research output: Contribution to journalArticle

Shortest path
Network analysis
High performance
Graph
Centrality

On packing arborescences in temporal networks

Kamiyama, N. & Kawase, Y., Jan 1 2015, In : Information Processing Letters. 115, 2, p. 321-325 5 p.

Research output: Contribution to journalArticle

Packing
Labels
Directed graphs
Arc of a curve
Directed Graph
2 Citations (Scopus)

On total unimodularity of edge-edge adjacency matrices

Matsumoto, Y., Kamiyama, N. & Imai, K., Oct 1 2013, In : Algorithmica. 67, 2, p. 277-292 16 p.

Research output: Contribution to journalArticle

Adjacency Matrix
Adjacency
Dominating Set
Matching Problem
Graph in graph theory

Pareto stable matchings under one-sided matroid constraints

Kamiyama, N., Jan 1 2019, In : SIAM Journal on Discrete Mathematics. 33, 3, p. 1431-1451 21 p.

Research output: Contribution to journalArticle

Stable Matching
Matroid
Pareto
Many to many
Solution Concepts
5 Citations (Scopus)

Popular matchings with ties and matroid constraints

Kamiyama, N., Jan 1 2017, In : SIAM Journal on Discrete Mathematics. 31, 3, p. 1801-1819 19 p.

Research output: Contribution to journalArticle

Tie
Matroid
Polynomial time
Matching Problem
Independent Set

Reconfiguration of maximum-weight b-matchings in a graph

Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., Feb 15 2019, In : Journal of Combinatorial Optimization. 37, 2, p. 454-464 11 p.

Research output: Contribution to journalArticle

Reconfiguration
Polynomials
Graph in graph theory
Bipartite Graph
Integer
2 Citations (Scopus)

Robustness of minimum cost arborescences

Kamiyama, N., Oct 1 2012, In : Japan Journal of Industrial and Applied Mathematics. 29, 3, p. 485-497 13 p.

Research output: Contribution to journalArticle

Robustness
Directed graphs
Costs
Spanning tree
Undirected Graph

Strategic issues in college admissions with score-limits

Kamiyama, N., Mar 1 2017, In : Operations Research Letters. 45, 2, p. 105-108 4 p.

Research output: Contribution to journalArticle

Polynomial time
Polynomials
Nash Equilibrium
Solvability
College admissions

The mixed evacuation problem

Hanawa, Y., Higashikawa, Y., Kamiyama, N., Katoh, N. & Takizawa, A., Nov 1 2018, In : Journal of Combinatorial Optimization. 36, 4, p. 1299-1314 16 p.

Research output: Contribution to journalArticle

Evacuation
Polynomials
Directed graphs
Railroad cars
Hardness
2 Citations (Scopus)

The nucleolus of arborescence games in directed acyclic graphs

Kamiyama, N., Jan 2015, In : Operations Research Letters. 43, 1, p. 89-92 4 p.

Research output: Contribution to journalArticle

Nucleolus
Directed Acyclic Graph
Game
Linear Time
Directed acyclic graph
1 Citation (Scopus)
Matroid
Condensation
Polynomials
Matching Problem
Tie
5 Citations (Scopus)

The popular matching and condensation problems under matroid constraints

Kamiyama, N., Nov 1 2016, In : Journal of Combinatorial Optimization. 32, 4, p. 1305-1326 22 p.

Research output: Contribution to journalArticle

Matroid
Condensation
Matching Problem
Polynomials
Polynomial-time Algorithm
1 Citation (Scopus)

The root location problem for arc-disjoint arborescences

Fujishige, S. & Kamiyama, N., Sep 1 2012, In : Discrete Applied Mathematics. 160, 13-14, p. 1964-1970 7 p.

Research output: Contribution to journalArticle

Location Problem
Disjoint
Arc of a curve
Roots
Vertex of a graph
3 Citations (Scopus)

The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths

Kamiyama, N. & Katoh, N., Dec 11 2014, In : Discrete Applied Mathematics. 178, p. 89-100 12 p.

Research output: Contribution to journalArticle

Dynamic Networks
Path Length
Polynomials
Polynomial-time Algorithm
Arc of a curve
Chapter

Minimum-cost b-Edge dominating sets on trees

Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., Jan 1 2014, Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings. Ahn, H-K. & Shin, C-S. (eds.). Springer Verlag, p. 195-207 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8889).

Research output: Chapter in Book/Report/Conference proceedingChapter

Dominating Set
Polynomials
Costs
Polynomial-time Algorithm
Computational complexity
Conference contribution
11 Citations (Scopus)

A matroid approach to stable matchings with lower quotas

Fleiner, T. & Kamiyama, N., Apr 30 2012, Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012. p. 135-142 8 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Stable Matching
Matroid
Polynomials
Matching Problem
Assignment
5 Citations (Scopus)

An efficient algorithm for evacuation problems in dynamic network flows with uniform arc capacity

Kamiyama, N., Katoh, N. & Takizawa, A., Jan 1 2006, Algorithmic Aspects in Information and Management - Second International Conference, AAIM 2006, Proceedings. Springer Verlag, p. 231-242 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4041 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Evacuation
Network Flow
Directed graphs
Dynamic Networks
Arc of a curve
2 Citations (Scopus)

An efficient algorithm for the evacuation problem in a certain class of a network with uniform path-lengths

Kamiyama, N., Katoh, N. & Takizawa, A., Dec 1 2007, Algorithmic Aspects in Information and Management - Third International Conference, AAIM 2007, Proceedings. p. 178-190 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4508 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Evacuation
Path Length
Efficient Algorithms
Arc of a curve
Polynomials
1 Citation (Scopus)

An inductive construction of minimally rigid body-hinge simple graphs

Higashikawa, Y., Kamiyama, N., Katoh, N. & Kobayashi, Y., Dec 1 2013, Combinatorial Optimization and Applications - 7th International Conference, COCOA 2013, Proceedings. p. 165-177 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8287 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hinges
Simple Graph
Rigid Body
Combinatorial optimization
Combinatorial Optimization

A polynomial-time algorithm for the universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths

Kamiyama, N. & Katoh, N., Dec 1 2009, Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings. p. 802-811 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5878 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dynamic Networks
Path Length
Polynomial-time Algorithm
Polynomials
Arc of a curve

Approximation algorithms for data association problem arising from multitarget tracking

Kamiyama, N. & Matsui, T., Dec 1 2011, Theory of Computing 2011 - Proceedings of the 17th Computing: The Australasian Theory Symposium, CATS 2011. p. 137-143 7 p. (Conferences in Research and Practice in Information Technology Series; vol. 119).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Approximation algorithms
Polynomials
6 Citations (Scopus)

Arc-disjoint in-trees in directed graphs

Kamiyama, N., Katoh, N. & Takizawa, A., Dec 1 2008, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 518-526 9 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Directed graphs
Directed Graph
Disjoint
Arc of a curve
Necessary Conditions
1 Citation (Scopus)

Covering directed graphs by in-trees

Kamiyama, N. & Katoh, N., Aug 4 2008, Computing and Combinatorics - 14th Annual International Conference, COCOON 2008, Proceedings. p. 444-457 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5092 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Covering Graph
Directed graphs
Directed Graph
Polynomials
Covering
3 Citations (Scopus)

Efficient stabilization of cooperative matching games

Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., Jan 1 2016, AAMAS 2016 - Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), p. 41-49 9 p. (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Stabilization
Combinatorial optimization
Polynomials
3 Citations (Scopus)

Exact and approximation algorithms for weighted matroid intersection

Huang, C. C., Kakimura, N. & Kamiyama, N., Jan 1 2016, 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. Krauthgamer, R. (ed.). Association for Computing Machinery, p. 430-444 15 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 1).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Matroid Intersection
Approximation algorithms
Exact Algorithms
Approximation Algorithms
Matroid