| 2009 |
|---|
| 40 | EE | Kazuo Murota:
L-convex Functions and M-convex Functions.
Encyclopedia of Optimization 2009: 1838-1845 |
| 2007 |
|---|
| 39 | EE | Yusuke Kobayashi,
Kazuo Murota:
Induction of M-convex functions by linking systems.
Discrete Applied Mathematics 155(11): 1471-1480 (2007) |
| 38 | EE | Yusuke Kobayashi,
Kazuo Murota,
Kenichiro Tanaka:
Operations on M-Convex Functions on Jump Systems.
SIAM J. Discrete Math. 21(1): 107-129 (2007) |
| 2006 |
|---|
| 37 | EE | Kazuo Murota,
Kenichiro Tanaka:
A Steepest Descent Algorithm for M-Convex Functions on Jump Systems.
IEICE Transactions 89-A(5): 1160-1165 (2006) |
| 36 | EE | Kazuo Murota:
M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem.
SIAM J. Discrete Math. 20(1): 213-226 (2006) |
| 2005 |
|---|
| 35 | EE | Kazuo Murota:
Fundamentals in Discrete Convex Analysis.
Computing and Markets 2005 |
| 34 | EE | Nicholas J. A. Harvey,
David R. Karger,
Kazuo Murota:
Deterministic network coding by matrix completion.
SODA 2005: 489-498 |
| 33 | EE | Kazuo Murota,
Akiyoshi Shioura:
Substitutes and complements in network flows viewed as discrete convexity.
Discrete Optimization 2(3): 256-268 (2005) |
| 32 | EE | Isao Saiki,
Kiyohiro Ikeda,
Kazuo Murota:
Flower Patterns Appearing on a Honeycomb Structure and their bifurcation Mechanism.
I. J. Bifurcation and Chaos 15(2): 497-515 (2005) |
| 31 | EE | Satoko Moriguchi,
Kazuo Murota:
Discrete Hessian Matrix for L-Convex Functions.
IEICE Transactions 88-A(5): 1104-1108 (2005) |
| 30 | EE | Satoru Iwata,
Satoko Moriguchi,
Kazuo Murota:
A capacity scaling algorithm for M-convex submodular flow.
Math. Program. 103(1): 181-202 (2005) |
| 2004 |
|---|
| 29 | EE | Satoru Iwata,
Satoko Moriguchi,
Kazuo Murota:
A Capacity Scaling Algorithm for M-convex Submodular Flow.
IPCO 2004: 352-367 |
| 28 | EE | Kazuo Murota,
Akiyoshi Shioura:
Conjugacy relationship between M-convex and L-convex functions in continuous variables.
Math. Program. 101(3): 415-433 (2004) |
| 27 | EE | Kazuo Murota,
Akihisa Tamura:
Proximity theorems of discrete convex functions.
Math. Program. 99(3): 539-562 (2004) |
| 26 | EE | Kazuo Murota,
Hiroo Saito,
Robert Weismantel:
Optimality criterion for a class of nonlinear integer programs.
Oper. Res. Lett. 32(5): 468-472 (2004) |
| 2003 |
|---|
| 25 | EE | Kazuo Murota,
Akiyoshi Shioura:
Quasi M-convex and L-convex functions--quasiconvexity in discrete optimization.
Discrete Applied Mathematics 131(2): 467-494 (2003) |
| 24 | EE | Kazuo Murota,
Akihisa Tamura:
New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
Discrete Applied Mathematics 131(2): 495-512 (2003) |
| 23 | EE | James F. Geelen,
Satoru Iwata,
Kazuo Murota:
The linear delta-matroid parity problem.
J. Comb. Theory, Ser. B 88(2): 377-398 (2003) |
| 2001 |
|---|
| 22 | EE | Kazuo Murota,
Akihisa Tamura:
Application of M-Convex Submodular Flow Problem to Mathematical Economics.
ISAAC 2001: 14-25 |
| 21 | | Kazuo Murota,
Akiyoshi Shioura:
Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.
Discrete Applied Mathematics 115(1-3): 151-176 (2001) |
| 1999 |
|---|
| 20 | EE | Kazuo Murota:
Submodular Flow Problem with a Nonseparable Cost Function.
Combinatorica 19(1): 87-109 (1999) |
| 1998 |
|---|
| 19 | | Kazuo Murota:
Fenchel-type duality for matroid valuations.
Math. Program. 82: 357-375 (1998) |
| 18 | | Kazuo Murota:
Discrete convex analysis.
Math. Program. 83: 313-371 (1998) |
| 1997 |
|---|
| 17 | EE | Kazuo Murota:
Matroid Valuation on Independent Sets.
J. Comb. Theory, Ser. B 69(1): 59-78 (1997) |
| 1996 |
|---|
| 16 | | Kazuo Murota:
Convexity and Steinitz's Exchange Property.
IPCO 1996: 260-274 |
| 15 | | Kazuo Murota:
On Exchange Axioms for Valuated Matroids and Valuated Delta-Matroids.
Combinatorica 16(4): 591-596 (1996) |
| 14 | EE | Satoru Iwata,
Kazuo Murota:
Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections.
SIAM J. Discrete Math. 9(1): 71-86 (1996) |
| 13 | EE | Kazuo Murota:
Valuated Matroid Intersection I: Optimality Criteria.
SIAM J. Discrete Math. 9(4): 545-561 (1996) |
| 12 | EE | Kazuo Murota:
Valuated Matroid Intersection II: Algorithms.
SIAM J. Discrete Math. 9(4): 562-576 (1996) |
| 1995 |
|---|
| 11 | EE | Kazuo Murota:
Combinatorial Relaxation Algorithm for the Maximum Degree of Subdeterminants: Computing Smith-McMillan Form at Infinity and Structural Indeces in Kronecker Form.
Appl. Algebra Eng. Commun. Comput. 6(4/5): 251-273 (1995) |
| 10 | EE | Satoru Iwata,
Kazuo Murota:
A Theorem on the Principal Structure for Independent Matchings.
Discrete Applied Mathematics 61(3): 229-244 (1995) |
| 9 | | Kazuo Murota:
Computing the Degree of Determinants Via Combinatorial Relaxation.
SIAM J. Comput. 24(4): 765-796 (1995) |
| 1993 |
|---|
| 8 | | Kazuo Murota:
Hierarchical decomposition of symmetric discrete systems by matroid and group theories.
Math. Program. 59: 377-404 (1993) |
| 1990 |
|---|
| 7 | | Kazuo Murota:
Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation.
SIGAL International Symposium on Algorithms 1990: 271-280 |
| 6 | EE | Kazuo Murota:
Principal structure of layered mixed matrices.
Discrete Applied Mathematics 27(3): 221-234 (1990) |
| 5 | | Kazuo Murota:
Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation.
SIAM J. Comput. 19(6): 1132-1161 (1990) |
| 1989 |
|---|
| 4 | EE | Kazuo Murota:
Combinatorial dynamical system theory: General framework and controllability criteria.
Discrete Applied Mathematics 22(3): 241-265 (1989) |
| 1985 |
|---|
| 3 | | Hiroshi Imai,
Masao Iri,
Kazuo Murota:
Voronoi Diagram in the Laguerre Geometry and its Applications.
SIAM J. Comput. 14(1): 93-105 (1985) |
| 1984 |
|---|
| 2 | | Takao Ohya,
Masao Iri,
Kazuo Murota:
A Fast Voronoi-Diagram Algorithm With Quaternary Tree Bucketing.
Inf. Process. Lett. 18(4): 227-231 (1984) |
| 1981 |
|---|
| 1 | | Masao Iri,
Kazuo Murota,
Shouichi Matsui:
Linear-Time Approximation Algorithms for Finding the Minimum-Weight Perfect Matching on a Plane.
Inf. Process. Lett. 12(4): 206-209 (1981) |
