| 2025 | IJCAI | An Inverse Optimization Approach to Contextual Inverse Optimization. | Yasunari Hikima, Naoyuki Kamiyama |
| 2025 | ISAAC | Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2025 | ISAAC | Reforming an Unfair Allocation by Exchanging Goods. | Sheung Man Yuen, Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong |
| 2025 | WSC | A Topological Data Analysis Approach to Detecting Congestion in Pedestrian Crowds. | Naoyuki Kamiyama, Hiroaki Yamada, Takashi Kato, Shizuo Kaji, Tetsuro Takahashi |
| 2024 | AAAI | Reachability of Fair Allocations via Sequential Exchanges. | Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong, Sheung Man Yuen |
| 2023 | COCOA | On Connectedness of Solutions to Integer Linear Systems. | Takasugu Shigenobu, Naoyuki Kamiyama |
| 2023 | ICALP | Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto |
| 2023 | WADS | Reconfiguration of Time-Respecting Arborescences. | Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki |
| 2023 | WADS | Algorithmic Theory of Qubit Routing. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2022 | AAAI | Reforming an Envy-Free Matching. | Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki |
| 2022 | PRIMA | On Reachable Assignments Under Dichotomous Preferences. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki |
| 2022 | SODA | 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 |
| 2021 | MABS | MAS Network: Surrogate Neural Network for Multi-agent Simulation. | Hiroaki Yamada, Masataka Shirahashi, Naoyuki Kamiyama, Yumeka Nakajima |
| 2021 | SSS | Distributed Reconfiguration of Spanning Trees. | Yukiko Yamauchi, Naoyuki Kamiyama, Yota Otachi |
| 2020 | PRIMA | Optimal Control of Pedestrian Flows by Congestion Forecasts Satisfying User Equilibrium Conditions. | Hiroaki Yamada, Naoyuki Kamiyama |
| 2019 | ESA | Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2018 | ISAAC | On the Complexity of Stable Fractional Hypergraph Matching. | Takashi Ishizuka, Naoyuki Kamiyama |
| 2018 | MFCS | The b-Branching Problem in Digraphs. | Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa |
| 2017 | COCOON | Reconfiguration of Maximum-Weight b-Matchings in a Graph. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2017 | WAOA | Submodular Function Minimization with Submodular Set Covering Constraints and Precedence Constraints. | Naoyuki Kamiyama |
| 2016 | COCOA | The Mixed Evacuation Problem. | Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa |
| 2016 | SODA | Exact and Approximation Algorithms for Weighted Matroid Intersection. | Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama |
| 2015 | SAGT | Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints. | Naoyuki Kamiyama |
| 2014 | COCOA | The Popular Matching and Condensation Problems Under Matroid Constraints. | Naoyuki Kamiyama |
| 2014 | ISAAC | Minimum-Cost b -Edge Dominating Sets on Trees. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2013 | COCOA | An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs. | Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Yuki Kobayashi |
| 2012 | SODA | A matroid approach to stable matchings with lower quotas. | Tams Fleiner, Naoyuki Kamiyama |
| 2011 | COCOON | On Totally Unimodularity of Edge-Edge Adjacency Matrices. | Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai |
| 2011 | ISAAC | Robustness of Minimum Cost Arborescences. | Naoyuki Kamiyama |
| 2011 | TAMC | Submodular Function Minimization under a Submodular Set Covering Constraint. | Naoyuki Kamiyama |
| 2010 | MFCS | The Prize-Collecting Edge Dominating Set Problem in Trees. | Naoyuki Kamiyama |
| 2009 | ISAAC | 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 |
| 2008 | COCOON | Covering Directed Graphs by In-Trees. | Naoyuki Kamiyama, Naoki Katoh |
| 2008 | SODA | Arc-disjoint in-trees in directed graphs. | Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa |
| 2007 | AAIM | An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths. | Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa |
| 2006 | AAIM | An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity. | Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa |