| Hard variants of stable marriage DF Manlove, RW Irving, K Iwama, S Miyazaki, Y Morita Theoretical Computer Science 276 (1-2), 261-279, 2002 | 411 | 2002 |
| Greedily finding a dense subgraph Y Asahiro, K Iwama, H Tamaki, T Tokuyama Journal of Algorithms 34 (2), 203-221, 2000 | 287 | 2000 |
| Transformation rules for designing CNOT-based quantum circuits K Iwama, Y Kambayashi, S Yamashita Proceedings of the 39th annual Design Automation Conference, 419-424, 2002 | 258 | 2002 |
| Stable marriage with incomplete lists and ties K Iwama, D Manlove, S Miyazaki, Y Morita Automata, Languages and Programming: 26th International Colloquium, ICALP’99 …, 2002 | 243 | 2002 |
| A survey of the stable marriage problem and its variants K Iwama, S Miyazaki International conference on informatics education and research for knowledge …, 2008 | 242 | 2008 |
| Quantum network coding M Hayashi, K Iwama, H Nishimura, R Raymond, S Yamashita Annual Symposium on Theoretical Aspects of Computer Science, 610-621, 2007 | 178 | 2007 |
| Complexity of finding dense subgraphs Y Asahiro, R Hassin, K Iwama Discrete Applied Mathematics 121 (1-3), 15-26, 2002 | 173 | 2002 |
| Improved upper bounds for 3-SAT K Iwama, S Tamaki Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete …, 2004 | 157 | 2004 |
| CNF-satisfiability test by counting and polynomial average time K Iwama SIAM Journal on Computing 18 (2), 385-391, 1989 | 148 | 1989 |
| Removable online knapsack problems K Iwama, S Taketomi Automata, Languages and Programming: 29th International Colloquium, ICALP …, 2002 | 125 | 2002 |
| An Explicit Lower Bound of 5n − o(n) for Boolean Circuits K Iwama, H Morizumi Mathematical Foundations of Computer Science 2002: 27th International …, 2002 | 116 | 2002 |
| SAT-variable complexity of hard combinatorial problems K Iwama Proc. IFIP 13th World Computer Congress, 1994, 253-258, 1994 | 114 | 1994 |
| Local search algorithms for partial MAXSAT B Cha, K Iwama, Y Kambayashi, S Miyazaki AAAI/IAAI 263268, 9, 1997 | 110 | 1997 |
| Random generation of test instances with controlled attributes Y Asahiro, K Iwama, E Miyano Cliques, Coloring, and Satisfiability, 377-393, 1996 | 110 | 1996 |
| Approximability results for stable marriage problems with ties MM Halldórsson, RW Irving, K Iwama, DF Manlove, S Miyazaki, Y Morita, ... Theoretical Computer Science 306 (1-3), 431-447, 2003 | 95 | 2003 |
| Adding new clauses for faster local search B Cha, K Iwama AAAI/IAAI, Vol. 1, 332-337, 1996 | 92 | 1996 |
| An improved exact algorithm for cubic graph TSP K Iwama, T Nakashima Computing and Combinatorics: 13th Annual International Conference, COCOON …, 2007 | 83 | 2007 |
| Undecidability on quantum finite automata M Amano, K Iwama Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999 | 81 | 1999 |
| Intriactability of Read-Once Resolution K Iwama, E Miyano Structure in Complexity Theory Conference, Annual, 29-29, 1995 | 77 | 1995 |
| Improved approximation results for the stable marriage problem MM Halldórsson, K Iwama, S Miyazaki, H Yanagisawa ACM Transactions on Algorithms (TALG) 3 (3), 30-es, 2007 | 76 | 2007 |
