Kazuo Murota

According to our database1, Kazuo Murota authored at least 100 papers between 1981 and 2021.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


On basic operations related to network induction of discrete convex functions.
Optim. Methods Softw., 2021

A survey of fundamental operations on discrete convex functions of various kinds.
Optim. Methods Softw., 2021

A note on M-convex functions on jump systems.
Discret. Appl. Math., 2021

Integrality of subgradients and biconjugates of integrally convex functions.
Optim. Lett., 2020

Discrete Midpoint Convexity.
Math. Oper. Res., 2020

A Tractable Class of Binary VCSPs via M-Convex Intersection.
ACM Trans. Algorithms, 2019

Scaling, proximity, and optimization of integrally convex functions.
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

Projection and convolution operations for integrally convex functions.
Discret. Appl. Math., 2019

Continuous relaxation for discrete DC programming.
Math. Program., 2018

Multiple Exchange Property for M♮-Concave Functions and Valuated Matroids.
Math. Oper. Res., 2018

Discrete convexity in joint winner property.
Discret. Optim., 2018

Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Relationship of Two Formulations for Shortest Bibranchings.
CoRR, 2017

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

Time bounds for iterative auctions: A unified approach by discrete convex analysis.
Discret. Optim., 2016

Scaling and Proximity Properties of Integrally Convex Functions.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

A framework of discrete DC programming by discrete convex analysis.
Math. Program., 2015

On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market.
Math. Oper. Res., 2015

Valuated matroid-based algorithm for submodular welfare problem.
Ann. Oper. Res., 2015

Linear Programming.
Computer Vision, A Reference Guide, 2014

Exact bounds for steepest descent algorithms of L-convex function minimization.
Oper. Res. Lett., 2014

Dijkstra's algorithm and L-concave function maximization.
Math. Program., 2014

A shift strategy for superquadratic convergence in the dqds algorithm for singular values.
J. Comput. Appl. Math., 2014

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

Cone superadditivity of discrete convex functions.
Math. Program., 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

Algorithm for Error-Controlled Simultaneous Block-Diagonalization of Matrices.
SIAM J. Matrix Anal. Appl., 2011

Error-controlling algorithm for simultaneous block-diagonalization and its application to independent component analysis.
JSIAM Lett., 2010

Superquadratic convergence of DLASQ for computing matrix singular values.
J. Comput. Appl. Math., 2010

L-convex Functions and M-convex Functions.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Function classes for double exponential integration formulas.
Numerische Mathematik, 2009

Function classes for successful DE-Sinc approximations.
Math. Comput., 2009

On Convergence of the DQDS Algorithm for Singular Value Computation.
SIAM J. Matrix Anal. Appl., 2008

Recent Developments in Discrete Convex Analysis.
Proceedings of the Research Trends in Combinatorial Optimization, 2008

Operations on M-Convex Functions on Jump Systems.
SIAM J. Discret. Math., 2007

Induction of M-convex functions by linking systems.
Discret. Appl. Math., 2007

M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem.
SIAM J. Discret. Math., 2006

A Steepest Descent Algorithm for M-Convex Functions on Jump Systems.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

A capacity scaling algorithm for M-convex submodular flow.
Math. Program., 2005

Note on Multimodularity and L-Convexity.
Math. Oper. Res., 2005

Numerical indefinite integration by double exponential sinc method.
Math. Comput., 2005

Flower Patterns Appearing on a Honeycomb Structure and their bifurcation Mechanism.
Int. J. Bifurc. Chaos, 2005

Discrete Hessian Matrix for L-Convex Functions.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Substitutes and complements in network flows viewed as discrete convexity.
Discret. Optim., 2005

Deterministic network coding by matrix completion.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Fundamentals in Discrete Convex Analysis.
Proceedings of the Computing and Markets, 3.-7. January 2005, 2005

On Steepest Descent Algorithms for Discrete Convex Functions.
SIAM J. Optim., 2004

Optimality criterion for a class of nonlinear integer programs.
Oper. Res. Lett., 2004

Proximity theorems of discrete convex functions.
Math. Program., 2004

Conjugacy relationship between M-convex and L-convex functions in continuous variables.
Math. Program., 2004

Quadratic M-convex and L-convex functions.
Adv. Appl. Math., 2004

Capacity scaling algorithm for scalable M-convex submodular flow problems.
Optim. Methods Softw., 2003

The linear delta-matroid parity problem.
J. Comb. Theory, Ser. B, 2003

New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
Discret. Appl. Math., 2003

Quasi M-convex and L-convex functions--quasiconvexity in discrete optimization.
Discret. Appl. Math., 2003

Discrete convex analysis.
SIAM monographs on discrete mathematics and applications 10, SIAM, ISBN: 978-0-89871-540-8, 2003

Scaling Algorithms for M-Convex Function Minimization.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework.
SIAM J. Optim., 2001

Discrete convexity and equilibria in economies with indivisible goods and money.
Math. Soc. Sci., 2001

Combinatorial relaxation algorithm for mixed polynomial matrices.
Math. Program., 2001

Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.
Discret. Appl. Math., 2001

On Circuit Valuation of Matroids.
Adv. Appl. Math., 2001

Application of M-Convex Submodular Flow Problem to Mathematical Economics.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Notes on L-/M-convex functions and the separation theorems.
Math. Program., 2000

Extension of M-Convexity and L-Convexity to Polyhedral Convex Functions.
Adv. Appl. Math., 2000

M-Convex Function on Generalized Polymatroid.
Math. Oper. Res., 1999

Submodular Flow Problem with a Nonseparable Cost Function.
Comb., 1999

On the Degree of Mixed Polynomial Matrices.
SIAM J. Matrix Anal. Appl., 1998

Discrete convex analysis.
Math. Program., 1998

Fenchel-type duality for matroid valuations.
Math. Program., 1998

A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences.
Math. Oper. Res., 1997

Matroid Valuation on Independent Sets.
J. Comb. Theory, Ser. B, 1997

Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants.
SIAM J. Sci. Comput., 1996

Valuated Matroid Intersection II: Algorithms.
SIAM J. Discret. Math., 1996

Valuated Matroid Intersection I: Optimality Criteria.
SIAM J. Discret. Math., 1996

Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections.
SIAM J. Discret. Math., 1996

On Exchange Axioms for Valuated Matroids and Valuated Delta-Matroids.
Comb., 1996

Convexity and Steinitz's Exchange Property.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

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

Computing the Degree of Determinants Via Combinatorial Relaxation.
SIAM J. Comput., 1995

A Theorem on the Principal Structure for Independent Matchings.
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

Hierarchical decomposition of symmetric discrete systems by matroid and group theories.
Math. Program., 1993

Computational Use of Group Theory in Bifurcation Analysis of Symmetric Structures.
SIAM J. Sci. Comput., 1991

Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation.
SIAM J. Comput., 1990

Principal structure of layered mixed matrices.
Discret. Appl. Math., 1990

Combinatorial dynamical system theory: General framework and controllability criteria.
Discret. Appl. Math., 1989

Finding a homotopy base for directed paths in an acyclic graph.
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

Voronoi Diagram in the Laguerre Geometry and its Applications.
SIAM J. Comput., 1985

A Fast Voronoi-Diagram Algorithm With Quaternary Tree Bucketing.
Inf. Process. Lett., 1984

Heuristics for planar minimum-weight perfect metchings.
Networks, 1983

Linear-Time Approximation Algorithms for Finding the Minimum-Weight Perfect Matching on a Plane.
Inf. Process. Lett., 1981