Kamiyama Naoyuki 神山直之

… Alternative Names

KAMIYAMA Naoyuki 神山直之

Less

Researcher Number	10548134
Affiliation (Current)	2025: 九州大学, マス・フォア・インダストリ研究所, 教授
Affiliation (based on the past Project Information) *help	2020 – 2024: 九州大学, マス・フォア・インダストリ研究所, 教授 2011 – 2016: 九州大学, マス・フォア・インダストリ研究所, 准教授 2014: 九州大学, ス・フォア・インダストリ研究所, 准教授 2014: 九州大学, マス・フォア・インダストリ研究所, 准教授 2013: 九州大学, 学内共同利用施設等, 准教授 2012: 中央大学, 理工学部, 助教 2009 – 2010: 中央大学, 理工学部, 助教
Review Section/Research Field	Principal Investigator Basic Section 60010:Theory of informatics-related / Theory of informatics / Fundamental theory of informatics Except Principal Investigator Transformative Research Areas, Section (IV) / Mathematical informatics / Science and Engineering / Fundamental theory of informatics
Keywords	Principal Investigator 離散最適化 / アルゴリズム / ネットワークフロー / カーネル化 / 頂点被覆問題 / 離散アルゴリズム / 安定マッチング問題 / マトロイド / 安定マッチング / 配置問題 / グラフ詰め込み / 有向木 / 有向グラフ … More Except Principal Investigator … More 避難計画 / 普遍的最速フロー / 最速避難計画 / 最速フロー / 組合せ剛性理論 / アルゴリズム / 計算複雑性 / 離散数学 / 数学 / 組合せ遷移 / 3次元一般剛性 / トラス・トポロジー最適化 / 最速避難計画問題 / 動的ネットワークフロー / 最適避難所配置 / 帰宅シミュレーション / 避難所配置問題 / 動的フロー / 多面体平坦折り畳み / 最速フロー問題 / 冗長剛性 / ブレース追加問題 / 大域剛性 / 劣モジュラー関数 / 計算上界 / 計算下界 / 乱択計算 / 指数時間厳密アルゴリズム / 計算量上下界 / 固定パラメータアルゴリズム / k劣サブモジュラー関数 / 乱択アルゴリズム / 劣モジュラー最適化 / 厳密計算 / マトロイド共通独立集合 / 優モジュラー彩色 / 秘密分散方式 / トークン遷移問題 / 体積計算 / #P困難 / 計算限界分析 / マトロイド・パリティ問題 / 疎性マトロイド / 拡張定式化 / 最適化理論 / 動的ネットワーク / 時間拡大ネットワーク / 剛性理論 / 計算幾何学 / 避難計画問題 / 組合せ剛性 / Lamanの定理 / 分子剛性予想 / パネルヒンジフレームワーク Less

動的ネットワークフローの革新的発展に関する研究Principal Investigator
- Principal Investigator
  
  神山直之
- Project Period (FY)
  2024 – 2027
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Kyushu University
A Study on Kernelization Algorithms for the Vertex Cover Problem and its GeneralizationsPrincipal Investigator
- Principal Investigator
  
  Kamiyama Naoyuki
- Project Period (FY)
  2020 – 2022
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Kyushu University
Development of Combinatorial Reconfiguration by Mathematics Approach: From Examples to New Methods
- Principal Investigator
  
  OKAMOTO Yoshio
- Project Period (FY)
  2020 – 2022
- Research Category
  
  Grant-in-Aid for Transformative Research Areas (B)
- Review Section
  
  Transformative Research Areas, Section (IV)
- Research Institution
  The University of Electro-Communications
Establishing the foundation of discrete mathematics in the field of architecture and urban planning and its application to large-scale optimization
- Principal Investigator
  
  Katoh Naoki
- Project Period (FY)
  2013 – 2016
- Research Category
  
  Grant-in-Aid for Scientific Research (A)
- Research Field
  
  Mathematical informatics
- Research Institution
  Kwansei Gakuin University
  Kyoto University
A Study on Discrete Structures of Advanced Stable Matching ProblemsPrincipal Investigator
- Principal Investigator
  
  KAMIYAMA Naoyuki
- Project Period (FY)
  2013 – 2014
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  Theory of informatics
- Research Institution
  Kyushu University
Deepening analysis methods for limits of computation through integration with optimization techniques
- Principal Investigator
  
  Katoh Naoki
- Project Period (FY)
  2012 – 2016
- Research Category
  
  Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)
- Review Section
  
  Science and Engineering
- Research Institution
  Kwansei Gakuin University
  Kyoto University
New Developments in Arborescence Packing ProblemsPrincipal Investigator
- Principal Investigator
  
  KAMIYAMA Naoyuki
- Project Period (FY)
  2010 – 2011
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Kyushu University
  Chuo University
Computational Geometry and Discrete Optimization in Architecture and Urban Planning
- Principal Investigator
  
  KATOH Naoki
- Project Period (FY)
  2009 – 2012
- Research Category
  
  Grant-in-Aid for Scientific Research (B)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Kyoto University

All 2024 2023 2022 2021 2016 2015 2014 2013 2012 2011 2010 2009 Other

All Journal Article Presentation

[Journal Article] The strongly stable matching problem with closures2024
- Author(s)
  Naoyuki Kamiyama
- Journal Title
  
  arXiv
  
  Volume: --
- Open Access
- Data Source
  KAKENHI-PLANNED-20H05795
[Journal Article] Modifying an instance of the super-stable matching problem2024
- Author(s)
  Naoyuki Kamiyama
- Journal Title
  
  arXiv
  
  Volume: --
- Open Access
- Data Source
  KAKENHI-PLANNED-20H05795
[Journal Article] Reachability of fair allocations via sequential exchanges2024
- Author(s)
  Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong, Yuen Sheung Man
- Journal Title
  
  Proc. of 38th AAAI Conference on Artificial Intelligence (AAAI 2024)
  
  Volume: -- Issue: 9 Pages: 9773-9780
- DOI
  10.1609/aaai.v38i9.28836
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05795
[Journal Article] Algorithmic theory of qubit routing2023
- Author(s)
  Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
- Journal Title
  
  Proc. of 18th Algorithms and Data Structures Symposium (WADS 2023), Lecture Notes in Computer Science
  
  Volume: 14079 Pages: 533-546
- DOI
  10.1007/978-3-031-38906-1_35
- ISBN
  9783031389054, 9783031389061
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-23K10982, KAKENHI-PROJECT-20K11670, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-23K21646, KAKENHI-PROJECT-22H05001
[Journal Article] Reconfiguration of Time-Respecting Arborescences2023
- Author(s)
  Ito Takehiro、Iwamasa Yuni、Kamiyama Naoyuki、Kobayashi Yasuaki、Kobayashi Yusuke、Maezawa Shun-ichi、Suzuki Akira
- Journal Title
  
  Algorithms and Data Structures (WADS 2023)
  
  Volume: 14079 Pages: 521-532
- DOI
  10.1007/978-3-031-38906-1_34
- ISBN
  9783031389054, 9783031389061
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-22K13956, KAKENHI-PROJECT-22K17854, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-23K28034
[Journal Article] On connectedness of solutions to integer linear systems2023
- Author(s)
  Takasugu Shigenobu, Naoyuki Kamiyama
- Journal Title
  
  Proc. of 16th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2023), Lecture Notes in Computer Science
  
  Volume: 14461 Pages: 421-433
- DOI
  10.1007/978-3-031-49611-0_30
- ISBN
  9783031496103, 9783031496110
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-20H05795
[Journal Article] On Optimization Problems in Acyclic Hypergraphs2023
- Author(s)
  Naoyuki Kamiyama
- Journal Title
  
  Information Processing Letters
  
  Volume: 182 Pages: 106390-106390
- DOI
  10.1016/j.ipl.2023.106390
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20K11680
[Journal Article] Pareto efficient matchings with pairwise preferences2023
- Author(s)
  Naoyuki Kamiyama
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 948 Pages: 113707-113707
- DOI
  10.1016/j.tcs.2023.113707
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-20H05795
[Journal Article] On reachable assignments under dichotomous preferences2023
- Author(s)
  Ito Takehiro、Kakimura Naonori、Kamiyama Naoyuki、Kobayashi Yusuke、Nozaki Yuta、Okamoto Yoshio、Ozeki Kenta
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 979 Pages: 114196-114196
- DOI
  10.1016/j.tcs.2023.114196
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-20K14317, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-23K10982, KAKENHI-PROJECT-20K11670, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-23K21646
[Journal Article] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2023
- Author(s)
  Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
- Journal Title
  
  ACM Transactions on Algorithms
  
  Volume: 19 Issue: 1 Pages: 6-6
- DOI
  10.1145/3561302
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-22K13956, KAKENHI-PROJECT-20K23323, KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-18K03391, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-23K21646
[Journal Article] KERNELIZATION ALGORITHMS FOR A GENERALIZATION OF THE COMPONENT ORDER CONNECTIVITY PROBLEM2023
- Author(s)
  Masataka Shirahashi, Naoyuki Kamiyama
- Journal Title
  
  Journal of the Operations Research Society of Japan
  
  Volume: 66 Issue: 2 Pages: 112-129
- DOI
  10.15807/jorsj.66.112
- ISSN
  0453-4514, 2188-8299
- Year and Date
  2023-04-30
- Language
  English
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-20K11680
[Journal Article] Hardness of finding combinatorial shortest paths on graph associahedra2023
- Author(s)
  Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
- Journal Title
  
  Proc. of 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023), Leibniz International Proceedings in Informatics
  
  Volume: 261
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PLANNED-20H05795
[Journal Article] Monotone edge flips to an orientation of maximum edge-connectivity ? la Nash-Williams2022
- Author(s)
  Ito Takehiro、Iwamasa Yuni、Kakimura Naonori、Kamiyama Naoyuki、Kobayashi Yusuke、Maezawa Shun-ichi、Nozaki Yuta、Okamoto Yoshio、Ozeki Kenta
- Journal Title
  
  Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
  
  Volume: なし Pages: 1342-1355
- DOI
  10.1137/1.9781611977073.56
- ISBN
  9781611977073
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-18K03391, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-20K11692, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795
[Journal Article] Shortest reconfiguration of perfect matchings via alternating cycles2022
- Author(s)
  Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
- Journal Title
  
  SIAM Journal on Discrete Mathematics
  
  Volume: 36 Issue: 2 Pages: 1102-1123
- DOI
  10.1137/20m1364370
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-17K00028, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-23K21646, KAKENHI-PROJECT-18H04091
[Journal Article] On reachable assignments under dichotomous preferences2022
- Author(s)
  Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
- Journal Title
  
  Proc. of 24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2022), Lecture Notes in Computer Science
  
  Volume: 13753 Pages: 650-658
- DOI
  10.1007/978-3-031-21203-1_43
- ISBN
  9783031212024, 9783031212031
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-20K14317, KAKENHI-PROJECT-20K20417, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795
[Journal Article] A parameterized view to the robust recoverable base problem of matroids under structural uncertainty2022
- Author(s)
  Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
- Journal Title
  
  Operations Research Letters
  
  Volume: 50 Issue: 3 Pages: 370-375
- DOI
  10.1016/j.orl.2022.05.001
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-20K20417, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-23K21646
[Journal Article] Reforming an envy-free matching2022
- Author(s)
  Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
- Journal Title
  
  Proc. of 36th AAAI Conference on Artificial Intelligence (AAAI 2022)
  
  Volume: 36 Issue: 5 Pages: 5084-5091
- DOI
  10.1609/aaai.v36i5.20441
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795
[Journal Article] Reforming an envy-free matching2022
- Author(s)
  Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
- Journal Title
  
  arXiv
  
  Volume: --
- Open Access
- Data Source
  KAKENHI-PLANNED-20H05795
