| Threshold influence model for allocating advertising budgets A Miyauchi, Y Iwamasa, T Fukunaga, N Kakimura International Conference on Machine Learning, 1395-1404, 2015 | 23 | 2015 |
| On -Submodular Relaxation H Hirai, Y Iwamasa SIAM Journal on Discrete Mathematics 30 (3), 1726-1736, 2016 | 16 | 2016 |
| Networks maximizing the consensus time of voter models Y Iwamasa, N Masuda Physical Review E 90 (1), 012816, 2014 | 13 | 2014 |
| 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, ... ACM Transactions on Algorithms 19 (1), 1-22, 2023 | 8 | 2023 |
| A combinatorial algorithm for computing the rank of a generic partitioned matrix with submatrices H Hirai, Y Iwamasa Mathematical Programming 195 (1), 1-37, 2022 | 7 | 2022 |
| Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications Y Iwamasa, K Takazawa International Conference on Theory and Applications of Models of Computation …, 2020 | 6 | 2020 |
| Reconfiguring (non-spanning) arborescences T Ito, Y Iwamasa, Y Kobayashi, Y Nakahata, Y Otachi, K Wasa Theoretical Computer Science 943, 131-141, 2023 | 5 | 2023 |
| The quadratic M-convexity testing problem Y Iwamasa Discrete Applied Mathematics 238, 106-114, 2018 | 5 | 2018 |
| Rerouting planar curves and disjoint paths T Ito, Y Iwamasa, N Kakimura, Y Kobayashi, S Maezawa, Y Nozaki, ... arXiv preprint arXiv:2210.11778, 2022 | 4 | 2022 |
| Independent set reconfiguration on directed graphs T Ito, Y Iwamasa, Y Kobayashi, Y Nakahata, Y Otachi, M Takahashi, ... arXiv preprint arXiv:2203.13435, 2022 | 4 | 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 | 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 |
| Reconfiguration of time-respecting arborescences T Ito, Y Iwamasa, N Kamiyama, Y Kobayashi, Y Kobayashi, S Maezawa, ... Algorithms and Data Structures Symposium, 521-532, 2023 | 2 | 2023 |
| Reforming an Envy-Free Matching T Ito, Y Iwamasa, N Kakimura, N Kamiyama, Y Kobayashi, Y Nozaki, ... Proceedings of the AAAI Conference on Artificial Intelligence 36 (5), 5084-5091, 2022 | 2 | 2022 |
| A Combinatorial Algorithm for Computing the Degree of the Determinant of a Generic Partitioned Polynomial Matrix with Submatrices Y Iwamasa Integer Programming and Combinatorial Optimization: 22nd International …, 2021 | 2 | 2021 |
| On a general framework for network representability in discrete optimization Y Iwamasa Journal of Combinatorial Optimization 36, 678-708, 2018 | 2 | 2018 |
| A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with submatrices Y Iwamasa Mathematical Programming 204 (1), 27-79, 2024 | 1 | 2024 |
| Algorithms for coloring reconfiguration under recolorability digraphs S Fujii, Y Iwamasa, K Kimura, A Suzuki 33rd International Symposium on Algorithms and Computation, ISAAC 2022, 4, 2022 | 1 | 2022 |
| Reconstructing phylogenetic trees from multipartite quartet systems H Hirai, Y Iwamasa Algorithmica 84 (7), 1875-1896, 2022 | 1 | 2022 |
