Threshold influence model for allocating advertising budgets A Miyauchi, Y Iwamasa, T Fukunaga, N Kakimura International Conference on Machine Learning, 1395-1404, 2015 | 16 | 2015 |

Networks maximizing the consensus time of voter models Y Iwamasa, N Masuda Physical Review E 90 (1), 012816, 2014 | 13 | 2014 |

On -Submodular Relaxation H Hirai, Y Iwamasa SIAM Journal on Discrete Mathematics 30 (3), 1726-1736, 2016 | 8 | 2016 |

Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications Y Iwamasa, K Takazawa Mathematical Programming 194 (1), 229-256, 2022 | 5 | 2022 |

The quadratic M-convexity testing problem Y Iwamasa Discrete Applied Mathematics 238, 106-114, 2018 | 5 | 2018 |

A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2 × 2 submatrices H Hirai, Y Iwamasa Mathematical Programming, 1-37, 2021 | 4 | 2021 |

A tractable class of binary VCSPs via M-convex intersection H Hirai, Y Iwamasa, K Murota, S Živný ACM Transactions on Algorithms (TALG) 15 (3), 1-41, 2019 | 3 | 2019 |

Discrete convexity in joint winner property Y Iwamasa, K Murota, S Živný Discrete Optimization 28, 78-88, 2018 | 3 | 2018 |

Monotone edge flips to an orientation of maximum edge-connectivity ŕ la Nash-Williams∗ T Ito, Y Iwamasa, N Kakimura, N Kamiyama, Y Kobayashi, S Maezawa, ... Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 2 | 2022 |

On a general framework for network representability in discrete optimization Y Iwamasa Journal of Combinatorial Optimization 36 (3), 678-708, 2018 | 2 | 2018 |

Reconstructing Phylogenetic Trees from Multipartite Quartet Systems H Hirai, Y Iwamasa Algorithmica, 1-22, 2022 | 1 | 2022 |

Reconfiguring Directed Trees in a Digraph T Ito, Y Iwamasa, Y Kobayashi, Y Nakahata, Y Otachi, K Wasa International Computing and Combinatorics Conference, 343-354, 2021 | 1 | 2021 |

Quantaloidal approach to constraint satisfaction S Fujii, Y Iwamasa, K Kimura arXiv preprint arXiv:2107.01778, 2021 | 1 | 2021 |

A Combinatorial Algorithm for Computing the Degree of the Determinant of a Generic Partitioned Polynomial Matrix with Submatrices Y Iwamasa International Conference on Integer Programming and Combinatorial …, 2021 | 1 | 2021 |

Beyond JWP: A tractable class of binary VCSPs via M-convex intersection H Hirai, Y Iwamasa, K Murota, S Zivny Leibniz Center for Informatics., 2018 | 1 | 2018 |

Independent set reconfiguration on directed graphs T Ito, Y Iwamasa, Y Kobayashi, Y Nakahata, Y Otachi, M Takahashi, ... arXiv preprint arXiv:2203.13435, 2022 | | 2022 |

Reforming an Envy-Free Matching T Ito, Y Iwamasa, N Kakimura, N Kamiyama, Y Kobayashi, Y Nozaki, ... | | 2022 |

A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with submatrices Y Iwamasa arXiv e-prints, arXiv: 2104.14841, 2021 | | 2021 |

LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS, LIPICS D Pous, GJ Woeginger, R Belmonte, M Lampis, V Mitsou, C Berkholz, ... | | 2018 |

Token Sliding on Directed Graphs T Ito, Y Iwamasa, Y Kobayashi, Y Nakahata, M Takahashi, Y Otachi, ... IEICE Technical Report; IEICE Tech. Rep., 0 | | |