[Journal Article] Submodular Reassignment Problem for Reallocating Agents to Tasks with Synergy Effects2021
- Author(s)
  Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
- Journal Title
  
  Discrete Optimization
  
  Volume: to appear Pages: 100631-100631
- DOI
  10.1016/j.disopt.2021.100631
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-20K20417, KAKENHI-PLANNED-20H05795
[Journal Article] On the complexity of fair house allocation2021
- Author(s)
  Naoyuki Kamiyama, Pasin Manurangsi, Warut Suksompong
- Journal Title
  
  Operations Research Letters
  
  Volume: 49 Issue: 4 Pages: 572-577
- DOI
  10.1016/j.orl.2021.06.006
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05795
[Journal Article] Algorithms for gerrymandering over graphs2021
- Author(s)
  Ito Takehiro、Kamiyama Naoyuki、Kobayashi Yusuke、Okamoto Yoshio
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 868 Pages: 30-45
- DOI
  10.1016/j.tcs.2021.03.037
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091
[Journal Article] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2021
- Author(s)
  Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
- Journal Title
  
  arXiv
  
  Volume: --
- Open Access
- Data Source
  KAKENHI-PLANNED-20H05795
[Journal Article] Distributed Reconfiguration of Spanning Trees2021
- Author(s)
  Yamauchi Yukiko、Kamiyama Naoyuki、Otachi Yota
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 13046 Pages: 516-520
- DOI
  10.1007/978-3-030-91081-5_40
- ISBN
  9783030910808, 9783030910815
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795
[Journal Article] Exact and Approximation Algorithms for Weighted Matroid Intersection2016
- Author(s)
  Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama
- Journal Title
  
  Proc. 27th Annual ACM/SIAM Symposium on Discrete Algorithms (SODA)
  
  Volume: - Pages: 430-444
- Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106005
[Journal Article] Exact and Approximation Algorithms for Weighted Matroid Intersection2016
- Author(s)
  Chien-Chung Huang, Naonori Kakimura, and Naoyuki Kamiyama
- Journal Title
  
  Proceedings of the 27th Annual ACM/SIAM Symposium on Discrete Algorithms
  
  Volume: - Pages: 430-444
- DOI
  10.1137/1.9781611974331.ch32
- Peer Reviewed / Acknowledgement Compliant / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106005, KAKENHI-PLANNED-24106002
[Journal Article] Extended formulations for sparsity matroids2016
- Author(s)
  Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, and Yoshio Okamoto
- Journal Title
  
  Mathematical Programming
  
  Volume: 印刷中 Issue: 1-2 Pages: 565-574
- DOI
  10.1007/s10107-015-0936-8
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-15K00009, KAKENHI-PROJECT-24700008, KAKENHI-PLANNED-24106005, KAKENHI-PROJECT-24220003, KAKENHI-PROJECT-26280004
[Journal Article] The Mixed Evacuation Problem2016
- Author(s)
  Y. Hanawa, Y. Higashikawa, N. Kamiyama, N. Katoh, A. Takizawa
- Journal Title
  
  Combinatorial Optimization and Applications (COCOA'16), Hong Kong, China
  
  Volume: 10043 Pages: 18-31
- DOI
  10.1007/978-3-319-48749-6_2
- NAID
  120006998855
- ISBN
  9783319487489, 9783319487496
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-16H01707, KAKENHI-PROJECT-25240004
[Journal Article] Efficient Stabilization of Cooperative Matching Games2016
- Author(s)
  Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
- Journal Title
  
  Proceedings of 15th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2016)
  
  Volume: - Pages: 41-49
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PLANNED-24106005
[Journal Article] The Nucleolus of Arborscence Games in Directed Acyclic Graphs2015
- Author(s)
  Naoyuki Kamiyama
- Journal Title
  
  Operations Research Letters
  
  Volume: 43 Issue: 1 Pages: 89-92
- DOI
  10.1016/j.orl.2014.12.005
- Peer Reviewed / Acknowledgement Compliant / Open Access
- Data Source
  KAKENHI-PROJECT-25240004
[Journal Article] On Packing Arborescences in Temporal Networks2015
- Author(s)
  Naoyuki Kamiyama and Yasushi Kawase
- Journal Title
  
  Information Processing Letters
  
  Volume: 115 Pages: 321-325
- Peer Reviewed / Acknowledgement Compliant / Open Access
- Data Source
  KAKENHI-PROJECT-25240004
[Journal Article] The Popular Matching and Condensation Problems under Matroid Constraints2014
- Author(s)
  Naoyuki Kamiyama
- Journal Title
  
  Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications
  
  Volume: LNCS 8881 Pages: 713-728
- DOI
  10.1007/978-3-319-12691-3_53
- ISBN
  9783319126906, 9783319126913
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-25730006
[Journal Article] Arborescence Problems in Directed Graphs: Theorems and Algorithms2014
- Author(s)
  N. Kamiyama
- Journal Title
  
  IIS
  
  Volume: 20 Issue: 1 Pages: 51-70
- DOI
  10.4036/iis.2014.51
- NAID
  110009795557
- ISSN
  1340-9050, 1347-6157
- Language
  English
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106005
[Journal Article] An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs2014
- Author(s)
  Y. Kobayashi, Y. Higashikawa, N. Kamiyama, N. Katoh
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 556 Pages: 2-12
- DOI
  10.1016/j.tcs.2014.08.007
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-14J04042, KAKENHI-PROJECT-25240004, KAKENHI-PROJECT-25285127
[Journal Article] The Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths2014
- Author(s)
  N. Kamiyama and N. Katoh
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume: 178 Pages: 89-100
- DOI
  10.1016/j.dam.2014.06.008
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106005, KAKENHI-PROJECT-25240004
[Journal Article] Extended formulations for sparsity matroids2014
- Author(s)
  Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, and Yoshio Okamoto
- Journal Title
  
  ArXiv Preprint
  
  Volume: 1403.7272
- Data Source
  KAKENHI-PLANNED-24106005
[Journal Article] A New Approach to the Pareto Stable Matching Problem2014
- Author(s)
  Naoyuki Kamiyama
