# 岩政 勇仁

Last Update: 2021/06/11 15:27:36

Print

Name(Kanji/Kana/Abecedarium Latinum)

Primary Affiliation(Org1/Job title)
Faculty
Org1 Job title

Academic Organizations You are Affiliated to in Japan
Organization name(Japanese) Organization name(English)

Field(Japanese) Field(English) University(Japanese) University(English) Method

Language of Instruction
Language(japanese) Language(english) Code

Personal Website(s) (URL(s))
ORCID ID
https://orcid.org/0000-0002-6794-3543
researchmap URL
https://researchmap.jp/yuni_iwamasa
Published Papers
Author Author(Japanese) Author(English) Title Title(Japanese) Title(English) Bibliography Bibliography(Japanese) Bibliography(English) Publication date Refereed paper Language Publishing type
Yuni Iwamasa Yuni Iwamasa Yuni Iwamasa A Combinatorial Algorithm for Computing the Degree of the Determinant of a Generic Partitioned Polynomial Matrix with $2+\times+2$ Submatrices A Combinatorial Algorithm for Computing the Degree of the Determinant of a Generic Partitioned Polynomial Matrix with $2+\times+2$ Submatrices A Combinatorial Algorithm for Computing the Degree of the Determinant of a Generic Partitioned Polynomial Matrix with $2+\times+2$ Submatrices Proceedings of the 22nd Conference on Integer Programming and Combinatorial Optimization (IPCO 2021), LNCS 12707, 119-133 Proceedings of the 22nd Conference on Integer Programming and Combinatorial Optimization (IPCO 2021), LNCS 12707, 119-133 Proceedings of the 22nd Conference on Integer Programming and Combinatorial Optimization (IPCO 2021), LNCS 12707, 119-133 2021 Refereed Research paper(international conference proceedings)
Yuni Iwamasa, Kenjiro Takazawa Yuni Iwamasa, Kenjiro Takazawa Yuni Iwamasa, Kenjiro Takazawa Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications Proceedings of the 16th Annual Conference on Theory and Applications of Models of Computation (TAMC 2020), LNCS 12337, 156-167 Proceedings of the 16th Annual Conference on Theory and Applications of Models of Computation (TAMC 2020), LNCS 12337, 156-167 Proceedings of the 16th Annual Conference on Theory and Applications of Models of Computation (TAMC 2020), LNCS 12337, 156-167 2020 Refereed Research paper(international conference proceedings)
Hiroshi Hirai, Yuni Iwamasa Hiroshi Hirai, Yuni Iwamasa Hiroshi Hirai, Yuni Iwamasa A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with $2 \times+2$ Submatrices A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with $2 \times+2$ Submatrices A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with $2 \times+2$ Submatrices Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO 2020), LNCS 12125, 196-208 Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO 2020), LNCS 12125, 196-208 Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO 2020), LNCS 12125, 196-208 2020 Refereed Research paper(international conference proceedings)
Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Živný Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Živný Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Živný A tractable class of binary VCSPs via M-convex intersection A tractable class of binary VCSPs via M-convex intersection A tractable class of binary VCSPs via M-convex intersection ACM Transactions on Algorithms, 15, 3, Article 44 (41 pages) ACM Transactions on Algorithms, 15, 3, Article 44 (41 pages) ACM Transactions on Algorithms, 15, 3, Article 44 (41 pages) 2019 Refereed Research paper(scientific journal)
Hiroshi Hirai, Yuni Iwamasa Hiroshi Hirai, Yuni Iwamasa Hiroshi Hirai, Yuni Iwamasa Reconstructing Phylogenetic Tree From Multipartite Quartet System Reconstructing Phylogenetic Tree From Multipartite Quartet System Reconstructing Phylogenetic Tree From Multipartite Quartet System Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC 2018), LIPIcs 123, Article 57 (13 pages) Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC 2018), LIPIcs 123, Article 57 (13 pages) Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC 2018), LIPIcs 123, Article 57 (13 pages) 2018 Refereed English Research paper(international conference proceedings)
Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Živný Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Živný Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Živný Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection Proceedings of the 35th International Symposium on Theoretical Aspects of Computer Science (STACS 2018), LIPIcs 96, Article 39 (14 pages) Proceedings of the 35th International Symposium on Theoretical Aspects of Computer Science (STACS 2018), LIPIcs 96, Article 39 (14 pages) Proceedings of the 35th International Symposium on Theoretical Aspects of Computer Science (STACS 2018), LIPIcs 96, Article 39 (14 pages) 2018 Refereed English Research paper(international conference proceedings)
Yuni Iwamasa, Kazuo Murota, Stanislav Živný Yuni Iwamasa, Kazuo Murota, Stanislav Živný Yuni Iwamasa, Kazuo Murota, Stanislav Živný Discrete convexity in joint winner property Discrete convexity in joint winner property Discrete convexity in joint winner property Discrete Optimization, 28, 78-88 Discrete Optimization, 28, 78-88 Discrete Optimization, 28, 78-88 2018 Refereed English Research paper(scientific journal)
Yuni Iwamasa Yuni Iwamasa Yuni Iwamasa The quadratic M-convexity testing problem The quadratic M-convexity testing problem The quadratic M-convexity testing problem Discrete Applied Mathematics, 238, 106-114 Discrete Applied Mathematics, 238, 106-114 Discrete Applied Mathematics, 238, 106-114 2018 Refereed English Research paper(scientific journal)
Yuni Iwamasa Yuni Iwamasa Yuni Iwamasa On a general framework for network representability in discrete optimization On a general framework for network representability in discrete optimization On a general framework for network representability in discrete optimization Journal of Combinatorial Optimization, 36, 3, 678-708 Journal of Combinatorial Optimization, 36, 3, 678-708 Journal of Combinatorial Optimization, 36, 3, 678-708 2018 Refereed English Research paper(scientific journal)
Yuni Iwamasa Yuni Iwamasa Yuni Iwamasa On a General Framework for Network Representability in Discrete Optimization On a General Framework for Network Representability in Discrete Optimization On a General Framework for Network Representability in Discrete Optimization Proceedings of the 4th International Symposium on Combinatorial Optimization (ISCO 2016), LNCS 9849, 369-380 Proceedings of the 4th International Symposium on Combinatorial Optimization (ISCO 2016), LNCS 9849, 369-380 Proceedings of the 4th International Symposium on Combinatorial Optimization (ISCO 2016), LNCS 9849, 369-380 2016 Refereed Research paper(international conference proceedings)
Hiroshi Hirai, Yuni Iwamasa Hiroshi Hirai, Yuni Iwamasa Hiroshi Hirai, Yuni Iwamasa On $k$ -submodular relaxation On $k$ -submodular relaxation On $k$ -submodular relaxation SIAM Journal on Discrete Mathematics, 30, 3, 1726-1736 SIAM Journal on Discrete Mathematics, 30, 3, 1726-1736 SIAM Journal on Discrete Mathematics, 30, 3, 1726-1736 2016 Refereed English Research paper(scientific journal)
Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, Naonori Kakimura Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, Naonori Kakimura Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, Naonori Kakimura Threshold influence model for allocating advertising budgets Threshold influence model for allocating advertising budgets Threshold influence model for allocating advertising budgets Proceedings of the 32nd International Conference on Machine Learning (ICML 2015), 1395-1404 Proceedings of the 32nd International Conference on Machine Learning (ICML 2015), 1395-1404 Proceedings of the 32nd International Conference on Machine Learning (ICML 2015), 1395-1404 2015 Refereed Research paper(international conference proceedings)
Yuni Iwamasa, Naoki Masuda Yuni Iwamasa, Naoki Masuda Yuni Iwamasa, Naoki Masuda Networks maximizing the consensus time of voter models Networks maximizing the consensus time of voter models Networks maximizing the consensus time of voter models Physical Review E, 90, 012816 Physical Review E, 90, 012816 Physical Review E, 90, 012816 2014 Refereed English Research paper(scientific journal)

