Naoyuki Kamiyama

ORCID

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 78

Top Venues

Publications

Naoyuki Kamiyama
The Strongly Stable Matching Problem with Closures. CoRR (2024)
Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino
Envy-free relaxations for goods, chores, and mixed items. Theor. Comput. Sci. 1002 (2024)
Naoyuki Kamiyama
The Set of Stable Matchings and the Core in a Matching Market with Ties and Matroid Constraints. CoRR (2024)
Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong, Sheung Man Yuen
Reachability of Fair Allocations via Sequential Exchanges. AAAI (2024)
Naoyuki Kamiyama
Modifying an Instance of the Super-Stable Matching Problem. CoRR (2024)
Naoyuki Kamiyama
On optimization problems in acyclic hypergraphs. Inf. Process. Lett. 182 (2023)
Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
Reconfiguration of Time-Respecting Arborescences. CoRR (2023)
Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong, Sheung Man Yuen
Reachability of Fair Allocations via Sequential Exchanges. CoRR (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. CoRR (2023)
Takasugu Shigenobu, Naoyuki Kamiyama
On Connectedness of Solutions to Integer Linear Systems. COCOA (1) (2023)
Naoyuki Kamiyama
Pareto efficient matchings with pairwise preferences. Theor. Comput. Sci. 948 (2023)
Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
Reconfiguration of Time-Respecting Arborescences. WADS (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Algorithmic Theory of Qubit Routing. WADS (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. ICALP (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
On reachable assignments under dichotomous preferences. Theor. Comput. Sci. 979 (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Algorithmic Theory of Qubit Routing. CoRR (2023)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. ACM Trans. Algorithms 19 (1) (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty. Oper. Res. Lett. 50 (3) (2022)
Naoyuki Kamiyama
A Matroid Generalization of the Super-Stable Matching Problem. SIAM J. Discret. Math. 36 (2) (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. SODA (2022)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. SIAM J. Discret. Math. 36 (2) (2022)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
On Reachable Assignments under Dichotomous Preferences. CoRR (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Reforming an Envy-Free Matching. CoRR (2022)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
On Reachable Assignments Under Dichotomous Preferences. PRIMA (2022)
Takashi Ishizuka, Naoyuki Kamiyama
NP-hardness of Computing Uniform Nash Equilibria on Planar Bimatrix Game. CoRR (2022)
Naoyuki Kamiyama
A Note on Robust Subsets of Transversal Matroids. CoRR (2022)
Takashi Ishizuka, Naoyuki Kamiyama
On Finding Pure Nash Equilibria of Discrete Preference Games and Network Coordination Games. CoRR (2022)
Naoyuki Kamiyama
Strongly Stable Matchings under Matroid Constraints. CoRR (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Reforming an Envy-Free Matching. AAAI (2022)
Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Submodular reassignment problem for reallocating agents to tasks with synergy effects. Discret. Optim. 44 (Part) (2022)
Naoyuki Kamiyama, Pasin Manurangsi, Warut Suksompong
On the Complexity of Fair House Allocation. CoRR (2021)
Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Algorithms for gerrymandering over graphs. Theor. Comput. Sci. 868 (2021)
Naoyuki Kamiyama, Pasin Manurangsi, Warut Suksompong
On the complexity of fair house allocation. Oper. Res. Lett. 49 (4) (2021)
Yukiko Yamauchi, Naoyuki Kamiyama, Yota Otachi
Distributed Reconfiguration of Spanning Trees. SSS (2021)
Naoyuki Kamiyama
The envy-free matching problem with pairwise preferences. Inf. Process. Lett. 172 (2021)
Akifumi Kira, Kiyohito Nagano, Manabu Sugiyama, Naoyuki Kamiyama
Optimal class assignment problem: a case study at Gunma University. CoRR (2021)
Hiroaki Yamada, Masataka Shirahashi, Naoyuki Kamiyama, Yumeka Nakajima
MAS Network: Surrogate Neural Network for Multi-agent Simulation. MABS (2021)
Naoyuki Kamiyama
Envy-free matchings with one-sided preferences and matroid constraints. Oper. Res. Lett. 49 (5) (2021)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. CoRR (2021)
Hiroaki Yamada, Naoyuki Kamiyama
Optimal Control of Pedestrian Flows by Congestion Forecasts Satisfying User Equilibrium Conditions. PRIMA (2020)
Hiroaki Yamada, Naoyuki Kamiyama
An Information Distribution Method for Avoiding Hunting Phenomenon in Theme Parks. AAMAS (2020)
Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino
Envy-free Relaxations for Goods, Chores, and Mixed Items. CoRR (2020)
Naoyuki Kamiyama
Lexicographically optimal earliest arrival flows. Networks 75 (1) (2020)
Naoyuki Kamiyama
A Matroid Generalization of the Super-Stable Matching Problem. CoRR (2020)
Naoyuki Kamiyama
On Stable Matchings with Pairwise Preferences and Matroid Constraints. AAMAS (2020)
Naoyuki Kamiyama
The Distance-Constrained Matroid Median Problem. Algorithmica 82 (7) (2020)
Naoyuki Kamiyama
Popular matchings with two-sided preference lists and matroid constraints. Theor. Comput. Sci. 809 (2020)
Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa
The b-branching problem in digraphs. Discret. Appl. Math. 283 (2020)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. ESA (2019)
Naoyuki Kamiyama
Pareto Stable Matchings under One-Sided Matroid Constraints. SIAM J. Discret. Math. 33 (3) (2019)
Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama
Exact and approximation algorithms for weighted matroid intersection. Math. Program. 177 (1-2) (2019)
Naoyuki Kamiyama
Many-to-Many Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints. AAMAS (2019)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Minimum-Cost b-Edge Dominating Sets on Trees. Algorithmica 81 (1) (2019)
Naoyuki Kamiyama
Discrete Newton methods for the evacuation problem. Theor. Comput. Sci. 795 (2019)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. CoRR (2019)
Naoyuki Kamiyama
A note on balanced flows in equality networks. Inf. Process. Lett. 145 (2019)
Susumu Kawanaka, Naoyuki Kamiyama
An improved algorithm for testing substitutability of weak preferences. Math. Soc. Sci. 99 (2019)
Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Algorithms for Gerrymandering over Graphs. AAMAS (2019)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Reconfiguration of maximum-weight b-matchings in a graph. J. Comb. Optim. 37 (2) (2019)
Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa
The b-branching problem in digraphs. CoRR (2018)
Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa
The b-Branching Problem in Digraphs. MFCS (2018)
Takashi Ishizuka, Naoyuki Kamiyama
On the Complexity of Stable Fractional Hypergraph Matching. ISAAC (2018)
Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
The mixed evacuation problem. J. Comb. Optim. 36 (4) (2018)
Naoyuki Kamiyama
A Note on Submodular Function Minimization with Covering Type Linear Constraints. Algorithmica 80 (10) (2018)
Naoyuki Kamiyama
Popular Matchings with Ties and Matroid Constraints. SIAM J. Discret. Math. 31 (3) (2017)
Hiroaki Yamada, Kotaro Ohori, Tadashige Iwao, Akifumi Kira, Naoyuki Kamiyama, Hiroaki Yoshida, Hirokazu Anai
Modeling and Managing Airport Passenger Flow Under Uncertainty: A Case of Fukuoka Airport in Japan. SocInfo (2) (2017)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Reconfiguration of Maximum-Weight b-Matchings in a Graph. COCOON (2017)
Naoyuki Kamiyama
Strategic issues in college admissions with score-limits. Oper. Res. Lett. 45 (2) (2017)
Naoyuki Kamiyama
A note on the submodular vertex cover problem with submodular penalties. Theor. Comput. Sci. 659 (2017)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Efficient stabilization of cooperative matching games. Theor. Comput. Sci. 677 (2017)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Taichi Shiitada
Tight Approximability of the Server Allocation Problem for Real-Time Applications. ALGOCLOUD (2017)
Naoyuki Kamiyama
Submodular Function Minimization with Submodular Set Covering Constraints and Precedence Constraints. WAOA (2017)
Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto
Extended formulations for sparsity matroids. Math. Program. 158 (1-2) (2016)
Naoyuki Kamiyama
The popular matching and condensation problems under matroid constraints. J. Comb. Optim. 32 (4) (2016)
Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
The Mixed Evacuation Problem. COCOA (2016)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Efficient Stabilization of Cooperative Matching Games. AAMAS (2016)
Tamás Fleiner, Naoyuki Kamiyama
A Matroid Approach to Stable Matchings with Lower Quotas. Math. Oper. Res. 41 (2) (2016)
Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama
Exact and Approximation Algorithms for Weighted Matroid Intersection. SODA (2016)
Naoyuki Kamiyama
Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints. SAGT (2015)
Naoyuki Kamiyama, Yasushi Kawase
On packing arborescences in temporal networks. Inf. Process. Lett. 115 (2) (2015)
Naoyuki Kamiyama
The nucleolus of arborescence games in directed acyclic graphs. Oper. Res. Lett. 43 (1) (2015)
Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto
Extended Formulations for Sparsity Matroids. CoRR (2014)
Naoyuki Kamiyama
The Popular Matching and Condensation Problems Under Matroid Constraints. COCOA (2014)
Naoyuki Kamiyama, Naoki Katoh
The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths. Discret. Appl. Math. 178 (2014)
Naoyuki Kamiyama
A New Approach to the Pareto Stable Matching Problem. Math. Oper. Res. 39 (3) (2014)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Minimum-Cost b -Edge Dominating Sets on Trees. ISAAC (2014)
Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Naoyuki Kamiyama
An inductive construction of minimally rigid body-hinge simple graphs. Theor. Comput. Sci. 556 (2014)
Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Yuki Kobayashi
An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs. COCOA (2013)
András Frank, Satoru Fujishige, Naoyuki Kamiyama, Naoki Katoh
Independent arborescences in directed graphs. Discret. Math. 313 (4) (2013)
Naoyuki Kamiyama
A note on the serial dictatorship with project closures. Oper. Res. Lett. 41 (5) (2013)
Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai
On Total Unimodularity of Edge-Edge Adjacency Matrices. Algorithmica 67 (2) (2013)
Satoru Fujishige, Naoyuki Kamiyama
The root location problem for arc-disjoint arborescences. Discret. Appl. Math. 160 (13-14) (2012)
Tamás Fleiner, Naoyuki Kamiyama
A matroid approach to stable matchings with lower quotas. SODA (2012)
Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai
On Totally Unimodularity of Edge-Edge Adjacency Matrices. COCOON (2011)
Naoyuki Kamiyama, Tomomi Matsui
Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking. CATS (2011)
Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai
An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem. Inf. Process. Lett. 111 (10) (2011)
Naoyuki Kamiyama, Naoki Katoh
Covering directed graphs by in-trees. J. Comb. Optim. 21 (1) (2011)
Naoyuki Kamiyama
Robustness of Minimum Cost Arborescences. ISAAC (2011)
Yutaka Iwaikawa, Naoyuki Kamiyama, Tomomi Matsui
Improved Approximation Algorithms for Firefighter Problem on Trees. IEICE Trans. Inf. Syst. (2) (2011)
Naoyuki Kamiyama
Submodular Function Minimization under a Submodular Set Covering Constraint. TAMC (2011)

Naoyuki Kamiyama.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Naoyuki Kamiyama