An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity. - Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa (AAIM, 2006)

An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity. - Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa (IEICE Trans. Inf. Syst., 2006)

An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths. - Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa (AAIM, 2007)

The Minimum Weight In-Tree Cover Problem. - Naoyuki Kamiyama; Naoki Katoh (MCO, 2008)

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 (ISAAC, 2009)

Arc-disjoint in-trees in directed graphs. - Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa (Comb., 2009)

An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths. - Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa (Discret. Appl. Math., 2009)

Computational Complexities of University Interview Timetabling. - Naoyuki Kamiyama; Yuuki Kiyonari; Eiji Miyano; Shuichi Miyazaki; Katsuhisa Yamanaka (IEICE Trans. Inf. Syst., 2009)

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 (Inf. Process. Lett., 2009)

The Prize-Collecting Edge Dominating Set Problem in Trees. - Naoyuki Kamiyama (MFCS, 2010)

A Relation between the Protocol Partition Number and the Quasi-Additive Bound - Naoyuki Kamiyama (CoRR, 2010)

Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking. - Naoyuki Kamiyama; Tomomi Matsui (CATS, 2011)

On Totally Unimodularity of Edge-Edge Adjacency Matrices. - Yusuke Matsumoto; Naoyuki Kamiyama; Keiko Imai (COCOON, 2011)

Robustness of Minimum Cost Arborescences. - Naoyuki Kamiyama (ISAAC, 2011)

Submodular Function Minimization under a Submodular Set Covering Constraint. - Naoyuki Kamiyama (TAMC, 2011)

Improved Approximation Algorithms for Firefighter Problem on Trees. - Yutaka Iwaikawa; Naoyuki Kamiyama; Tomomi Matsui (IEICE Trans. Inf. Syst., 2011)

An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem. - Yusuke Matsumoto; Naoyuki Kamiyama; Keiko Imai (Inf. Process. Lett., 2011)

Covering directed graphs by in-trees. - Naoyuki Kamiyama; Naoki Katoh (J. Comb. Optim., 2011)

The root location problem for arc-disjoint arborescences. - Satoru Fujishige; Naoyuki Kamiyama (Discret. Appl. Math., 2012)

On Total Unimodularity of Edge-Edge Adjacency Matrices. - Yusuke Matsumoto; Naoyuki Kamiyama; Keiko Imai (Algorithmica, 2013)

Independent arborescences in directed graphs. - András Frank; Satoru Fujishige; Naoyuki Kamiyama; Naoki Katoh (Discret. Math., 2013)

A note on the serial dictatorship with project closures. - Naoyuki Kamiyama (Oper. Res. Lett., 2013)

The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths. - Naoyuki Kamiyama; Naoki Katoh (Discret. Appl. Math., 2014)

A New Approach to the Pareto Stable Matching Problem. - Naoyuki Kamiyama (Math. Oper. Res., 2014)

An inductive construction of minimally rigid body-hinge simple graphs. - Yuki Kobayashi; Yuya Higashikawa; Naoki Katoh; Naoyuki Kamiyama (Theor. Comput. Sci., 2014)

Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints. - Naoyuki Kamiyama (SAGT, 2015)

On packing arborescences in temporal networks. - Naoyuki Kamiyama; Yasushi Kawase (Inf. Process. Lett., 2015)

The nucleolus of arborescence games in directed acyclic graphs. - Naoyuki Kamiyama (Oper. Res. Lett., 2015)

The popular matching and condensation problems under matroid constraints. - Naoyuki Kamiyama (J. Comb. Optim., 2016)

A Matroid Approach to Stable Matchings with Lower Quotas. - Tamás Fleiner; Naoyuki Kamiyama (Math. Oper. Res., 2016)

Extended formulations for sparsity matroids. - Satoru Iwata 001; Naoyuki Kamiyama; Naoki Katoh; Shuji Kijima; Yoshio Okamoto (Math. Program., 2016)

Tight Approximability of the Server Allocation Problem for Real-Time Applications. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto; Taichi Shiitada (ALGOCLOUD, 2017)

