Ito, Takehiro; Kakimura, Naonori; Kamiyama, Naoyuki; Kobayashi, Yusuke; Okamoto, Yoshio A parameterized view to the robust recoverable base problem of matroids under structural uncertainty. (English) Zbl 1525.90317 Oper. Res. Lett. 50, No. 3, 370-375 (2022). MSC: 90C17 05B35 90C27 PDFBibTeX XMLCite \textit{T. Ito} et al., Oper. Res. Lett. 50, No. 3, 370--375 (2022; Zbl 1525.90317) Full Text: DOI
Kamiyama, Naoyuki A matroid generalization of the super-stable matching problem. (English) Zbl 1493.91092 SIAM J. Discrete Math. 36, No. 2, 1467-1482 (2022). MSC: 91B68 05B35 PDFBibTeX XMLCite \textit{N. Kamiyama}, SIAM J. Discrete Math. 36, No. 2, 1467--1482 (2022; Zbl 1493.91092) Full Text: DOI arXiv
Kamiyama, Naoyuki Envy-free matchings with one-sided preferences and matroid constraints. (English) Zbl 1525.91128 Oper. Res. Lett. 49, No. 5, 790-794 (2021). MSC: 91B68 05B35 05C70 PDFBibTeX XMLCite \textit{N. Kamiyama}, Oper. Res. Lett. 49, No. 5, 790--794 (2021; Zbl 1525.91128) Full Text: DOI
Kakimura, Naonori; Kamiyama, Naoyuki; Takazawa, Kenjiro The \(b\)-branching problem in digraphs. (English) Zbl 1442.05076 Discrete Appl. Math. 283, 565-576 (2020). MSC: 05C20 05C85 05B35 52B40 PDFBibTeX XMLCite \textit{N. Kakimura} et al., Discrete Appl. Math. 283, 565--576 (2020; Zbl 1442.05076) Full Text: DOI
Kamiyama, Naoyuki The distance-constrained matroid median problem. (English) Zbl 1442.90166 Algorithmica 82, No. 7, 2087-2106 (2020). MSC: 90C27 05B35 68W25 90B80 90C59 PDFBibTeX XMLCite \textit{N. Kamiyama}, Algorithmica 82, No. 7, 2087--2106 (2020; Zbl 1442.90166) Full Text: DOI Link
Kamiyama, Naoyuki Popular matchings with two-sided preference lists and matroid constraints. (English) Zbl 1436.91086 Theor. Comput. Sci. 809, 265-276 (2020). MSC: 91B68 PDFBibTeX XMLCite \textit{N. Kamiyama}, Theor. Comput. Sci. 809, 265--276 (2020; Zbl 1436.91086) Full Text: DOI
Kamiyama, Naoyuki Pareto stable matchings under one-sided matroid constraints. (English) Zbl 1432.91088 SIAM J. Discrete Math. 33, No. 3, 1431-1451 (2019). MSC: 91B68 05B35 PDFBibTeX XMLCite \textit{N. Kamiyama}, SIAM J. Discrete Math. 33, No. 3, 1431--1451 (2019; Zbl 1432.91088) Full Text: DOI Link
Huang, Chien-Chung; Kakimura, Naonori; Kamiyama, Naoyuki Exact and approximation algorithms for weighted matroid intersection. (English) Zbl 1418.90229 Math. Program. 177, No. 1-2 (A), 85-112 (2019). MSC: 90C27 65K05 PDFBibTeX XMLCite \textit{C.-C. Huang} et al., Math. Program. 177, No. 1--2 (A), 85--112 (2019; Zbl 1418.90229) Full Text: DOI Link
Kakimura, Naonori; Kamiyama, Naoyuki; Takazawa, Kenjiro The \(b\)-branching problem in digraphs. (English) Zbl 1510.68078 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 12, 15 p. (2018). MSC: 68R10 05C20 05C70 05C85 PDFBibTeX XMLCite \textit{N. Kakimura} et al., LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 12, 15 p. (2018; Zbl 1510.68078) Full Text: DOI arXiv
Kamiyama, Naoyuki A characterization of weighted popular matchings under matroid constraints. (English) Zbl 1394.90486 J. Oper. Res. Soc. Japan 61, No. 1, 2-17 (2018). MSC: 90C27 05B35 90C35 05C70 91B68 PDFBibTeX XMLCite \textit{N. Kamiyama}, J. Oper. Res. Soc. Japan 61, No. 1, 2--17 (2018; Zbl 1394.90486) Full Text: DOI
Kamiyama, Naoyuki Popular matchings with ties and matroid constraints. (English) Zbl 1372.91072 SIAM J. Discrete Math. 31, No. 3, 1801-1819 (2017). MSC: 91B68 05B35 68Q25 PDFBibTeX XMLCite \textit{N. Kamiyama}, SIAM J. Discrete Math. 31, No. 3, 1801--1819 (2017; Zbl 1372.91072) Full Text: DOI
Kamiyama, Naoyuki The popular matching and condensation problems under matroid constraints. (English) Zbl 1385.90023 J. Comb. Optim. 32, No. 4, 1305-1326 (2016). MSC: 90C27 91B68 05B35 05C70 68Q25 PDFBibTeX XMLCite \textit{N. Kamiyama}, J. Comb. Optim. 32, No. 4, 1305--1326 (2016; Zbl 1385.90023) Full Text: DOI
Fleiner, Tamás; Kamiyama, Naoyuki A matroid approach to stable matchings with lower quotas. (English) Zbl 1341.91107 Math. Oper. Res. 41, No. 2, 734-744 (2016). MSC: 91B68 PDFBibTeX XMLCite \textit{T. Fleiner} and \textit{N. Kamiyama}, Math. Oper. Res. 41, No. 2, 734--744 (2016; Zbl 1341.91107) Full Text: DOI Link
Kamiyama, Naoyuki Arborescence problems in directed graphs: theorems and algorithms. (English) Zbl 1288.05116 Interdiscip. Inf. Sci. 20, No. 1, 51-70 (2014). MSC: 05C20 05C85 05C70 PDFBibTeX XMLCite \textit{N. Kamiyama}, Interdiscip. Inf. Sci. 20, No. 1, 51--70 (2014; Zbl 1288.05116) Full Text: DOI
Kamiyama, Naoyuki; Katoh, Naoki Covering directed graphs by in-trees. (English) Zbl 1209.90303 J. Comb. Optim. 21, No. 1, 2-18 (2011). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{N. Kamiyama} and \textit{N. Katoh}, J. Comb. Optim. 21, No. 1, 2--18 (2011; Zbl 1209.90303) Full Text: DOI arXiv