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

2010.3  

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

2009.3  

Reachability of Fair Allocations via Sequential Exchanges Reviewed

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

Algorithmica   86   3653 - 3683   2024.12

Envy-free Relaxations for Goods, Chores, and Mixed Items Reviewed

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   1002   114596   2024.6   （ ISSN:0304-3975 ）

A Note on Robust Subsets of Transversal Matroids Reviewed

Naoyuki Kamiyama

Journal of the Operations Research Society of Japan   67 ( 2 )   37 - 45   2024.4   （ ISSN:0453-4514 eISSN:2188-8299 ）

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

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

Proceedings of the AAAI Conference on Artificial Intelligence   9773 - 9780   2024.3   （ ISSN:2159-5399 eISSN:2374-3468 ）

On Connectedness of Solutions to Integer Linear Systems Reviewed

Takasugu Shigenobu, Naoyuki Kamiyama

Combinatorial Optimization and Applications   LNCS 14461   421 - 433   2023.12   （ ISSN:0302-9743 ISBN:9783031496103, 9783031496110 eISSN:1611-3349 ）

On Reachable Assignments under Dichotomous Preferences Reviewed

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

Theoretical Computer Science   979   114196   2023.11   （ ISSN:0304-3975 ISBN:9783031212024, 9783031212031 eISSN:1611-3349 ）

On Optimization Problems in Acyclic Hypergraphs Reviewed

Naoyuki Kamiyama

Information Processing Letters   182   106390   2023.8   （ ISSN:0020-0190 ）

Reconfiguration of Time-Respecting Arborescences Reviewed

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)   LNCS 14079   521 - 532   2023.7

Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. Reviewed

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)   LIPIcs 261   82:1 - 82:17   2023.7

[preliminary version] Algorithmic Theory of Qubit Routing Reviewed

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

Proceedings of the 18th Algorithms and Data Structures Symposium (WADS)   LNCS 14079   533 - 546   2023.7

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

Masataka Shirahashi, Naoyuki Kamiyama

Journal of the Operations Research Society of Japan   66 ( 2 )   112 - 129   2023.4

Pareto Efficient Matchings with Pairwise Preferences Reviewed

Naoyuki Kamiyama

Theoretical Computer Science   948   113707   2023.2   （ ISSN:0304-3975 ）

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

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

ACM Transactions on Algorithms   19 ( 1 )   1 - 22   2023.1   （ ISSN:1549-6325 eISSN:1549-6333 ）

[preliminary version] On Reachable Assignments Under Dichotomous Preferences Reviewed

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)   LNCS 13753   650 - 658   2022.11   （ ISSN:0302-9743 ISBN:9783031212024, 9783031212031 eISSN:1611-3349 ）

Shortest Reconfiguration of Perfect Matchings via Alternating Cycles Reviewed

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

SIAM Journal on Discrete Mathematics   36 ( 2 )   1102 - 1123   2022.6   （ ISSN:0895-4801 eISSN:1095-7146 ）

A Matroid Generalization of the Super-Stable Matching Problem Reviewed

Naoyuki Kamiyama

SIAM Journal on Discrete Mathematics   36 ( 2 )   1467 - 1482   2022.6   （ ISSN:0895-4801 eISSN:1095-7146 ）

[preliminary version] Reforming an Envy-Free Matching Reviewed

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)   5084 - 5091   2022.6   （ ISSN:2159-5399 eISSN:2374-3468 ）

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

Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

Discrete Optimization   44   100631 - 100631   2022.5   （ ISSN:1572-5286 ）

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

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

Operations Research Letters   50 ( 3 )   370 - 375   2022.5   （ ISSN:0167-6377 ）

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

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)   1342 - 1355   2022.1

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

Hiroaki Yamada, Masataka Shirahashi, Naoyuki Kamiyama, Yumeka Nakajima

Proceedings of the 22nd International Workshop on Multi-Agent-Based Simulation (MABS)   LNCS 13128   113 - 124   2022.1   （ ISSN:0302-9743 ISBN:9783030945473, 9783030945480 eISSN:1611-3349 ）

The Envy-Free Matching Problem with Pairwise Preferences Reviewed

Naoyuki Kamiyama

Information Processing Letters   172   106158   2021.12

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

Naoyuki Kamiyama

Operations Research Letters   49 ( 5 )   790 - 794   2021.9

On the Complexity of Fair House Allocation Reviewed

Naoyuki Kamiyama, Pasin Manurangsi, Warut Suksompong

Operations Research Letters   49 ( 4 )   572 - 577   2021.7

Algorithms for Gerrymandering over Graphs Reviewed

Ito Takehiro, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

Theoretical Computer Science   868 ( 8 )   30 - 45   2021.5

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

Hiroaki Yamada, Naoyuki Kamiyama

Proceedings of the 23rd International Conference on Principles and Practice of Multi-Agent Systems (PRIMA)   LNCS 12568   299 - 314   2021.2

The b-Branching Problem in Digraphs Reviewed

Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa

Discrete Applied Mathematics   283   565 - 576   2020.9

The Distance-Constrained Matroid Median Problem Reviewed

Naoyuki Kamiyama

Algorithmica   82 ( 7 )   2087 - 2106   2020.7

On Stable Matchings with Pairwise Preferences and Matroid Constraints Reviewed

Naoyuki Kamiyama

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS)   584 - 592   2020.5

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

Naoyuki Kamiyama

Theoretical Computer Science   809   265 - 276   2020.2

Lexicographically Optimal Earliest Arrival Flows Reviewed

Naoyuki Kamiyama

Networks   75 ( 1 )   18 - 33   2020.1

Discrete Newton Methods for the Evacuation Problem Reviewed

Naoyuki Kamiyama

Theoretical Computer Science   795   510 - 519   2019.11

On Dynamic Patrolling Security Games Reviewed

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

Journal of the Operations Research Society of Japan   62 ( 4 )   152 - 168   2019.10

Exact and Approximation Algorithms for Weighted Matroid Intersection Reviewed

Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama

Mathematical Programming   177 ( 1-2 )   85 - 112   2019.9

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

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

Proceedings of the 27th Annual European Symposium on Algorithms (ESA)   LIPIcs 144   61:1 - 61:15   2019.9

A Note on Balanced Flows in Equality Networks Reviewed

Naoyuki Kamiyama

Information Processing Letters   145   74 - 76   2019.5

[preliminary version] Algorithms for Gerrymandering over Graphs Reviewed

Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS)   1413 - 1421   2019.5

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

Naoyuki Kamiyama

Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS)   583 - 591   2019.5

An Improved Algorithm for Testing Substitutability of Weak Preferences Reviewed

Susumu Kawanaka, Naoyuki Kamiyama

Mathematical Social Sciences   99   1 - 4   2019.5

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

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

Journal of Combinatorial Optimization   37 ( 2 )   454 - 464   2019.2

Minimum-Cost b-Edge Dominating Sets on Trees Reviewed

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

Algorithmica   81 ( 1 )   343 - 366   2019.1

Pareto Stable Matchings under One-Sided Matroid Constraints Reviewed

Naoyuki Kamiyama

SIAM Journal on Discrete Mathematics   33 ( 3 )   1431 - 1451   2019.1

On the Complexity of Stable Fractional Hypergraph Matching Reviewed

Takashi Ishizuka, Naoyuki Kamiyama

Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC)   LIPIcs 123   11:1 - 11:12   2018.12

The Mixed Evacuation Problem Reviewed

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

Journal of Combinatorial Optimization   36 ( 4 )   1299 - 1314   2018.11

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

Naoyuki Kamiyama

Algorithmica   80 ( 10 )   2957 - 2971   2018.10

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

Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS)   LIPIcs 117   12:1 - 12:15   2018.8

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

Naoyuki Kamiyama

Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)   LNCS 10787   90 - 101   2018.4

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

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)   LNCS 10739   41 - 55   2018.1

A Characterization of Weighted Popular Matchings under Matroid Constraints Reviewed

Naoyuki Kamiyama

Journal of the Operations Research Society of Japan   61 ( 1 )   2 - 17   2018.1

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

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

Proceedings of the 9th International Conference on Social Informatics (SocInfo)   LNCS 10540   419 - 430   2017.9

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

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

Prceedings of the 23rd Annual International Computing and Combinatorics Conference (COCOON)   LNCS 10392   287 - 296   2017.7

Efficient Stabilization of Cooperative Matching Games Reviewed

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

Theoretical Computer Science   677   69 - 82   2017.5

Strategic Issues in College Admissions with Score-Limits Reviewed

Naoyuki Kamiyama

Operations Research Letters   45 ( 2 )   105 - 108   2017.3

Popular Matchings with Ties and Matroid Constraints Reviewed