Modeling and Managing Airport Passenger Flow Under Uncertainty: A Case of Fukuoka Airport in Japan. - Hiroaki Yamada 001; Kotaro Ohori; Tadashige Iwao; Akifumi Kira; Naoyuki Kamiyama; Hiroaki Yoshida; Hirokazu Anai (SocInfo (2), 2017)

Submodular Function Minimization with Submodular Set Covering Constraints and Precedence Constraints. - Naoyuki Kamiyama (WAOA, 2017)

Strategic issues in college admissions with score-limits. - Naoyuki Kamiyama (Oper. Res. Lett., 2017)

Popular Matchings with Ties and Matroid Constraints. - Naoyuki Kamiyama (SIAM J. Discret. Math., 2017)

Efficient stabilization of cooperative matching games. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Theor. Comput. Sci., 2017)

A note on the submodular vertex cover problem with submodular penalties. - Naoyuki Kamiyama (Theor. Comput. Sci., 2017)

On the Complexity of Stable Fractional Hypergraph Matching. - Takashi Ishizuka; Naoyuki Kamiyama (ISAAC, 2018)

A Note on Submodular Function Minimization with Covering Type Linear Constraints. - Naoyuki Kamiyama (Algorithmica, 2018)

The mixed evacuation problem. - Yosuke Hanawa; Yuya Higashikawa; Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa (J. Comb. Optim., 2018)

Many-to-Many Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints. - Naoyuki Kamiyama (AAMAS, 2019)

Minimum-Cost b-Edge Dominating Sets on Trees. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Algorithmica, 2019)

A note on balanced flows in equality networks. - Naoyuki Kamiyama (Inf. Process. Lett., 2019)

Reconfiguration of maximum-weight b-matchings in a graph. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (J. Comb. Optim., 2019)

Exact and approximation algorithms for weighted matroid intersection. - Chien-Chung Huang 001; Naonori Kakimura; Naoyuki Kamiyama (Math. Program., 2019)

An improved algorithm for testing substitutability of weak preferences. - Susumu Kawanaka; Naoyuki Kamiyama (Math. Soc. Sci., 2019)

Pareto Stable Matchings under One-Sided Matroid Constraints. - Naoyuki Kamiyama (SIAM J. Discret. Math., 2019)

Discrete Newton methods for the evacuation problem. - Naoyuki Kamiyama (Theor. Comput. Sci., 2019)

An Information Distribution Method for Avoiding Hunting Phenomenon in Theme Parks. - Hiroaki Yamada 001; Naoyuki Kamiyama (AAMAS, 2020)

On Stable Matchings with Pairwise Preferences and Matroid Constraints. - Naoyuki Kamiyama (AAMAS, 2020)

Optimal Control of Pedestrian Flows by Congestion Forecasts Satisfying User Equilibrium Conditions. - Hiroaki Yamada 001; Naoyuki Kamiyama (PRIMA, 2020)

The Distance-Constrained Matroid Median Problem. - Naoyuki Kamiyama (Algorithmica, 2020)

The b-branching problem in digraphs. - Naonori Kakimura; Naoyuki Kamiyama; Kenjiro Takazawa (Discret. Appl. Math., 2020)

Lexicographically optimal earliest arrival flows. - Naoyuki Kamiyama (Networks, 2020)

Popular matchings with two-sided preference lists and matroid constraints. - Naoyuki Kamiyama (Theor. Comput. Sci., 2020)

MAS Network: Surrogate Neural Network for Multi-agent Simulation. - Hiroaki Yamada 001; Masataka Shirahashi; Naoyuki Kamiyama; Yumeka Nakajima (MABS, 2021)

Distributed Reconfiguration of Spanning Trees. - Yukiko Yamauchi; Naoyuki Kamiyama; Yota Otachi (SSS, 2021)

Optimal class assignment problem: a case study at Gunma University. - Akifumi Kira; Kiyohito Nagano; Manabu Sugiyama; Naoyuki Kamiyama (CoRR, 2021)

