M-convex function on generalized polymatroid K Murota, A Shioura Mathematics of operations research 24 (1), 95-105, 1999 | 209 | 1999 |

An optimal algorithm for scanning all spanning trees of undirected graphs A Shioura, A Tamura, T Uno SIAM Journal on Computing 26 (3), 678-692, 1997 | 163 | 1997 |

Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati–Tardella K Murota, A Shioura Discrete Applied Mathematics 115 (1-3), 151-176, 2001 | 75 | 2001 |

Gross substitutes condition and discrete concavity for multi-unit valuations: a survey A Shioura, A Tamura Journal of the Operations Research Society of Japan 58 (1), 61-103, 2015 | 66 | 2015 |

Extension of M-convexity and L-convexity to polyhedral convex functions K Murota, A Shioura Advances in Applied Mathematics 25 (4), 352-427, 2000 | 64 | 2000 |

Efficiently scanning all spanning trees of an undirected graph A Shioura, A Tamura Journal of the Operations Research Society of Japan 38 (3), 331-344, 1995 | 58* | 1995 |

New algorithms for convex cost tension problem with application to computer vision V Kolmogorov, A Shioura Discrete Optimization 6 (4), 378-393, 2009 | 57 | 2009 |

Minimization of an M-convex function A Shioura Discrete Applied Mathematics 84 (1-3), 215-220, 1998 | 50 | 1998 |

Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches A Shioura, NV Shakhlevich, VA Strusevich European Journal of Operational Research 266 (3), 795-818, 2018 | 46 | 2018 |

Dijkstra’s algorithm and L-concave function maximization K Murota, A Shioura Mathematical Programming 145, 163-177, 2014 | 46 | 2014 |

Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem A Shioura Discrete Applied Mathematics 134 (1-3), 303-316, 2004 | 45 | 2004 |

Quasi M-convex and L-convex functions—quasiconvexity in discrete optimization K Murota, A Shioura Discrete Applied Mathematics 131 (2), 467-494, 2003 | 41 | 2003 |

Exact bounds for steepest descent algorithms of L-convex function minimization K Murota, A Shioura Operations Research Letters 42 (5), 361-366, 2014 | 32 | 2014 |

On the pipage rounding algorithm for submodular function maximization—a view from discrete convex analysis A Shioura Discrete Mathematics, Algorithms and Applications 1 (01), 1-23, 2009 | 31 | 2009 |

M-convex function minimization by continuous relaxation approach: Proximity theorem and algorithm S Moriguchi, A Shioura, N Tsuchimura SIAM Journal on Optimization 21 (3), 633-668, 2011 | 30 | 2011 |

Scaling algorithms for M-convex function minimization S Moriguchi, K Murota, A Shioura IEICE Transactions on Fundamentals of Electronics, Communications and …, 2002 | 30 | 2002 |

Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines A Shioura, NV Shakhlevich, VA Strusevich INFORMS Journal on Computing 28 (1), 148-161, 2016 | 28 | 2016 |

Conjugacy relationship between M-convex and L-convex functions in continuous variables K Murota, A Shioura Mathematical programming 101, 415-433, 2004 | 27 | 2004 |

Computing a Walrasian equilibrium in iterative auctions with multiple differentiated items K Murota, A Shioura, Z Yang Algorithms and Computation: 24th International Symposium, ISAAC 2013, Hong …, 2013 | 26 | 2013 |

Single machine scheduling with controllable processing times by submodular optimization NV Shakhlevich, A Shioura, VA Strusevich International Journal of Foundations of Computer Science 20 (02), 247-269, 2009 | 26 | 2009 |