| 2025 | ISAAC | Minimum Partition of Polygons Under Width and Cut Constraints. | Jaehoon Chung, Kazuo Iwama, Chung-Shou Liao, Hee-Kap Ahn |
| 2022 | ISAAC | Improving the Bounds of the Online Dynamic Power Management Problem. | Ya-Chun Liang, Kazuo Iwama, Chung-Shou Liao |
| 2021 | ISAAC | Tight Competitive Analyses of Online Car-Sharing Problems. | Ya-Chun Liang, Kuan-Yun Lai, Ho-Lin Chen, Kazuo Iwama |
| 2017 | WADS | Improved Average Complexity for Comparison-Based Sorting. | Kazuo Iwama, Junichi Teruyama |
| 2014 | STACS | Read-Once Branching Programs for Tree Evaluation Problems. | Kazuo Iwama, Atsuki Nagao |
| 2013 | COCOA | Online Bin Packing with (1, 1) and (2, R) Bins. | Jing Chen, Xin Han, Kazuo Iwama, Hing-Fung Ting |
| 2013 | ISAAC | The Train Delivery Problem Revisited. | Jing Chen, He Guo, Xin Han, Kazuo Iwama |
| 2012 | DLT | Recovering Strings in Oracles: Quantum and Classic. | Kazuo Iwama |
| 2012 | WALCOM | Approximability of Stable Matching Problems. | Kazuo Iwama |
| 2011 | ESA | The Hospitals/Residents Problem with Quota Lower Bounds. | Koki Hamada, Kazuo Iwama, Shuichi Miyazaki |
| 2011 | ISAAC | Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs. | David Avis, Kazuo Iwama, Daichi Paku |
| 2011 | TAMC | Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects. | Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa |
| 2010 | ESA | A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties. | Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa |
| 2010 | ISAAC | Quantum Counterfeit Coin Problems. | Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama |
| 2010 | ISAAC | Improved Randomized Algorithms for 3-SAT. | Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki |
| 2008 | COCOON | Average-Case Competitive Analyses for One-Way Trading. | Hiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi |
| 2008 | ESA | Randomized Competitive Analysis for Two-Server Problems. | Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara |
| 2008 | ICALP | Polynomial-Time Construction of Linear Network Coding. | Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita |
| 2008 | ISAAC | Quantum Query Complexity of Boolean Functions with Small On-Sets. | Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita |
| 2008 | SAT | SAT, UNSAT and Coloring. | Kazuo Iwama |
| 2007 | AAIM | Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs. | Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas |
| 2007 | AAIM | Strip Packing vs. Bin Packing. | Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang |
| 2007 | ASPDAC | Flow Time Minimization under Energy Constraints. | Jian-Jia Chen, Kazuo Iwama, Tei-Wei Kuo, Hsueh-I Lu |
| 2007 | COCOON | Properties of Symmetric Incentive Compatible Auctions. | Xiaotie Deng, Kazuo Iwama, Qi Qi, Aries Wei Sun, Toyotaka Tasaka |
| 2007 | COCOON | An Improved Exact Algorithm for Cubic Graph TSP. | Kazuo Iwama, Takuya Nakashima |
| 2007 | FUN | Drawing Borders Efficiently. | Kazuo Iwama, Eiji Miyano, Hirotaka Ono |
| 2007 | ICALP | Unbounded-Error One-Way Classical and Quantum Communication Complexity. | Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita |
| 2007 | ISAAC | Unbounded-Error Classical and Quantum Communication Complexity. | Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita |
| 2007 | SODA | Harmonic algorithm for 3-dimensional strip packing problem. | Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang |
| 2007 | SODA | A 1.875: approximation algorithm for the stable marriage problem. | Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi |
| 2007 | STACS | Quantum Network Coding. | Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond Harry Putra, Shigeru Yamashita |
| 2007 | WADS | Approximation Algorithms for the Sex-Equal Stable Marriage Problem. | Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa |
| 2007 | WAOA | A Randomized Algorithm for Two Servers in Cross Polytope Spaces. | Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec |
| 2006 | ISAAC | Finite-State Online Algorithms and Their Automated Competitive Analysis. | Takashi Horiyama, Kazuo Iwama, Jun Kawahara |
| 2006 | ISAAC | Stable Matching Problems. | Kazuo Iwama |
| 2006 | ISAAC | Negation-Limited Complexity of Parity and Inverters. | Kazuo Iwama, Hiroki Morizumi, Jun Tarui |
| 2006 | ISIT | (4, 1)-Quantum Random Access Coding Does Not Exist. | Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita |
| 2006 | MFCS | Reductions for Monotone Boolean Circuits. | Kazuo Iwama, Hiroki Morizumi |
| 2005 | ESA | Linear-Time Enumeration of Isolated Cliques. | Hiro Ito, Kazuo Iwama, Tsuyoshi Osumi |
| 2005 | FCT | The Delayed | Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga |
| 2005 | ISAAC | A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem. | Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi |
| 2005 | SODA | Approximating vertex cover on dense graphs. | Tomokazu Imamura, Kazuo Iwama |
| 2005 | WADS | Max-stretch Reduction for Tree Spanners. | Kazuo Iwama, Andrzej Lingas, Masaki Okita |
| 2005 | WAOA | Online Removable Square Packing. | Xin Han, Kazuo Iwama, Guochuan Zhang |
| 2004 | COCOON | Approximated Vertex Cover for Graphs with Perfect Matchings. | Tomokazu Imamura, Kazuo Iwama, Tatsuie Tsukiji |
| 2004 | ISAAC | Approximated Two Choices in Randomized Load Balancing. | Kazuo Iwama, Akinori Kawachi |
| 2004 | SODA | Improved upper bounds for 3-SAT. | Kazuo Iwama, Suguru Tamaki |
| 2004 | STACS | Quantum Identification of Boolean Oracles. | Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda, Raymond H. Putra, Shigeru Yamashita |
| 2003 | COCOON | Randomized Approximation of the Stable Marriage Problem. | Magns M. Halldrsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa |
| 2003 | COCOON | Quantum Sampling for Balanced Allocations. | Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita |
| 2003 | ESA | Improved Approximation of the Stable Marriage Problem. | Magns M. Halldrsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa |
| 2003 | SAT | Density Condensation of Boolean Formulas. | Youichi Hanatani, Takashi Horiyama, Kazuo Iwama |
| 2003 | SIROCCO | Polynomial-Time Computable Backup Tables for Shortest-Path Routing. | Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro |
| 2002 | DAC | Transformation rules for designing CNOT-based quantum circuits. | Kazuo Iwama, Yahiko Kambayashi, Shigeru Yamashita |
| 2002 | ICALP | Removable Online Knapsack Problems. | Kazuo Iwama, Shiro Taketomi |
| 2002 | ISAAC | Average-Case Competitive Analyses for Ski-Rental Problems. | Hiroshi Fujiwara, Kazuo Iwama |
| 2002 | LATIN | Inapproximability Results on Stable Marriage Problems. | Magns M. Halldrsson, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita |
| 2002 | MFCS | An Explicit Lower Bound of 5n - o(n) for Boolean Circuits. | Kazuo Iwama, Hiroki Morizumi |
| 2002 | PODC | Compact routing for average-case networks. | Kazuo Iwama, Masaki Okita |
| 2002 | SIROCCO | Avoiding Routing Loops on the Internet. | Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro |
| 2001 | COCOON | Separating Oblivious and Non-oblivious BPs. | Kazuo Iwama, Yasuo Okabe, Toshiro Takase |
| 2000 | COCOON | Online Independent Sets. | Magns M. Halldrsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi |
| 2000 | ISAAC | Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. | Takao Asano, Magns M. Halldrsson, Kazuo Iwama, Takeshi Matsuda |
| 2000 | MFCS | A Family of NFA's Which Need 2 | Kazuo Iwama, Akihiro Matsuura, Mike Paterson |
| 2000 | PODC | Compact routing with stretch factor of less than three (brief announcement). | Kazuo Iwama, Akinori Kawachi |
| 2000 | SPAA | A (2.954 epsilon)n oblivious routing algorithm on 2D meshes. | Kazuo Iwama, Eiji Miyano |
| 1999 | COCOON | Using Generalized Forecasts for Online Currency Conversion. | Kazuo Iwama, Kouki Yonezawa |
| 1999 | ESA | Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing. | Kazuo Iwama, Eiji Miyano |
| 1999 | ICALP | Stable Marriage with Incomplete Lists and Ties. | Kazuo Iwama, David F. Manlove, Shuichi Miyazaki, Yasufumi Morita |
| 1999 | ISAAC | Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle. | Kazuo Iwama, Shuichi Miyazaki |
| 1999 | SODA | An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size. | Kazuo Iwama, Eiji Miyano |
| 1999 | STOC | Undecidability on Quantum Finite Automata. | Masami Amano, Kazuo Iwama |
| 1998 | COCOON | Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. | Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki |
| 1998 | ESA | New Bounds for Oblivious Mesh Routing. | Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano |
| 1998 | MFCS | Improved Time and Space Hierarchies of One-Tape Off-Line TMs. | Kazuo Iwama, Chuzo Iwamoto |
| 1998 | MFCS | Optimizing OBDDs Is Still Intractable for Monotone Functions. | Kazuo Iwama, Mitsushi Nouzoe, Shuzo Yajima |
| 1997 | AAAI | Local Search Algorithms for Partial MAXSAT. | Byungki Cha, Kazuo Iwama, Yahiko Kambayashi, Shuichi Miyazaki |
| 1997 | DATE | Random benchmark circuits with controlled attributes. | Kazuo Iwama, Kensuke Hino, Hiroyuki Kurokawa, Sunao Sawada |
| 1997 | DLT | Tight Bounds on the Number of States of DFA's That Are Equivalent to n-state NFA's. | Kazuo Iwama, Kazuya Takaki |
| 1997 | ESA | Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing. | Kazuo Iwama, Eiji Miyano |
| 1997 | MFCS | Complexity of Finding Short Resolution Proofs. | Kazuo Iwama |
| 1996 | AAAI | Adding New Clauses for Faster Local Search. | Byungki Cha, Kazuo Iwama |
| 1995 | COCOON | Approximation of coNP Sets by NP-complete Sets. | Kazuo Iwama, Shuichi Miyazaki |
| 1995 | IJCAI | Performance Test of Local Search Algorithms Using New Types of Random CNF Formulas. | Byungki Cha, Kazuo Iwama |
| 1995 | ISAAC | Finding Dense Subgraphs. | Yuichi Asahiro, Kazuo Iwama |
| 1994 | DAC | Random Generation of Test Instances for Logic Optimizers. | Kazuo Iwama, Kensuke Hino |
| 1994 | ISAAC | Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity. | Chuzo Iwamoto, Kazuo Iwama |
| 1993 | DLT | Low-Level Tradeoffs between Reversals and Alternations. | Kazuo Iwama |
| 1992 | ISAAC | Routing Problems on the Mesh of Buses. | Kazuo Iwama, Eiji Miyano |
| 1983 | STOC | Unique Decomposability of Shuffled Strings: A Formal Treatment of Asynchronous Time-Multiplexed Communication | Kazuo Iwama |
| 1982 | FOCS | On Equations Including String Variables | Kazuo Iwama |