default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKazuo Murota
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j95]Kazuo Murota
, Akihisa Tamura:
Shapley-Folkman-type theorem for integrally convex sets. Discret. Appl. Math. 360: 42-50 (2025)- 2023
- [j94]András Frank, Kazuo Murota:
Fair Integral Network Flows. Math. Oper. Res. 48(3): 1393-1422 (2023) - [i5]Kazuo Murota, Takayasu Matsuo:
Double-Exponential transformation: A quick review of a Japanese tradition. CoRR abs/2301.01920 (2023) - 2022
- [j93]András Frank, Kazuo Murota:
Fair integral submodular flows. Discret. Appl. Math. 320: 416-434 (2022) - [j92]András Frank, Kazuo Murota:
A Discrete Convex Min-Max Formula for Box-TDI Polyhedra. Math. Oper. Res. 47(2): 1026-1047 (2022) - [j91]András Frank, Kazuo Murota:
Decreasing minimization on M-convex sets: background and structures. Math. Program. 195(1): 977-1025 (2022) - [j90]András Frank, Kazuo Murota:
Decreasing minimization on M-convex sets: algorithms and applications. Math. Program. 195(1): 1027-1068 (2022) - 2021
- [j89]Kazuo Murota:
A note on M-convex functions on jump systems. Discret. Appl. Math. 289: 492-502 (2021) - [j88]Kazuo Murota:
A survey of fundamental operations on discrete convex functions of various kinds. Optim. Methods Softw. 36(2-3): 472-518 (2021) - [j87]Kazuo Murota:
On basic operations related to network induction of discrete convex functions. Optim. Methods Softw. 36(2-3): 519-559 (2021) - 2020
- [j86]Satoko Moriguchi, Kazuo Murota, Akihisa Tamura, Fabio Tardella:
Discrete Midpoint Convexity. Math. Oper. Res. 45(1): 99-128 (2020) - [j85]Kazuo Murota, Akihisa Tamura:
Integrality of subgradients and biconjugates of integrally convex functions. Optim. Lett. 14(1): 195-208 (2020)
2010 – 2019
- 2019
- [j84]Satoko Moriguchi, Kazuo Murota:
Projection and convolution operations for integrally convex functions. Discret. Appl. Math. 255: 283-298 (2019) - [j83]Mohammadreza Bolandnazar, Woonghee Tim Huh, S. Thomas McCormick, Kazuo Murota:
Technical Note - Error Noted in "Order-Based Cost Optimization in Assemble-to-Order Systems" by Lu and Song (2005). Oper. Res. 67(1): 163-166 (2019) - [j82]Satoko Moriguchi, Kazuo Murota, Akihisa Tamura, Fabio Tardella:
Scaling, proximity, and optimization of integrally convex functions. Math. Program. 175(1-2): 119-154 (2019) - [j81]Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný:
A Tractable Class of Binary VCSPs via M-Convex Intersection. ACM Trans. Algorithms 15(3): 44:1-44:41 (2019) - 2018
- [j80]Yuni Iwamasa, Kazuo Murota, Stanislav Zivný:
Discrete convexity in joint winner property. Discret. Optim. 28: 78-88 (2018) - [j79]Kazuo Murota:
Multiple Exchange Property for M♮-Concave Functions and Valuated Matroids. Math. Oper. Res. 43(3): 781-788 (2018) - [j78]Takanori Maehara, Naoki Marumo, Kazuo Murota:
Continuous relaxation for discrete DC programming. Math. Program. 169(1): 199-219 (2018) - [c11]Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný:
Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. STACS 2018: 39:1-39:14 - [i4]Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný:
A tractable class of binary VCSPs via M-convex intersection. CoRR abs/1801.02199 (2018) - 2017
- [i3]Yuni Iwamasa, Kazuo Murota, Stanislav Zivný:
Discrete Convexity in Joint Winner Property. CoRR abs/1701.07645 (2017) - [i2]Kazuo Murota, Kenjiro Takazawa:
Relationship of Two Formulations for Shortest Bibranchings. CoRR abs/1706.02029 (2017) - 2016
- [j77]Kazuo Murota, Akiyoshi Shioura, Zaifu Yang:
Time bounds for iterative auctions: A unified approach by discrete convex analysis. Discret. Optim. 19: 36-62 (2016) - [j76]Kensuke Otsuki, Yusuke Kobayashi, Kazuo Murota:
Improved max-flow min-cut algorithms in a Circular Disk Failure Model with application to a road network. Eur. J. Oper. Res. 248(2): 396-403 (2016) - [j75]Shinji Ito, Kazuo Murota:
An Algorithm for the Generalized Eigenvalue Problem for Nonsquare Matrix Pencils by Minimal Perturbation Approach. SIAM J. Matrix Anal. Appl. 37(1): 409-419 (2016) - [c10]Satoko Moriguchi, Kazuo Murota, Akihisa Tamura, Fabio Tardella:
Scaling and Proximity Properties of Integrally Convex Functions. ISAAC 2016: 57:1-57:13 - 2015
- [j74]Takanori Maehara, Kazuo Murota:
Valuated matroid-based algorithm for submodular welfare problem. Ann. Oper. Res. 229(1): 565-590 (2015) - [j73]Kazuo Murota, Yu Yokoi:
On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market. Math. Oper. Res. 40(2): 460-473 (2015) - [j72]Takanori Maehara, Kazuo Murota:
A framework of discrete DC programming by discrete convex analysis. Math. Program. 152(1-2): 435-466 (2015) - [c9]Takanori Maehara, Naoki Marumo, Kazuo Murota:
Continuous Relaxation for Discrete DC Programming. MCO (1) 2015: 181-190 - 2014
- [j71]Kensuke Aishima, Takayasu Matsuo, Kazuo Murota, Masaaki Sugihara:
A shift strategy for superquadratic convergence in the dqds algorithm for singular values. J. Comput. Appl. Math. 257: 132-143 (2014) - [j70]Kazuo Murota, Akiyoshi Shioura:
Dijkstra's algorithm and L-concave function maximization. Math. Program. 145(1-2): 163-177 (2014) - [j69]Kazuo Murota, Akiyoshi Shioura:
Exact bounds for steepest descent algorithms of L-convex function minimization. Oper. Res. Lett. 42(5): 361-366 (2014) - [r2]Kazuo Murota:
Linear Programming. Computer Vision, A Reference Guide 2014: 455-460 - 2013
- [c8]Naoki Masuda, Tetsuya Fujie, Kazuo Murota:
Application of Semidefinite Programming to Maximize the Spectral Gap Produced by Node Removal. CompleNet 2013: 155-163 - [c7]Kazuo Murota, Akiyoshi Shioura, Zaifu Yang:
Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items. ISAAC 2013: 468-478 - 2012
- [j68]Takuya Iimura, Kazuo Murota, Akihisa Tamura:
Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope. Discret. Appl. Math. 160(4-5): 588-592 (2012) - [j67]Kiyohiro Ikeda, Kazuo Murota, Takashi Akamatsu:
Self-Organization of LöSCH's Hexagons in Economic agglomeration for Core-periphery Models. Int. J. Bifurc. Chaos 22(8) (2012) - [j66]Kensuke Aishima, Takayasu Matsuo, Kazuo Murota, Masaaki Sugihara:
A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence. J. Comput. Appl. Math. 236(15): 3556-3560 (2012) - [j65]Yusuke Kobayashi, Kazuo Murota, Robert Weismantel:
Cone superadditivity of discrete convex functions. Math. Program. 135(1-2): 25-44 (2012) - 2011
- [j64]Takanori Maehara, Kazuo Murota:
Algorithm for Error-Controlled Simultaneous Block-Diagonalization of Matrices. SIAM J. Matrix Anal. Appl. 32(2): 605-620 (2011) - 2010
- [j63]Kensuke Aishima, Takayasu Matsuo, Kazuo Murota, Masaaki Sugihara:
Superquadratic convergence of DLASQ for computing matrix singular values. J. Comput. Appl. Math. 234(4): 1179-1187 (2010) - [j62]Takanori Maehara, Kazuo Murota:
Error-controlling algorithm for simultaneous block-diagonalization and its application to independent component analysis. JSIAM Lett. 2: 131-134 (2010)
2000 – 2009
- 2009
- [j61]Ken'ichiro Tanaka, Masaaki Sugihara, Kazuo Murota:
Function classes for successful DE-Sinc approximations. Math. Comput. 78(267): 1553-1571 (2009) - [j60]Ken'ichiro Tanaka, Masaaki Sugihara, Kazuo Murota, Masatake Mori:
Function classes for double exponential integration formulas. Numerische Mathematik 111(4): 631-655 (2009) - [r1]Kazuo Murota:
L-convex Functions and M-convex Functions. Encyclopedia of Optimization 2009: 1838-1845 - 2008
- [j59]Kensuke Aishima, Takayasu Matsuo, Kazuo Murota, Masaaki Sugihara:
On Convergence of the DQDS Algorithm for Singular Value Computation. SIAM J. Matrix Anal. Appl. 30(2): 522-537 (2008) - [c6]Kazuo Murota:
Recent Developments in Discrete Convex Analysis. Bonn Workshop of Combinatorial Optimization 2008: 219-260 - 2007
- [j58]Yusuke Kobayashi, Kazuo Murota:
Induction of M-convex functions by linking systems. Discret. Appl. Math. 155(11): 1471-1480 (2007) - [j57]Yusuke Kobayashi, Kazuo Murota, Ken'ichiro Tanaka:
Operations on M-Convex Functions on Jump Systems. SIAM J. Discret. Math. 21(1): 107-129 (2007) - 2006
- [j56]Kazuo Murota, Ken'ichiro Tanaka:
A Steepest Descent Algorithm for M-Convex Functions on Jump Systems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1160-1165 (2006) - [j55]Kazuo Murota:
M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem. SIAM J. Discret. Math. 20(1): 213-226 (2006) - 2005
- [j54]Kazuo Murota, Akiyoshi Shioura:
Substitutes and complements in network flows viewed as discrete convexity. Discret. Optim. 2(3): 256-268 (2005) - [j53]Satoko Moriguchi, Kazuo Murota:
Discrete Hessian Matrix for L-Convex Functions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(5): 1104-1108 (2005) - [j52]Isao Saiki, Kiyohiro Ikeda, Kazuo Murota:
Flower Patterns Appearing on a Honeycomb Structure and their bifurcation Mechanism. Int. J. Bifurc. Chaos 15(2): 497-515 (2005) - [j51]Ken'ichiro Tanaka, Masaaki Sugihara, Kazuo Murota:
Numerical indefinite integration by double exponential sinc method. Math. Comput. 74(250): 655-679 (2005) - [j50]Kazuo Murota:
Note on Multimodularity and L-Convexity. Math. Oper. Res. 30(3): 658-661 (2005) - [j49]Satoru Iwata, Satoko Moriguchi, Kazuo Murota:
A capacity scaling algorithm for M-convex submodular flow. Math. Program. 103(1): 181-202 (2005) - [c5]Nicholas J. A. Harvey, David R. Karger, Kazuo Murota:
Deterministic network coding by matrix completion. SODA 2005: 489-498 - [i1]Kazuo Murota:
Fundamentals in Discrete Convex Analysis. Computing and Markets 2005 - 2004
- [j48]Kazuo Murota, Akiyoshi Shioura:
Quadratic M-convex and L-convex functions. Adv. Appl. Math. 33(2): 318-341 (2004) - [j47]Kazuo Murota, Akihisa Tamura:
Proximity theorems of discrete convex functions. Math. Program. 99(3): 539-562 (2004) - [j46]Kazuo Murota, Akiyoshi Shioura:
Conjugacy relationship between M-convex and L-convex functions in continuous variables. Math. Program. 101(3): 415-433 (2004) - [j45]Kazuo Murota, Hiroo Saito, Robert Weismantel:
Optimality criterion for a class of nonlinear integer programs. Oper. Res. Lett. 32(5): 468-472 (2004) - [j44]Kazuo Murota:
On Steepest Descent Algorithms for Discrete Convex Functions. SIAM J. Optim. 14(3): 699-707 (2004) - [c4]Satoru Iwata, Satoko Moriguchi, Kazuo Murota:
A Capacity Scaling Algorithm for M-convex Submodular Flow. IPCO 2004: 352-367 - 2003
- [b1]Kazuo Murota:
Discrete convex analysis. SIAM monographs on discrete mathematics and applications 10, SIAM 2003, ISBN 978-0-89871-540-8, pp. I-XXII, 1-389 - [j43]Kazuo Murota, Akiyoshi Shioura:
Quasi M-convex and L-convex functions--quasiconvexity in discrete optimization. Discret. Appl. Math. 131(2): 467-494 (2003) - [j42]Kazuo Murota, Akihisa Tamura:
New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities. Discret. Appl. Math. 131(2): 495-512 (2003) - [j41]James F. Geelen, Satoru Iwata, Kazuo Murota:
The linear delta-matroid parity problem. J. Comb. Theory B 88(2): 377-398 (2003) - [j40]Satoko Moriguchi, Kazuo Murota:
Capacity scaling algorithm for scalable M-convex submodular flow problems. Optim. Methods Softw. 18(2): 207-218 (2003) - 2002
- [j39]Satoko Moriguchi, Kazuo Murota, Akiyoshi Shioura:
Scaling Algorithms for M-Convex Function Minimization. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(5): 922-929 (2002) - 2001
- [j38]Kazuo Murota, Akihisa Tamura:
On Circuit Valuation of Matroids. Adv. Appl. Math. 26(3): 192-225 (2001) - [j37]Kazuo Murota, Akiyoshi Shioura:
Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella. Discret. Appl. Math. 115(1-3): 151-176 (2001) - [j36]Satoru Iwata, Kazuo Murota:
Combinatorial relaxation algorithm for mixed polynomial matrices. Math. Program. 90(2): 353-371 (2001) - [j35]Vladimir I. Danilov, Gleb A. Koshevoy, Kazuo Murota:
Discrete convexity and equilibria in economies with indivisible goods and money. Math. Soc. Sci. 41(3): 251-273 (2001) - [j34]Mituhiro Fukuda, Masakazu Kojima, Kazuo Murota, Kazuhide Nakata:
Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework. SIAM J. Optim. 11(3): 647-674 (2001) - [c3]Kazuo Murota, Akihisa Tamura:
Application of M-Convex Submodular Flow Problem to Mathematical Economics. ISAAC 2001: 14-25 - 2000
- [j33]Kazuo Murota, Akiyoshi Shioura:
Extension of M-Convexity and L-Convexity to Polyhedral Convex Functions. Adv. Appl. Math. 25(4): 352-427 (2000) - [j32]Satoru Fujishige, Kazuo Murota:
Notes on L-/M-convex functions and the separation theorems. Math. Program. 88(1): 129-146 (2000)
1990 – 1999
- 1999
- [j31]Kazuo Murota:
Submodular Flow Problem with a Nonseparable Cost Function. Comb. 19(1): 87-109 (1999) - [j30]Kazuo Murota, Akiyoshi Shioura:
M-Convex Function on Generalized Polymatroid. Math. Oper. Res. 24(1): 95-105 (1999) - 1998
- [j29]Kazuo Murota:
Fenchel-type duality for matroid valuations. Math. Program. 82: 357-375 (1998) - [j28]Kazuo Murota:
Discrete convex analysis. Math. Program. 83: 313-371 (1998) - [j27]Kazuo Murota:
On the Degree of Mixed Polynomial Matrices. SIAM J. Matrix Anal. Appl. 20(1): 196-227 (1998) - 1997
- [j26]Kazuo Murota:
Matroid Valuation on Independent Sets. J. Comb. Theory B 69(1): 59-78 (1997) - [j25]Satoru Iwata, Kazuo Murota, Maiko Shigeno:
A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences. Math. Oper. Res. 22(4): 803-813 (1997) - 1996
- [j24]Kazuo Murota:
On Exchange Axioms for Valuated Matroids and Valuated Delta-Matroids. Comb. 16(4): 591-596 (1996) - [j23]Satoru Iwata, Kazuo Murota:
Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections. SIAM J. Discret. Math. 9(1): 71-86 (1996) - [j22]Kazuo Murota:
Valuated Matroid Intersection I: Optimality Criteria. SIAM J. Discret. Math. 9(4): 545-561 (1996) - [j21]Kazuo Murota:
Valuated Matroid Intersection II: Algorithms. SIAM J. Discret. Math. 9(4): 562-576 (1996) - [j20]Satoru Iwata, Kazuo Murota, Izumi Sakuta:
Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants. SIAM J. Sci. Comput. 17(4): 993-1012 (1996) - [c2]Kazuo Murota:
Convexity and Steinitz's Exchange Property. IPCO 1996: 260-274 - 1995
- [j19]Kazuo Murota:
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. 6(4/5): 251-273 (1995) - [j18]Satoru Iwata, Kazuo Murota:
A Theorem on the Principal Structure for Independent Matchings. Discret. Appl. Math. 61(3): 229-244 (1995) - [j17]Kazuo Murota:
Computing the Degree of Determinants Via Combinatorial Relaxation. SIAM J. Comput. 24(4): 765-796 (1995) - [j16]Satoru Iwata, Kazuo Murota:
A Minimax Theorem and a Dulmage-Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices. SIAM J. Matrix Anal. Appl. 16(3): 719-734 (1995) - [j15]Jacob van der Woude, Kazuo Murota:
Disturbance Decoupling with Pole Placement for Structured Systems: A Graph-Theoretic Approach. SIAM J. Matrix Anal. Appl. 16(3): 922-942 (1995) - 1994
- [j14]Hisashi Ito, Satoru Iwata, Kazuo Murota:
Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations. SIAM J. Matrix Anal. Appl. 15(4): 1226-1255 (1994) - 1993
- [j13]Kazuo Murota:
Hierarchical decomposition of symmetric discrete systems by matroid and group theories. Math. Program. 59: 377-404 (1993) - [j12]Kazuo Murota:
On the Smith Normal Form of Structured Polynomial Matrices, II. SIAM J. Matrix Anal. Appl. 14(4): 1103-1111 (1993) - 1991
- [j11]Kazuo Murota, Kiyohiro Ikeda:
Computational Use of Group Theory in Bifurcation Analysis of Symmetric Structures. SIAM J. Sci. Comput. 12(2): 273-297 (1991) - 1990
- [j10]Kazuo Murota:
Principal structure of layered mixed matrices. Discret. Appl. Math. 27(3): 221-234 (1990) - [j9]Kazuo Murota:
Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation. SIAM J. Comput. 19(6): 1132-1161 (1990) - [c1]Kazuo Murota:
Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation. SIGAL International Symposium on Algorithms 1990: 271-280
1980 – 1989
- 1989
- [j8]Kazuo Murota:
Combinatorial dynamical system theory: General framework and controllability criteria. Discret. Appl. Math. 22(3): 241-265 (1989) - 1987
- [j7]Kazuo Murota:
Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations. Discret. Appl. Math. 17(1-2): 107-134 (1987) - [j6]Kazuo Murota:
Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid. Discret. Appl. Math. 17(1-2): 135-155 (1987) - [j5]Kazuo Murota, Satoru Fujishige:
Finding a homotopy base for directed paths in an acyclic graph. Discret. Appl. Math. 17(1-2): 157-162 (1987) - 1985
- [j4]Hiroshi Imai, Masao Iri, Kazuo Murota:
Voronoi Diagram in the Laguerre Geometry and its Applications. SIAM J. Comput. 14(1): 93-105 (1985) - 1984
- [j3]Takao Ohya, Masao Iri, Kazuo Murota:
A Fast Voronoi-Diagram Algorithm With Quaternary Tree Bucketing. Inf. Process. Lett. 18(4): 227-231 (1984) - 1983
- [j2]Masao Iri, Kazuo Murota, Shouichi Matsui:
Heuristics for planar minimum-weight perfect metchings. Networks 13(1): 67-92 (1983) - 1981
- [j1]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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