- Journal Title
  
  Mathematics of Operations Research
  
  Volume: 39(3) Issue: 3 Pages: 851-862
- DOI
  10.1287/moor.2013.0627
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-25730006
[Journal Article] Minimum-Cost b-Edge Dominating Sets on Trees2014
- Author(s)
  Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 8889 Pages: 195-207
- DOI
  10.1007/978-3-319-13075-0_16
- ISBN
  9783319130743, 9783319130750
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PLANNED-24106005, KAKENHI-PROJECT-24700004, KAKENHI-PROJECT-24700008, KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-25730001, KAKENHI-PLANNED-24106002
[Journal Article] A Note on the Serial Dictatorship with Project Closures2013
- Author(s)
  Naoyuki Kamiyama
- Journal Title
  
  Operations Research Letters
  
  Volume: 41 Issue: 5 Pages: 559-561
- DOI
  10.1016/j.orl.2013.07.006
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-25730006
[Journal Article] Matroid Intersection with Priority Constraints2013
- Author(s)
  Naoyuki Kamiyama
- Journal Title
  
  Journal of the Operations Research Society of Japan
  
  Volume: 56 Pages: 15-25
- NAID
  110009596091
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106005
[Journal Article] Robustness of Minimum Cost Arborescences2013
- Author(s)
  Naoyuki Kamiyama
- Journal Title
  
  Japan Journal of Industrial and Applied Mathematics
  
  Volume: 29 Pages: 485-497
- NAID
  10031126879
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106005
[Journal Article] Independent Arborescences in Directed Graphs2013
- Author(s)
  Andras Franka, Satoru Fujishige, Naoyuki Kamiyama, Naoki Katoh
- Journal Title
  
  Discrete Mathematics
  
  Volume: 313 Issue: 4 Pages: 453-459
- DOI
  10.1016/j.disc.2012.11.006
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21300003, KAKENHI-PLANNED-24106005
[Journal Article] An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs2013
- Author(s)
  Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh and Yuki Kobayashi
- Journal Title
  
  Proc. of COCOA 2013, LNCS
  
  Volume: 8287 Pages: 165-177
- DOI
  10.1007/978-3-319-03780-6_15
- ISBN
  9783319037790, 9783319037806
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-25240004
[Journal Article] Independent Arborescences in Directed Graphs2013
- Author(s)
  Andras Frank, Satoru Fujishige, Naoyuki Kamiyama, Naoki Katoh
- Journal Title
  
  Discrete Mathematics
  
  Volume: 313(4) Pages: 453-459
- Data Source
  KAKENHI-PROJECT-21300003
[Journal Article] A note on the quasi-additive bound for Boolean functions2012
- Author(s)
  Naoyuki Kamiyama
- Journal Title
  
  Journal of Math-for-Industry
  
  Volume: 4-B Pages: 119-122
- NAID
  120005372038
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106005
[Journal Article] Covering directed graphs by in-trees2011
- Author(s)
  N.Kamiyama, N.Katoh
- Journal Title
  
  J.Comb.Optim.
  
  Volume: 21(1) Pages: 2-18
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21300003
[Journal Article] 動的ネットワークフロー2011
- Author(s)
  神山直之
- Journal Title
  
  日本オペレーションズ・リサーチ学会誌
  
  Volume: 56-1 Pages: 15-20
- NAID
  110008007156
- Data Source
  KAKENHI-PROJECT-21300003
[Journal Article] overing directed graphs by in-trees2011
- Author(s)
  N. Kamiyama, N. Katoh
- Journal Title
  
  J. Comb. Optim.
  
  Volume: 21(1) Pages: 2-18
- Data Source
  KAKENHI-PROJECT-21300003
[Journal Article] Covering Directed Graphs by In-trees2011
- Author(s)
  Naoyuki Kamiyama, Naoki Katoh
- Journal Title
  
  Journal of Combinatorial Optimization
  
  Volume: 21(1) Pages: 2-18
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22700016
[Journal Article] Covering Directed Graphs by In-trees2010
- Author(s)
  Naoyuki Kamiyama, Naoki Katoh
- Journal Title
  
  Journal of Combinatorial Optimization (オンラインによる発表)
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21300003
[Journal Article] A Linear-Time Algorithm to Find a Pair of Arc-disjoint Spanning In-arborescence and Out-arborescence in a Directed Acyclic Graph2009
- Author(s)
  Kristof Berczi, Satoru Fujishige, Naoyuki Kamiyama
- Journal Title
  
  Information Processing Letters 109 (23-24)
  
  Pages: 1227-1231
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21300003
[Journal Article] A Linear-Time Algorithm to Find a Pair of Arc-disjoint Spanning In-arborescence and Out-arborescence in a Directed Acyclic Graph2009
- Author(s)
  Kristof Berczi, Satoru Fujishige, Naoyuki Kamiyama
- Journal Title
  
  nformation Processing Letters
  
  Volume: 109(23-24) Pages: 1227-1231
- Data Source
  KAKENHI-PROJECT-21300003
[Journal Article] Arc-disjoint In-trees in Directed Graphs2009
- Author(s)
  Naoyuki Kamiyama, Naoki Katoh, and Atsushi Takizawa
- Journal Title
  
  Combinatorica
  
  Volume: 29 (2) Pages: 197-214
- NAID
  110006533718
- Data Source
  KAKENHI-PROJECT-21300003
[Journal Article] A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths2009
- Author(s)
  Naoyuki Kamiyama, Naoki Katoh
- Journal Title
  
  Proc.20th International Symposium on Algorithms and Computation, Lecture Notes in Computer Science
  
  Volume: 5878 Pages: 802-811
- Data Source
  KAKENHI-PROJECT-21300003
[Journal Article] Arc-disjoint In-trees in Directed Graphs2009
- Author(s)
  Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
- Journal Title
  
  Combinatorica 29 (2)
  
  Pages: 197-214
