Research Output per year

## Research Output 2006 2020

- 1 - 50 out of 64 results
- Title (ascending)

### A characterization of weighted popular matchings under matroid constraints

Kamiyama, N., Jan 2018, In : Journal of the Operations Research Society of Japan. 61, 1, p. 2-17 16 p.Research output: Contribution to journal › Article

### 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 journal › Article

### 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 proceeding › Conference contribution

### 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 journal › Article

### 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 journal › Article

### 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 journal › Article

### 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 proceeding › Conference contribution

### 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 proceeding › Conference contribution

### 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 journal › Article

### 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 journal › Article

### 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 journal › Article

### 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 proceeding › Conference contribution

### 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 journal › Article

### 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 journal › Article

### 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 journal › Article

### 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 journal › Article

### 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 journal › Article

### 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 proceeding › Conference contribution

### 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 proceeding › Conference contribution

### 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 journal › Article

### 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 proceeding › Conference contribution

### 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 journal › Article

### 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 proceeding › Conference contribution

### 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 journal › Article

### 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 journal › Article

### 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 proceeding › Conference contribution

### 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 journal › Article

### 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 journal › Article

### 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 proceeding › Conference contribution

### 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 journal › Article

### 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 journal › Article

### 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 journal › Article

### Lexicographically optimal earliest arrival flows

Kamiyama, N., Jan 1 2020, In : Networks. 75, 1, p. 18-33 16 p.Research output: Contribution to journal › Article

### 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 journal › Article

### 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 proceeding › Chapter

### 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 journal › Article

### Modeling and managing airport passenger flow under uncertainty: A case of fukuoka airport in Japan

Yamada, H., Ohori, K., Iwao, T., Kira, A., Kamiyama, N., Yoshida, H. & Anai, H., Jan 1 2017,*Social Informatics - 9th International Conference, SocInfo 2017, Proceedings.*Ciampaglia, G. L., Yasseri, T. & Mashhadi, A. (eds.). Springer Verlag, p. 419-430 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10540 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

### 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 journal › Article

### 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 journal › Article

### On the complexity of stable fractional hypergraph matching

Ishizuka, T. & Kamiyama, N., Dec 1 2018,*29th International Symposium on Algorithms and Computation, ISAAC 2018.*Liao, C-S., Lee, D-T. & Hsu, W-L. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 123).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

### On totally unimodularity of edge-edge adjacency matrices

Matsumoto, Y., Kamiyama, N. & Imai, K., Aug 29 2011,*Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Proceedings.*p. 354-365 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6842 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

### 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 journal › Article

### 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 journal › Article

### 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 journal › Article

### 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 journal › Article

### Reconfiguration of maximum-weight b-matchings in a graph

Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., Jan 1 2017,*Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings.*Cao, Y. & Chen, J. (eds.). Springer Verlag, p. 287-296 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10392 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

### 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 proceeding › Conference contribution

### 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 journal › Article

### Shortest reconfiguration of perfect matchings via alternating cycles

Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., Sep 2019,*27th Annual European Symposium on Algorithms, ESA 2019.*Bender, M. A., Svensson, O. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 61. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 144).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

### Stable matchings with ties, master preference lists, and matroid constraints

Kamiyama, N., Jan 1 2015,*Algorithmic Game Theory - 8th International Symposium, SAGT 2015.*Hoefer, M. & Hoefer, M. (eds.). Springer Verlag, p. 3-14 12 p. A1. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9347).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution