Basic Information

Faculty

• Faculty of Engineering

Email Address

• Email Address

  kamiyama.naoyuki.5rkyoto-u.ac.jp

Academic Degree

• 23 Mar. 2006

  京都大学修士（工学）
• 23 Mar. 2009

  京都大学博士（工学）

Academic Resume (Undergraduate School/Majors)

• 京都大学, 工学部建築学科, 卒業

Research History

• From Apr. 2026

  Kyoto University, Graduate School of Informatics, Applied Mathematics and Physics Course, Professor
• From Jul. 2019, To Mar. 2026

  Kyushu University, Institute of Mathematics for Industry, Professor
• From Oct. 2014, To Mar. 2021

  Japan Science and Technology Agency, PRESTO Researcher
• From Oct. 2011, To Jun. 2019

  Kyushu University, Institute of Mathematics for Industry, Associate Professor
• From Apr. 2009, To Sep. 2011

  Chuo University, Faculty of Science and Engineering Department of Information and System Engineering, Assistant Professor
• From Apr. 2007, To Mar. 2009

  Japan Society for the Promotion of Science, Research Fellow of the Japan Society for the Promotion Science

ID,URL

• Researcher number

  10548134

• External link

  https://nkamiyama.github.io/website/

researchmap URL

• https://researchmap.jp/read0149503

Research

Research Interests

• Discrete Optimization
• Discrete Algorithm
• Discrete Structure
• Applied Mathematics

Research Areas

• Natural sciences, Applied mathematics and statistics
• Informatics, Information theory

Papers

• Loss Minimization for Electrical Flows over Spanning Trees on Grids

  Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yoshio Okamoto

  Theoretical Computer Science, 12 Sep. 2026, Peer-reviewed

  
• Reforming an Unfair Allocation by Exchanging Goods

  Yuen Sheung Man; Ayumi Igarashi; Naoyuki Kamiyama; Warut Suksompong

  Algorithmica, 2027, Peer-reviewed

  
• A Sampling-Based Approach to Contextual Inverse Optimization

  Yasunari Hikima; Naoyuki Kamiyama; Shinsaku Sakaue; Taira Tsuchiya

  Proceedings of the 35th International Joint Conference on Artificial Intelligence (IJCAI-ECAI), 2027, Peer-reviewed

  
• A Necessary Condition for Connectedness of Solutions to Integer Linear Systems

  Takasugu Shigenobu; Naoyuki Kamiyama

  Journal of the Operations Research Society of Japan, 2027, Peer-reviewed

  
• The Strongly Stable Matching Problem with Closures

  Naoyuki Kamiyama

  Theoretical Computer Science, 27 Jun. 2026, Peer-reviewed

  
• Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra

  Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto

  SIAM Journal on Discrete Mathematics, Jun. 2026, Peer-reviewed

  Access this paper :

  
• Two-Sided Fairness in Many-to-One Matching

  Ayumi Igarashi; Naoyuki Kamiyama; Yasushi Kawase; Warut Suksompong; Hanna Sumita; Yu Yokoi

  Proceedings of the 21st Conference on Web and Internet Economics (WINE), 12 May 2026, Peer-reviewed

  
• Non-uniformly Stable Matchings

  Naoyuki Kamiyama

  ACM Transactions on Economics and Computation, 13 Feb. 2026, Peer-reviewed

  
• Optimal Class Assignment Problem: A Case Study at Gunma University

  Akifumi Kira; Kiyohito Nagano; Manabu Sugiyama; Naoyuki Kamiyama

  Journal of the Operations Research Society of Japan, 31 Jan. 2026

  
• Reconfiguration of Time-Respecting Arborescences

  Takehiro Ito; Yuni Iwamasa; Naoyuki Kamiyama; Yasuaki Kobayashi; Yusuke Kobayashi; Shun-ichi Maezawa; Akira Suzuki

  Algorithmica, 22 Dec. 2025, Peer-reviewed

  
• A Topological Data Analysis Approach to Detecting Congestion in Pedestrian Crowds

  Naoyuki Kamiyama; Hiroaki Yamada; Takashi Kato; Shizuo Kaji; Tetsuro Takahashi

  2025 Winter Simulation Conference (WSC), 07 Dec. 2025, Peer-reviewed

  
• [preliminary version] Reforming an Unfair Allocation by Exchanging Goods

  Yuen Sheung Man; Ayumi Igarashi; Naoyuki Kamiyama; Warut Suksompong

  Proceedings of the 36th International Symposium on Algorithms and Computation (ISAAC), 27 Nov. 2025, Peer-reviewed

  
• Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs

  Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yoshio Okamoto

  Proceedings of the 36th International Symposium on Algorithms and Computation (ISAAC), 27 Nov. 2025, Peer-reviewed

  
• Strongly Stable Matchings under Matroid Constraints

  Naoyuki Kamiyama

  SIAM Journal on Discrete Mathematics, Sep. 2025, Peer-reviewed

  
• An Inverse Optimization Approach to Contextual Inverse Optimization

  Yasunari Hikima; Naoyuki Kamiyama

  Proceedings of the 34th International Joint Conference on Artificial Intelligence (IJCAI), Aug. 2025, Peer-reviewed

  
• The Minimum‐Cost Dynamic Flow Problem in a Fixed Graph With a Constant Target Flow Value

  Naoyuki Kamiyama

  Networks, Jun. 2025

  
• Algorithmic Theory of Qubit Routing in the Linear Nearest Neighbor Architectures

  Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yoshio Okamoto

  ACM Transactions on Quantum Computing, May 2025, Peer-reviewed

  
• Super-Stable Common Independent Sets of Generalized Matroids

  Naoyuki Kamiyama

  Operations Research Letters, May 2025, Peer-reviewed

  
• Modifying an Instance of the Super-Stable Matching Problem

  Naoyuki Kamiyama

  Information Processing Letters, Mar. 2025

  
• Reforming an Envy-Free Matching

  Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki

  Algorithmica, 27 Jan. 2025, Peer-reviewed

  
• Reachability of Fair Allocations via Sequential Exchanges

  Ayumi Igarashi; Naoyuki Kamiyama; Warut Suksompong; Yuen Sheung Man

  Algorithmica, Dec. 2024, Peer-reviewed

  
• Envy-Free Relaxations for Goods, Chores, and Mixed Items

  Kristóf Bérczi; Erika R. Bérczi-Kovács; Endre Boros; Fekadu Tolessa Gedefa; Naoyuki Kamiyama; Telikepalli Kavitha; Yusuke Kobayashi; Kazuhisa Makino

  Theoretical Computer Science, 29 Jun. 2024, Peer-reviewed

  
• A Note on Robust Subsets of Transversal Matroids

  Naoyuki Kamiyama

  Journal of the Operations Research Society of Japan, 30 Apr. 2024, Peer-reviewed

  
• [preliminary version] Reachability of Fair Allocations via Sequential Exchanges

  Ayumi Igarashi; Naoyuki Kamiyama; Warut Suksompong; Sheung Man Yuen

  Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI), 24 Mar. 2024, Peer-reviewed

  
• On Connectedness of Solutions to Integer Linear Systems

  Takasugu Shigenobu; Naoyuki Kamiyama

  Combinatorial Optimization and Applications, 09 Dec. 2023, Peer-reviewed

  
• On Reachable Assignments under Dichotomous Preferences

  Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki

  Theoretical Computer Science, 10 Nov. 2023, Peer-reviewed

  Access this paper :

  
• On Optimization Problems in Acyclic Hypergraphs

  Naoyuki Kamiyama

  Information Processing Letters, Aug. 2023, Peer-reviewed

  
• [preliminary version] Reconfiguration of Time-Respecting Arborescences

  Takehiro Ito; Yuni Iwamasa; Naoyuki Kamiyama; Yasuaki Kobayashi; Yusuke Kobayashi; Shun-ichi Maezawa; Akira Suzuki

  Proceedings of the 18th Algorithms and Data Structures Symposium (WADS), 28 Jul. 2023, Peer-reviewed

  
• [preliminary version] Algorithmic Theory of Qubit Routing

  Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yoshio Okamoto

  Proceedings of the 18th Algorithms and Data Structures Symposium (WADS), 28 Jul. 2023, Peer-reviewed

  
• [preliminary version] Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra.

  Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto

  Proceedings of the 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP), 05 Jul. 2023, Peer-reviewed

  
• Kernelization Algorithms for a Generalization of the Component Order Connectivity Problem

  Masataka Shirahashi; Naoyuki Kamiyama

  Journal of the Operations Research Society of Japan, 30 Apr. 2023, Peer-reviewed

  
• Pareto Efficient Matchings with Pairwise Preferences

  Naoyuki Kamiyama

  Theoretical Computer Science, 28 Feb. 2023, Peer-reviewed

  
• Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams

  Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Shun-Ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki

  ACM Transactions on Algorithms, Jan. 2023, Peer-reviewed

  
• [preliminary version] On Reachable Assignments Under Dichotomous Preferences

  Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki

  Proceedings of the 24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA), 12 Nov. 2022, Peer-reviewed

  
• [preliminary version] Reforming an Envy-Free Matching

  Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki

  Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI), 28 Jun. 2022, Peer-reviewed

  
• A Matroid Generalization of the Super-Stable Matching Problem

  Naoyuki Kamiyama

  SIAM Journal on Discrete Mathematics, Jun. 2022, Peer-reviewed

  
• Shortest Reconfiguration of Perfect Matchings via Alternating Cycles

  Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yoshio Okamoto

  SIAM Journal on Discrete Mathematics, Jun. 2022, Peer-reviewed

  Access this paper :

  
• A Parameterized View to the Robust Recoverable Base Problem of Matroids Under Structural Uncertainty

  Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yoshio Okamoto

  Operations Research Letters, May 2022, Peer-reviewed

  Access this paper :

  
• Submodular Reassignment Problem for Reallocating Agents to Tasks with Synergy Effects

  Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yoshio Okamoto

  Discrete Optimization, May 2022, Peer-reviewed

  
• MAS Network: Surrogate Neural Network for Multi-agent Simulation

  Hiroaki Yamada; Masataka Shirahashi; Naoyuki Kamiyama; Yumeka Nakajima

  Proceedings of the 22nd International Workshop on Multi-Agent-Based Simulation (MABS), 16 Jan. 2022, Peer-reviewed

  
• [preliminary version] Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams

  Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki

  Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 09 Jan. 2022, Peer-reviewed

  
• The Envy-Free Matching Problem with Pairwise Preferences

  Naoyuki Kamiyama

  Information Processing Letters, Dec. 2021, Peer-reviewed

  
• Envy-Free Matchings with One-Sided Preferences and Matroid Constraints

  Naoyuki Kamiyama

  Operations Research Letters, Sep. 2021, Peer-reviewed

  
• On the Complexity of Fair House Allocation

  Naoyuki Kamiyama; Pasin Manurangsi; Warut Suksompong

  Operations Research Letters, Jul. 2021, Peer-reviewed

  
• Algorithms for Gerrymandering over Graphs

  Ito Takehiro; Naoyuki Kamiyama; Yusuke Kobayashi; Yoshio Okamoto

  Theoretical Computer Science, 08 May 2021, Peer-reviewed

  Access this paper :

  
• Optimal Control of Pedestrian Flows by Congestion Forecasts Satisfying User Equilibrium Conditions

  Hiroaki Yamada; Naoyuki Kamiyama

  Proceedings of the 23rd International Conference on Principles and Practice of Multi-Agent Systems (PRIMA), 14 Feb. 2021, Peer-reviewed

  
• The b-Branching Problem in Digraphs

  Naonori Kakimura; Naoyuki Kamiyama; Kenjiro Takazawa

  Discrete Applied Mathematics, 15 Sep. 2020, Peer-reviewed

  
• The Distance-Constrained Matroid Median Problem

  Naoyuki Kamiyama

  Algorithmica, Jul. 2020, Peer-reviewed

  
• On Stable Matchings with Pairwise Preferences and Matroid Constraints

  Naoyuki Kamiyama

  Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 09 May 2020, Peer-reviewed

  
• Popular Matchings with Two-Sided Preference Lists and Matroid Constraints

  Naoyuki Kamiyama

  Theoretical Computer Science, 24 Feb. 2020, Peer-reviewed

  
• Lexicographically Optimal Earliest Arrival Flows

  Naoyuki Kamiyama

  Networks, Jan. 2020, Peer-reviewed

  
• Discrete Newton Methods for the Evacuation Problem

  Naoyuki Kamiyama

  Theoretical Computer Science, 26 Nov. 2019, Peer-reviewed

  
• On Dynamic Patrolling Security Games

  Akifumi Kira; Naoyuki Kamiyama; Hirokazu Anai; Hiroaki Iwashita; Kotaro Ohori

  Journal of the Operations Research Society of Japan, 31 Oct. 2019, Peer-reviewed

  
• [preliminary version] Shortest Reconfiguration of Perfect Matchings via Alternating Cycles.

  Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 0001; Yoshio Okamoto

  Proceedings of the 27th Annual European Symposium on Algorithms (ESA), 06 Sep. 2019, Peer-reviewed

  
• Exact and Approximation Algorithms for Weighted Matroid Intersection

  Chien-Chung Huang; Naonori Kakimura; Naoyuki Kamiyama

  Mathematical Programming, 01 Sep. 2019, Peer-reviewed

  
• [preliminary version] Algorithms for Gerrymandering over Graphs

  Takehiro Ito; Naoyuki Kamiyama; Yusuke Kobayashi; Yoshio Okamoto

  Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 13 May 2019, Peer-reviewed

  
• Many-to-Many Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints

  Naoyuki Kamiyama

  Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 13 May 2019, Peer-reviewed

  
• A Note on Balanced Flows in Equality Networks

  Naoyuki Kamiyama

  Information Processing Letters, May 2019, Peer-reviewed

  
• An Improved Algorithm for Testing Substitutability of Weak Preferences

  Susumu Kawanaka; Naoyuki Kamiyama

  Mathematical Social Sciences, May 2019, Peer-reviewed

  
• Reconfiguration of Maximum-Weight b-Matchings in a Graph

  Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yoshio Okamoto

  Journal of Combinatorial Optimization, 15 Feb. 2019, Peer-reviewed

  
• Minimum-Cost b-Edge Dominating Sets on Trees

  Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yoshio Okamoto

  Algorithmica, 15 Jan. 2019, Peer-reviewed

  
• Pareto Stable Matchings under One-Sided Matroid Constraints

  Naoyuki Kamiyama

  SIAM Journal on Discrete Mathematics, Jan. 2019, Peer-reviewed

  
• On the Complexity of Stable Fractional Hypergraph Matching

  Takashi Ishizuka; Naoyuki Kamiyama

  Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC), 06 Dec. 2018, Peer-reviewed

  
• The Mixed Evacuation Problem

  Yosuke Hanawa; Yuya Higashikawa; Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa

  Journal of Combinatorial Optimization, Nov. 2018, Peer-reviewed

  
• A Note on Submodular Function Minimization with Covering Type Linear Constraints

  Naoyuki Kamiyama

  Algorithmica, Oct. 2018, Peer-reviewed

  
• [preliminary version] The b-Branching Problem in Digraphs.

  Naonori Kakimura; Naoyuki Kamiyama; Kenjiro Takazawa

  Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS), 27 Aug. 2018, Peer-reviewed

  
• Submodular Function Minimization with Submodular Set Covering Constraints and Precedence Constraints

  Naoyuki Kamiyama

  Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), 01 Apr. 2018, Peer-reviewed

  
• Tight Approximability of the Server Allocation Problem for Real-Time Applications

  Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yoshio Okamoto; Taichi Shiitada

  Proceedings of the 3rd International Workshop on Algorithmic Aspects of Cloud Computing (Algocloud), 29 Jan. 2018, Peer-reviewed

  
• A Characterization of Weighted Popular Matchings under Matroid Constraints

  Naoyuki Kamiyama

  Journal of the Operations Research Society of Japan, 07 Jan. 2018, Peer-reviewed

  
• Modeling and Managing Airport Passenger Flow Under Uncertainty: A Case of Fukuoka Airport in Japan

  Hiroaki Yamada; Kotaro Ohori; Tadashige Iwao; Akifumi Kira; Naoyuki Kamiyama; Hiroaki Yoshida; Hirokazu Anai

  Proceedings of the 9th International Conference on Social Informatics (SocInfo), 02 Sep. 2017, Peer-reviewed

  
• [preliminary version] Reconfiguration of Maximum-Weight b-Matchings in a Graph

  Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yoshio Okamoto

  Prceedings of the 23rd Annual International Computing and Combinatorics Conference (COCOON), 04 Jul. 2017, Peer-reviewed

  
• Efficient Stabilization of Cooperative Matching Games

  Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yoshio Okamoto

  Theoretical Computer Science, 16 May 2017, Peer-reviewed

  
• Strategic Issues in College Admissions with Score-Limits

  Naoyuki Kamiyama

  Operations Research Letters, Mar. 2017, Peer-reviewed

  
• A Note on the Submodular Vertex Cover Problem with Submodular Penalties

  Naoyuki Kamiyama

  Theoretical Computer Science, 10 Jan. 2017, Peer-reviewed

  
• Popular Matchings with Ties and Matroid Constraints

  Naoyuki Kamiyama

  SIAM Journal on Discrete Mathematics, Jan. 2017, Peer-reviewed

  
• The Popular Matching and Condensation Problems under Matroid Constraints

  Naoyuki Kamiyama

  Journal of Combinatorial Optimization, Nov. 2016, Peer-reviewed

  
• [preliminary version] The Mixed Evacuation Problem

  Yosuke Hanawa; Yuya Higashikawa; Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa

  Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 31 Oct. 2016, Peer-reviewed

  
• Extended Formulations for Sparsity Matroids

  Satoru Iwata; Naoyuki Kamiyama; Naoki Katoh; Shuji Kijima; Yoshio Okamoto

  Mathematical Programming, Jul. 2016, Peer-reviewed

  
• Many-to-Many Stable Matchings with Ties in Trees

  Keita Nakamura; Naoyuki Kamiyama

  Journal of the Operations Research Society of Japan, Jul. 2016, Peer-reviewed

  
• [preliminary version] Efficient Stabilization of Cooperative Matching Games

  Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yoshio Okamoto

  Proceedings of the 15th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 09 May 2016, Peer-reviewed

  
• A Matroid Approach to Stable Matchings with Lower Quotas

  Tamás Fleiner; Naoyuki Kamiyama

  Mathematics of Operations Research, May 2016, Peer-reviewed

  
• [preliminary version] Exact and Approximation Algorithms for Weighted Matroid Intersection

  Chien-Chung Huang; Naonori Kakimura; Naoyuki Kamiyama

  Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 10 Jan. 2016, Peer-reviewed

  
• Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints

  Naoyuki Kamiyama

  Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 15 Sep. 2015, Peer-reviewed

  
• On Packing Arborescences in Temporal Networks

  Naoyuki Kamiyama; Yasushi Kawase

  Information Processing Letters, Feb. 2015, Peer-reviewed

  
• The Nucleolus of Arborescence Games in Directed Acyclic Graphs

  Naoyuki Kamiyama

  Operations Research Letters, Jan. 2015, Peer-reviewed

  
• The Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths

  Naoyuki Kamiyama; Naoki Katoh

  Discrete Applied Mathematics, 11 Dec. 2014, Peer-reviewed

  
• [preliminary version] Minimum-Cost $$b$$-Edge Dominating Sets on Trees

  Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yoshio Okamoto

  Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC), 20 Nov. 2014, Peer-reviewed

  
• [preliminary version] The Popular Matching and Condensation Problems Under Matroid Constraints

  Naoyuki Kamiyama

  Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 19 Nov. 2014, Peer-reviewed

  
• An Inductive Construction of Minimally Rigid Body–Hinge Simple Graphs

  Yuki Kobayashi; Yuya Higashikawa; Naoki Katoh; Naoyuki Kamiyama

  Theoretical Computer Science, 30 Oct. 2014, Peer-reviewed

  
• A New Approach to the Pareto Stable Matching Problem

  Naoyuki Kamiyama

  Mathematics of Operations Research, Aug. 2014, Peer-reviewed

  
• Arborescence Problems in Directed Graphs: Theorems and Algorithms

  Naoyuki Kamiyama

  Interdisciplinary Information Sciences, Mar. 2014, Peer-reviewed

  
• [preliminary version] An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs

  Yuya Higashikawa; Naoyuki Kamiyama; Naoki Katoh; Yuki Kobayashi

  Proceedings of the 7th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 20 Nov. 2013, Peer-reviewed

  
• On Total Unimodularity of Edge–Edge Adjacency Matrices

  Yusuke Matsumoto; Naoyuki Kamiyama; Keiko Imai

  Algorithmica, Oct. 2013, Peer-reviewed

  
• A Note on the Serial Dictatorship with Project Closures

  Naoyuki Kamiyama

  Operations Research Letters, Sep. 2013, Peer-reviewed

  
• Matroid Intersection with Priority Constraints

  Naoyuki Kamiyama

  Journal of the Operations Research Society of Japan, Mar. 2013, Peer-reviewed

  
• Independent Arborescences in Directed Graphs

  András Frank; Satoru Fujishige; Naoyuki Kamiyama; Naoki Katoh

  Discrete Mathematics, 28 Feb. 2013, Peer-reviewed

  
• A Note on the Quasi-additive Bound for Boolean Functions

  Naoyuki Kamiyama

  Journal of Math-for-Industry, Oct. 2012, Peer-reviewed

  
• Robustness of Minimum Cost Arborescences

  Naoyuki Kamiyama

  Japan Journal of Industrial and Applied Mathematics, Oct. 2012, Peer-reviewed

  
• The Root Location Problem for Arc-Disjoint Arborescences

  Satoru Fujishige; Naoyuki Kamiyama

  Discrete Applied Mathematics, Sep. 2012, Peer-reviewed

  
• [preliminary version] A Matroid Approach to Stable Matchings with Lower Quotas

  Tamás Fleiner; Naoyuki Kamiyama

  Proceedings of the 23rd Annual ACM/SIAM Symposium on Discrete Algorithms (SODA), 17 Jan. 2012, Peer-reviewed

  
• NETAL : High-Performance Implementation of Network Analysis Library Considering Computer Memory Hierarchy

  Yuichiro Yasui; Katsuki Fujisawa; Kazushige Goto; Naoyuki Kamiyama; Mizuyo Takamatsu

  Journal of the Operations Research Society of Japan, Dec. 2011, Peer-reviewed

  
• [preliminary version] Robustness of Minimum Cost Arborescences

  Naoyuki Kamiyama

  Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC), 21 Nov. 2011, Peer-reviewed

  
• [preliminary version] On Totally Unimodularity of Edge-Edge Adjacency Matrices

  Yusuke Matsumoto; Naoyuki Kamiyama; Keiko Imai

  Proceedings of the 17th Annual International Computing and Combinatorics Conference (COCOON) Computer Science, 18 Jul. 2011, Peer-reviewed

  
• Submodular Function Minimization under a Submodular Set Covering Constraint

  Naoyuki Kamiyama

  Proceedings of the 8th Annual Conference on Theory and Applications of Models of Computation (TAMC), 03 May 2011, Peer-reviewed

  
• An Approximation Algorithm Dependent on Edge-Coloring Number for Minimum Maximal Matching Problem

  Yusuke Matsumoto; Naoyuki Kamiyama; Keiko Imai

  Information Processing Letters, 30 Apr. 2011, Peer-reviewed

  
• Improved Approximation Algorithms for Firefighter Problem on Trees

  Yutaka Iwaikawa; Naoyuki Kamiyama; Tomomi Matsui

  IEICE Transactions on Information and Systems, 01 Feb. 2011, Peer-reviewed

  
• Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking

  Naoyuki Kamiyama; Tomomi Matsui

  Proceedings of the 17th Computing: the Australasian Theory Symposium (CATS), Jan. 2011, Peer-reviewed

  
• Covering Directed Graphs by In-Trees

  Naoyuki Kamiyama; Naoki Katoh

  Journal of Combinatorial Optimization, Jan. 2011, Peer-reviewed

  
• The Prize-Collecting Edge Dominating Set Problem in Trees

  Naoyuki Kamiyama

  Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS), 10 Aug. 2010, Peer-reviewed

  
• [preliminary version] A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths

  Naoyuki Kamiyama; Naoki Katoh

  Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC), 24 Nov. 2009, Peer-reviewed

  
• A Linear-Time Algorithm to Find a Pair of Arc-Disjoint Spanning In-Arborescence and Out-Arborescence in a Directed Acyclic Graph

  Kristóf Bérczi; Satoru Fujishige; Naoyuki Kamiyama

  Information Processing Letters, 15 Nov. 2009, Peer-reviewed

  
• An Efficient Algorithm for the Evacuation Problem in a Certain Class of Networks with Uniform Path-Lengths

  Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa

  Discrete Applied Mathematics, 28 Oct. 2009, Peer-reviewed

  Access this paper :

  
• Arc-Disjoint In-Trees in Directed Graphs

  Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa

  Combinatorica, Mar. 2009, Peer-reviewed

  Access this paper :

  
• Computational Complexities of University Interview Timetabling

  Naoyuki Kamiyama; Yuuki Kiyonari; Eiji Miyano; Shuichi Miyazaki; Katsuhisa Yamanaka

  IEICE Transactions on Information and Systems, 01 Feb. 2009, Peer-reviewed

  
• The Minimum Weight In-Tree Cover Problem

  Naoyuki Kamiyama; Naoki Katoh

  Proceedings of the 2nd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO), 28 Aug. 2008, Peer-reviewed

  
• Finding an Optimal Location of Line Facility using Evolutionary Algorithm and Integer Program

  Takenao Taji; Shin-ichi Tanigawa; Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa

  Journal of Computational Science and Technology, Jul. 2008, Peer-reviewed

  
• [preliminary version] Covering Directed Graphs by In-Trees

  Naoyuki Kamiyama; Naoki Katoh

  Proceedings of the14th Annual International Computing and Combinatorics Conference (COCOON), 16 Jun. 2008, Peer-reviewed

  
• [preliminary version] Arc-Disjoint In-Trees in Directed Graphs

  Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa

  Proceedings of the 19th Annual ACM/SIAM Symposium on Discrete Algorithms (SODA), 20 Jan. 2008, Peer-reviewed

  
• [preliminary version] An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths

  Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa

  Proceedings of the 3rd International Conference on Algorithmic Aspect in Information and Management (AAIM), 31 May 2007, Peer-reviewed

  
• An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity

  Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa

  IEICE Transactions on Information and Systems, 01 Aug. 2006, Peer-reviewed

  Access this paper :

  
• [preliminary version] An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity

  Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa

  Proceedings of the 2nd International Conference on Algorithmic Aspect in Information and Management (AAIM), 09 Jun. 2006, Peer-reviewed

  