- NAID
  110006533718
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21300003
[Journal Article] An Efficient Algorithm for the Evacuation Problem in a Certain Class of Networks with Uniform Path-Lengths2009
- Author(s)
  Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
- Journal Title
  
  Discrete Applied Mathematics 157 (17)
  
  Pages: 3665-3677
- NAID
  120002317412
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21300003
[Journal Article] Evaluation of Capacities of Refuges in Urban Areas by using Dynamic Network Flows2009
- Author(s)
  Naoyuki Kamiyama, Atsushi Takizawa, Naoki Katoh, Yuto Kawabata
- Journal Title
  
  Proc. 8th International Symposium on Operations Research and Its Applications
  
  Pages: 453-460
- Data Source
  KAKENHI-PROJECT-21300003
[Journal Article] An Efficient Algorithm for the Evacuation Problem in a Certain Class of Networks with Uniform Path-Lengths2009
- Author(s)
  Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume: 157(17) Pages: 3665-3677
- NAID
  120002317412
- Data Source
  KAKENHI-PROJECT-21300003
[Journal Article] Robustness of minimum cost arborescences
- Author(s)
  Naoyuki Kamiyama
- Journal Title
  
  Japan Journal of Industrial and Applied Mathematics
- NAID
  10031126879
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22700016
[Journal Article] Robustness of minimum cost arborescences
- Author(s)
  Naoyuki Kamiyama
- Journal Title
  
  Japan Journal of Industrial and Applied Mathematics
  
  Volume: (未定)(採録決定)
- NAID
  10031126879
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22700016
[Journal Article] The root location problem for arc-disjoint arborescences
- Author(s)
  Satoru Fujishige and Naoyuki Kamiyama
- Journal Title
  
  Discrete Applied Mathematics
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22700016
[Presentation] Reconfiguration of time-respecting arborescences2023
- Author(s)
  Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
- Organizer
  18th Algorithms and Data Structures Symposium (WADS 2023)
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05795
[Presentation] ILS解グラフの連結性の行列のサイズによる分類2023
- Author(s)
  重信賢直, 神山直之
- Organizer
  日本オペレーションズ・リサーチ学会九州支部九州地区におけるOR若手研究交流会
- Data Source
  KAKENHI-PLANNED-20H05795
[Presentation] 時間制約付き有向木の遷移2023
- Author(s)
  伊藤健洋, 岩政勇仁, 神山直之, 小林靖明, 小林佑輔, 前澤俊一, 鈴木顕
- Organizer
  2023年度夏のLAシンポジウム
- Data Source
  KAKENHI-PLANNED-20H05795
[Presentation] Three open problems on combinatorial reconfiguration2023
- Author(s)
  Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
- Organizer
  3rd Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2023
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05795
[Presentation] Hardness of finding combinatorial shortest paths on graph associahedra2023
- Author(s)
  Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
- Organizer
  50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023)
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05795
[Presentation] Algorithmic theory of qubit routing2023
- Author(s)
  Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
- Organizer
  3rd Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2023
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05795
[Presentation] On reachable assignments under dichotomous preferences2022
- Author(s)
  Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki
- Organizer
  24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2022)
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05795
[Presentation] On reachable assignments under dichotomous preferences2022
- Author(s)
  Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki
- Organizer
  24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA)
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05795
[Presentation] On finding Nash equilibria of discrete preference games and network coordination games2022
- Author(s)
  石塚天, 神山直之
- Organizer
  2021年度冬のLAシンポジウム, 京都大学数理解析研究所RIMS共同研究（公開型）, 情報社会を支える計算機科学の基礎理論
- Data Source
  KAKENHI-PLANNED-20H05795
[Presentation] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2022
- Author(s)
  Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
- Organizer
  2022 ACM-SIAM Symposium on Discrete Algorithms (SODA 2022)
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05795
[Presentation] ILS における解グラフの連結性に関する研究2022
- Author(s)
  重信賢直, 神山直之
- Organizer
  日本オペレーションズ・リサーチ学会九州支部九州地区におけるOR若手研究交流会
- Data Source
  KAKENHI-PLANNED-20H05795
[Presentation] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2022
- Author(s)
  Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
- Organizer
  電子情報通信学会コンピュテーション研究会
- Invited
- Data Source
  KAKENHI-PLANNED-20H05795
[Presentation] Reformist envy-free item allocations: algorithms and complexity2021
- Author(s)
  Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
- Organizer
  第183回情報処理学会アルゴリズム研究会
- Data Source
  KAKENHI-PLANNED-20H05795
[Presentation] Reconfiguration of envy-free item allocations2021
- Author(s)
  Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
- Organizer
  Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2021
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05795
[Presentation] Component Order Connectivity Problem の拡張に対するカーネル化2021
- Author(s)
  白橋正貴, 神山直之
- Organizer
  2021年度OR学会九州支部事業「九州地区における若手OR研究交流会」
- Data Source
  KAKENHI-PROJECT-20K11680
[Presentation] ネットワーク型交渉ゲームの安定化アルゴリズム2016
- Author(s)
  伊藤健洋，垣村尚徳，神山直之，小林佑輔，岡本吉央
- Organizer
  第157回アルゴリズム研究会
- Place of Presentation
  電気通信大学（東京都，調布市）
- Year and Date
  2016-03-06
- Data Source
  KAKENHI-PLANNED-24106005
[Presentation] The Mixed Evacuation Problem2016
- Author(s)
  Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
- Organizer
  The 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2016)
- Place of Presentation
  Hong Kong (China)
- Year and Date
  2016-12-16
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25240004
[Presentation] Efficient Stabilization of Cooperative Matching Games2016
- Author(s)
  Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
- Organizer
  15th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2016)
- Place of Presentation
  シンガポール (シンガポール)
- Year and Date
  2016-05-11
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106005
[Presentation] 木における最小費用b-辺支配集合問題2015
- Author(s)
  伊藤健洋，垣村尚徳，神山直之，小林佑輔，岡本吉央
- Organizer
  オペレーションズ・リサーチ学会2015年春季研究発表会
- Place of Presentation
  東京理科大学