• <<
• >>
Title language:
Conference Activities & Talks
Title Title(Japanese) Title(English) Conference Conference(Japanese) Conference(English) Promotor Promotor(Japanese) Promotor(English) Date Language Assortment
A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with $2+\times+2$ submatrices A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with $2+\times+2$ submatrices A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with $2+\times+2$ submatrices The 22nd Conference on Integer Programming and Combinatorial Optimization (IPCO 2021) The 22nd Conference on Integer Programming and Combinatorial Optimization (IPCO 2021) The 22nd Conference on Integer Programming and Combinatorial Optimization (IPCO 2021) 2021/05
2部マッチング理論の代数的一般化について[Invited] 2部マッチング理論の代数的一般化について [Invited] 第32回RAMP数理最適化シンポジウム (RAMP 2020) 第32回RAMP数理最適化シンポジウム (RAMP 2020) 2020/10
Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications The 16th Annual Conference on Theory and Applications of Models of Computation (TAMC 2020) The 16th Annual Conference on Theory and Applications of Models of Computation (TAMC 2020) The 16th Annual Conference on Theory and Applications of Models of Computation (TAMC 2020) 2020/10 Oral presentation(general)

A combinatorial algorithm for computing the rank of a generic partitioned matrix with $2+×+2$ submatrices A combinatorial algorithm for computing the rank of a generic partitioned matrix with $2+×+2$ submatrices A combinatorial algorithm for computing the rank of a generic partitioned matrix with $2+×+2$ submatrices The 21st Conference on Integer Programming and Combinatorial Optimization (IPCO 2020) The 21st Conference on Integer Programming and Combinatorial Optimization (IPCO 2020) The 21st Conference on Integer Programming and Combinatorial Optimization (IPCO 2020) 2020/06 Oral presentation(general)
$2+\times+2$ 型分割行列のランクを求める組合せ的多項式時間アルゴリズム $2+\times+2$ 型分割行列のランクを求める組合せ的多項式時間アルゴリズム 日本応用数理学会 第16回研究部会連合発表会 日本応用数理学会 第16回研究部会連合発表会 2020/03 Oral presentation(general)
$2+\times+2$ 型分割行列のランクを求める組合せ的多項式時間アルゴリズム[Invited] $2+\times+2$ 型分割行列のランクを求める組合せ的多項式時間アルゴリズム [Invited] 日本オペレーションズ・リサーチ学会 研究部会「超スマート社会のシステムデザインのための理論と応用」 日本オペレーションズ・リサーチ学会 研究部会「超スマート社会のシステムデザインのための理論と応用」 2019/11 Oral presentation(invited, special)
Reconstructing phylogenetic tree from multipartite quartet system Reconstructing phylogenetic tree from multipartite quartet system Reconstructing phylogenetic tree from multipartite quartet system The 29th International Symposium on Algorithms and Computation (ISAAC 2018) The 29th International Symposium on Algorithms and Computation (ISAAC 2018) The 29th International Symposium on Algorithms and Computation (ISAAC 2018) 2018/12 Oral presentation(general)

