Kazuo Iwama
According to our database^{1},
Kazuo Iwama
authored at least 187 papers
between 1977 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on zbmath.org

on id.loc.gov
On csauthors.net:
Bibliography
2021
CoRR, 2021
2020
Theor. Comput. Sci., 2020
2019
ACM Trans. Comput. Theory, 2019
Bull. EATCS, 2019
2018
ACM Trans. Comput. Theory, 2018
Bull. EATCS, 2018
Reconstructing Strings from Substrings: Optimal Randomized and AverageCase Algorithms.
CoRR, 2018
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018
2017
Bull. EATCS, 2017
2016
Encyclopedia of Algorithms, 2016
Encyclopedia of Algorithms, 2016
Inf. Comput., 2016
Comput. Complex., 2016
Balt. J. Mod. Comput., 2016
Algorithmica, 2016
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016
2015
J. Inf. Process., 2015
J. Comb. Optim., 2015
CoRR, 2015
Proceedings of the Approximation, 2015
2014
Discret. Appl. Math., 2014
Correction: Pareto Optimization or Cascaded Weighted Sum: A Comparison of Concepts. <i>Algorithms </i>2014, <i>7</i>, 166185.
Algorithms, 2014
A 25/17Approximation Algorithm for the Stable Marriage Problem with OneSided Ties.
Algorithmica, 2014
2013
SIAM J. Comput., 2013
Parameterized Complexity and the Understanding, Design, and Analysis of Heuristics (NII Shonan Meeting 20132).
NII Shonan Meet. Rep., 2013
Int. J. Found. Comput. Sci., 2013
Algorithms, 2013
Proceedings of the Algorithms and Computation  24th International Symposium, 2013
2012
Theor. Comput. Sci., 2012
Improved approximation bounds for the StudentProject Allocation problem with preferences over projects.
J. Discrete Algorithms, 2012
Proceedings of the WALCOM: Algorithms and Computation  6th International Workshop, 2012
Proceedings of the Algorithm Theory  SWAT 2012, 2012
Proceedings of the Developments in Language Theory  16th International Conference, 2012
2011
Theor. Comput. Sci., 2011
J. Comb. Optim., 2011
Proceedings of the Algorithms and Computation  22nd International Symposium, 2011
Proceedings of the Algorithms  ESA 2011, 2011
2010
Theor. Comput. Sci., 2010
ACM Trans. Algorithms, 2010
Inf. Process. Lett., 2010
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010
Algorithmica, 2010
Proceedings of the Algorithms and Computation  21st International Symposium, 2010
Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010
2009
ACM Trans. Algorithms, 2009
Theory Comput. Syst., 2009
An improved approximation lower bound for finding almost stable maximum matchings.
Inf. Process. Lett., 2009
CoRR, 2009
Algorithmica, 2009
Proceedings of the Implementation and Application of Automata, 2009
2008
Proceedings of the Encyclopedia of Algorithms  2008 Edition, 2008
Proceedings of the Encyclopedia of Algorithms  2008 Edition, 2008
Theor. Comput. Sci., 2008
Theory Comput. Syst., 2008
Inf. Process. Lett., 2008
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008
Electron. Colloquium Comput. Complex., 2008
CoRR, 2008
Algorithms, 2008
Algorithms, 2008
A (2<i>c</i>(1/sqrt(N)))Approximation Algorithm for the Stable Marriage Problem.
Algorithmica, 2008
Algorithmica, 2008
Proceedings of the Theory and Applications of Satisfiability Testing, 2008
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
Proceedings of the Moderately Exponential Time Algorithms, 19.10.  24.10.2008, 2008
Proceedings of the Moderately Exponential Time Algorithms, 19.10.  24.10.2008, 2008
Proceedings of the Moderately Exponential Time Algorithms, 19.10.  24.10.2008, 2008
2007
Theor. Comput. Sci., 2007
ACM Trans. Algorithms, 2007
Discret. Appl. Math., 2007
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
Proceedings of the 2007 IEEE International Conference on Research, 2007
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007
Proceedings of the 12th Conference on Asia South Pacific Design Automation, 2007
Proceedings of the Approximation, 2007
Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2007
2006
Inf. Process. Lett., 2006
A (2  <i>c</i>log <i>N</i>/<i>N</i>)Approximation Algorithm for the Stable Marriage Problem.
IEICE Trans. Inf. Syst., 2006
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006
IEICE Trans. Inf. Syst., 2006
Electron. Colloquium Comput. Complex., 2006
Discret. Appl. Math., 2006
CoRR, 2006
Proceedings of the Algorithm Theory, 2006
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006
Proceedings of the Complexity of Boolean Functions, 12.03.  17.03.2006, 2006
2005
Theor. Comput. Sci., 2005
IEICE Trans. Inf. Syst., 2005
IEICE Trans. Inf. Syst., 2005
Algorithmica, 2005
Proceedings of the Sixteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005
Proceedings of the Algorithms, 2005
2004
Theor. Comput. Sci., 2004
Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs.
J. Parallel Distributed Comput., 2004
Inf. Process. Lett., 2004
WorstCase Upper Bounds for kSAT (Column: Algorithmics).
Bull. EATCS, 2004
Proceedings of the Algorithm Theory, 2004
Proceedings of the STACS 2004, 2004
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004
2003
Theor. Comput. Sci., 2003
Theor. Comput. Sci., 2003
New Gener. Comput., 2003
New Gener. Comput., 2003
Theory Comput. Syst., 2003
Inf. Process. Lett., 2003
Electron. Colloquium Comput. Complex., 2003
Proceedings of the Distributed Computing, 17th International Conference, 2003
PolynomialTime Computable Backup Tables for ShortestPath Routing.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003
Proceedings of the Algorithms, 2003
2002
Theor. Comput. Sci., 2002
Theor. Comput. Sci., 2002
ACM J. Exp. Algorithmics, 2002
Discret. Appl. Math., 2002
Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations.
Proceedings of the Unconventional Models of Computation, Third International Conference, 2002
Proceedings of the TwentyFirst Annual ACM Symposium on Principles of Distributed Computing, 2002
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002
Proceedings of the LATIN 2002: Theoretical Informatics, 2002
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002
Proceedings of the 39th Design Automation Conference, 2002
2001
Theor. Comput. Sci., 2001
J. Graph Algorithms Appl., 2001
J. Algorithms, 2001
J. Algorithms, 2001
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001
2000
Theor. Comput. Sci., 2000
J. Parallel Distributed Comput., 2000
J. Algorithms, 2000
Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000
Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000
1999
Systems and Computers in Japan, 1999
Proceedings of the ThirtyFirst Annual ACM Symposium on Theory of Computing, 1999
Proceedings of the Tenth Annual ACMSIAM Symposium on Discrete Algorithms, 1999
TreeLike Resolution Is Superpolynomially Slower Than DAGLike Resolution for the Pigeonhole Principle.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999
Proceedings of the Automata, 1999
Proceedings of the Algorithms, 1999
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999
1998
Inf. Comput., 1998
Discret. Appl. Math., 1998
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998
1997
Inf. Process. Lett., 1997
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997
ThreeDimensional Meshes are Less Powerful than TwoDimensional Ones in Oblivious Routing.
Proceedings of the Algorithms, 1997
Tight Bounds on the Number of States of DFA's That Are Equivalent to nstate NFA's.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997
Proceedings of the European Design and Test Conference, 1997
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997
1996
Theor. Comput. Sci., 1996
J. Algorithms, 1996
alphaConnectivity: A Gradually Nonparallel Graph Problem.
J. Algorithms, 1996
Proceedings of the Satisfiability Problem: Theory and Applications, 1996
Database Queries as Combinatorial Optimization Problems.
Proceedings of the International Symposium on Cooperative Database Systems for Advanced Applications, 1996
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996
1995
Inf. Process. Lett., 1995
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995
Performance Test of Local Search Algorithms Using New Types of Random CNF Formulas.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995
Proceedings of the Tenth Annual Structure in Complexity Theory Conference, 1995
1994
J. Algorithms, 1994
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994
SATVarible Complexity of Hard Combinatorial Problems.
Proceedings of the Technology and Foundations  Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994
Proceedings of the 31st Conference on Design Automation, 1994
1993
SIAM J. Comput., 1993
Systems and Computers in Japan, 1993
LowLevel Tradeoffs between Reversals and Alternations.
Proceedings of the Developments in Language Theory, 1993
Proceedings of the Cliques, 1993
1992
Proceedings of the Algorithms and Computation, Third International Symposium, 1992
Random Generation of Satisfiable and Unsatisfiable CNF Predicates.
Proceedings of the Algorithms, Software, Architecture, 1992
1989
SIAM J. Comput., 1989
An O(log n) Parallel Connectivity Algorithm on the Mesh of Buses.
Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989
1983
Acta Informatica, 1983
Unique Decomposability of Shuffled Strings: A Formal Treatment of Asynchronous TimeMultiplexed Communication
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983
1982
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982
1977
Computer, 1977