| A survey of algorithms for calculating power indices of weighted majority games T Matsui, Y Matsui Journal of the Operations Research Society of Japan 43 (1), 71-86, 2000 | 185 | 2000 |
| NP-completeness for calculating power indices of weighted majority games Y Matsui, T Matsui Theoretical Computer Science 263 (1-2), 305-310, 2001 | 139 | 2001 |
| Efficient enumeration of all ladder lotteries and its application K Yamanaka, S Nakano, Y Matsui, R Uehara, K Nakada Theoretical Computer Science 411 (16-18), 1714-1722, 2010 | 28 | 2010 |
| Safe sets in graphs: Graph classes and structural parameters R Águeda, N Cohen, S Fujita, S Legay, Y Manoussakis, Y Matsui, ... Journal of Combinatorial Optimization 36, 1221-1242, 2018 | 23 | 2018 |
| Safe sets, network majority on weighted trees RB Bapat, S Fujita, S Legay, Y Manoussakis, Y Matsui, T Sakuma, Z Tuza Networks 71 (1), 81-92, 2018 | 16 | 2018 |
| Network majority on tree topological network RB Bapat, S Fujita, S Legay, Y Manoussakis, Y Matsui, T Sakuma, Z Tuza Electronic Notes in Discrete Mathematics 54, 79-84, 2016 | 15 | 2016 |
| Enumeration of the perfect sequences of a chordal graph Y Matsui, R Uehara, T Uno Theoretical computer science 411 (40-42), 3635-3641, 2010 | 13 | 2010 |
| Enumeration algorithm for the edge coloring problem on bipartite graphs Y Matsui, T Matsui Franco-Japanese and Franco-Chinese Conference on Combinatorics and Computer …, 1995 | 10 | 1995 |
| Random generation of 2× 2×⋯× 2× J contingency tables T Matsui, Y Matsui, Y Ono Theoretical Computer Science 326 (1-3), 117-135, 2004 | 9 | 2004 |
| Enumerating highly-edge-connected spanning subgraphs K Yamanaka, Y Matsui, SI Nakano IEICE Transactions on Fundamentals of Electronics, Communications and …, 2019 | 8 | 2019 |
| Weighted safe set problem on trees RB Bapat, S Fujita, S Legay, Y Manoussakis, Y Matsui, T Sakuma, Z Tuza Networks 71, 81-92, 2018 | 5 | 2018 |
| Safe Sets in Graphs: Graph Classes and Structural Parameters N Cohen, R Águeda, S Fujita, S Legay, Y Manoussakis, Y Matsui, ... COCOA 2016-10th International Conference Combinatorial Optimization and …, 2016 | 5 | 2016 |
| Enumeration of perfect sequences of chordal graph Y Matsui, R Uehara, T Uno Algorithms and Computation: 19th International Symposium, ISAAC 2008, Gold …, 2008 | 5 | 2008 |
| Efficient enumeration of all ladder lotteries K Yamanaka, S Nakano, Y Matsui, R Uehara, K Nakada Proc. The 20th Workshop on Topological Graph Theory,(TGT20), 150-151, 2008 | 4 | 2008 |
| On the enumeration of bipartite minimum edge colorings Y Matsui, T Uno Graph Theory in Paris: Proceedings of a Conference in Memory of Claude Berge …, 2007 | 4 | 2007 |
| More routes for evacuation K Yamanaka, Y Matsui, S Nakano International Computing and Combinatorics Conference, 76-83, 2018 | 3 | 2018 |
| A fast enumerating algorithm for edge colorings of bipartite graphs Y Matsui, T Uno Algorithmica, 2006 | 3 | 2006 |
| Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints Y Kobayashi, K Kurita, K Mann, Y Matsui, H Ono Algorithms 18 (2), 112, 2025 | 2 | 2025 |
| Monotone diameter of bisubmodular polyhedra Y Matsui, N Sukegawa, P Zhan Operations Research Forum 4 (4), 76, 2023 | 1 | 2023 |
| Home page of Enumeration Algorithms Y Matsui http://dmawww. epfl. ch/roso. mosaic/kf/enum/enum. html, 0 | 1 | |
Tomomi MatsuiTokyo Institute of TechnologyVerified email at m.titech.ac.jp