Discrete convexity in binary VCSPs Discrete convexity in binary VCSPs Discrete convexity in binary VCSPs The 23rd International Symposium on Mathematical Programming (ISMP 2018) The 23rd International Symposium on Mathematical Programming (ISMP 2018) The 23rd International Symposium on Mathematical Programming (ISMP 2018) 2018/07 Oral presentation(general)
Beyond JWP: A tractable class of binary VCSPs via M-convex intersection Beyond JWP: A tractable class of binary VCSPs via M-convex intersection Beyond JWP: A tractable class of binary VCSPs via M-convex intersection The 35th International Symposium on Theoretical Aspects of Computer Science (STACS 2018) The 35th International Symposium on Theoretical Aspects of Computer Science (STACS 2018) The 35th International Symposium on Theoretical Aspects of Computer Science (STACS 2018) 2018/03 Oral presentation(general)
A tractable class of binary VCSPs via M-convex intersection A tractable class of binary VCSPs via M-convex intersection 電子情報通信学会2018年（平成30年）総合大会 COMP-ELC学生シンポジウム 電子情報通信学会2018年（平成30年）総合大会 COMP-ELC学生シンポジウム 2018/03 Oral presentation(general)

Discrete convexity in joint winner property Discrete convexity in joint winner property 日本応用数理学会 2017年度年会 日本応用数理学会 2017年度年会 2017/09 Oral presentation(general)
Discrete convexity in valued constraint satisfaction problems: M-convexity and joint winner property[Invited] Discrete convexity in valued constraint satisfaction problems: M-convexity and joint winner property [Invited] Japanese Conference on Combinatorics and its Applications (JCCA 2017)・離散数学とその応用研究集会2017 Japanese Conference on Combinatorics and its Applications (JCCA 2017)・離散数学とその応用研究集会2017 2017/08 Oral presentation(invited, special)
Discrete convexity in joint winner property Discrete convexity in joint winner property Discrete convexity in joint winner property The 19th Conference on Integer Programming and Combinatorial Optimization (IPCO 2017) The 19th Conference on Integer Programming and Combinatorial Optimization (IPCO 2017) The 19th Conference on Integer Programming and Combinatorial Optimization (IPCO 2017) 2017/06 Poster presentation
The quadratic M-convexity testing problem The quadratic M-convexity testing problem The quadratic M-convexity testing problem The 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH 2017) The 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH 2017) The 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH 2017) 2017/05 Oral presentation(general)
2次関数のM凸性判定問題 2次関数のM凸性判定問題 日本オペレーションズ・リサーチ学会 2017年春季研究発表会（創立60周年記念大会） 日本オペレーションズ・リサーチ学会 2017年春季研究発表会（創立60周年記念大会） 2017/03 Oral presentation(general)
On a general framework for network representability in discrete optimization On a general framework for network representability in discrete optimization On a general framework for network representability in discrete optimization The 4th International Symposium on Combinatorial Optimization (ISCO 2016) The 4th International Symposium on Combinatorial Optimization (ISCO 2016) The 4th International Symposium on Combinatorial Optimization (ISCO 2016) 2016/05 Oral presentation(general)
M ${}^\natural$ -convex completion problem M ${}^\natural$ -convex completion problem 日本オペレーションズ・リサーチ学会 研究部会「最適化の基盤とフロンティア—未来を担う若手研究者の集い2016—」 日本オペレーションズ・リサーチ学会 研究部会「最適化の基盤とフロンティア—未来を担う若手研究者の集い2016—」 2016/05 Oral presentation(general)

On $k$ -submodular relaxation On $k$ -submodular relaxation On $k$ -submodular relaxation The 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ 2015) The 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ 2015) The 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ 2015) 2015/06 Oral presentation(general)
On $k$ -submodular relaxation On $k$ -submodular relaxation 日本オペレーションズ・リサーチ学会 研究部会「最適化の基盤とフロンティア—未来を担う若手研究者の集い2015—」 日本オペレーションズ・リサーチ学会 研究部会「最適化の基盤とフロンティア—未来を担う若手研究者の集い2015—」 2015/05 Oral presentation(general)

• <<
• >>
Title language:
External funds: competitive funds and Grants-in-Aid for Scientific Research (Kakenhi)
Type Position Title(Japanese) Title(English) Period

Teaching subject(s)
Name(Japanese) Name(English) Term Department Period