Naoyuki Kamiyama

SIAM Journal on Discrete Mathematics   31 ( 3 )   1801 - 1819   2017.1

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

Naoyuki Kamiyama

Theoretical Computer Science   659   95 - 97   2017.1

The Popular Matching and Condensation Problems under Matroid Constraints Reviewed

Naoyuki Kamiyama

Journal of Combinatorial Optimization   32 ( 4 )   1305 - 1326   2016.11

[preliminary version] The Mixed Evacuation Problem Reviewed

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

Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)   LNCS 10043   18 - 32   2016.10

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

Keita Nakamura, Naoyuki Kamiyama

Journal of the Operations Research Society of Japan   59 ( 3 )   225 - 240   2016.7

Extended Formulations for Sparsity Matroids Reviewed

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

Mathematical Programming   158 ( 1-2 )   565 - 574   2016.7

A Matroid Approach to Stable Matchings with Lower Quotas Reviewed

Tamás Fleiner, Naoyuki Kamiyama

Mathematics of Operations Research   41 ( 2 )   734 - 744   2016.5

[preliminary version] Efficient Stabilization of Cooperative Matching Games Reviewed

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)   41 - 49   2016.5

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

Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama

Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)   430 - 444   2016.1

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

Naoyuki Kamiyama

Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT)   LNCS 9347   3 - 14   2015.9

On Packing Arborescences in Temporal Networks Reviewed

Naoyuki Kamiyama, Yasushi Kawase

Information Processing Letters   115 ( 2 )   321 - 325   2015.2

The Nucleolus of Arborescence Games in Directed Acyclic Graphs Reviewed

Naoyuki Kamiyama

Operations Research Letters   43 ( 1 )   89 - 92   2015.1

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

Naoyuki Kamiyama, Naoki Katoh

Discrete Applied Mathematics   178   89 - 100   2014.12

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

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

Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC)   LNCS 8889   195 - 207   2014.11

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

Naoyuki Kamiyama

Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)   LNCS 8881   713 - 728   2014.11

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

Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Naoyuki Kamiyama

Theoretical Computer Science   556   2 - 12   2014.10

A New Approach to the Pareto Stable Matching Problem Reviewed

Naoyuki Kamiyama

Mathematics of Operations Research   39 ( 3 )   851 - 862   2014.8

Arborescence Problems in Directed Graphs: Theorems and Algorithms Reviewed

Naoyuki Kamiyama

Interdisciplinary Information Sciences   20 ( 1 )   51 - 70   2014.3

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

Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Yuki Kobayashi

Proceedings of the 7th Annual International Conference on Combinatorial Optimization and Applications (COCOA)   LNCS 8287   165 - 177   2013.11

On Total Unimodularity of Edge–Edge Adjacency Matrices Reviewed

Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai

Algorithmica   67 ( 2 )   277 - 292   2013.10

A Note on the Serial Dictatorship with Project Closures Reviewed

Naoyuki Kamiyama

Operations Research Letters   41 ( 5 )   559 - 561   2013.9

Matroid Intersection with Priority Constraints Reviewed

Naoyuki Kamiyama

Journal of the Operations Research Society of Japan   56 ( 1 )   15 - 25   2013.3

Independent Arborescences in Directed Graphs Reviewed

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

Discrete Mathematics   313 ( 4 )   453 - 459   2013.2

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

Naoyuki Kamiyama

Journal of Math-for-Industry   4-B   119 - 122   2012.10

Robustness of Minimum Cost Arborescences Reviewed

Naoyuki Kamiyama

Japan Journal of Industrial and Applied Mathematics   29 ( 3 )   485 - 497   2012.10

The Root Location Problem for Arc-Disjoint Arborescences Reviewed

Satoru Fujishige, Naoyuki Kamiyama

Discrete Applied Mathematics   160 ( 13-14 )   1964 - 1970   2012.9

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

Tamás Fleiner, Naoyuki Kamiyama

Proceedings of the 23rd Annual ACM/SIAM Symposium on Discrete Algorithms (SODA)   135 - 142   2012.1

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

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

Journal of the Operations Research Society of Japan   54 ( 4 )   259 - 280   2011.12

[preliminary version] Robustness of Minimum Cost Arborescences Reviewed

Naoyuki Kamiyama

Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC)   LNCS 7074   130 - 139   2011.11

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

Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai

