Naoyuki Kamiyama

137 papers A* 8A 6B 14C 8Misc 3Journal 93Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. SIAM J. Discret. Math. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2026	J	`jnl`	Non-uniformly Stable Common Independent Sets. CoRR Naoyuki Kamiyama
2026	J	`jnl`	Non-uniformly Stable Matchings. ACM Trans. Economics and Comput. Naoyuki Kamiyama
2026	J	`jnl`	Reconfiguration of Time-Respecting Arborescences. Algorithmica Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
2025	J	`jnl`	A Linear Programming Approach to the Super-Stable Roommates Problem. CoRR Naoyuki Kamiyama
2025	J	`jnl`	A Necessary Condition for Connectedness of Solutions to Integer Linear Systems. CoRR Takasugu Shigenobu, Naoyuki Kamiyama
2025	J	`jnl`	Algorithmic Theory of Qubit Routing in the Linear Nearest Neighbor Architectures. ACM Trans. Quantum Comput. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2025	A*	`conf`	An Inverse Optimization Approach to Contextual Inverse Optimization. IJCAI Yasunari Hikima, Naoyuki Kamiyama
2025	B	`conf`	Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs. ISAAC Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2025	J	`jnl`	Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2025	J	`jnl`	Modifying an instance of the super-stable matching problem. Inf. Process. Lett. Naoyuki Kamiyama
2025	J	`jnl`	Reforming an Envy-Free Matching. Algorithmica Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2025	B	`conf`	Reforming an Unfair Allocation by Exchanging Goods. ISAAC Sheung Man Yuen, Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong
2025	J	`jnl`	Strongly Stable Matchings under Matroid Constraints. SIAM J. Discret. Math. Naoyuki Kamiyama
2025	J	`jnl`	Super-stable common independent sets of generalized matroids. Oper. Res. Lett. Naoyuki Kamiyama
2025	J	`jnl`	The Minimum-Cost Dynamic Flow Problem in a Fixed Graph With a Constant Target Flow Value. Networks Naoyuki Kamiyama
2025	J	`jnl`	The Strongly Stable Roommates Problem and Linear Programming. CoRR Naoyuki Kamiyama
2025	J	`jnl`	Two-Sided Fairness in Many-to-One Matching. CoRR Ayumi Igarashi, Naoyuki Kamiyama, Yasushi Kawase, Warut Suksompong, Hanna Sumita, Yu Yokoi
2024	J	`jnl`	Envy-free relaxations for goods, chores, and mixed items. Theor. Comput. Sci. Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino
2024	J	`jnl`	Loss Minimization for Electrical Flows over Spanning Trees on Grids. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2024	J	`jnl`	Modifying an Instance of the Super-Stable Matching Problem. CoRR Naoyuki Kamiyama
2024	J	`jnl`	Non-uniformly Stable Matchings. CoRR Naoyuki Kamiyama
2024	J	`jnl`	On Connectedness of Solutions to Integer Linear Systems. CoRR Takasugu Shigenobu, Naoyuki Kamiyama
2024	A*	`conf`	Reachability of Fair Allocations via Sequential Exchanges. AAAI Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong, Sheung Man Yuen
2024	J	`jnl`	Reachability of Fair Allocations via Sequential Exchanges. Algorithmica Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong, Sheung Man Yuen
2024	J	`jnl`	Reforming an Unfair Allocation by Exchanging Goods. CoRR Sheung Man Yuen, Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong
2024	J	`jnl`	The Set of Stable Matchings and the Core in a Matching Market with Ties and Matroid Constraints. CoRR Naoyuki Kamiyama
2024	J	`jnl`	The Strongly Stable Matching Problem with Closures. CoRR Naoyuki Kamiyama
2023	B	`conf`	Algorithmic Theory of Qubit Routing. WADS Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2023	J	`jnl`	Algorithmic Theory of Qubit Routing. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2023	A*	`conf`	Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. ICALP Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2023	J	`jnl`	Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2023	J	`jnl`	Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. ACM Trans. Algorithms Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023	—	`conf`	On Connectedness of Solutions to Integer Linear Systems. COCOA (1) Takasugu Shigenobu, Naoyuki Kamiyama
2023	J	`jnl`	On optimization problems in acyclic hypergraphs. Inf. Process. Lett. Naoyuki Kamiyama
2023	J	`jnl`	On reachable assignments under dichotomous preferences. Theor. Comput. Sci. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023	J	`jnl`	Pareto efficient matchings with pairwise preferences. Theor. Comput. Sci. Naoyuki Kamiyama
2023	J	`jnl`	Reachability of Fair Allocations via Sequential Exchanges. CoRR Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong, Sheung Man Yuen
2023	B	`conf`	Reconfiguration of Time-Respecting Arborescences. WADS Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
2023	J	`jnl`	Reconfiguration of Time-Respecting Arborescences. CoRR Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
2022	J	`jnl`	A Matroid Generalization of the Super-Stable Matching Problem. SIAM J. Discret. Math. Naoyuki Kamiyama
2022	J	`jnl`	A Note on Robust Subsets of Transversal Matroids. CoRR Naoyuki Kamiyama
2022	J	`jnl`	A parameterized view to the robust recoverable base problem of matroids under structural uncertainty. Oper. Res. Lett. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2022	A*	`conf`	Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. SODA Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	NP-hardness of Computing Uniform Nash Equilibria on Planar Bimatrix Game. CoRR Takashi Ishizuka, Naoyuki Kamiyama
2022	J	`jnl`	On Finding Pure Nash Equilibria of Discrete Preference Games and Network Coordination Games. CoRR Takashi Ishizuka, Naoyuki Kamiyama
2022	B	`conf`	On Reachable Assignments Under Dichotomous Preferences. PRIMA Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	On Reachable Assignments under Dichotomous Preferences. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	A*	`conf`	Reforming an Envy-Free Matching. AAAI Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	Reforming an Envy-Free Matching. CoRR Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. SIAM J. Discret. Math. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2022	J	`jnl`	Strongly Stable Matchings under Matroid Constraints. CoRR Naoyuki Kamiyama
2022	J	`jnl`	Submodular reassignment problem for reallocating agents to tasks with synergy effects. Discret. Optim. Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2021	J	`jnl`	Algorithms for gerrymandering over graphs. Theor. Comput. Sci. Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2021	C	`conf`	Distributed Reconfiguration of Spanning Trees. SSS Yukiko Yamauchi, Naoyuki Kamiyama, Yota Otachi
2021	J	`jnl`	Envy-free matchings with one-sided preferences and matroid constraints. Oper. Res. Lett. Naoyuki Kamiyama
2021	C	`conf`	MAS Network: Surrogate Neural Network for Multi-agent Simulation. MABS Hiroaki Yamada, Masataka Shirahashi, Naoyuki Kamiyama, Yumeka Nakajima
2021	J	`jnl`	Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. CoRR Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2021	J	`jnl`	On the Complexity of Fair House Allocation. CoRR Naoyuki Kamiyama, Pasin Manurangsi, Warut Suksompong
2021	J	`jnl`	On the complexity of fair house allocation. Oper. Res. Lett. Naoyuki Kamiyama, Pasin Manurangsi, Warut Suksompong
2021	J	`jnl`	Optimal class assignment problem: a case study at Gunma University. CoRR Akifumi Kira, Kiyohito Nagano, Manabu Sugiyama, Naoyuki Kamiyama
2021	J	`jnl`	The envy-free matching problem with pairwise preferences. Inf. Process. Lett. Naoyuki Kamiyama
2020	J	`jnl`	A Matroid Generalization of the Super-Stable Matching Problem. CoRR Naoyuki Kamiyama
2020	A	`conf`	An Information Distribution Method for Avoiding Hunting Phenomenon in Theme Parks. AAMAS Hiroaki Yamada, Naoyuki Kamiyama
2020	J	`jnl`	Envy-free Relaxations for Goods, Chores, and Mixed Items. CoRR Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino
2020	J	`jnl`	Lexicographically optimal earliest arrival flows. Networks Naoyuki Kamiyama
2020	A	`conf`	On Stable Matchings with Pairwise Preferences and Matroid Constraints. AAMAS Naoyuki Kamiyama
2020	B	`conf`	Optimal Control of Pedestrian Flows by Congestion Forecasts Satisfying User Equilibrium Conditions. PRIMA Hiroaki Yamada, Naoyuki Kamiyama
2020	J	`jnl`	Popular matchings with two-sided preference lists and matroid constraints. Theor. Comput. Sci. Naoyuki Kamiyama
2020	J	`jnl`	The Distance-Constrained Matroid Median Problem. Algorithmica Naoyuki Kamiyama
2020	J	`jnl`	The b-branching problem in digraphs. Discret. Appl. Math. Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa
2019	J	`jnl`	A note on balanced flows in equality networks. Inf. Process. Lett. Naoyuki Kamiyama
2019	A	`conf`	Algorithms for Gerrymandering over Graphs. AAMAS Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019	J	`jnl`	An improved algorithm for testing substitutability of weak preferences. Math. Soc. Sci. Susumu Kawanaka, Naoyuki Kamiyama
2019	J	`jnl`	Discrete Newton methods for the evacuation problem. Theor. Comput. Sci. Naoyuki Kamiyama
2019	J	`jnl`	Exact and approximation algorithms for weighted matroid intersection. Math. Program. Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama
2019	A	`conf`	Many-to-Many Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints. AAMAS Naoyuki Kamiyama
2019	J	`jnl`	Minimum-Cost b-Edge Dominating Sets on Trees. Algorithmica Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019	J	`jnl`	Pareto Stable Matchings under One-Sided Matroid Constraints. SIAM J. Discret. Math. Naoyuki Kamiyama
2019	J	`jnl`	Reconfiguration of maximum-weight b-matchings in a graph. J. Comb. Optim. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019	A	`conf`	Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. ESA Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019	J	`jnl`	Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2018	J	`jnl`	A Note on Submodular Function Minimization with Covering Type Linear Constraints. Algorithmica Naoyuki Kamiyama
2018	B	`conf`	On the Complexity of Stable Fractional Hypergraph Matching. ISAAC Takashi Ishizuka, Naoyuki Kamiyama
2018	B	`conf`	The b-Branching Problem in Digraphs. MFCS Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa
2018	J	`jnl`	The b-branching problem in digraphs. CoRR Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa
2018	J	`jnl`	The mixed evacuation problem. J. Comb. Optim. Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
2017	J	`jnl`	A note on the submodular vertex cover problem with submodular penalties. Theor. Comput. Sci. Naoyuki Kamiyama
2017	J	`jnl`	Efficient stabilization of cooperative matching games. Theor. Comput. Sci. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2017	—	`conf`	Modeling and Managing Airport Passenger Flow Under Uncertainty: A Case of Fukuoka Airport in Japan. SocInfo (2) Hiroaki Yamada, Kotaro Ohori, Tadashige Iwao, Akifumi Kira, Naoyuki Kamiyama, Hiroaki Yoshida, Hirokazu Anai
2017	J	`jnl`	Popular Matchings with Ties and Matroid Constraints. SIAM J. Discret. Math. Naoyuki Kamiyama
2017	Misc	`conf`	Reconfiguration of Maximum-Weight b-Matchings in a Graph. COCOON Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2017	J	`jnl`	Strategic issues in college admissions with score-limits. Oper. Res. Lett. Naoyuki Kamiyama
2017	B	`conf`	Submodular Function Minimization with Submodular Set Covering Constraints and Precedence Constraints. WAOA Naoyuki Kamiyama
2017	—	`conf`	Tight Approximability of the Server Allocation Problem for Real-Time Applications. ALGOCLOUD Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Taichi Shiitada
2016	J	`jnl`	A Matroid Approach to Stable Matchings with Lower Quotas. Math. Oper. Res. Tamás Fleiner, Naoyuki Kamiyama
2016	A	`conf`	Efficient Stabilization of Cooperative Matching Games. AAMAS Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2016	A*	`conf`	Exact and Approximation Algorithms for Weighted Matroid Intersection. SODA Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama
2016	J	`jnl`	Extended formulations for sparsity matroids. Math. Program. Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto
2016	C	`conf`	The Mixed Evacuation Problem. COCOA Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
2016	J	`jnl`	The popular matching and condensation problems under matroid constraints. J. Comb. Optim. Naoyuki Kamiyama
2015	J	`jnl`	On packing arborescences in temporal networks. Inf. Process. Lett. Naoyuki Kamiyama, Yasushi Kawase
2015	B	`conf`	Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints. SAGT Naoyuki Kamiyama
2015	J	`jnl`	The nucleolus of arborescence games in directed acyclic graphs. Oper. Res. Lett. Naoyuki Kamiyama
2014	J	`jnl`	A New Approach to the Pareto Stable Matching Problem. Math. Oper. Res. Naoyuki Kamiyama
2014	J	`jnl`	An inductive construction of minimally rigid body-hinge simple graphs. Theor. Comput. Sci. Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Naoyuki Kamiyama
2014	J	`jnl`	Extended Formulations for Sparsity Matroids. CoRR Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto
2014	B	`conf`	Minimum-Cost b -Edge Dominating Sets on Trees. ISAAC Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2014	C	`conf`	The Popular Matching and Condensation Problems Under Matroid Constraints. COCOA Naoyuki Kamiyama
2014	J	`jnl`	The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths. Discret. Appl. Math. Naoyuki Kamiyama, Naoki Katoh
2013	J	`jnl`	A note on the serial dictatorship with project closures. Oper. Res. Lett. Naoyuki Kamiyama
2013	C	`conf`	An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs. COCOA Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Yuki Kobayashi
2013	J	`jnl`	Independent arborescences in directed graphs. Discret. Math. András Frank, Satoru Fujishige, Naoyuki Kamiyama, Naoki Katoh
2013	J	`jnl`	On Total Unimodularity of Edge-Edge Adjacency Matrices. Algorithmica Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai
2012	A*	`conf`	A matroid approach to stable matchings with lower quotas. SODA Tamás Fleiner, Naoyuki Kamiyama
2012	J	`jnl`	The root location problem for arc-disjoint arborescences. Discret. Appl. Math. Satoru Fujishige, Naoyuki Kamiyama
2011	J	`jnl`	An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem. Inf. Process. Lett. Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai
2011	—	`conf`	Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking. CATS Naoyuki Kamiyama, Tomomi Matsui
2011	J	`jnl`	Covering directed graphs by in-trees. J. Comb. Optim. Naoyuki Kamiyama, Naoki Katoh
2011	J	`jnl`	Improved Approximation Algorithms for Firefighter Problem on Trees. IEICE Trans. Inf. Syst. Yutaka Iwaikawa, Naoyuki Kamiyama, Tomomi Matsui
2011	Misc	`conf`	On Totally Unimodularity of Edge-Edge Adjacency Matrices. COCOON Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai
2011	B	`conf`	Robustness of Minimum Cost Arborescences. ISAAC Naoyuki Kamiyama
2011	C	`conf`	Submodular Function Minimization under a Submodular Set Covering Constraint. TAMC Naoyuki Kamiyama
2010	J	`jnl`	A Relation between the Protocol Partition Number and the Quasi-Additive Bound CoRR Naoyuki Kamiyama
2010	B	`conf`	The Prize-Collecting Edge Dominating Set Problem in Trees. MFCS Naoyuki Kamiyama
2009	B	`conf`	A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths. ISAAC Naoyuki Kamiyama, Naoki Katoh
2009	J	`jnl`	A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph. Inf. Process. Lett. Kristóf Bérczi, Satoru Fujishige, Naoyuki Kamiyama
2009	J	`jnl`	An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths. Discret. Appl. Math. Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
2009	J	`jnl`	Arc-disjoint in-trees in directed graphs. Comb. Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
2009	J	`jnl`	Computational Complexities of University Interview Timetabling. IEICE Trans. Inf. Syst. Naoyuki Kamiyama, Yuuki Kiyonari, Eiji Miyano, Shuichi Miyazaki, Katsuhisa Yamanaka
2008	A*	`conf`	Arc-disjoint in-trees in directed graphs. SODA Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
2008	Misc	`conf`	Covering Directed Graphs by In-Trees. COCOON Naoyuki Kamiyama, Naoki Katoh
2008	J	`jnl`	Covering Directed Graphs by In-trees CoRR Naoyuki Kamiyama, Naoki Katoh
2008	—	`conf`	The Minimum Weight In-Tree Cover Problem. MCO Naoyuki Kamiyama, Naoki Katoh
2007	C	`conf`	An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths. AAIM Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
2006	J	`jnl`	An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity. IEICE Trans. Inf. Syst. Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
2006	C	`conf`	An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity. AAIM Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa