九州大学 研究者情報
論文一覧
神山 直之(かみやま なおゆき) データ更新日:2021.06.04

教授 /  マス・フォア・インダストリ研究所 数学テクノロジー先端研究部門


原著論文
1. Ito Takehiro, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Algorithms for Gerrymandering over Graphs, Theoretical Computer Science, 10.1016/j.tcs.2021.03.037, 868, 8, 30-45, 2021.05.
2. Hiroaki Yamada, Naoyuki Kamiyama, Optimal Control of Pedestrian Flows by Congestion Forecasts Satisfying User Equilibrium Conditions, Proceedings of the 23rd International Conference on Principles and Practice of Multi-Agent Systems (PRIMA), 10.1007/978-3-030-69322-0_19, LNCS 12568, 299-314, 2020.11.
3. Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa, The b-Branching Problem in Digraphs, Discrete Applied Mathematics, 10.1016/j.dam.2020.02.005, 283, 565-576, 2020.09.
4. Naoyuki Kamiyama, The Distance-Constrained Matroid Median Problem, Algorithmica, 10.1007/s00453-020-00688-5, 82, 7, 2087-2106, 2020.07.
5. Naoyuki Kamiyama, On Stable Matchings with Pairwise Preferences and Matroid Constraints, Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 584-592, 2020.05.
6. Naoyuki Kamiyama, Popular Matchings with Two-Sided Preference Lists and Matroid Constraints, Theoretical Computer Science, 10.1016/j.tcs.2019.12.017, 809, 265-276, 2020.02.
7. Naoyuki Kamiyama, Lexicographically Optimal Earliest Arrival Flows, Networks, 10.1002/net.21902, 75, 1, 18-33, 2020.01.
8. Naoyuki Kamiyama, Discrete Newton Methods for the Evacuation Problem, Theoretical Computer Science, 10.1016/j.tcs.2019.08.004, 795, 510-519, 2019.11.
9. Akifumi Kira, Naoyuki Kamiyama, Hirokazu Anai, Hiroaki Iwashita, Kotaro Ohori, On Dynamic Patrolling Security Games, Journal of the Operations Research Society of Japan, 10.15807/jorsj.62.152, 62, 4, 152-168, 2019.10.
10. Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama, Exact and Approximation Algorithms for Weighted Matroid Intersection, Mathematical Programming, 10.1007/s10107-018-1260-x, 177, 1-2, 85-112, 2019.09.
11. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Shortest Reconfiguration of Perfect Matchings via Alternating Cycles, Proceedings of the 27th Annual European Symposium on Algorithms (ESA), LIPIcs 144, 61:1-61:15, 2019.09.
12. Naoyuki Kamiyama, Pareto Stable Matchings under One-Sided Matroid Constraints, SIAM Journal on Discrete Mathematics, 10.1137/17m1149717, 33, 3, 1431-1451, 2019.08.
13. Naoyuki Kamiyama, A Note on Balanced Flows in Equality Networks, Information Processing Letters, 10.1016/j.ipl.2019.01.014, 145, 74-76, 2019.05.
14. Susumu Kawanaka, Naoyuki Kamiyama, An Improved Algorithm for Testing Substitutability of Weak Preferences, Mathematical Social Sciences, 10.1016/j.mathsocsci.2019.02.003, 99, 1-4, 2019.05.
15. Naoyuki Kamiyama, Many-to-Many Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints, Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 583-591, 2019.05.
16. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Reconfiguration of Maximum-Weight b-Matchings in a Graph, Journal of Combinatorial Optimization, 10.1007/s10878-018-0289-3, 37, 2, 454-464, 2019.02.
17. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Minimum-Cost b-Edge Dominating Sets on Trees, Algorithmica, 10.1007/s00453-018-0448-z, 81, 1, 343-366, 2019.01.
18. Takashi Ishizuka, Naoyuki Kamiyama, On the Complexity of Stable Fractional Hypergraph Matching, Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC), LIPIcs 123, 11:1-11:12, 2018.12.
19. Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa, The Mixed Evacuation Problem, Journal of Combinatorial Optimization, 10.1007/s10878-017-0237-7, 36, 4, 1299-1314, 2018.11.
20. Naoyuki Kamiyama, A Note on Submodular Function Minimization with Covering Type Linear Constraints, Algorithmica, 10.1007/s00453-017-0363-8, 80, 10, 2957-2971, 2018.10.
21. Naoyuki Kamiyama, A Characterization of Weighted Popular Matchings under Matroid Constraints, Journal of the Operations Research Society of Japan, 10.15807/jorsj.61.2, 61, 1, 2-17, 2018.01.
22. Hiroaki Yamada, Kotaro Ohori, Tadashige Iwao, Akifumi Kira, Naoyuki Kamiyama, Hiroaki Yoshida, Hirokazu Anai, Modeling and Managing Airport Passenger Flow Under Uncertainty: A Case of Fukuoka Airport in Japan, Proceedings of the 9th International Conference on Social Informatics (SocInfo), 10.1007/978-3-319-67256-4_33, LNCS 10540, 419-430, 2017.09.
23. Naoyuki Kamiyama, Submodular Function Minimization with Submodular Set Covering Constraints and Precedence Constraints, Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), 10.1007/978-3-319-89441-6_8, LNCS 10787, 90-101, 2017.09.
24. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Taichi Shiitada, Tight Approximability of the Server Allocation Problem for Real-Time Applications, Proceedings of the 3rd International Workshop on Algorithmic Aspects of Cloud Computing (Algocloud), 10.1007/978-3-319-74875-7_4, LNCS 10739, 41-55, 2017.09.
25. Naoyuki Kamiyama, Popular Matchings with Ties and Matroid Constraints, SIAM Journal on Discrete Mathematics, 10.1137/15m104918x, 31, 3, 1801-1819, 2017.08.
26. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Efficient Stabilization of Cooperative Matching Games, Theoretical Computer Science, 10.1016/j.tcs.2017.03.020, 677, 69-82, 2017.05.
27. Naoyuki Kamiyama, Strategic Issues in College Admissions with Score-Limits, Operations Research Letters, 10.1016/j.orl.2017.01.001, 45, 2, 105-108, 2017.03.
28. Naoyuki Kamiyama, A Note on the Submodular Vertex Cover Problem with Submodular Penalties, Theoretical Computer Science, 10.1016/j.tcs.2016.10.017, 659, 95-97, 2017.01.
29. Naoyuki Kamiyama, The Popular Matching and Condensation Problems under Matroid Constraints, Journal of Combinatorial Optimization, 10.1007/s10878-015-9965-8, 32, 4, 1305-1326, 2016.11.
30. Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto, Extended Formulations for Sparsity Matroids, Mathematical Programming, 10.1007/s10107-015-0936-8, 158, 1-2, 565-574, 2016.07.
31. Keita Nakamura, Naoyuki Kamiyama, Many-to-Many Stable Matchings with Ties in Trees, Journal of the Operations Research Society of Japan, 10.15807/jorsj.59.225, 59, 3, 225-240, 2016.07.
32. Tamás Fleiner, Naoyuki Kamiyama, A Matroid Approach to Stable Matchings with Lower Quotas, Mathematics of Operations Research, 10.1287/moor.2015.0751, 41, 2, 734-744, 2016.05.
33. Naoyuki Kamiyama, Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints, Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 10.1007/978-3-662-48433-3_1, LNCS 9347, 3-14, 2015.09.
34. Naoyuki Kamiyama, Yasushi Kawase, On Packing Arborescences in Temporal Networks, Information Processing Letters, 10.1016/j.ipl.2014.10.005, 115, 2, 321-325, 2015.02.
35. Naoyuki Kamiyama, The Nucleolus of Arborescence Games in Directed Acyclic Graphs, Operations Research Letters, 10.1016/j.orl.2014.12.005, 43, 1, 89-92, 2015.01.
36. Naoyuki Kamiyama, Naoki Katoh, The Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths, Discrete Applied Mathematics, 10.1016/j.dam.2014.06.008, 178, 89-100, 2014.12.
37. Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Naoyuki Kamiyama, An Inductive Construction of Minimally Rigid Body–Hinge Simple Graphs, Theoretical Computer Science, 10.1016/j.tcs.2014.08.007, 556, 2-12, 2014.10.
38. Naoyuki Kamiyama, A New Approach to the Pareto Stable Matching Problem, Mathematics of Operations Research, 10.1287/moor.2013.0627, 39, 3, 851-862, 2014.08.
39. Naoyuki Kamiyama, Arborescence Problems in Directed Graphs: Theorems and Algorithms, Interdisciplinary Information Sciences, 10.4036/iis.2014.51, 20, 1, 51-70, 2014.03.
40. Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai, On Total Unimodularity of Edge–Edge Adjacency Matrices, Algorithmica, 10.1007/s00453-013-9804-1, 67, 2, 277-292, 2013.10.
41. Naoyuki Kamiyama, A Note on the Serial Dictatorship with Project Closures, Operations Research Letters, 10.1016/j.orl.2013.07.006, 41, 5, 559-561, 2013.09.
42. Naoyuki Kamiyama, Matroid Intersection with Priority Constraints, Journal of the Operations Research Society of Japan, 10.15807/jorsj.56.15, 56, 1, 15-25, 2013.03.
43. András Frank, Satoru Fujishige, Naoyuki Kamiyama, Naoki Katoh, Independent Arborescences in Directed Graphs, Discrete Mathematics, 10.1016/j.disc.2012.11.006, 313, 4, 453-459, 2013.02.
44. Naoyuki Kamiyama, A Note on the Quasi-additive Bound for Boolean Functions, Journal of Math-for-Industry, 4-B, 119-122, 2012.10.
45. Naoyuki Kamiyama, Robustness of Minimum Cost Arborescences, Japan Journal of Industrial and Applied Mathematics, 10.1007/s13160-012-0079-8, 29, 3, 485-497, 2012.10.
46. Satoru Fujishige, Naoyuki Kamiyama, The Root Location Problem for Arc-Disjoint Arborescences, Discrete Applied Mathematics, 10.1016/j.dam.2012.04.013, 160, 13-14, 1964-1970, 2012.09.
47. Yuichiro Yasui, Katsuki Fujisawa, Kazushige Goto, Naoyuki Kamiyama, Mizuyo Takamatsu, NETAL : High-Performance Implementation of Network Analysis Library Considering Computer Memory Hierarchy, Journal of the Operations Research Society of Japan, 10.15807/jorsj.54.259, 54, 4, 259-280, 2011.12.
48. Naoyuki Kamiyama, Submodular Function Minimization under a Submodular Set Covering Constraint, Proceedings of the 8th Annual Conference on Theory and Applications of Models of Computation (TAMC), 10.1007/978-3-642-20877-5_14, LNCS 6648, 133-141, 2011.05.
49. Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai, An Approximation Algorithm Dependent on Edge-Coloring Number for Minimum Maximal Matching Problem, Information Processing Letters, 10.1016/j.ipl.2011.02.006, 111, 10, 465-468, 2011.04.
50. Yutaka Iwaikawa, Naoyuki Kamiyama, Tomomi Matsui, Improved Approximation Algorithms for Firefighter Problem on Trees, IEICE Transactions on Information and Systems, 10.1587/transinf.e94.d.196, E94-D, 2, 196-199, 2011.02.
51. Naoyuki Kamiyama, Tomomi Matsui, Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking, Proceedings of the 17th Computing: the Australasian Theory Symposium (CATS), CRPIT 119, 137-144, 2011.01.
52. Naoyuki Kamiyama, Naoki Katoh, Covering Directed Graphs by In-Trees, Journal of Combinatorial Optimization, 10.1007/s10878-009-9242-9, 21, 1, 2-18, 2011.01.
53. Naoyuki Kamiyama, The Prize-Collecting Edge Dominating Set Problem in Trees, Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS), 10.1007/978-3-642-15155-2_41, LNCS 6281, 465-476, 2010.08.
54. Kristóf Bérczi, Satoru Fujishige, Naoyuki Kamiyama, A Linear-Time Algorithm to Find a Pair of Arc-Disjoint Spanning In-Arborescence and Out-Arborescence in a Directed Acyclic Graph, Information Processing Letters, 10.1016/j.ipl.2009.09.004, 109, 23-24, 1227-1231, 2009.11.
55. Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa, An Efficient Algorithm for the Evacuation Problem in a Certain Class of Networks with Uniform Path-Lengths, Discrete Applied Mathematics, 10.1016/j.dam.2009.04.007, 157, 17, 3665-3677, 2009.10.
56. Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa, Arc-Disjoint In-Trees in Directed Graphs, Combinatorica, 10.1007/s00493-009-2428-z, 29, 2, 197-214, 2009.03.
57. Naoyuki Kamiyama, Yuuki Kiyonari, Eiji Miyano, Shuichi Miyazaki, Katsuhisa Yamanaka, Computational Complexities of University Interview Timetabling, IEICE Transactions on Information and Systems, 10.1587/transinf.e92.d.130, E92-D, 2, 130-140, 2009.02.
58. Naoyuki Kamiyama, Naoki Katoh, The Minimum Weight In-Tree Cover Problem, Proceedings of the 2nd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO), 10.1007/978-3-540-87477-5_17, CCIS 14, 155-164, 2008.09.
59. Takenao Taji, Shin-ichi Tanigawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa, Finding an Optimal Location of Line Facility using Evolutionary Algorithm and Integer Program, Journal of Computational Science and Technology, 10.1299/jcst.2.362, 2, 3, 362-370, 2008.07.
60. Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa, An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity, IEICE Transactions on Information and Systems, 10.1093/ietisy/e89-d.8.2372, E89-D, 8, 2372-2379, 2006.08.
61. 神山 直之, 瀧澤 重志, 加藤 直樹, フロアプランの列挙に基づく2階建て住宅の室配置アルゴリズム, 日本建築学会環境系論文集, 10.3130/aije.71.65_1, 601, 65-72, 2006.03.

九大関連コンテンツ

pure2017年10月2日から、「九州大学研究者情報」を補完するデータベースとして、Elsevier社の「Pure」による研究業績の公開を開始しました。
 
 
九州大学知的財産本部「九州大学Seeds集」