Proceedings of the 17th Annual International Computing and Combinatorics Conference (COCOON) Computer Science   LNCS 6842   354 - 365   2011.7

Submodular Function Minimization under a Submodular Set Covering Constraint Reviewed

Naoyuki Kamiyama

Proceedings of the 8th Annual Conference on Theory and Applications of Models of Computation (TAMC)   LNCS 6648   133 - 141   2011.5

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

Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai

Information Processing Letters   111 ( 10 )   465 - 468   2011.4

Improved Approximation Algorithms for Firefighter Problem on Trees Reviewed

Yutaka Iwaikawa, Naoyuki Kamiyama, Tomomi Matsui

IEICE Transactions on Information and Systems   E94-D ( 2 )   196 - 199   2011.2

Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking Reviewed

Naoyuki Kamiyama, Tomomi Matsui

Proceedings of the 17th Computing: the Australasian Theory Symposium (CATS)   CRPIT 119   137 - 144   2011.1

Covering Directed Graphs by In-Trees Reviewed

Naoyuki Kamiyama, Naoki Katoh

Journal of Combinatorial Optimization   21 ( 1 )   2 - 18   2011.1

The Prize-Collecting Edge Dominating Set Problem in Trees Reviewed

Naoyuki Kamiyama

Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS)   LNCS 6281   465 - 476   2010.8

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

Naoyuki Kamiyama, Naoki Katoh

Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC)   LNCS 5878   802 - 811   2009.11

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

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

Information Processing Letters   109 ( 23-24 )   1227 - 1231   2009.11

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

Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa

Discrete Applied Mathematics   157 ( 17 )   3665 - 3677   2009.10

Arc-Disjoint In-Trees in Directed Graphs Reviewed

Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa

Combinatorica   29 ( 2 )   197 - 214   2009.3

Computational Complexities of University Interview Timetabling Reviewed

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

IEICE Transactions on Information and Systems   E92-D ( 2 )   130 - 140   2009.2

The Minimum Weight In-Tree Cover Problem Reviewed

Naoyuki Kamiyama, Naoki Katoh

Proceedings of the 2nd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO)   CCIS 14   155 - 164   2008.8

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

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

Journal of Computational Science and Technology   2 ( 3 )   362 - 370   2008.7

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

Naoyuki Kamiyama, Naoki Katoh

Proceedings of the14th Annual International Computing and Combinatorics Conference (COCOON)   LNCS 5092   444 - 457   2008.6

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

Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa

Proceedings of the 19th Annual ACM/SIAM Symposium on Discrete Algorithms (SODA)   518 - 526   2008.1

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

Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa

Proceedings of the 3rd International Conference on Algorithmic Aspect in Information and Management (AAIM)   LNCS 4508   178 - 190   2007.5

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

Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa

IEICE Transactions on Information and Systems   E89-D ( 8 )   2372 - 2379   2006.8

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

Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa

Proceedings of the 2nd International Conference on Algorithmic Aspect in Information and Management (AAIM)   LNCS 4041   231 - 242   2006.6

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

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

日本建築学会環境系論文集   601   65 - 72   2006.3

Optimal Class Assignment Problem: A Case Study at Gunma University

Akifumi Kira, Kiyohito Nagano, Manabu Sugiyama, Naoyuki Kamiyama

5th ZIB-RIKEN-IMI-ISM MODAL Workshop on Optimization, Data Analysis and HPC in AI  2021.9 

Reconfiguration of Envy-Free Item Allocations

Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto

Workshop on Combinatorial Reconfiguration, affiliated with ICALP  2021.7 

Reformist Envy-Free Item Allocations: Algorithms and Complexity International conference

Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, and Yoshio Okamoto

情報処理学会アルゴリズム研究会  2021.5 

サイクルを含む選好を持つポピュラーマッチング問題

神山直之

日本オペレーションズ・リサーチ学会研究部会 超スマート社会のシステムデザインのための理論と応用  2020.11 

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

Naoyuki Kamiyama

18th International Conference on Autonomous Agents and Multiagent Systems  2019.5 

On Stable Matchings with Pairwise Preferences and Matroid Constraints International conference

Naoyuki Kamiyama

19th International Conference on Autonomous Agents and Multiagent Systems  2020.5 

Matching problems under preferences with ties and matroid constraints

Naoyuki Kamiyama

International Workshop on Combinatorial Optimization and Algorithmic Game Theory  2020.1 

片側のみが選好順序を持つ多対一無羨望マッチング問題

