| 1. |
Naoyuki Kamiyama, A Note on Robust Subsets of Transversal Matroids, Journal of the Operations Research Society of Japan . |
| 2. |
Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong, Sheung Man Yuen, Reachability of Fair Allocations via Sequential Exchanges, Proceedings of the AAAI Conference on Artificial Intelligence, 10.1609/aaai.v38i9.28836, 9773-9780, 2024.03. |
| 3. |
Takasugu Shigenobu, Naoyuki Kamiyama, On Connectedness of Solutions to Integer Linear Systems, Combinatorial Optimization and Applications, 10.1007/978-3-031-49611-0_30, LNCS 14461, 421-433, 2023.12. |
| 4. |
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki, On Reachable Assignments under Dichotomous Preferences, Theoretical Computer Science, 10.1016/j.tcs.2023.114196, 979, 114196, 2023.11. |
| 5. |
Naoyuki Kamiyama, On Optimization Problems in Acyclic Hypergraphs, Information Processing Letters, 10.1016/j.ipl.2023.106390, 182, 106390, 2023.08. |
| 6. |
Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki, Reconfiguration of Time-Respecting Arborescences, Proceedings of the 18th Algorithms and Data Structures Symposium (WADS), 10.1007/978-3-031-38906-1_34, LNCS 14079, 521-532, 2023.07. |
| 7. |
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Algorithmic Theory of Qubit Routing, Proceedings of the 18th Algorithms and Data Structures Symposium (WADS), 10.1007/978-3-031-38906-1_35, LNCS 14079, 533-546, 2023.07. |
| 8. |
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra., Proceedings of the 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP), 10.4230/LIPIcs.ICALP.2023.82, LIPIcs 261, 82:1-82:17, 2023.07. |
| 9. |
Masataka Shirahashi, Naoyuki Kamiyama, Kernelization Algorithms for a Generalization of the Component Order Connectivity Problem, Journal of the Operations Research Society of Japan, 10.15807/jorsj.66.112, 66, 2, 112-129, 2023.04. |
| 10. |
Naoyuki Kamiyama, Pareto Efficient Matchings with Pairwise Preferences, Theoretical Computer Science, 10.1016/j.tcs.2023.113707, 948, 113707, 2023.02. |
| 11. |
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-Ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki, Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams, ACM Transactions on Algorithms, 10.1145/3561302, 19, 1, 1-22, 2023.01. |
| 12. |
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki, [preliminary version] On Reachable Assignments Under Dichotomous Preferences, Proceedings of the 24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA), 10.1007/978-3-031-21203-1_43, LNCS 13753, 650-658, 2022.11. |
| 13. |
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Shortest Reconfiguration of Perfect Matchings via Alternating Cycles, SIAM Journal on Discrete Mathematics, 10.1137/20m1364370, 36, 2, 1102-1123, 2022.06. |
| 14. |
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki, Reforming an Envy-Free Matching, Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI), 10.1609/aaai.v36i5.20441, 5084-5091, 2022.06. |
| 15. |
Naoyuki Kamiyama, A Matroid Generalization of the Super-Stable Matching Problem, SIAM Journal on Discrete Mathematics, 10.1137/21m1437214, 36, 2, 1467-1482, 2022.06. |
| 16. |
Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Submodular Reassignment Problem for Reallocating Agents to Tasks with Synergy Effects, Discrete Optimization, 10.1016/j.disopt.2021.100631, 44, 100631-100631, 2022.05. |
| 17. |
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, A Parameterized View to the Robust Recoverable Base Problem of Matroids Under Structural Uncertainty, Operations Research Letters, 10.1016/j.orl.2022.05.001, 50, 3, 370-375, 2022.05. |
| 18. |
Hiroaki Yamada, Masataka Shirahashi, Naoyuki Kamiyama, Yumeka Nakajima, MAS Network: Surrogate Neural Network for Multi-agent Simulation, Proceedings of the 22nd International Workshop on Multi-Agent-Based Simulation (MABS), 10.1007/978-3-030-94548-0_9, LNCS 13128, 113-124, 2022.01. |
| 19. |
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki, [preliminary version] Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams, Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 10.1137/1.9781611977073.56, 1342-1355, 2022.01. |
| 20. |
Naoyuki Kamiyama, The Envy-Free Matching Problem with Pairwise Preferences, Information Processing Letters, 10.1016/j.ipl.2021.106158, 172, 106158, 2021.12. |
| 21. |
Naoyuki Kamiyama, Envy-Free Matchings with One-Sided Preferences and Matroid Constraints, Operations Research Letters, 10.1016/j.orl.2021.08.010, 49, 5, 790-794, 2021.09. |
| 22. |
Naoyuki Kamiyama, Pasin Manurangsi, Warut Suksompong, On the Complexity of Fair House Allocation, Operations Research Letters, 10.1016/j.orl.2021.06.006, 49, 4, 572-577, 2021.07. |
| 23. |
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. |
| 24. |
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, 2021.02.  |
| 25. |
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. |
| 26. |
Naoyuki Kamiyama, The Distance-Constrained Matroid Median Problem, Algorithmica, 10.1007/s00453-020-00688-5, 82, 7, 2087-2106, 2020.07. |
| 27. |
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. |
| 28. |
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. |
| 29. |
Naoyuki Kamiyama, Lexicographically Optimal Earliest Arrival Flows, Networks, 10.1002/net.21902, 75, 1, 18-33, 2020.01. |
| 30. |
Naoyuki Kamiyama, Discrete Newton Methods for the Evacuation Problem, Theoretical Computer Science, 10.1016/j.tcs.2019.08.004, 795, 510-519, 2019.11. |
| 31. |
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. |
| 32. |
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. |
| 33. |
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Yoshio Okamoto, [preliminary version] Shortest Reconfiguration of Perfect Matchings via Alternating Cycles., Proceedings of the 27th Annual European Symposium on Algorithms (ESA), 10.4230/LIPIcs.ESA.2019.61, LIPIcs 144, 61:1-61:15, 2019.09. |
| 34. |
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. |
| 35. |
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. |
| 36. |
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. |
| 37. |
Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, [preliminary version] Algorithms for Gerrymandering over Graphs, Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1413-1421, 2019.05. |
| 38. |
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. |
| 39. |
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. |
| 40. |
Naoyuki Kamiyama, Pareto Stable Matchings under One-Sided Matroid Constraints, SIAM Journal on Discrete Mathematics, 10.1137/17m1149717, 33, 3, 1431-1451, 2019.01. |
| 41. |
Takashi Ishizuka, Naoyuki Kamiyama, On the Complexity of Stable Fractional Hypergraph Matching, Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC), 10.4230/LIPIcs.ISAAC.2018.11, LIPIcs 123, 11:1-11:12, 2018.12. |
| 42. |
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. |
| 43. |
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. |
| 44. |
Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa, [preliminary version] The b-Branching Problem in Digraphs., Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS), 10.4230/LIPIcs.MFCS.2018.12, LIPIcs 117, 12:1-12:15, 2018.08. |
| 45. |
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, 2018.04. |
| 46. |
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. |
| 47. |
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, 2018.01. |
| 48. |
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. |
| 49. |
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, [preliminary version] Reconfiguration of Maximum-Weight b-Matchings in a Graph, Prceedings of the 23rd Annual International Computing and Combinatorics Conference (COCOON), 10.1007/978-3-319-62389-4_24, LNCS 10392, 287-296, 2017.07. |
| 50. |
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. |
| 51. |
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. |
| 52. |
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. |
| 53. |
Naoyuki Kamiyama, Popular Matchings with Ties and Matroid Constraints, SIAM Journal on Discrete Mathematics, 10.1137/15m104918x, 31, 3, 1801-1819, 2017.01. |
| 54. |
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. |
| 55. |
Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa, [preliminary version] The Mixed Evacuation Problem, Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 10.1007/978-3-319-48749-6_2, LNCS 10043, 18-32, 2016.10. |
| 56. |
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. |
| 57. |
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. |
| 58. |
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. |
| 59. |
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, [preliminary version] Efficient Stabilization of Cooperative Matching Games, Proceedings of the 15th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 41-49, 2016.05. |
| 60. |
Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama, [preliminary version] Exact and Approximation Algorithms for Weighted Matroid Intersection, Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 10.1137/1.9781611974331.ch32, 430-444, 2016.01. |
| 61. |
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. |
| 62. |
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. |
| 63. |
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. |
| 64. |
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. |
| 65. |
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, [preliminary version] Minimum-Cost b-Edge Dominating Sets on Trees, Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC), 10.1007/978-3-319-13075-0_16, LNCS 8889, 195-207, 2014.11. |
| 66. |
Naoyuki Kamiyama, [preliminary version] The Popular Matching and Condensation Problems Under Matroid Constraints, Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 10.1007/978-3-319-12691-3_53, LNCS 8881, 713-728, 2014.11. |
| 67. |
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. |
| 68. |
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. |
| 69. |
Naoyuki Kamiyama, Arborescence Problems in Directed Graphs: Theorems and Algorithms, Interdisciplinary Information Sciences, 10.4036/iis.2014.51, 20, 1, 51-70, 2014.03. |
| 70. |
Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Yuki Kobayashi, [preliminary version] An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs, Proceedings of the 7th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 10.1007/978-3-319-03780-6_15, LNCS 8287, 165-177, 2013.11. |
| 71. |
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. |
| 72. |
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. |
| 73. |
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. |
| 74. |
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. |
| 75. |
Naoyuki Kamiyama, A Note on the Quasi-additive Bound for Boolean Functions, Journal of Math-for-Industry, 4-B, 119-122, 2012.10. |
| 76. |
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. |
| 77. |
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. |
| 78. |
Tamás Fleiner, Naoyuki Kamiyama, [preliminary version] A Matroid Approach to Stable Matchings with Lower Quotas, Proceedings of the 23rd Annual ACM/SIAM Symposium on Discrete Algorithms (SODA), 10.1137/1.9781611973099.12, 135-142, 2012.01. |
| 79. |
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. |
| 80. |
Naoyuki Kamiyama, [preliminary version] Robustness of Minimum Cost Arborescences, Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC), 10.1007/978-3-642-25591-5_15, LNCS 7074, 130-139, 2011.11. |
| 81. |
Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai, [preliminary version] On Totally Unimodularity of Edge-Edge Adjacency Matrices, Proceedings of the 17th Annual International Computing and Combinatorics Conference (COCOON) Computer Science, 10.1007/978-3-642-22685-4_32, LNCS 6842, 354-365, 2011.07. |
| 82. |
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. |
| 83. |
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. |
| 84. |
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. |
| 85. |
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. |
| 86. |
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. |
| 87. |
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. |
| 88. |
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. |
| 89. |
Naoyuki Kamiyama, Naoki Katoh, [preliminary version] A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths, Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC), 10.1007/978-3-642-10631-6_81, LNCS 5878, 802-811, 2009.11. |
| 90. |
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. |
| 91. |
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. |
| 92. |
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. |
| 93. |
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.08. |
| 94. |
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. |
| 95. |
Naoyuki Kamiyama, Naoki Katoh, [preliminary version] Covering Directed Graphs by In-Trees, Proceedings of the14th Annual International Computing and Combinatorics Conference (COCOON), 10.1007/978-3-540-69733-6_44, LNCS 5092, 444-457, 2008.06. |
| 96. |
Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa, [preliminary version] Arc-Disjoint In-Trees in Directed Graphs, Proceedings of the 19th Annual ACM/SIAM Symposium on Discrete Algorithms (SODA), 518-526, 2008.01. |
| 97. |
Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa, [preliminary version] An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths, Proceedings of the 3rd International Conference on Algorithmic Aspect in Information and Management (AAIM), 10.1007/978-3-540-72870-2_17, LNCS 4508, 178-190, 2007.05. |
| 98. |
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. |
| 99. |
Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa, [preliminary version] An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity, Proceedings of the 2nd International Conference on Algorithmic Aspect in Information and Management (AAIM), 10.1007/11775096_22, LNCS 4041, 231-242, 2006.06. |
| 100. |
神山 直之, 瀧澤 重志, 加藤 直樹, フロアプランの列挙に基づく2階建て住宅の室配置アルゴリズム, 日本建築学会環境系論文集, 10.3130/aije.71.65_1, 601, 65-72, 2006.03. |
