Kazuo Iwama
Kazuo Iwama
Kyoto Sangyo University, Kyushu University, Kyoto University
No verified email
Cited by
Cited by
Hard variants of stable marriage
DF Manlove, RW Irving, K Iwama, S Miyazaki, Y Morita
Theoretical Computer Science 276 (1-2), 261-279, 2002
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
Greedily finding a dense subgraph
Y Asahiro, K Iwama, H Tamaki, T Tokuyama
Journal of Algorithms 34 (2), 203-221, 2000
Stable marriage with incomplete lists and ties
K Iwama, S Miyazaki, Y Morita, D Manlove
International Colloquium on Automata, Languages, and Programming, 443-452, 1999
A survey of the stable marriage problem and its variants
K Iwama, S Miyazaki
International conference on informatics education and research for knowledge …, 2008
Improved upper bounds for 3-SAT
K Iwama, S Tamaki
Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete …, 2004
Complexity of finding dense subgraphs
Y Asahiro, R Hassin, K Iwama
Discrete Applied Mathematics 121 (1-3), 15-26, 2002
CNF-satisfiability test by counting and polynomial average time
K Iwama
SIAM Journal on Computing 18 (2), 385-391, 1989
Quantum network coding
M Hayashi, K Iwama, H Nishimura, R Raymond, S Yamashita
Annual Symposium on Theoretical Aspects of Computer Science, 610-621, 2007
SAT-variable complexity of hard combinatorial problems
K Iwama, S Miyazaki
In Proceedings of the World Computer Congress of the IFIP, 1994
Random generation of test instances with controlled attributes
Y Asahiro, K Iwama, E Miyano
DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26 (1 …, 1996
An Explicit Lower Bound of 5no(n) for Boolean Circuits
K Iwama, H Morizumi
International Symposium on Mathematical Foundations of Computer Science, 353-364, 2002
Local search algorithms for partial MAXSAT
B Cha, K Iwama, Y Kambayashi, S Miyazaki
AAAI/IAAI 263268, 9, 1997
Removable online knapsack problems
K Iwama, S Taketomi
International Colloquium on Automata, Languages, and Programming, 293-305, 2002
Adding new clauses for faster local search
B Cha, K Iwama
AAAI/IAAI, Vol. 1, 332-337, 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
An improved exact algorithm for cubic graph TSP
K Iwama, T Nakashima
International Computing and Combinatorics Conference, 108-117, 2007
Performance test of local search algorithms using new types of random CNF formulas
B Cha, K Iwama
IJCAI 95, 304-310, 1995
Undecidability on quantum finite automata
M Amano, K Iwama
Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999
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
The system can't perform the operation now. Try again later.
Articles 1–20