- Year and Date
  2015-03-26
- Data Source
  KAKENHI-PLANNED-24106005
[Presentation] Minimum-Cost b-Edge Dominating Sets on Trees2015
- Author(s)
  Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
- Organizer
  第152回情報処理学会アルゴリズム研究会
- Place of Presentation
  電気通信大学
- Year and Date
  2015-03-03
- Data Source
  KAKENHI-PLANNED-24106005
[Presentation] 計算限界解析と数理計画法2015
- Author(s)
  神山直之
- Organizer
  第20回情報・統計科学シンポジウム
- Place of Presentation
  九州大学（福岡県，福岡市）
- Year and Date
  2015-12-04
- Invited
- Data Source
  KAKENHI-PLANNED-24106005
[Presentation] 有向非巡回グラフにおける有向木ゲームの仁の計算2014
- Author(s)
  神山直之
- Organizer
  日本オぺレーションズ・リサーチ学会「OR 横断若手の会」研究部会
- Place of Presentation
  京都大学
- Data Source
  KAKENHI-PROJECT-25240004
[Presentation] 普遍的最速フローモデルを用いた緊急災害時における避難計画手法に関する研究2014
- Author(s)
  大田章雄, 神山直之, 瀧澤重志, 加藤直樹
- Organizer
  情報処理学会第76回全国大会
- Place of Presentation
  東京電機大学
- Data Source
  KAKENHI-PROJECT-25240004
[Presentation] 最速輸送問題に対する高近似解法の提案及び避難計画への応用に関する研究2014
- Author(s)
  大田章雄, 神山直之, 瀧澤重志, 加藤直樹
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  明治大学
- Data Source
  KAKENHI-PROJECT-25240004
[Presentation] マトロイド制約付き最適選好マッチング問題2014
- Author(s)
  神山直之
- Organizer
  日本オぺレーションズ・リサーチ学会「最適化の理論と応用」研究部会
- Place of Presentation
  東京大学
- Year and Date
  2014-04-19
- Data Source
  KAKENHI-PROJECT-25730006
[Presentation] 疎性マトロイドの拡張定式化2014
- Author(s)
  岩田覚，神山直之，加藤直樹，来嶋秀治，岡本吉央
- Organizer
  研究集会「最適化：モデリングとアルゴリズム」
- Place of Presentation
  政策研究大学院大学
- Data Source
  KAKENHI-PLANNED-24106005
[Presentation] 最速輸送問題に対する高近似解法の提案及び避難計画への応用に関する研究2014
- Author(s)
  大田章雄, 神山直之, 瀧澤重志, 加藤直樹
- Organizer
  日本オペレーションズリサーチ学会　2014年春季研究発表会
- Place of Presentation
  大阪大学
- Data Source
  KAKENHI-PROJECT-25240004
[Presentation] 劣モジュラ罰則付き耐故障性施設配置問題2014
- Author(s)
  神山直之
- Organizer
  冬の LA シンポジウム
- Place of Presentation
  京都大学
- Data Source
  KAKENHI-PLANNED-24106005
[Presentation] 安定マッチング問題に対するマトロイド的手法2014
- Author(s)
  神山直之
- Organizer
  ゲーム理論ワークショップ
- Place of Presentation
  東京工業大学
- Data Source
  KAKENHI-PROJECT-25730006
[Presentation] A New Approach to the Pareto Stable Matching Problem2013
- Author(s)
  Naoyuki Kamiyama
- Organizer
  8 th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
- Place of Presentation
  Veszprem, Hungary
- Data Source
  KAKENHI-PROJECT-25730006
[Presentation] 最適化手法と計算限界解析:双対性と整数性2013
- Author(s)
  神山直之
- Organizer
  ELC 計算量理論の秋学校
- Place of Presentation
  長野県軽井沢市　文化軽井沢山荘
- Data Source
  KAKENHI-PLANNED-24106005
[Presentation] プロジェクト閉鎖付き順次独裁メカニズムの拡張に関する研究2013
- Author(s)
  神山直之
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  沖縄産業支援センター
- Data Source
  KAKENHI-PROJECT-25730006
[Presentation] 離散最適化 -ネットワークフローを中心に- IMIチュートリアル「数学モデリングの基礎と展開」2013
- Author(s)
  神山直之
- Organizer
  IMIチュートリアル「数学モデリングの基礎と展開」
- Place of Presentation
  九州大学
- Data Source
  KAKENHI-PROJECT-21300003
[Presentation] 優先度制約付きマトロイド交差問題,冬のLAシンポジウム2012
- Author(s)
  神山直之
- Place of Presentation
  京都大学
- Year and Date
  2012-02-01
- Data Source
  KAKENHI-PROJECT-22700016
[Presentation] 優先度制約付きマトロイド交差問題2012
- Author(s)
  神山直之
- Organizer
  冬のLAシンポジウム
- Place of Presentation
  京都大学(京都)
- Year and Date
  2012-02-01
- Data Source
  KAKENHI-PROJECT-22700016
[Presentation] 組合せ剛性理論に基づく冗長性を有する剛堅な2次元フレームワークの生成手法2012
- Author(s)
  吉仲祐史, 加藤直樹, 神山直之
- Organizer
  情報処理学会アルゴリズム研究会研究報告
- Place of Presentation
  信州大学松本キャンパス旭会館
- Data Source
  KAKENHI-PROJECT-21300003
[Presentation] 最速輸送問題2012
- Author(s)
  神山直之
- Organizer
  京都大学数理解析研究所研究集会共同研究「組合せ最適化セミナ」
- Data Source
  KAKENHI-PROJECT-21300003
[Presentation] 最速輸送問題2012
- Author(s)
  神山直之
- Organizer
  京都大学数理解析研究所研究集会共同研究「組合せ最適化セミナー」
- Place of Presentation
  京都大学
- Data Source
  KAKENHI-PROJECT-21300003
[Presentation] 組合せ剛性理論に基づく冗長性を有する剛堅な2次元フレームワークの生成手法2012
- Author(s)
  吉仲祐史, 加藤直樹, 神山直之
