Yuni Iwamasa - RankMe

62 papers A* 6A 2B 8C 2Misc 1Journal 42Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Independent Set Reconfiguration on Directed Graphs. SIAM J. Discret. Math. Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
2026	J	`jnl`	On the sizes of BDDs and ZDDs representing matroids. Theor. Comput. Sci. Hiromi Emoto, Yuni Iwamasa, Shin-ichi Minato
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	B	`conf`	A General Framework for Finding Diverse Solutions via Network Flow and Its Applications. ISAAC Yuni Iwamasa, Tomoki Matsuda, Shunya Morihira, Hanna Sumita
2025	J	`jnl`	A general framework for finding diverse solutions via network flow and its applications. CoRR Yuni Iwamasa, Tomoki Matsuda, Shunya Morihira, Hanna Sumita
2025	J	`jnl`	Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices. Math. Program. Hiroshi Hirai, Yuni Iwamasa, Taihei Oki, Tasuku Soma
2025	A*	`conf`	Algorithmic Aspects of Semistability of Quiver Representations. ICALP Yuni Iwamasa, Taihei Oki, Tasuku Soma
2025	J	`jnl`	Homotopy types of Hom complexes of graph homomorphisms whose codomains are cycles. J. Appl. Comput. Topol. Soichiro Fujii, Yuni Iwamasa, Kei Kimura, Yuta Nozaki, Akira Suzuki
2025	J	`jnl`	Reconfiguration of colorings in triangulations of the sphere. J. Comput. Geom. Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
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	J	`jnl`	Rerouting Planar Curves and Disjoint Paths. ACM Trans. Algorithms Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2024	J	`jnl`	A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with 2 ˟ 2 submatrices. Math. Program. Yuni Iwamasa
2024	J	`jnl`	Algorithmic aspects of semistability of quiver representations. CoRR Yuni Iwamasa, Taihei Oki, Tasuku Soma
2024	B	`conf`	Basis Sequence Reconfiguration in the Union of Matroids. ISAAC Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, Rin Saito
2024	J	`jnl`	Basis sequence reconfiguration in the union of matroids. CoRR Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, Rin Saito
2024	J	`jnl`	Characterizations of the set of integer points in an integral bisubmodular polyhedron. Discret. Math. Yuni Iwamasa
2024	J	`jnl`	Computing diverse pair of solutions for tractable SAT. CoRR Tatsuya Gima, Yuni Iwamasa, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi, Rin Saito
2024	A	`conf`	Finding a Maximum Restricted t-Matching via Boolean Edge-CSP. ESA Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa
2024	J	`jnl`	On the sizes of BDDs and ZDDs representing matroids. CoRR Hiromi Emoto, Yuni Iwamasa, Shin-ichi Minato
2023	J	`jnl`	Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices. CoRR Hiroshi Hirai, Yuni Iwamasa, Taihei Oki, Tasuku Soma
2023	J	`jnl`	Characterizations of the set of integer points in an integral bisubmodular polyhedron. CoRR Yuni Iwamasa
2023	J	`jnl`	Finding a Maximum Restricted t-Matching via Boolean Edge-CSP. CoRR Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa
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	A*	`conf`	Reconfiguration of Colorings in Triangulations of the Sphere. SoCG Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
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
2023	J	`jnl`	Reconfiguring (non-spanning) arborescences. Theor. Comput. Sci. Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
2023	A*	`conf`	Rerouting Planar Curves and Disjoint Paths. ICALP Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2 ˟ 2 submatrices. Math. Program. Hiroshi Hirai, Yuni Iwamasa
2022	B	`conf`	Algorithms for Coloring Reconfiguration Under Recolorability Digraphs. ISAAC Soichiro Fujii, Yuni Iwamasa, Kei Kimura, Akira Suzuki
2022	B	`conf`	Independent Set Reconfiguration on Directed Graphs. MFCS Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
2022	J	`jnl`	Independent set reconfiguration on directed graphs. CoRR Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
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`	Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications. Math. Program. Yuni Iwamasa, Kenjiro Takazawa
2022	J	`jnl`	Reconfiguration of colorings in triangulations of the sphere. CoRR Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	Reconstructing Phylogenetic Trees from Multipartite Quartet Systems. Algorithmica Hiroshi Hirai, Yuni Iwamasa
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`	Rerouting Planar Curves and Disjoint Paths. CoRR Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2021	B	`conf`	A Combinatorial Algorithm for Computing the Degree of the Determinant of a Generic Partitioned Polynomial Matrix with $2\, \times \, 2$ Submatrices. IPCO Yuni Iwamasa
2021	J	`jnl`	A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with 2×2 submatrices. CoRR Yuni Iwamasa
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	—	`conf`	Quantaloidal approach to constraint satisfaction. ACT Soichiro Fujii, Yuni Iwamasa, Kei Kimura
2021	Misc	`conf`	Reconfiguring Directed Trees in a Digraph. COCOON Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
2021	J	`jnl`	Reconfiguring Directed Trees in a Digraph. CoRR Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
2020	B	`conf`	A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 ˟ 2 Submatrices. IPCO Hiroshi Hirai, Yuni Iwamasa
2020	J	`jnl`	A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2×2 submatrices. CoRR Hiroshi Hirai, Yuni Iwamasa
2020	C	`conf`	Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications. TAMC Yuni Iwamasa, Kenjiro Takazawa
2020	J	`jnl`	Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications. CoRR Yuni Iwamasa, Kenjiro Takazawa
2019	J	`jnl`	A Tractable Class of Binary VCSPs via M-Convex Intersection. ACM Trans. Algorithms Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný
2018	J	`jnl`	A tractable class of binary VCSPs via M-convex intersection. CoRR Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný
2018	A	`conf`	Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. STACS Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný
2018	J	`jnl`	Discrete convexity in joint winner property. Discret. Optim. Yuni Iwamasa, Kazuo Murota, Stanislav Zivný
2018	J	`jnl`	On a general framework for network representability in discrete optimization. J. Comb. Optim. Yuni Iwamasa
2018	B	`conf`	Reconstructing Phylogenetic Tree From Multipartite Quartet System. ISAAC Hiroshi Hirai, Yuni Iwamasa
2018	J	`jnl`	The quadratic M-convexity testing problem. Discret. Appl. Math. Yuni Iwamasa
2017	J	`jnl`	Discrete Convexity in Joint Winner Property. CoRR Yuni Iwamasa, Kazuo Murota, Stanislav Zivný
2016	C	`conf`	On a General Framework for Network Representability in Discrete Optimization - (Extended Abstract). ISCO Yuni Iwamasa
2016	J	`jnl`	On k-Submodular Relaxation. SIAM J. Discret. Math. Hiroshi Hirai, Yuni Iwamasa
2015	J	`jnl`	On k-Submodular Relaxation. CoRR Hiroshi Hirai, Yuni Iwamasa
2015	A*	`conf`	Threshold Influence Model for Allocating Advertising Budgets. ICML Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, Naonori Kakimura
2014	J	`jnl`	Networks maximising the consensus time of voter models. CoRR Yuni Iwamasa, Naoki Masuda