神山直之

日本オペレーションズ・リサーチ学会研究部会 最適化とその応用  2019.12 

A Note on Testing Substitutability of Weak Preferences International conference

Susumu Kawanaka and Naoyuki Kamiyama

11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications  2019.5 

計算複雑性から眺めるマッチング問題

神山直之

CREST・さきがけ・AIMaP 合同シンポジウム「数学パワーが世界を変える 2019」  2019.3 

A New Solution Concept for Earliest Arrival Flows International conference

Naoyuki Kamiyama

3nd IMI-ISM-ZIB MODAL Workshop on Challenges in Real World Data Analytics and High-Performance Optimization  2018.9 

辞書式最適最速到達フロー問題

神山直之

情報処理学会アルゴリズム研究会  2018.9 

最速到達フロー問題とその拡張

神山直之

日本オペレーションズ・リサーチ学会研究グループ 「数理的発想とその実践」第 2 回研究集会  2018.10 

計算量理論とマッチング

神山直之

第61回自動制御連合講演会  2018.11 

避難計画問題に対する実用的なアルゴリズム

神山 直之

九州大学マス・フォア・インダストリ研究所 共同利用研究 公開ワークショップ 「最大フロー求解アルゴリズムの効率的実装と，その大規模データを用いた避難計画策定への応用」  2016.9 

Matroid Generalizations of the Popular Matching and Condensation Problems with Strict Preferences International conference

Naoyuki Kamiyama

3rd International Workshop on Matching Under Preferences  2015.4 

歩車混合避難計画問題

神山 直之

九州大学マス・フォア・インダストリ研究所 共同利用研究 公開ワークショップ「大規模データに対する 最大フロー求解アルゴリズムの実装技術の構築」  2015.6 

計算限界解析と数理計画法

神山 直之

第20回情報・統計科学シンポジウム  2015.12 

パラメトリック劣モジュラ関数最小化に基づく避難計画アルゴリズム

神山 直之

日本オペレーションズ・リサーチ学会秋季研究発表会  2016.9 

優先度制約付きマトロイド交差問題

神山　直之

冬のLAシンポジウム  2012.2 

割当問題の数理モデル

神山 直之

平成23年度数学・数理科学と諸科学・産業との連携研究ワークショップ「数理モデルの産業・諸科学への応用」  2011.11 

安定マッチングモデルに対するアルゴリズムの最近の進展

神山 直之

平成23年度数学・数理科学と諸科学・産業との連携研究ワークショップ「最適化理論の産業・諸科学への応用」  2011.10 

最小費用有向木のロバスト性に関する研究

神山　直之

日本応用数理学会2011年度年会  2011.9 

Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking International conference

Naoyuki Kamiyama, Tomomi Matsui

17th Computing: the Australasian Theory Symposium  2011.1 

有向木詰め込み問題の歴史と最先端 Invited

神山 直之

日本オペレーションズ・リサーチ学会  2010.9 

Submodular Function Minimization under a Submodular Set Covering Constraint International conference

Naoyuki Kamiyama

8th Annual Conference on Theory and Applications of Models of Computation  2011.5 

Robustness of Minimum Cost Arborescences International conference

Naoyuki Kamiyama

22nd International Symposium on Algorithms and Computation  2011.12 

A Matroid Approach to Stable Matchings with Lower Quotas International conference

Naoyuki Kamiyama, Tamas Fleiner

23rd Annual ACM/SIAM Symposium on Discrete Algorithms  2012.1 

最速輸送問題

神山 直之

京都大学数理解析研究所研究集会共同研究「組合せ最適化セミナー」  2012.7 

離散最適化～ネットワークフローを中心に～

神山 直之

IMIチュートリアル「数学モデリングの基礎と展開」  2013.2 

パレート安定マッチング問題に対する新算法

神山 直之

日本オペレーションズ・リサーチ学会春季研究発表会  2013.3 

Matroid Intersection with Priority Constraints International conference

Naoyuki Kamiyama

21st International Symposium on Mathematical Programming  2012.8 

Pareto Stability in a Two-sided Matching Market with Indifferences International conference

Naoyuki Kamiyama

Forum Math-for-Industry 2012  2012.10 

最適化手法と計算限界解析:双対性と整数性

神山 直之

ELC 計算量理論の秋学校  2013.9 

プロジェクト閉鎖付き順次独裁メカニズムの拡張に関する研究

神山 直之

電子情報通信学会コンピュテーション研究会  2013.12 

劣モジュラ罰則付き耐故障性施設配置問題

神山 直之

冬の LA シンポジウム  2014.1 

有向非巡回グラフにおける有向木ゲームの仁の計算

神山 直之

日本オペレーションズ・リサーチ学会「OR 横断若手の会」研究部会  2014.2 

安定マッチング問題に対するマトロイド的手法

神山 直之

ゲーム理論ワークショップ  2014.3 

A New Approach to the Pareto Stable Matching Problem International conference

Naoyuki Kamiyama

8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications  2013.6 

Packing Arborescences in Acyclic Temporal Networks International conference

Naoyuki Kamiyama

3rd International Symposium on Combinatorial Optimization  2014.3 

マトロイド制約付き最適選好マッチング問題

神山 直之

日本オペレーションズリサーチ学会「最適化の理論と応用」研究部会  2014.4 

時刻ラベル付き非巡回ネットワーク上の有向木詰込み問題

神山 直之

日本オペレーションズ・リサーチ学会秋季研究発表会  2014.8 

劣モジュラ被覆制約付き劣モジュラ関数最小化問題

神山 直之

数学・数理科学と諸科学・産業との協働によるイノベーション創出のための研究促進プログラム「自然言語処理と最適化」  2014.10 

より良い都市・社会システム構築のための最適化理論

神山 直之

九州大学テクノロジーフォーラム 2014  2014.12 

マッチング問題と離散最適化

神山 直之

情報処理学会全国大会  2014.3 

Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints International conference

Naoyuki Kamiyama

8th International Symposium on Algorithmic Game Theory  2015.9 

The Mixed Evacuation Problem International conference

Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, and Atsushi Takizawa

10th Annual International Conference on Combinatorial Optimization and Applications  2016.12 

よりよい社会システム構築のための基盤技術としての離散最適化

神山 直之

日本応用数理学会ものづくり企業に役立つ応用数理手法の研究会  2017.2 

被覆型不等式制約を持つ劣モジュラ関数最小化問題に対する主双対近似アルゴリズム

神山 直之

日本オペレーションズ・リサーチ学会春季研究発表会  2017.3 

Practical Algorithms and Models for Evacuation Problems International conference

Naoyuki Kamiyama

10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications  2017.5 

Submodular Function Minimization with Submodular Set Covering Constraints and Precedence Constraints International conference

Naoyuki Kamiyama

15th Workshop on Approximation and Online Algorithm  2017.9 

Mathematical Models for Evacuation Problems based on Dynamic Network Flows International conference

Naoyuki Kamiyama

2nd ISM-ZIB-IMI MODAL Workshop on Mathematical Optimization and Data Analysis  2017.9 

数学で社会の「しくみ」を作る

神山 直之

数学・数理科学4研究拠点合同市民講演会  2017.11 

社会システムデザインにおける離散最適化の活用

神山 直之

数学と諸分野の連携を通した知の創造  2017.12 

離散最適化と都市計画・ゲーム理論

神山 直之

金沢数理データサイエンス研究会  2017.12 

線形計画法入門

神山 直之

AIMaP チュートリアル「最適化理論の基礎と応用」  2018.1 

離散最適化とその社会的課題への応用

神山 直之

AIMaP ワークショップ「非ノイマン型計算、理論と応用」  2018.3 

実行委員

日本オペレーションズ・リサーチ学会2021年秋季発表会  （ Japan ） 2023.9

Program Committee International contribution

Forum “Math-for-Industry” 2023  （ Japan ） 2023.8 - 2023.9

Program Committee International contribution

32nd International Joint Conference on Artificial Intelligence  （ Macao ） 2023.8

Program Committee International contribution

13th International Conference on Algorithms and Complexity  （ Cyprus ） 2023.6

Program Committee International contribution

37th AAAI Conference on Artificial Intelligence  （ UnitedStatesofAmerica ） 2023.2

Screening of academic papers

Role(s)： Peer review

2023

Program Committee International contribution

7th International Symposium on Combinatorial Optimization  （ online ） 2022.5

Organizing Committee International contribution

32nd International Symposium on Algorithms and Computation  （ Fukuoka + online Japan ） 2021.12

Program Committee International contribution

35th AAAI Conference on Artificial Intelligence  （ online ） 2021.2

Screening of academic papers

Role(s)： Peer review

2021

Program Committee International contribution

31st International Symposium on Algorithms and Computation  （ online ） 2020.12

Program committee International contribution

14th International Frontiers of Algorithmics Workshop  （ online ） 2020.5

Program committee International contribution

6th International Symposium on Combinatorial Optimization  （ online ） 2020.5

Program committee International contribution

34th AAAI Conference on Artificial Intelligence  （ UnitedStatesofAmerica ） 2020.2

Screening of academic papers

Role(s)： Peer review

2020

Program committee International contribution

11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications  （ Japan ） 2019.5

Program Committee International contribution

5th International Workshop on Matching Under Preferences  （ Switzerland ） 2019.5

Screening of academic papers

Role(s)： Peer review

2019

Program Committee International contribution

5th International Symposium on Combinatorial Optimization  （ Japan ） 2018.4

Screening of academic papers

Role(s)： Peer review

2018

Program Committee International contribution

28th International Symposium on Algorithms and Computation  （ Japan ） 2017.12

Screening of academic papers

Role(s)： Peer review

2017

Program Committee International contribution

4th International Symposium on Combinatorial Optimization  （ Japan ） 2016.5

Screening of academic papers

Role(s)： Peer review

2016

運営責任者

平成27年度数学・数理科学と諸科学・産業との協働によるイノベーション創出のための研究促進プログラム「食と流通のしくみをデザインする数理技術と現場介入」  （ Japan ） 2015.12

実行委員長

日本オペレーションズ・リサーチ学会九州支部支部事業「九州地区における若手OR研究交流会  （ Japan ） 2015.10 - 2015.11

Program Committee International contribution

Forum “Math-for-Industry” 2015  （ Japan ） 2015.10

実行委員

日本オペレーションズ・リサーチ学会2015年秋季発表会  （ Japan ） 2015.9 - 2016.9

Program Committee International contribution

9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications  （ Japan ） 2015.6 - 2018.6

運営責任者

平成26年度数学・数理科学と諸科学・産業との協働によるイノベーション創出のための研究促進プログラム「社会システムデザインのための数理と社会実装へのアプローチ」  （ Japan ） 2015.2

実行委員

日本オペレーションズ・リサーチ学会九州支部支部事業「九州地区における若手OR 研究交流会」  （ Japan ） 2014.10

運営責任者

平成26年度数学・数理科学と諸科学・産業との協働によるイノベーション創出のための研究促進プログラム「自然言語処理と最適化」  （ Japan ） 2014.10

運営責任者

平成25年度文部科学省 数学・数理科学と諸科学・産業との連携研究ワークショップ「グラフビッグ データ」  （ Japan ） 2013.12

オーガナイザー

第25回RAMPシンポジウム  （ Japan ） 2013.10

実行委員

日本オペレーションズ・リサーチ学会九州支部支部事業「九州地区における若手OR研究交流会」  （ Japan ） 2013.10

実行委員

日本応用数理学会2013年度年会  （ Japan ） 2013.9

運営責任者

平成24年度科学技術試験研究委託事業 数学・数理科学と諸科学・産業との協働によるイノベーション創出のための研究促進プログラム「拡がっていく最適化」  （ Japan ） 2013.2

会場世話人

電子情報通信学会2012年12月度コンピュテーション研究会  （ Japan ） 2012.12

運営責任者

平成24年度文部科学省数学・数理科学と諸科学・産業との連携研究ワークショップ「離散構造と最適化:展開と連携」  （ Japan ） 2012.11

実行委員

日本オペレーションズ・リサーチ学会九州支部支部事業「九州地区における若手OR研究交流会」  （ Japan ） 2012.10

会場世話人

電子情報通信学会2011年3月度コンピュテーション研究会  （ Japan ） 2011.3

建築・都市分野における離散数理基盤の構築と大規模最適化への展開

2013 - 2016

Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for Scientific Research (A)

先進的安定マッチング問題の離散構造に関する研究

2013 - 2014

Grants-in-Aid for Scientific Research  Grant-in-Aid for Young Scientists(A)or(B)

最適化技法との融合による計算限界解析法の深化

2012 - 2016

Japan Society for the Promotion of Science・Ministry of Education, Culture, Sports, Science and Technology  Grants-in-Aid for Scientific Research  Grant-in-Aid for Scientific Research on Innovative Areas

有向木詰め込み問題の新展開

2010 - 2011