- Organizer
  情報処理学会アルゴリズム研究会研究報告
- Place of Presentation
  信州大学松本キャンパス旭会館
- Year and Date
  2012-03-07
- Data Source
  KAKENHI-PROJECT-21300003
[Presentation] Transitivity in distributed systems using exchange property of matroid bases2012
- Author(s)
  山内由紀子，神山直之, 来嶋秀治, 大舘陽太
- Organizer
  012年度夏のLAシンポジウム
- Place of Presentation
  天橋立宮津ロイヤルホテル
- Year and Date
  2012-07-17
- Data Source
  KAKENHI-PLANNED-24106005
[Presentation] 最小費用有向木のロバスート性に関する研究2011
- Author(s)
  神山直之
- Organizer
  日本応用数理学会2011年度年会
- Place of Presentation
  同志社大学(京都)
- Year and Date
  2011-09-14
- Data Source
  KAKENHI-PROJECT-22700016
[Presentation] Robustness of minimum cost arborescences2011
- Author(s)
  Naoyuki Kamiyama
- Organizer
  22^<nd> International Symposium on Algorithms and Computation
- Place of Presentation
  ワークピア横浜(神奈川)
- Year and Date
  2011-12-06
- Data Source
  KAKENHI-PROJECT-22700016
[Presentation] 最小費用有向木のロバスト性に関する研究2011
- Author(s)
  神山直之
- Organizer
  日本応用数理学会2011年度年会
- Place of Presentation
  同志社大学
- Year and Date
  2011-09-14
- Data Source
  KAKENHI-PROJECT-22700016
[Presentation] 動的ネットワークフロー概論2011
- Author(s)
  神山直之
- Organizer
  日本オペレーションズ・リサーチ学会関西支部講演会
- Data Source
  KAKENHI-PROJECT-21300003
[Presentation] Robustness of minimum cost arborescences2011
- Author(s)
  Naoyuki Kamiyama
- Organizer
  The 22nd International Symposium on Algorithms and Computation
- Place of Presentation
  ワークピア横浜
- Year and Date
  2011-12-06
- Data Source
  KAKENHI-PROJECT-22700016
[Presentation] 有向木詰め込み問題の歴史と最先端2010
- Author(s)
  神山直之
- Organizer
  日本オペレーションズ・リサーチ学会秋季研究発表会
- Place of Presentation
  コラッセ福島(福島県)
- Year and Date
  2010-09-17
- Data Source
  KAKENHI-PROJECT-22700016
[Presentation] 有向木詰め込み問題の歴史と最先端2010
- Author(s)
  神山直之
- Organizer
  日本オペレーションズ・リサーチ学会秋季研究発表会
- Place of Presentation
  コラッセ福島
- Year and Date
  2010-09-17
- Data Source
  KAKENHI-PROJECT-22700016
[Presentation] 有向木詰め込み問題の歴史と最先端2010
- Author(s)
  神山直之
- Organizer
  月本オペレーションズ・リサーチ学会秋季研究発表会
- Place of Presentation
  コラッセ福島(福島県)(招待講演)
- Year and Date
  2010-09-17
- Data Source
  KAKENHI-PROJECT-21300003
[Presentation] The Root Location Problem for Arc-disjoint Arborescences2010
- Author(s)
  Satoru Fujishige, Naoyuki Kamiyama
- Organizer
  Mini-Symposium on New Developments of Discrete Algorithms
- Place of Presentation
  東京工業大学
- Year and Date
  2010-02-15
- Data Source
  KAKENHI-PROJECT-21300003
[Presentation] 有向木の詰め込みの歴史と最近の進展2009
- Author(s)
  神山直之
- Organizer
  第21回RAMPシンポジウム
- Data Source
  KAKENHI-PROJECT-21300003
[Presentation] APolynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths2009
- Author(s)
  Naoyuki Kamiyama and Naoki Katoh
