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

Research Output 2006 2019

  • 192 Citations
  • 7 h-Index
  • 39 Article
  • 24 Conference contribution
  • 1 Chapter
Filter
Conference contribution
2019

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 proceedingConference contribution

Computational complexity
Polynomials
2018

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 proceedingConference contribution

Polynomials

Submodular function minimization with submodular set covering constraints and precedence constraints

Kamiyama, N., Jan 1 2018, Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers. Solis-Oba, R. & Fleischer, R. (eds.). Springer Verlag, p. 90-101 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10787 LNCS).

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

Function Minimization
Submodular Function
Set Covering
Precedence Constraints
Covering Problem

The B-branching problem in digraphs

Kakimura, N., Kamiyama, N. & Takazawa, K., Aug 1 2018, 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018. Potapov, I., Worrell, J. & Spirakis, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 12. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 117).

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

Polynomials
Decomposition

Tight approximability of the server allocation problem for real-time applications

Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y., Okamoto, Y. & Shiitada, T., Jan 1 2018, Algorithmic Aspects of Cloud Computing - 3rd International Workshop, ALGOCLOUD 2017, Revised Selected Papers. Springer Verlag, p. 41-55 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10739 LNCS).

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

Approximability
Servers
Server
Real-time
Approximation algorithms
2017

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 proceedingConference contribution

Airports
Japan
Congestion
Uncertainty
Modeling
3 Citations (Scopus)

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. Springer Verlag, Vol. 10392 LNCS. 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 proceedingConference contribution

Reconfiguration
Polynomials
Graph in graph theory
Bipartite Graph
Integer
2016
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
2 Citations (Scopus)

The mixed evacuation problem

Hanawa, Y., Higashikawa, Y., Kamiyama, N., Katoh, N. & Takizawa, A., Jan 1 2016, Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings. Li, M., Wang, L. & Chan, T-H. H. (eds.). Springer Verlag, p. 18-52 35 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10043 LNCS).

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

Evacuation
Polynomials
Directed graphs
Railroad cars
Hardness
2015
3 Citations (Scopus)

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 proceedingConference contribution

Stable Matching
Tie
Matroid
Capacity Constraints
Polynomial-time Algorithm
2013
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
2012
10 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
2011

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

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 proceedingConference contribution

Adjacency Matrix
Totally Unimodular Matrix
Dominating Set
Matching Problem
Graph in graph theory
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

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
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. Vol. 14. 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
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