Grants-in-Aid for Scientific Research  Grant-in-Aid for Young Scientists(A)or(B)

建築・都市分野における計算幾何学と離散最適化

2009 - 2012

Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for Scientific Research (B)

動線を最適化する平面計画問題に対する効率的な組合せ最適化アルゴリズムの研究

2007 - 2008

Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for JSPS Fellows

複素関数論（電情EE）

2023.4 - 2023.9   First semester

数学共創基礎Ⅲ

2023.4 - 2023.6   Spring quarter

数学的モデリング

2023.4 - 2023.6   Spring quarter

プログラミング演習(P)

2022.6 - 2022.8   Summer quarter

複素関数論（A）

2022.4 - 2022.9   First semester

複素関数論（C）

2022.4 - 2022.9   First semester

数学共創基礎Ⅲ

2022.4 - 2022.6   Spring quarter

数学的モデリング

2022.4 - 2022.6   Spring quarter

プログラミング演習

2021.6 - 2021.8   Summer quarter

数学的モデリング

2021.4 - 2021.6   Spring quarter

常微分方程式

2020.10 - 2021.3   Second semester

常微分方程式

2020.10 - 2021.3   Second semester

プログラミング演習

2020.10 - 2021.3   Second semester

機能数理学概論Ⅰ

2020.4 - 2020.9   First semester

数学的モデリング

2020.4 - 2020.9   First semester

複素関数論

2019.10 - 2020.3   Second semester

計算機数学概論

2019.10 - 2020.3   Second semester

複素関数論

2019.4 - 2019.9   First semester

数学的モデリング

2019.4 - 2019.9   First semester

計算機数学概論

2018.10 - 2019.3   Second semester

常微分方程式

2018.10 - 2019.3   Second semester

MMA講究B

2018.10 - 2019.3   Second semester

常微分方程式

2018.4 - 2018.9   First semester

複素関数論

2017.10 - 2018.3   Second semester

情報数学特論１

2017.10 - 2018.3   Second semester

複素関数論

2017.10 - 2018.3   Second semester

MMA講究A

2017.4 - 2017.9   First semester

情報数学特論I

2016.10 - 2017.3   Second semester

複素関数論

2016.10 - 2017.3   Second semester

数理学講究II

2016.4 - 2017.3   Full year

計算数理学基礎・演習

2016.4 - 2016.9   First semester

複素関数論

2016.4 - 2016.9   First semester

数学1A

2015.10 - 2016.3   Second semester

数学1A

2015.10 - 2016.3   Second semester

数理モデル概論

2015.10 - 2016.3   Second semester

数理学講究II

2015.4 - 2016.3   Full year

情報数学

2015.4 - 2015.9   First semester

数理学講究第I

2014.10 - 2015.3   Second semester

数学1A

2014.10 - 2015.3   Second semester

数学1A

2014.10 - 2015.3   Second semester

数理モデル概論

2014.10 - 2015.3   Second semester

数理学講究第II

2014.4 - 2015.3   Full year

数理学講究第II

2014.4 - 2015.3   Full year

MMA講究C

2014.4 - 2014.9   First semester

情報数学

2014.4 - 2014.9   First semester

最適化理論基礎・演習

2014.4 - 2014.9   First semester

数理学講究第I

2013.10 - 2014.3   Second semester

微分積分学・同演習B

2013.10 - 2014.3   Second semester

数学1A

2013.10 - 2014.3   Second semester

MMA講究D

2013.10 - 2014.3   Second semester

数理モデル概論

2013.10 - 2014.3   Second semester

数理学講究第II

2013.4 - 2014.3   Full year

最適化理論基礎・演習

2013.4 - 2013.9   First semester

微分積分学・同演習A

2013.4 - 2013.9   First semester

情報数学

2013.4 - 2013.9   First semester

数理学講究第I

2012.10 - 2013.3   Second semester

微分積分学・同演習B

2012.10 - 2013.3   Second semester

微分積分学・同演習B

2012.10 - 2013.3   Second semester

数理モデル概論

2012.10 - 2013.3   Second semester

線形代数

2012.4 - 2012.9   First semester

微分積分学・同演習A

2012.4 - 2012.9   First semester

微分積分学・同演習A

2012.4 - 2012.9   First semester

線形代数

2012.4 - 2012.9   First semester

2015  科学技術振興機構 さきがけ研究員 

2014  科学技術振興機構 さきがけ研究員