| Hard variants of stable marriage DF Manlove, RW Irving, K Iwama, S Miyazaki, Y Morita Theoretical Computer Science 276 (1-2), 261-279, 2002 | 395 | 2002 |
| Stable marriage with incomplete lists and ties K Iwama, D Manlove, S Miyazaki, Y Morita Automata, Languages and Programming, 443-452, 1999 | 232 | 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 | 228 | 2008 |
| SAT-variable complexity of hard combinatorial problems K Iwama Proc. IFIP 13th World Computer Congress, 1994, 253-258, 1994 | 113 | 1994 |
| Local search algorithms for partial MAXSAT B Cha, K Iwama, Y Kambayashi, S Miyazaki AAAI/IAAI 263268, 9, 1997 | 102 | 1997 |
| 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 | 92 | 2003 |
| 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 | 73 | 2007 |
| A 1.875: approximation algorithm for the stable marriage problem K Iwama, S Miyazaki, N Yamauchi Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007 | 66 | 2007 |
| The hospitals/residents problem with lower quotas K Hamada, K Iwama, S Miyazaki Algorithmica 74, 440-465, 2016 | 65 | 2016 |
| Randomized approximation of the stable marriage problem MM Halldórsson, K Iwama, S Miyazaki, H Yanagisawa Theoretical Computer Science 325 (3), 439-465, 2004 | 55 | 2004 |
| The hospitals/residents problem with quota lower bounds K Hamada, K Iwama, S Miyazaki European Symposium on Algorithms, 180-191, 2011 | 44 | 2011 |
| Improved approximation bounds for the student-project allocation problem with preferences over projects K Iwama, S Miyazaki, H Yanagisawa Journal of Discrete Algorithms 13, 59-66, 2012 | 41 | 2012 |
| Online independent sets MM Halldórsson, K Iwama, S Miyazaki, S Taketomi Theoretical Computer Science 289 (2), 953-962, 2002 | 40 | 2002 |
| A 25/17-approximation algorithm for the stable marriage problem with one-sided ties K Iwama, S Miyazaki, H Yanagisawa Algorithmica 68 (3), 758-775, 2014 | 39 | 2014 |
| Database queries as combinatorial optimization problems S Miyazaki Proc. CODAS'96, 1996 | 35 | 1996 |
| Approximation algorithms for the sex-equal stable marriage problem K Iwama, S Miyazaki, H Yanagisawa ACM Transactions on Algorithms (TALG) 7 (1), 1-17, 2010 | 34 | 2010 |
| A ()-approximation algorithm for the stable marriage problem K Iwama, S Miyazaki, N Yamauchi Algorithmica 51 (3), 342-356, 2008 | 32 | 2008 |
| On the advice complexity of online bipartite matching and online stable marriage S Miyazaki Information Processing Letters 114 (12), 714-717, 2014 | 30 | 2014 |
| The online graph exploration problem on restricted graphs S Miyazaki, N Morimoto, Y Okabe IEICE transactions on information and systems 92 (9), 1620-1627, 2009 | 30 | 2009 |
| Improved approximation of the stable marriage problem MM Halldórsson, K Iwama, S Miyazaki, H Yanagisawa European Symposium on Algorithms, 266-277, 2003 | 30 | 2003 |
Yasuo OkabeKyoto UniversityVerified email at i.kyoto-u.ac.jp
