Yuni Iwamasa

About Yuni Iwamasa

Yuni Iwamasa, With an exceptional h-index of 6 and a recent h-index of 6 (since 2020), a distinguished researcher at Kyoto University, specializes in the field of Combinatorial Optimization, Discrete Mathematics, Computational Complexity Theory.

His recent articles reflect a diverse array of research interests and contributions to the field:

On the sizes of BDDs and ZDDs representing matroids

Characterizations of the set of integer points in an integral bisubmodular polyhedron

A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with submatrices

Finding a Maximum Restricted -Matching via Boolean Edge-CSP

Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices

Reconfiguration of time-respecting arborescences

Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams

Reconfiguring (non-spanning) arborescences

Yuni Iwamasa Information

University

Position

___

Citations(all)

97

Citations(since 2020)

75

Cited By

51

hIndex(all)

6

hIndex(since 2020)

6

i10Index(all)

3

i10Index(since 2020)

2

Email

University Profile Page

Google Scholar

Yuni Iwamasa Skills & Research Interests

Combinatorial Optimization

Discrete Mathematics

Computational Complexity Theory

Top articles of Yuni Iwamasa

On the sizes of BDDs and ZDDs representing matroids

arXiv preprint arXiv:2404.14670

2024/4/23

Yuni Iwamasa
Yuni Iwamasa

H-Index: 4

Shin-Ichi Minato
Shin-Ichi Minato

H-Index: 17

Characterizations of the set of integer points in an integral bisubmodular polyhedron

Discrete Mathematics

2024/4/1

Yuni Iwamasa
Yuni Iwamasa

H-Index: 4

A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with submatrices

Mathematical Programming

2024/3

Yuni Iwamasa
Yuni Iwamasa

H-Index: 4

Finding a Maximum Restricted -Matching via Boolean Edge-CSP

arXiv preprint arXiv:2310.20245

2023/10/31

Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices

arXiv preprint arXiv:2310.15502

2023/10/24

Yuni Iwamasa
Yuni Iwamasa

H-Index: 4

Tasuku Soma
Tasuku Soma

H-Index: 8

Reconfiguration of time-respecting arborescences

2023/7/28

Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams

ACM Transactions on Algorithms

2023/2/20

Reconfiguring (non-spanning) arborescences

Theoretical Computer Science

2023/1/17

Reconfiguration of Colorings in Triangulations of the Sphere

arXiv preprint arXiv:2210.17105

2022/10/31

Yuni Iwamasa
Yuni Iwamasa

H-Index: 4

Yusuke Kobayashi
Yusuke Kobayashi

H-Index: 12

Rerouting planar curves and disjoint paths

arXiv preprint arXiv:2210.11778

2022/10/21

A combinatorial algorithm for computing the rank of a generic partitioned matrix with submatrices

Mathematical Programming

2022/9

Yuni Iwamasa
Yuni Iwamasa

H-Index: 4

Reconstructing phylogenetic trees from multipartite quartet systems

Algorithmica

2022/7

Yuni Iwamasa
Yuni Iwamasa

H-Index: 4

Reforming an Envy-Free Matching

Proceedings of the AAAI Conference on Artificial Intelligence

2022/6/28

Independent set reconfiguration on directed graphs

arXiv preprint arXiv:2203.13435

2022/3/25

Algorithms for coloring reconfiguration under recolorability digraphs

2022

Token Sliding on Directed Graphs

IEICE Technical Report; IEICE Tech. Rep.

2021/11/26

Reconfiguring directed trees in a digraph

2021/10/20

Quantaloidal approach to constraint satisfaction

arXiv preprint arXiv:2107.01778

2021/7/5

Yuni Iwamasa
Yuni Iwamasa

H-Index: 4

Kei Kimura
Kei Kimura

H-Index: 3

Reformist Envy-Free Item Allocations: Algorithms and Complexity

2021/5/7

A Combinatorial Algorithm for Computing the Degree of the Determinant of a Generic Partitioned Polynomial Matrix with Submatrices

2021

Yuni Iwamasa
Yuni Iwamasa

H-Index: 4

See List of Professors in Yuni Iwamasa University(Kyoto University)