Kazuo Iwama

263 papers A* 16A 15B 37C 8Misc 12Journal 129Unranked 37
YearRankTypeTitle / Venue / Authors
2025 B conf
Minimum Partition of Polygons Under Width and Cut Constraints.
ISAAC
Jaehoon Chung, Kazuo Iwama, Chung-Shou Liao, Hee-Kap Ahn
2025 J jnl
Minimum Partition of Polygons under Width and Cut Constraints.
CoRR
Jaehoon Chung, Kazuo Iwama, Chung-Shou Liao, Hee-Kap Ahn
2023 J jnl
Marriage and Roommate.
CoRR
Kazuo Iwama, Shuichi Miyazaki
2023 J jnl
Marriage and Roommate.
Int. J. Found. Comput. Sci.
Kazuo Iwama, Shuichi Miyazaki
2022 J jnl
Bounded Hanoi.
Am. Math. Mon.
Kazuo Iwama, Mike Paterson
2022 B conf
Improving the Bounds of the Online Dynamic Power Management Problem.
ISAAC
Ya-Chun Liang, Kazuo Iwama, Chung-Shou Liao
2022 J jnl
Improving the Bounds of the Online Dynamic Power Management Problem.
CoRR
Ya-Chun Liang, Kazuo Iwama, Chung-Shou Liao
2022 J jnl
Tight competitive analyses of online car-sharing problems.
Theor. Comput. Sci.
Ya-Chun Liang, Kuan-Yun Lai, Ho-Lin Chen, Kazuo Iwama, Chung-Shou Liao
2021 J jnl
Letter from the Bulletin Editor.
Bull. EATCS
Kazuo Iwama
2021 J jnl
Randomized Scheduling for the Online Car-sharing Problem.
CoRR
Kuan-Yun Lai, Ya-Chun Liang, Ho-Lin Chen, Kazuo Iwama, Chung-Shou Liao
2021 B conf
Tight Competitive Analyses of Online Car-Sharing Problems.
ISAAC
Ya-Chun Liang, Kuan-Yun Lai, Ho-Lin Chen, Kazuo Iwama
2020 J jnl
Improved average complexity for comparison-based sorting.
Theor. Comput. Sci.
Kazuo Iwama, Junichi Teruyama
2020 J jnl
Letter from the Bulletin Editor.
Bull. EATCS
Kazuo Iwama
2020 J jnl
Letter from the Bulletin Editor.
Bull. EATCS
Kazuo Iwama
2020 J jnl
Letter from the Editor.
Bull. EATCS
Kazuo Iwama
2019 J jnl
Letter from the Editor.
Bull. EATCS
Kazuo Iwama
2019 J jnl
Letter from the Editor.
Bull. EATCS
Kazuo Iwama
2019 J jnl
Letter from the Editor.
Bull. EATCS
Kazuo Iwama
2019 J jnl
Read-Once Branching Programs for Tree Evaluation Problems.
ACM Trans. Comput. Theory
Kazuo Iwama, Atsuki Nagao
2018 J jnl
Letter from the Bulletin Editor.
Bull. EATCS
Kazuo Iwama
2018 J jnl
Letter from the Bulletin Editor.
Bull. EATCS
Kazuo Iwama
2018 J jnl
Letter from the Editor.
Bull. EATCS
Kazuo Iwama
2018 J jnl
Parameterized Testability.
ACM Trans. Comput. Theory
Kazuo Iwama, Yuichi Yoshida
2018 J jnl
Reconstructing Strings from Substrings: Optimal Randomized and Average-Case Algorithms.
CoRR
Kazuo Iwama, Junichi Teruyama, Shuntaro Tsuyama
2018 — conf
Small Complexity Gaps for Comparison-Based Sorting.
Adventures Between Lower Bounds and Higher Altitudes
Shogo Ehara, Kazuo Iwama, Junichi Teruyama
2017 B conf
Improved Average Complexity for Comparison-Based Sorting.
WADS
Kazuo Iwama, Junichi Teruyama
2017 J jnl
Improved Average Complexity for Comparison-Based Sorting.
CoRR
Kazuo Iwama, Junichi Teruyama
2017 J jnl
Letter from the Bulletin Editor.
Bull. EATCS
Kazuo Iwama
2017 J jnl
Letter from the Bulletin Editor.
Bull. EATCS
Kazuo Iwama
2017 J jnl
Letter from the Bulletin Editor.
Bull. EATCS
Kazuo Iwama
2017 J jnl
Twenty Lectures on Algorithmic Game Theory.
Bull. EATCS
Tim Roughgarden, Kazuo Iwama
2016 J jnl
Approximate strip packing: Revisited.
Inf. Comput.
Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang
2016 — ch.
Exact Algorithms for
Encyclopedia of Algorithms
Kazuo Iwama
2016 J jnl
Letter from the Bulletin Editor.
Bull. EATCS
Kazuo Iwama
2016 J jnl
Letter from the Bulletin Editor.
Bull. EATCS
Kazuo Iwama
2016 J jnl
Letter from the Bulletin Editor.
Bull. EATCS
Kazuo Iwama
2016 J jnl
Preface.
Balt. J. Mod. Comput.
Juris Borzovs, Kazuo Iwama, Solvita Zarina
2016 J jnl
Quantum Query Complexity of Almost All Functions with Fixed On-set Size.
Comput. Complex.
Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita
2016 — ch.
Stable Marriage with Ties and Incomplete Lists.
Encyclopedia of Algorithms
Kazuo Iwama, Shuichi Miyazaki
2016 J jnl
The Hospitals/Residents Problem with Lower Quotas.
Algorithmica
Koki Hamada, Kazuo Iwama, Shuichi Miyazaki
2016 — conf
Total Stability in Stable Matching Games.
SWAT
Sushmita Gupta, Kazuo Iwama, Shuichi Miyazaki
2015 — conf
A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties.
APPROX-RANDOM
Chien-Chung Huang, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
2015 — ed.
Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I
ICALP (1)
Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann
2015 — ed.
Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II
ICALP (2)
Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann
2015 J jnl
Finding Witnesses for Stability in the Hospitals/Residents Problem.
J. Inf. Process.
Minseon Lee, Shuichi Miyazaki, Kazuo Iwama
2015 J jnl
Letter from the Bulletin Editor.
Bull. EATCS
Kazuo Iwama
2015 J jnl
Letter from the Bulletin Editor.
Bull. EATCS
Kazuo Iwama
2015 J jnl
Letter from the Bulletin Editor.
Bull. EATCS
Kazuo Iwama
2015 J jnl
Online bin packing with (1, 1) and (2, R) bins.
J. Comb. Optim.
Jing Chen, Xin Han, Kazuo Iwama, Hing-Fung Ting
2015 J jnl
Stable Nash Equilibria in the Gale-Shapley Matching Game.
CoRR
Sushmita Gupta, Kazuo Iwama, Shuichi Miyazaki
2014 J jnl
A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties.
Algorithmica
Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
2014 — ed.
Computing with New Resources - Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday
Computing with New Resources
Cristian S. Calude, Rusins Freivalds, Kazuo Iwama
2014 J jnl
Correction: Pareto Optimization or Cascaded Weighted Sum: A Comparison of Concepts.
Algorithms
Kazuo Iwama
2014 J jnl
Letter from the Bulletin Editor.
Bull. EATCS
Kazuo Iwama
2014 J jnl
Letter from the Bulletin Editor.
Bull. EATCS
Kazuo Iwama
2014 J jnl
Letter from the Bulletin Editor.
Bull. EATCS
Kazuo Iwama
2014 A conf
Parameterized testability.
ITCS
Kazuo Iwama, Yuichi Yoshida
2014 A conf
Read-Once Branching Programs for Tree Evaluation Problems.
STACS
Kazuo Iwama, Atsuki Nagao
2014 J jnl
Reputation games for undirected graphs.
Discret. Appl. Math.
David Avis, Kazuo Iwama, Daichi Paku
2013 J jnl
A Harmonic Algorithm for the 3D Strip Packing Problem.
SIAM J. Comput.
Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang
2013 J jnl
Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists.
Algorithms
Takao Inoshita, Robert W. Irving, Kazuo Iwama, Shuichi Miyazaki, Takashi Nagase
2013 J jnl
Letter from the Bulletin Editor.
Bull. EATCS
Kazuo Iwama
2013 C conf
Online Bin Packing with (1, 1) and (2, R) Bins.
COCOA
Jing Chen, Xin Han, Kazuo Iwama, Hing-Fung Ting
2013 J jnl
Parameterized Complexity and the Understanding, Design, and Analysis of Heuristics (NII Shonan Meeting 2013-2).
NII Shonan Meet. Rep.
Gregory Z. Gutin, Kazuo Iwama, Dimitrios M. Thilikos
2013 J jnl
Recovering Strings in Oracles: Quantum and Classic.
Int. J. Found. Comput. Sci.
Kazuo Iwama, Harumichi Nishimura
2013 B conf
The Train Delivery Problem Revisited.
ISAAC
Jing Chen, He Guo, Xin Han, Kazuo Iwama
2013 — ed.
Theory of Quantum Computation, Communication, and Cryptography, 7th Conference, TQC 2012, Tokyo, Japan, May 17-19, 2012, Revised Selected Papers
TCQ
Kazuo Iwama, Yasuhito Kawano, Mio Murao
2012 B conf
Approximability of Stable Matching Problems.
WALCOM
Kazuo Iwama
2012 J jnl
Improved approximation bounds for the Student-Project Allocation problem with preferences over projects.
J. Discrete Algorithms
Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
2012 J jnl
Quantum counterfeit coin problems.
Theor. Comput. Sci.
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama
2012 J jnl
Reconstructing Strings from Substrings with Quantum Queries
CoRR
Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita
2012 — conf
Reconstructing Strings from Substrings with Quantum Queries.
SWAT
Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita
2012 C conf
Recovering Strings in Oracles: Quantum and Classic.
Developments in Language Theory
Kazuo Iwama
2012 J jnl
Reputation Games for Undirected Graphs
CoRR
David Avis, Kazuo Iwama, Daichi Paku
2011 J jnl
A randomized algorithm for two servers in cross polytope spaces.
Theor. Comput. Sci.
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec
2011 J jnl
Average-case competitive analyses for one-way trading.
J. Comb. Optim.
Hiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi
2011 C conf
Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects.
TAMC
Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
2011 A conf
The Hospitals/Residents Problem with Quota Lower Bounds.
ESA
Koki Hamada, Kazuo Iwama, Shuichi Miyazaki
2011 B conf
Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs.
ISAAC
David Avis, Kazuo Iwama, Daichi Paku
2010 — conf
A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties.
ESA (2)
Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
2010 J jnl
Approximation algorithms for the sex-equal stable marriage problem.
ACM Trans. Algorithms
Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
2010 — conf
Averaging Techniques for Competitive Auctions.
ANALCO
Takayuki Ichiba, Kazuo Iwama
2010 J jnl
Guest Editorial: Special Issue on Matching Under Preferences.
Algorithmica
David F. Manlove, Robert W. Irving, Kazuo Iwama
2010 — conf
Improved Randomized Algorithms for 3-SAT.
ISAAC (1)
Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki
2010 J jnl
Online knapsack with resource augmentation.
Inf. Process. Lett.
Kazuo Iwama, Guochuan Zhang
2010 J jnl
Quantum Counterfeit Coin Problems
CoRR
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama
2010 — conf
Quantum Counterfeit Coin Problems.
ISAAC (1)
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama
2010 J jnl
The Planar Hajós Calculus for Bounded Degree Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki
2010 J jnl
The complexity of the Hajós calculus for planar graphs.
Theor. Comput. Sci.
Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki
2009 J jnl
An improved approximation lower bound for finding almost stable maximum matchings.
Inf. Process. Lett.
Koki Hamada, Kazuo Iwama, Shuichi Miyazaki
2009 J jnl
Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size
CoRR
Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita
2009 J jnl
Drawing Borders Efficiently.
Theory Comput. Syst.
Kazuo Iwama, Eiji Miyano, Hirotaka Ono
2009 J jnl
Enumeration of isolated cliques and pseudo-cliques.
ACM Trans. Algorithms
Hiro Ito, Kazuo Iwama
2009 J jnl
Negation-Limited Complexity of Parity and Inverters.
Algorithmica
Kazuo Iwama, Hiroki Morizumi, Jun Tarui
2009 C conf
Quantum Queries on Permutations with a Promise.
CIAA
Rusins Freivalds, Kazuo Iwama
2008 — conf
08431 Abstracts Collection - Moderately Exponential Time Algorithms.
Moderately Exponential Time Algorithms
Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch
2008 — conf
08431 Executive Summary - Moderately Exponential Time Algorithms.
Moderately Exponential Time Algorithms
Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch
2008 — conf
08431 Open Problems - Moderately Exponential Time Algorithms.
Moderately Exponential Time Algorithms
Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch, Petteri Kaski, Mikko Koivisto, Lukasz Kowalik, Yoshio Okamoto, Johan M. M. van Rooij, Ryan Williams
2008 J jnl
A (2-
Algorithmica
Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi
2008 Misc conf
Average-Case Competitive Analyses for One-Way Trading.
COCOON
Hiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi
2008 J jnl
Editor's Foreword.
Algorithms
Kazuo Iwama
2008 — ch.
Local Search Algorithms for kSAT.
Encyclopedia of Algorithms
Kazuo Iwama
2008 J jnl
Max-Stretch Reduction for Tree Spanners.
Algorithmica
Kazuo Iwama, Andrzej Lingas, Masaki Okita
2008 — ed.
Moderately Exponential Time Algorithms, 19.10. - 24.10.2008
Moderately Exponential Time Algorithms
Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch
2008 J jnl
New Graph Calculi for Planar Non-3-Colorable Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Youichi Hanatani, Takashi Horiyama, Kazuo Iwama, Suguru Tamaki
2008 J jnl
On Two Dimensional Orthogonal Knapsack Problem
CoRR
Xin Han, Kazuo Iwama, Guochuan Zhang
2008 J jnl
Online Removable Square Packing.
Theory Comput. Syst.
Xin Han, Kazuo Iwama, Guochuan Zhang
2008 J jnl
Online chasing problems for regular polygons.
Inf. Process. Lett.
Hiroshi Fujiwara, Kazuo Iwama, Kouki Yonezawa
2008 — conf
Polynomial-Time Construction of Linear Network Coding.
ICALP (1)
Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita
2008 B conf
Quantum Query Complexity of Boolean Functions with Small On-Sets.
ISAAC
Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita
2008 J jnl
Randomized Competitive Analysis for Two Server Problems.
Algorithms
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara
2008 A conf
Randomized Competitive Analysis for Two-Server Problems.
ESA
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara
2008 J jnl
Reductions for monotone Boolean circuits.
Theor. Comput. Sci.
Kazuo Iwama, Hiroki Morizumi, Jun Tarui
2008 A conf
SAT, UNSAT and Coloring.
SAT
Kazuo Iwama
2008 — ch.
Stable Marriage with Ties and Incomplete Lists.
Encyclopedia of Algorithms
Kazuo Iwama, Shuichi Miyazaki
2008 J jnl
The Complexity of the Hajos Calculus for Planar Graphs.
Electron. Colloquium Comput. Complex.
Kazuo Iwama, Suguru Tamaki
2007 A* conf
A 1.875: approximation algorithm for the stable marriage problem.
SODA
Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi
2007 B conf
A Randomized Algorithm for Two Servers in Cross Polytope Spaces.
WAOA
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec
2007 Misc conf
An Improved Exact Algorithm for Cubic Graph TSP.
COCOON
Kazuo Iwama, Takuya Nakashima
2007 C conf
Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs.
AAIM
Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas
2007 B conf
Approximation Algorithms for the Sex-Equal Stable Marriage Problem.
WADS
Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
2007 Misc conf
Drawing Borders Efficiently.
FUN
Kazuo Iwama, Eiji Miyano, Hirotaka Ono
2007 J jnl
Exploiting partial knowledge of satisfying assignments.
Discret. Appl. Math.
Kazuo Iwama, Suguru Tamaki
2007 — conf
Flow Time Minimization under Energy Constraints.
ASP-DAC
Jian-Jia Chen, Kazuo Iwama, Tei-Wei Kuo, Hsueh-I Lu
2007 A* conf
Harmonic algorithm for 3-dimensional strip packing problem.
SODA
Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang
2007 J jnl
Improved algorithms for quantum identification of Boolean oracles.
Theor. Comput. Sci.
Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond, Shigeru Yamashita
2007 J jnl
Improved approximation results for the stable marriage problem.
ACM Trans. Algorithms
Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
2007 — conf
Online Chasing Problems for Regular n-Gons.
RIVF
Hiroshi Fujiwara, Kazuo Iwama, Kouki Yonezawa
2007 — conf
Optimal Resource Augmentations for Online Knapsack.
APPROX-RANDOM
Kazuo Iwama, Guochuan Zhang
2007 Misc conf
Properties of Symmetric Incentive Compatible Auctions.
COCOON
Xiaotie Deng, Kazuo Iwama, Qi Qi, Aries Wei Sun, Toyotaka Tasaka
2007 A conf
Quantum Network Coding.
STACS
Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond Harry Putra, Shigeru Yamashita
2007 C conf
Strip Packing vs. Bin Packing.
AAIM
Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang
2007 B conf
Unbounded-Error Classical and Quantum Communication Complexity.
ISAAC
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
2007 A* conf
Unbounded-Error One-Way Classical and Quantum Communication Complexity.
ICALP
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
2006 B conf
(4, 1)-Quantum Random Access Coding Does Not Exist.
ISIT
Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
2006 J jnl
A (2 -
IEICE Trans. Inf. Syst.
Kazuo Iwama, Shuichi Miyazaki, Kazuya Okamoto
2006 J jnl
Approximated Vertex Cover for Graphs with Perfect Matchings.
IEICE Trans. Inf. Syst.
Tomokazu Imamura, Kazuo Iwama, Tatsuie Tsukiji
2006 — conf
Classic and Quantum Network Coding.
SWAT
Kazuo Iwama
2006 J jnl
Density condensation of Boolean formulas.
Discret. Appl. Math.
Youichi Hanatani, Takashi Horiyama, Kazuo Iwama
2006 J jnl
Efficient Methods for Determining DNA Probe Orders.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Hiro Ito, Kazuo Iwama, Takeyuki Tamura
2006 B conf
Finite-State Online Algorithms and Their Automated Competitive Analysis.
ISAAC
Takashi Horiyama, Kazuo Iwama, Jun Kawahara
2006 — conf
Improved Algorithms for Quantum Identification of Boolean Oracles.
SWAT
Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond Harry Putra, Shigeru Yamashita
2006 B conf
Negation-Limited Complexity of Parity and Inverters.
ISAAC
Kazuo Iwama, Hiroki Morizumi, Jun Tarui
2006 J jnl
New Upper Bounds on The Approximability of 3D Strip Packing
CoRR
Xin Han, Kazuo Iwama, Guochuan Zhang
2006 J jnl
Quantum Biased Oracles.
Inf. Media Technol.
Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita
2006 — conf
Quantum Network Coding.
Complexity of Boolean Functions
Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
2006 J jnl
Quantum lower bounds for the Goldreich-Levin problem.
Inf. Process. Lett.
Mark Adcock, Richard Cleve, Kazuo Iwama, Raymond H. Putra, Shigeru Yamashita
2006 B conf
Reductions for Monotone Boolean Circuits.
MFCS
Kazuo Iwama, Hiroki Morizumi
2006 B conf
Stable Matching Problems.
ISAAC
Kazuo Iwama
2006 J jnl
Strip Packing vs. Bin Packing
CoRR
Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang
2006 J jnl
Strip Packing vs. Bin Packing.
Electron. Colloquium Comput. Complex.
Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang
2005 B conf
A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem.
ISAAC
Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi
2005 A* conf
Approximating vertex cover on dense graphs.
SODA
Tomokazu Imamura, Kazuo Iwama
2005 — conf
Average-Case Competitive Analyses for Ski-Rental Problems.
Algorithms for Optimization with Incomplete Information
Hiroshi Fujiwara, Kazuo Iwama
2005 J jnl
Average-Case Competitive Analyses for Ski-Rental Problems.
Algorithmica
Hiroshi Fujiwara, Kazuo Iwama
2005 — conf
Classic and Quantum Network Coding.
ISPAN
Kazuo Iwama
2005 J jnl
Compact Routing with Stretch Factor of Less Than Three.
IEICE Trans. Inf. Syst.
Kazuo Iwama, Akinori Kawachi
2005 A conf
Linear-Time Enumeration of Isolated Cliques.
ESA
Hiro Ito, Kazuo Iwama, Tsuyoshi Osumi
2005 B conf
Max-stretch Reduction for Tree Spanners.
WADS
Kazuo Iwama, Andrzej Lingas, Masaki Okita
2005 B conf
Online Removable Square Packing.
WAOA
Xin Han, Kazuo Iwama, Guochuan Zhang
2005 J jnl
Quantum Sampling for Balanced Allocations.
IEICE Trans. Inf. Syst.
Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita
2005 J jnl
Single backup table schemes for shortest-path routing.
Theor. Comput. Sci.
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro
2005 B conf
The Delayed
FCT
Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga
2004 — conf
A (2-c(log N/N))-Approximation Algorithm for the Stable Marriage Problem.
SWAT
Kazuo Iwama, Shuichi Miyazaki, Kazuya Okamoto
2004 B conf
Approximated Two Choices in Randomized Load Balancing.
ISAAC
Kazuo Iwama, Akinori Kawachi
2004 Misc conf
Approximated Vertex Cover for Graphs with Perfect Matchings.
COCOON
Tomokazu Imamura, Kazuo Iwama, Tatsuie Tsukiji
2004 — conf
Imperfectness of Data for STS-Based Physical Mapping.
IFIP TCS
Hiro Ito, Kazuo Iwama, Takeyuki Tamura
2004 A* conf
Improved upper bounds for 3-SAT.
SODA
Kazuo Iwama, Suguru Tamaki
2004 J jnl
Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs.
J. Parallel Distributed Comput.
Toshiyuki Fujiwara, Kazuo Iwama, Chuzo Iwamoto
2004 A conf
Quantum Identification of Boolean Oracles.
STACS
Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda, Raymond H. Putra, Shigeru Yamashita
2004 J jnl
Randomized approximation of the stable marriage problem.
Theor. Comput. Sci.
Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
2004 J jnl
The orthogonal CNN problem.
Inf. Process. Lett.
Kazuo Iwama, Kouki Yonezawa
2004 J jnl
Worst-Case Upper Bounds for kSAT (Column: Algorithmics).
Bull. EATCS
Kazuo Iwama
2003 J jnl
A New Quantum Claw-finding Algorithm for Three Functions.
New Gener. Comput.
Kazuo Iwama, Akinori Kawachi
2003 J jnl
A family of NFAs which need 2n- deterministic states.
Theor. Comput. Sci.
Kazuo Iwama, Akihiro Matsuura, Mike Paterson
2003 J jnl
Approximability results for stable marriage problems with ties.
Theor. Comput. Sci.
Magnús M. Halldórsson, Robert W. Irving, Kazuo Iwama, David F. Manlove, Shuichi Miyazaki, Yasufumi Morita, Sandy Scott
2003 J jnl
Avoiding Routing Loops on the Internet.
Theory Comput. Syst.
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro
2003 A conf
Compact Routing for Flat Networks.
DISC
Kazuo Iwama, Masaki Okita
2003 A conf
Density Condensation of Boolean Formulas.
SAT
Youichi Hanatani, Takashi Horiyama, Kazuo Iwama
2003 A conf
Improved Approximation of the Stable Marriage Problem.
ESA
Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
2003 J jnl
Improved Upper Bounds for 3-SAT
Electron. Colloquium Comput. Complex.
Kazuo Iwama, Suguru Tamaki
2003 J jnl
Inclusion-exclusion for k-CNF formulas.
Inf. Process. Lett.
Kazuyuki Amano, Kazuo Iwama, Akira Maruoka, Kenshi Matsuo, Akihiro Matsuura
2003 B conf
Polynomial-Time Computable Backup Tables for Shortest-Path Routing.
SIROCCO
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro
2003 Misc conf
Quantum Sampling for Balanced Allocations.
COCOON
Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita
2003 Misc conf
Randomized Approximation of the Stable Marriage Problem.
COCOON
Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
2003 J jnl
Transformation Rules for CNOT-based Quantum Circuits and Their Applications.
New Gener. Comput.
Kazuo Iwama, Shigeru Yamashita
2002 B conf
An Explicit Lower Bound of 5n - o(n) for Boolean Circuits.
MFCS
Kazuo Iwama, Hiroki Morizumi
2002 B conf
Average-Case Competitive Analyses for Ski-Rental Problems.
ISAAC
Hiroshi Fujiwara, Kazuo Iwama
2002 B conf
Avoiding Routing Loops on the Internet.
SIROCCO
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro
2002 A* conf
Compact routing for average-case networks.
PODC
Kazuo Iwama, Masaki Okita
2002 J jnl
Complexity of finding dense subgraphs.
Discret. Appl. Math.
Yuichi Asahiro, Refael Hassin, Kazuo Iwama
2002 — conf
Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations.
UMC
Masami Amano, Kazuo Iwama, Raymond H. Putra
2002 J jnl
Hard variants of stable marriage.
Theor. Comput. Sci.
David F. Manlove, Robert W. Irving, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita
2002 B conf
Inapproximability Results on Stable Marriage Problems.
LATIN
Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita
2002 J jnl
Online independent sets.
Theor. Comput. Sci.
Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi
2002 J jnl
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM.
ACM J. Exp. Algorithmics
Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto
2002 A* conf
Removable Online Knapsack Problems.
ICALP
Kazuo Iwama, Shiro Taketomi
2002 A* conf
Transformation rules for designing CNOT-based quantum circuits.
DAC
Kazuo Iwama, Yahiko Kambayashi, Shigeru Yamashita
2001 J jnl
A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes.
J. Algorithms
Kazuo Iwama, Eiji Miyano
2001 J jnl
An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size.
J. Algorithms
Kazuo Iwama, Eiji Miyano
2001 J jnl
Efficient randomized routing algorithms on the two-dimensional mesh of buses.
Theor. Comput. Sci.
Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki
2001 — conf
Exploiting Partial Knowledge of Satisfying Assignments.
WAE
Kazuo Iwama, Suguru Tamaki
2001 J jnl
New Bounds for Oblivious Mesh Routing.
J. Graph Algorithms Appl.
Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
2001 Misc conf
Separating Oblivious and Non-oblivious BPs.
COCOON
Kazuo Iwama, Yasuo Okabe, Toshiro Takase
2000 B conf
A (2.954 epsilon)n oblivious routing algorithm on 2D meshes.
SPAA
Kazuo Iwama, Eiji Miyano
2000 B conf
A Family of NFA's Which Need 2
MFCS
Kazuo Iwama, Akihiro Matsuura, Mike Paterson
2000 B conf
Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits.
ISAAC
Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda
2000 A* conf
Compact routing with stretch factor of less than three (brief announcement).
PODC
Kazuo Iwama, Akinori Kawachi
2000 J jnl
Greedily Finding a Dense Subgraph.
J. Algorithms
Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama
2000 J jnl
Oblivious Routing Algorithms on the Mesh of Buses.
J. Parallel Distributed Comput.
Kazuo Iwama, Eiji Miyano
2000 Misc conf
Online Independent Sets.
COCOON
Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi
2000 — conf
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM.
WAE
Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto
2000 J jnl
Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs.
Theor. Comput. Sci.
Kazuo Iwama, Yahiko Kambayashi, Kazuya Takaki
1999 A* conf
An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size.
SODA
Kazuo Iwama, Eiji Miyano
1999 J jnl
Approximation of coNP sets by NP-complete sets and its applications.
Syst. Comput. Jpn.
Shuichi Miyazaki, Kazuo Iwama
1999 A conf
Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing.
ESA
Kazuo Iwama, Eiji Miyano
1999 A* conf
Stable Marriage with Incomplete Lists and Ties.
ICALP
Kazuo Iwama, David F. Manlove, Shuichi Miyazaki, Yasufumi Morita
1999 B conf
Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle.
ISAAC
Kazuo Iwama, Shuichi Miyazaki
1999 A* conf
Undecidability on Quantum Finite Automata.
STOC
Masami Amano, Kazuo Iwama
1999 Misc conf
Using Generalized Forecasts for Online Currency Conversion.
COCOON
Kazuo Iwama, Kouki Yonezawa
1998 J jnl
A Canonical Form of Vector Machines.
Inf. Comput.
Kazuo Iwama, Chuzo Iwamoto
1998 J jnl
Better Approximations of Non-Hamiltonian Graphs.
Discret. Appl. Math.
Kazuo Iwama, Eiji Miyano
1998 Misc conf
Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses.
COCOON
Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki
1998 B conf
Improved Time and Space Hierarchies of One-Tape Off-Line TMs.
MFCS
Kazuo Iwama, Chuzo Iwamoto
1998 A conf
New Bounds for Oblivious Mesh Routing.
ESA
Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
1998 B conf
Optimizing OBDDs Is Still Intractable for Monotone Functions.
MFCS
Kazuo Iwama, Mitsushi Nouzoe, Shuzo Yajima
1997 J jnl
A Faster Parallel Algorithm for k-Connectivity.
Inf. Process. Lett.
Kazuo Iwama, Chuzo Iwamoto, T. Ohsawa
1997 B conf
Complexity of Finding Short Resolution Proofs.
MFCS
Kazuo Iwama
1997 — conf
Local Search Algorithms for Partial MAXSAT.
AAAI/IAAI
Byungki Cha, Kazuo Iwama, Yahiko Kambayashi, Shuichi Miyazaki
1997 — conf
Oblivious Routing Algorithms on the Mesh of Buses.
IPPS
Kazuo Iwama, Eiji Miyano
1997 — conf
Random benchmark circuits with controlled attributes.
ED&TC
Kazuo Iwama, Kensuke Hino, Hiroyuki Kurokawa, Sunao Sawada
1997 A conf
Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing.
ESA
Kazuo Iwama, Eiji Miyano
1997 C conf
Tight Bounds on the Number of States of DFA's That Are Equivalent to n-state NFA's.
Developments in Language Theory
Kazuo Iwama, Kazuya Takaki
1996 — conf
Adding New Clauses for Faster Local Search.
AAAI/IAAI, Vol. 1
Byungki Cha, Kazuo Iwama
1996 — conf
Database Queries as Combinatorial Optimization Problems.
CODAS
Shuichi Miyazaki, Kazuo Iwama, Yahiko Kambayashi
1996 — conf
Greedily Finding a Dense Subgraph.
SWAT
Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama
1996 A conf
Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits.
CCC
Kazuo Iwama, Chuzo Iwamoto
1996 J jnl
Routing Problems on the Mesh of Buses.
J. Algorithms
Kazuo Iwama, Eiji Miyano, Yahiko Kambayashi
1996 — conf
Satisfiability of 3CNF formulas with small clause/variable-ratio.
Satisfiability Problem: Theory and Applications
Kazuo Iwama, Kazuya Takaki
1996 J jnl
Time Lower Bounds do not Exist for CRCW PRAMs.
Theor. Comput. Sci.
Kazuo Iwama, Chuzo Iwamoto, Manzur Morshed
1996 J jnl
alpha-Connectivity: A Gradually Nonparallel Graph Problem.
J. Algorithms
Kazuo Iwama, Chuzo Iwamoto
1995 Misc conf
Approximation of coNP Sets by NP-complete Sets.
COCOON
Kazuo Iwama, Shuichi Miyazaki
1995 J jnl
Exponential Lower Bounds for the Tree-Like Hajós Calculus.
Inf. Process. Lett.
Kazuo Iwama, Toniann Pitassi
1995 B conf
Finding Dense Subgraphs.
ISAAC
Yuichi Asahiro, Kazuo Iwama
1995 — conf
Intractability of Read-Once Resolution.
SCT
Kazuo Iwama, Eiji Miyano
1995 A* conf
Performance Test of Local Search Algorithms Using New Types of Random CNF Formulas.
IJCAI
Byungki Cha, Kazuo Iwama
1994 J jnl
A Simpler Parallel Algorithm for Graph Conectivity.
J. Algorithms
Kazuo Iwama, Yahiko Kambayashi
1994 B conf
Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity.
ISAAC
Chuzo Iwamoto, Kazuo Iwama
1994 A* conf
Random Generation of Test Instances for Logic Optimizers.
DAC
Kazuo Iwama, Kensuke Hino
1994 — conf
SAT-Varible Complexity of Hard Combinatorial Problems.
IFIP Congress (1)
Kazuo Iwama, Shuichi Miyazaki
1993 J jnl
ASPACE(o(log log n)) is Regular.
SIAM J. Comput.
Kazuo Iwama
1993 C conf
Low-Level Tradeoffs between Reversals and Alternations.
Developments in Language Theory
Kazuo Iwama
1993 — conf
Random generation of test instances with controlled attributes.
Cliques, Coloring, and Satisfiability
Yuichi Asahiro, Kazuo Iwama, Eiji Miyano
1993 J jnl
Rs-vector algorithms for combinational problems.
Syst. Comput. Jpn.
Chuzo Iwamoto, Kazuo Iwama
1992 B ed.
Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings
ISAAC
Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita
1992 — conf
Random Generation of Satisfiable and Unsatisfiable CNF Predicates.
IFIP Congress (1)
Kazuo Iwama, Hidetoshi Abeta, Eiji Miyano
1992 B conf
Routing Problems on the Mesh of Buses.
ISAAC
Kazuo Iwama, Eiji Miyano
1989 — conf
An O(log n) Parallel Connectivity Algorithm on the Mesh of Buses.
IFIP Congress
Kazuo Iwama, Yahiko Kambayashi
1989 J jnl
CNF Satisfiability Test by Counting and Polynomial Average Time.
SIAM J. Comput.
Kazuo Iwama
1983 J jnl
The Universe Problem for Unrestricted Flow Languages.
Acta Informatica
Kazuo Iwama
1983 A* conf
Unique Decomposability of Shuffled Strings: A Formal Treatment of Asynchronous Time-Multiplexed Communication
STOC
Kazuo Iwama
1982 A* conf
On Equations Including String Variables
FOCS
Kazuo Iwama
1977 J jnl
Labolink: An Optically Linked Laboratory Computer Network.
Computer
Shuzo Yajima, Yahiko Kambayashi, Susumu Yoshida, Kazuo Iwama