- Organizer
  20th International Symposium on Algorithms andComputation (ISAAC'09)
- Place of Presentation
  Honolulu, Hawaii, USA
- Data Source
  KAKENHI-PROJECT-21300003
[Presentation] 木における一般化辺支配集合問題2009
- Author(s)
  今井桂子, 神山直之, 松本雄介
- Organizer
  日本オペレーションズ・リサーチ学会研究部会「若手によるOR横断研究」平成21年度若手研究交流会
- Place of Presentation
  関西大学飛鳥文化研究所
- Year and Date
  2009-10-10
- Data Source
  KAKENHI-PROJECT-21300003
[Presentation] A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths2009
- Author(s)
  神山直之, 加藤直樹
- Organizer
  20th International Symposium on Algorithms and Computation (ISAAC' 09)
- Place of Presentation
  Honolulu, Hawaii, USA
- Year and Date
  2009-12-18
- Data Source
  KAKENHI-PROJECT-21300003
[Presentation] Evaluation of Capacities of Refuges in Urban Areas by using Dynamic Network Flows2009
- Author(s)
  N. Kamiyama, A. Takizawa, N. Katoh a n d Y. Kawabata
- Organizer
  The 8th International Symposium on Operations Research and Its Applications (ISORA 2009)
- Place of Presentation
  Zhangjiajie, China
- Year and Date
  2009-09-20
- Data Source
  KAKENHI-PROJECT-21300003
[Presentation] 動的ネットワークフローを用いた避難所の収容人数の評価2009
- Author(s)
  神山直之,川端祐人,加藤直樹,瀧澤重志
- Organizer
  日本オペレーションズ・リサーチ学会秋季研究発表会
- Place of Presentation
  長崎大学
- Year and Date
  2009-09-09
- Data Source
  KAKENHI-PROJECT-21300003
[Presentation] The Multicover Problem in Graphs arising from Patrol Route Planning2009
- Author(s)
  Masaki Inoue, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa, and Koo Wonyong
- Organizer
  International Symposium on Scheduling 2009 (ISS'09)
- Place of Presentation
  名古屋工業大学
- Data Source
  KAKENHI-PROJECT-21300003
[Presentation] Evaluation of Capacities of Refuges in Urban Areas by using Dynamic Network Flows2009
- Author(s)
  神山直之, 瀧澤重志, 加藤直樹, 川端祐人
- Organizer
  8th International Symposium on Operations Research and Its Applications (ISORA' 09)
- Place of Presentation
  Zhangjiajie, China
- Year and Date
  2009-09-20
- Data Source
  KAKENHI-PROJECT-21300003
[Presentation] The Multicover Problem in Graphs arising from Patrol Route Planning2009
- Author(s)
  Masaki Inoue, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa, Koo Wonyong
- Organizer
  International Symposium on Scheduling 2009 (ISS '09)
- Place of Presentation
  名古屋工業大学
- Year and Date
  2009-06-04
- Data Source
  KAKENHI-PROJECT-21300003
[Presentation] 辺容量が一定のグリッドを一般化した動的ネットワークにおける普遍的最速フロー問題に対する多項式時間アルゴリズム2009
- Author(s)
  神山直之, 加藤直樹
- Organizer
  日本オペレーションズ・リサーチ学会「計算と最適化の新展開」研究部会「未来を担う若手研究者の集い2009」
- Place of Presentation
  筑波大学
- Year and Date
  2009-05-30
- Data Source
  KAKENHI-PROJECT-21300003
[Presentation] 時刻ラベル付き非巡回ネットワーク上の有向木詰込み問題
- Author(s)
  神山直之
- Organizer
  オペレーションズ・リサーチ学会秋季研究発表会
- Place of Presentation
  北海道科学大学
- Year and Date
  2014-08-28 – 2014-08-29
- Data Source
  KAKENHI-PROJECT-25240004
[Presentation] The Popular Matching and Condensation Problems under Matroid Constraints
- Author(s)
  Naoyuki Kamiyama
- Organizer
  The 8th Annual International Conference on Combinatorial Optimization and Applications
- Place of Presentation
  Hawaii, USA
- Year and Date
  2014-12-19 – 2014-12-20
- Data Source
  KAKENHI-PROJECT-25730006

1. KATOH Naoki (40145826)

# of Collaborated Projects: 3 results

# of Collaborated Products: 29 results
2. TAKIZAWA Atsushi (40304133)

# of Collaborated Projects: 2 results

# of Collaborated Products: 15 results
3. TANIGAWA Shinichi (30623540)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
4. OKAMOTO Yoshio (00402660)

# of Collaborated Projects: 2 results

# of Collaborated Products: 22 results
5. KOO Wonyong (20534754)

# of Collaborated Projects: 1 results

# of Collaborated Products: 2 results
6. MINATO Shin-ichi (10374612)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
7. UNO Takeaki (00302977)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
8. 岩田覚 (00263161)

# of Collaborated Projects: 1 results

# of Collaborated Products: 2 results
9. 来嶋秀治 (70452307)

# of Collaborated Projects: 1 results

# of Collaborated Products: 3 results
10. BELMONTE Remy (80780147)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
11. 藤澤克樹 (40303854)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
12. 伊藤仁一 (20193493)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
13. 東川雄哉 (20749486)

# of Collaborated Projects: 1 results

# of Collaborated Products: 2 results
14. 小林祐貴 (70756668)

# of Collaborated Projects: 1 results

# of Collaborated Products: 1 results
15. 山川誠 (50378816)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
16. 奈良知惠 (40147898)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
17. 小関健太 (10649122)

# of Collaborated Projects: 1 results

# of Collaborated Products: 10 results
18. 垣村尚徳 (30508180)

# of Collaborated Projects: 1 results

# of Collaborated Products: 13 results
19. 小林佑輔 (40581591)

# of Collaborated Projects: 1 results

# of Collaborated Products: 14 results
20. 野崎雄太 (40822648)

# of Collaborated Projects: 1 results

# of Collaborated Products: 12 results
21. 岩政勇仁 (70854602)

# of Collaborated Projects: 1 results

# of Collaborated Products: 9 results
22. 前澤俊一 (70905934)

# of Collaborated Projects: 1 results

# of Collaborated Products: 9 results
23. SUZUMURA Toyotaro

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
24. 伊藤健洋

# of Collaborated Projects: 0 results

# of Collaborated Products: 6 results
25. 大舘陽太

# of Collaborated Projects: 0 results

# of Collaborated Products: 1 results
26. 小林靖明

# of Collaborated Projects: 0 results

# of Collaborated Products: 1 results

Kamiyama Naoyuki 神山 直之

KAMIYAMA Naoyuki 神山 直之

Research Projects

Research Products

Co-Researchers

動的ネットワークフローの革新的発展に関する研究Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

A Study on Kernelization Algorithms for the Vertex Cover Problem and its GeneralizationsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Development of Combinatorial Reconfiguration by Mathematics Approach: From Examples to New Methods

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Establishing the foundation of discrete mathematics in the field of architecture and urban planning and its application to large-scale optimization

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

A Study on Discrete Structures of Advanced Stable Matching ProblemsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Deepening analysis methods for limits of computation through integration with optimization techniques

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

New Developments in Arborescence Packing ProblemsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Computational Geometry and Discrete Optimization in Architecture and Urban Planning

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

[Journal Article] The strongly stable matching problem with closures2024

Author(s)

Journal Title

Data Source

[Journal Article] Modifying an instance of the super-stable matching problem2024

Author(s)

Journal Title

Data Source

[Journal Article] Reachability of fair allocations via sequential exchanges2024

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Algorithmic theory of qubit routing2023

Author(s)

Journal Title

DOI

ISBN

Data Source

[Journal Article] Reconfiguration of Time-Respecting Arborescences2023

Author(s)

Journal Title

DOI

ISBN

Data Source

[Journal Article] On connectedness of solutions to integer linear systems2023

Author(s)

Kamiyama Naoyuki 神山直之

KAMIYAMA Naoyuki 神山直之