• フロアプランの列挙に基づく2階建て住宅の室配置アルゴリズム

  神山 直之; 瀧澤 重志; 加藤 直樹

  日本建築学会環境系論文集, 30 Mar. 2006, Peer-reviewed

  

Misc.

• ネットワークアルゴリズム

  神山 直之

  理論計算機科学事典, Jan. 2022

  
• 組合せ最適化

  神山 直之

  数理科学, Dec. 2021

  
• 離散最適化の理論と応用, （３）劣モジュラ関数と避難計画問題

  神山 直之

  数学セミナー, Apr. 2018

  
• 離散最適化の理論と応用, （２）マトロイドとマッチング問題

  神山 直之

  数学セミナー, Mar. 2018

  
• 離散最適化の理論と応用, （１）離散最適化とマトロイド・劣モジュラ関数

  神山 直之

  数学セミナー, Feb. 2018

  

Industrial Property Rights

• 特許第6896254号, 特開2019-67158, 特願2017-192222, マッチングプログラム、マッチング方法およびマッチング装置

  岩下 洋哲; 大堀 耕太郎; 神山 直之; 吉良 知文

  
• 特許第6818272号, 特開2018-60480, 特願2016-199547, リスク評価プログラム、リスク評価方法およびリスク評価装置

  岩下 洋哲; 大堀 耕太郎; 神山 直之; 吉良 知文

  
• 特許第6789554号, 特開2018-133053, 特願2017-28361, マッチングプログラム、マッチング方法およびマッチング装置

  岩下 洋哲; 大堀 耕太郎; 吉良 知文; 神山 直之

  
• 特許第6775789号, 特開2018-133056, 特願2017-28404, マッチングプログラム、マッチング方法およびマッチング装置

  岩下 洋哲; 大堀 耕太郎; 神山 直之; 吉良 知文

  
• 特許第6716076号, 特開2018-32173, 特願2016-163096, 探索プログラム、探索方法および探索装置

  中尾 悠里; 大堀 耕太郎; 吉田 宏章; 大輪 拓也; 吉良 知文; 神山 直之

  
• 特許第6715534号, 特開2017-191504, 特願2016-81319, 運行計画プログラム、運行計画方法、運行計画装置および運行計画システム

  穴井 宏和; 大堀 耕太郎; 岩根 秀直; 神山 直之; 吉良 知文

  

Awards

• Aug. 2021

  第19回情報科学技術フォーラムFIT船井ベストペーパー賞

  岡本 吉央, 伊藤 健洋, 垣村 尚徳, 神山 直之, 小林 佑輔
• Mar. 2021

  日本オペレーションズ・リサーチ学会フェロー
• Jun. 2019

  2018年度人工知能学会研究会優秀賞

  山田 広明, 神山 直之, 岩下 洋哲, 大輪 拓也, 大堀 耕太郎
• Sep. 2019

  第8回藤原洋数理科学賞奨励賞
• Jun. 2019

  2018年度人工知能学会現場イノベーション賞「金賞」

  大堀 耕太郎, 岩下 洋哲, 吉田 宏章, 穴井 宏和, 吉良 知文, 神山 直之, 福本 康秀
• Apr. 2019

  平成31年度科学技術分野の文部科学大臣表彰若手科学者賞
• Mar. 2010

  日本オペレーションズ・リサーチ学会第38回文献賞
• Mar. 2009

  情報処理学会平成20年度山下記念研究賞

External funds: Kakenhi

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

  Grant-in-Aid for Scientific Research (C)

  Basic Section 60010:Theory of informatics-related

  Kyushu University

  神山 直之

  From 01 Apr. 2024, To 31 Mar. 2028, Granted

  アルゴリズム;離散最適化;ネットワークフロー

  https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-24K14825/
• A Study on Kernelization Algorithms for the Vertex Cover Problem and its Generalizations

  Grant-in-Aid for Scientific Research (C)

  Basic Section 60010:Theory of informatics-related

  Kyushu University

  Naoyuki Kamiyama

  From 01 Apr. 2020, To 31 Mar. 2023, Project Closed

  頂点被覆問題;カーネル化

  https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-20K11680/
• Development of Combinatorial Reconfiguration by Mathematics Approach: From Examples to New Methods

  Grant-in-Aid for Transformative Research Areas (B)

  Transformative Research Areas, Section (IV)

  The University of Electro-Communications

  Yoshio OKAMOTO

  From 02 Oct. 2020, To 31 Mar. 2023, Project Closed

  組合せ遷移;数学;離散数学;アルゴリズム;計算複雑性

  https://kaken.nii.ac.jp/grant/KAKENHI-PLANNED-20H05795/