The envy-free matching problem with pairwise preferences. - Naoyuki Kamiyama (Inf. Process. Lett., 2021)

Envy-free matchings with one-sided preferences and matroid constraints. - Naoyuki Kamiyama (Oper. Res. Lett., 2021)

On the complexity of fair house allocation. - Naoyuki Kamiyama; Pasin Manurangsi; Warut Suksompong (Oper. Res. Lett., 2021)

Algorithms for gerrymandering over graphs. - Takehiro Ito; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Theor. Comput. Sci., 2021)

NP-hardness of Computing Uniform Nash Equilibria on Planar Bimatrix Game. - Takashi Ishizuka; Naoyuki Kamiyama (CoRR, 2022)

On Finding Pure Nash Equilibria of Discrete Preference Games and Network Coordination Games. - Takashi Ishizuka; Naoyuki Kamiyama (CoRR, 2022)

A Note on Robust Subsets of Transversal Matroids. - Naoyuki Kamiyama (CoRR, 2022)

Submodular reassignment problem for reallocating agents to tasks with synergy effects. - Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Discret. Optim., 2022)

A parameterized view to the robust recoverable base problem of matroids under structural uncertainty. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Oper. Res. Lett., 2022)

Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (SIAM J. Discret. Math., 2022)

A Matroid Generalization of the Super-Stable Matching Problem. - Naoyuki Kamiyama (SIAM J. Discret. Math., 2022)

On Connectedness of Solutions to Integer Linear Systems. - Takasugu Shigenobu; Naoyuki Kamiyama (COCOA (1), 2023)

Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto (ICALP, 2023)

Reconfiguration of Time-Respecting Arborescences. - Takehiro Ito; Yuni Iwamasa; Naoyuki Kamiyama; Yasuaki Kobayashi; Yusuke Kobayashi 001; Shun-ichi Maezawa; Akira Suzuki 001 (WADS, 2023)

Algorithmic Theory of Qubit Routing. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (WADS, 2023)

Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (ACM Trans. Algorithms, 2023)

Pareto efficient matchings with pairwise preferences. - Naoyuki Kamiyama (Theor. Comput. Sci., 2023)

On optimization problems in acyclic hypergraphs. - Naoyuki Kamiyama (Inf. Process. Lett., 2023)

On reachable assignments under dichotomous preferences. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (Theor. Comput. Sci., 2023)

The Strongly Stable Matching Problem with Closures. - Naoyuki Kamiyama (CoRR, 2024)

The Set of Stable Matchings and the Core in a Matching Market with Ties and Matroid Constraints. - Naoyuki Kamiyama (CoRR, 2024)

Non-uniformly Stable Matchings. - Naoyuki Kamiyama (CoRR, 2024)

Loss Minimization for Electrical Flows over Spanning Trees on Grids. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (CoRR, 2024)

Reforming an Unfair Allocation by Exchanging Goods. - Sheung Man Yuen; Ayumi Igarashi 001; Naoyuki Kamiyama; Warut Suksompong (CoRR, 2024)

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 001; Kazuhisa Makino (Theor. Comput. Sci., 2024)

Reachability of Fair Allocations via Sequential Exchanges. - Ayumi Igarashi 001; Naoyuki Kamiyama; Warut Suksompong; Sheung Man Yuen (Algorithmica, 2024)

Modifying an instance of the super-stable matching problem. - Naoyuki Kamiyama (Inf. Process. Lett., 2025)

Super-stable common independent sets of generalized matroids. - Naoyuki Kamiyama (Oper. Res. Lett., 2025)

Strongly Stable Matchings under Matroid Constraints. - Naoyuki Kamiyama (SIAM J. Discret. Math., 2025)

A Linear Programming Approach to the Super-Stable Roommates Problem. - Naoyuki Kamiyama (CoRR, 2025)

Reforming an Envy-Free Matching. - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (Algorithmica, 2025)

A Necessary Condition for Connectedness of Solutions to Integer Linear Systems. - Takasugu Shigenobu; Naoyuki Kamiyama (CoRR, 2025)