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
2011
2 Citations (Scopus)

Robustness of minimum cost arborescences

Kamiyama, N., Dec 26 2011, Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings. p. 130-139 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7074 LNCS).

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

Directed graphs
Robustness
Costs
Graph in graph theory
Directed Graph
4 Citations (Scopus)

Submodular function minimization under a submodular set covering constraint

Kamiyama, N., May 13 2011, Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Proceedings. Vol. 6648 LNCS. p. 133-141 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6648 LNCS).

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

Function Minimization
Submodular Function
Set Covering
Approximation algorithms
Cost functions
2010
2 Citations (Scopus)

The prize-collecting edge dominating set problem in trees

Kamiyama, N., Nov 22 2010, Mathematical Foundations of Computer Science 2010 - 35th International Symposium, MFCS 2010, Proceedings. p. 465-476 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6281 LNCS).

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

Dominating Set
Polynomials
Approximation algorithms
Polynomial time
Penalty
2009
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
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

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
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
2008
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
1 Citation (Scopus)

The Minimum Weight In-Tree Cover Problem

Kamiyama, N. & Katoh, N., Dec 1 2008, Modelling, Computation and Optimization in Information Systems and Management Sciences - Second International Conference, MCO 2008, Proceedings. p. 155-164 10 p. (Communications in Computer and Information Science; vol. 14).

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

Directed graphs
Polynomials
Pipe
2007
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
2006
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
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