Kazuo Murota
Orcid: 0000-0003-1518-9152
According to our database1,
Kazuo Murota
authored at least 109 papers
between 1981 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2025
2023
CoRR, 2023
2022
Math. Program., 2022
Math. Program., 2022
2021
Optim. Methods Softw., 2021
Optim. Methods Softw., 2021
2020
Optim. Lett., 2020
2019
ACM Trans. Algorithms, 2019
Math. Program., 2019
Technical Note - Error Noted in "Order-Based Cost Optimization in Assemble-to-Order Systems" by Lu and Song (2005).
Oper. Res., 2019
Discret. Appl. Math., 2019
2018
Math. Oper. Res., 2018
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018
2017
2016
An Algorithm for the Generalized Eigenvalue Problem for Nonsquare Matrix Pencils by Minimal Perturbation Approach.
SIAM J. Matrix Anal. Appl., 2016
Improved max-flow min-cut algorithms in a Circular Disk Failure Model with application to a road network.
Eur. J. Oper. Res., 2016
Discret. Optim., 2016
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016
2015
Math. Program., 2015
On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market.
Math. Oper. Res., 2015
Ann. Oper. Res., 2015
2014
Oper. Res. Lett., 2014
A shift strategy for superquadratic convergence in the dqds algorithm for singular values.
J. Comput. Appl. Math., 2014
2013
Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013
Application of Semidefinite Programming to Maximize the Spectral Gap Produced by Node Removal.
Proceedings of the Complex Networks IV, 2013
2012
A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence.
J. Comput. Appl. Math., 2012
Self-Organization of LöSCH's Hexagons in Economic agglomeration for Core-periphery Models.
Int. J. Bifurc. Chaos, 2012
Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope.
Discret. Appl. Math., 2012
2011
SIAM J. Matrix Anal. Appl., 2011
2010
Error-controlling algorithm for simultaneous block-diagonalization and its application to independent component analysis.
JSIAM Lett., 2010
J. Comput. Appl. Math., 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Numerische Mathematik, 2009
2008
SIAM J. Matrix Anal. Appl., 2008
Proceedings of the Research Trends in Combinatorial Optimization, 2008
2007
2006
M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem.
SIAM J. Discret. Math., 2006
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006
2005
Math. Comput., 2005
Int. J. Bifurc. Chaos, 2005
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005
Discret. Optim., 2005
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005
Proceedings of the Computing and Markets, 3.-7. January 2005, 2005
2004
Oper. Res. Lett., 2004
Conjugacy relationship between M-convex and L-convex functions in continuous variables.
Math. Program., 2004
2003
Optim. Methods Softw., 2003
New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
Discret. Appl. Math., 2003
Discret. Appl. Math., 2003
Discrete convex analysis.
SIAM monographs on discrete mathematics and applications 10, SIAM, ISBN: 978-0-89871-540-8, 2003
2002
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002
2001
Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework.
SIAM J. Optim., 2001
Math. Soc. Sci., 2001
Math. Program., 2001
Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.
Discret. Appl. Math., 2001
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001
2000
Adv. Appl. Math., 2000
1999
1998
1997
Math. Oper. Res., 1997
1996
Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants.
SIAM J. Sci. Comput., 1996
Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections.
SIAM J. Discret. Math., 1996
Proceedings of the Integer Programming and Combinatorial Optimization, 1996
1995
Disturbance Decoupling with Pole Placement for Structured Systems: A Graph-Theoretic Approach.
SIAM J. Matrix Anal. Appl., 1995
A Minimax Theorem and a Dulmage-Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices.
SIAM J. Matrix Anal. Appl., 1995
SIAM J. Comput., 1995
Discret. Appl. Math., 1995
Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-Mcmillan form at infinity and structural indices in Kronecker form.
Appl. Algebra Eng. Commun. Comput., 1995
1994
Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations.
SIAM J. Matrix Anal. Appl., October, 1994
1993
SIAM J. Matrix Anal. Appl., October, 1993
Hierarchical decomposition of symmetric discrete systems by matroid and group theories.
Math. Program., 1993
1991
SIAM J. Sci. Comput., 1991
1990
Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation.
SIAM J. Comput., 1990
1989
Combinatorial dynamical system theory: General framework and controllability criteria.
Discret. Appl. Math., 1989
1987
Discret. Appl. Math., 1987
Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid.
Discret. Appl. Math., 1987
Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations.
Discret. Appl. Math., 1987
1985
1984
Inf. Process. Lett., 1984
1983
1981
Linear-Time Approximation Algorithms for Finding the Minimum-Weight Perfect Matching on a Plane.
Inf. Process. Lett., 1981