• A Study on Discrete Structures of Advanced Stable Matching Problems

  Grant-in-Aid for Young Scientists (B)

  Kyushu University

  Naoyuki KAMIYAMA

  From 01 Apr. 2013, To 31 Mar. 2015, Project Closed

  安定マッチング;マトロイド;アルゴリズム;安定マッチング問題;離散最適化;離散アルゴリズム

  https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-25730006/
• Establishing the foundation of discrete mathematics in the field of architecture and urban planning and its application to large-scale optimization

  Grant-in-Aid for Scientific Research (A)

  Kwansei Gakuin University;Kyoto University

  Naoki Katoh

  From 01 Apr. 2013, To 31 Mar. 2017, Project Closed

  最速フロー;組合せ剛性理論;大域剛性;避難計画;ブレース追加問題;普遍的最速フロー;冗長剛性;最速フロー問題;多面体平坦折り畳み;動的フロー;避難所配置問題;帰宅シミュレーション;最速避難計画;最適避難所配置;動的ネットワークフロー;最速避難計画問題;トラス・トポロジー最適化;3次元一般剛性

  https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-25240004/
• Deepening analysis methods for limits of computation through integration with optimization techniques

  Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)

  Science and Engineering

  Kwansei Gakuin University;Kyoto University

  Naoki Katoh

  From 28 Jun. 2012, To 31 Mar. 2017, Project Closed

  最適化理論;拡張定式化;疎性マトロイド;マトロイド・パリティ問題;計算限界分析;#P困難;体積計算;トークン遷移問題;秘密分散方式;優モジュラー彩色;マトロイド共通独立集合;厳密計算;劣モジュラー最適化;乱択アルゴリズム;k劣サブモジュラー関数;固定パラメータアルゴリズム;計算量上下界;指数時間厳密アルゴリズム;乱択計算;計算下界;計算上界;劣モジュラー関数

  https://kaken.nii.ac.jp/grant/KAKENHI-PLANNED-24106005/
• New Developments in Arborescence Packing Problems

  Grant-in-Aid for Young Scientists (B)

  Kyushu University;Chuo University

  Naoyuki KAMIYAMA

  From 01 Apr. 2010, To 31 Mar. 2012, Project Closed

  有向グラフ;有向木;グラフ詰め込み;配置問題

  https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-22700016/
• Computational Geometry and Discrete Optimization in Architecture and Urban Planning

  Grant-in-Aid for Scientific Research (B)

  Kyoto University

  Naoki KATOH

  From 01 Apr. 2009, To 31 Mar. 2013, Project Closed

  アルゴリズム;組合せ剛性理論;最速フロー;最速避難計画;パネルヒンジフレームワーク;分子剛性予想;Lamanの定理;組合せ剛性;避難計画問題;普遍的最速フロー;計算幾何学;剛性理論;避難計画;時間拡大ネットワーク;動的ネットワーク

  https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-21300003/

External funds: others

• 数理的システムデザインに潜む離散構造の研究とその応用

  科学技術振興機構, さきがけ「新しい社会システムデザインに向けた情報基盤技術の創出」領域

  From Oct. 2017, To Mar. 2021
• 都市・社会システム最適化のための離散的数学理論の深化

  科学技術振興機構, さきがけ「社会的課題の解決に向けた数学と諸分野の協働」領域

  From Oct. 2014, To Mar. 2018

Education

Teaching subject(s)

• From 01 Apr. 2026, To 31 Mar. 2027

  Optimization

  9079, Fall, Faculty of Engineering, 2
• From 01 Apr. 2026, To 31 Mar. 2027

  Graph Theory

  9030, Spring, Faculty of Engineering, 2
• From 01 Apr. 2026, To 31 Mar. 2027

  Optimization

  3150, Fall, Graduate School of Management, 2
• From 01 Apr. 2026, To 31 Mar. 2027

  Seminar in Discrete Mathematics

  3452, Fall, Graduate School of Informatics, 2
• From 01 Apr. 2026, To 31 Mar. 2027

  Discrete Mathematics, Advanced

  3413, Fall, Graduate School of Informatics, 2

Administration

Faculty management (title, position)

• From 01 Apr. 2026, To 31 Mar. 2027

  連携推進WG 委員
• From 01 Apr. 2026, To 31 Mar. 2027

  評価・広報委員会 委員

Academic, Social Contribution

Committee Memberships

• From 2023, To Present

  Subject Editor, International Journal of Mathematics for Industry