Kazuo Murota
According to our database^{1},
Kazuo Murota
authored at least 100 papers
between 1981 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 dnb.info
On csauthors.net:
Bibliography
2021
Optim. Methods Softw., 2021
Optim. Methods Softw., 2021
Discret. Appl. Math., 2021
2020
Optim. Lett., 2020
Math. Oper. Res., 2020
2019
ACM Trans. Algorithms, 2019
Math. Program., 2019
Technical Note  Error Noted in "OrderBased Cost Optimization in AssembletoOrder Systems" by Lu and Song (2005).
Oper. Res., 2019
Discret. Appl. Math., 2019
2018
Math. Program., 2018
Math. Oper. Res., 2018
Discret. Optim., 2018
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018
2017
CoRR, 2017
2016
An Algorithm for the Generalized Eigenvalue Problem for Nonsquare Matrix Pencils by Minimal Perturbation Approach.
SIAM J. Matrix Anal. Appl., 2016
Improved maxflow mincut algorithms in a Circular Disk Failure Model with application to a road network.
Eur. J. Oper. Res., 2016
Time bounds for iterative auctions: A unified approach by discrete convex analysis.
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 TwoSided DiscreteConcave Market.
Math. Oper. Res., 2015
Ann. Oper. Res., 2015
2014
Computer Vision, A Reference Guide, 2014
Oper. Res. Lett., 2014
Math. Program., 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
Math. Program., 2012
A Wilkinsonlike multishift QR algorithm for symmetric eigenvalue problems and its global convergence.
J. Comput. Appl. Math., 2012
SelfOrganization of LöSCH's Hexagons in Economic agglomeration for Coreperiphery 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
Errorcontrolling algorithm for simultaneous blockdiagonalization 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
Math. Comput., 2009
2008
SIAM J. Matrix Anal. Appl., 2008
Proceedings of the Research Trends in Combinatorial Optimization, 2008
2007
SIAM J. Discret. Math., 2007
Discret. Appl. Math., 2007
2006
MConvex 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. Program., 2005
Math. Oper. Res., 2005
Math. Comput., 2005
Flower Patterns Appearing on a Honeycomb Structure and their bifurcation Mechanism.
Int. J. Bifurc. Chaos, 2005
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005
Discret. Optim., 2005
Proceedings of the Sixteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2005
Proceedings of the Computing and Markets, 3.7. January 2005, 2005
2004
SIAM J. Optim., 2004
Oper. Res. Lett., 2004
Math. Program., 2004
Conjugacy relationship between Mconvex and Lconvex functions in continuous variables.
Math. Program., 2004
Adv. Appl. Math., 2004
2003
Optim. Methods Softw., 2003
J. Comb. Theory, Ser. B, 2003
New characterizations of Mconvex 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: 9780898715408, 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/Lconvex functions with discrete convex functions by Miller and FavatiTardella.
Discret. Appl. Math., 2001
Adv. Appl. Math., 2001
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001
2000
Math. Program., 2000
Adv. Appl. Math., 2000
1999
Math. Oper. Res., 1999
Comb., 1999
1998
SIAM J. Matrix Anal. Appl., 1998
Math. Program., 1998
Math. Program., 1998
1997
Math. Oper. Res., 1997
J. Comb. Theory, Ser. B, 1997
1996
PrimalDual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants.
SIAM J. Sci. Comput., 1996
SIAM J. Discret. Math., 1996
SIAM J. Discret. Math., 1996
Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by DesignVariable Selections.
SIAM J. Discret. Math., 1996
Comb., 1996
Proceedings of the Integer Programming and Combinatorial Optimization, 1996
1995
Disturbance Decoupling with Pole Placement for Structured Systems: A GraphTheoretic Approach.
SIAM J. Matrix Anal. Appl., 1995
A Minimax Theorem and a DulmageMendelsohn 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 SmithMcmillan form at infinity and structural indices in Kronecker form.
Appl. Algebra Eng. Commun. Comput., 1995
1993
Hierarchical decomposition of symmetric discrete systems by matroid and group theories.
Math. Program., 1993
1991
Computational Use of Group Theory in Bifurcation Analysis of Symmetric Structures.
SIAM J. Sci. Comput., 1991
1990
Computing PuiseuxSeries Solutions to Determinantal Equations via Combinatorial Relaxation.
SIAM J. Comput., 1990
Discret. Appl. Math., 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
Mengerdecomposition of a graph and its application to the structural analysis of a largescale system of equations.
Discret. Appl. Math., 1987
1985
SIAM J. Comput., 1985
1984
Inf. Process. Lett., 1984
1983
Networks, 1983
1981
LinearTime Approximation Algorithms for Finding the MinimumWeight Perfect Matching on a Plane.
Inf. Process. Lett., 1981