Satoru Fujishige

Orcid: 0000-0002-0950-4278

Affiliations:
  • Kyoto University, Research Institute for Mathematical Sciences


According to our database1, Satoru Fujishige authored at least 88 papers between 1972 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022
Discrete 2-convex functions.
Math. Program., 2022

Minimizing submodular functions on diamonds via generalized fractional matroid matchings.
J. Comb. Theory B, 2022

Compression of M<sup>♮</sup>-convex functions - Flag matroids and valuated permutohedra.
J. Comb. Theory A, 2022

2021
Signed ring families and signed posets.
Optim. Methods Softw., 2021

2019
Greedy systems of linear inequalities and lexicographically optimal solutions.
RAIRO Oper. Res., 2019

Submodular optimization views on the random assignment problem.
Math. Program., 2019

Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016.
J. Comb. Optim., 2019

A note on submodular function minimization by Chubanov's LP algorithm.
Discret. Optim., 2019

A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids.
CoRR, 2019

2018
The Random Assignment Problem with Submodular Constraints on Goods.
ACM Trans. Economics and Comput., 2018

Polynomial combinatorial algorithms for skew-bisubmodular function minimization.
Math. Program., 2018

2017
Matroids Are Immune to Braess' Paradox.
Math. Oper. Res., 2017

Parametric bisubmodular function minimization and its associated signed ring family.
Discret. Appl. Math., 2017

2016
Random decentralized market processes for stable job matchings with competitive salaries.
J. Econ. Theory, 2016

2015
Congestion games viewed from M-convexity.
Oper. Res. Lett., 2015

Dual consistent systems of linear inequalities and cardinality constrained polytopes.
Math. Program., 2015

2014
A Min-Max Theorem for Transversal Submodular Functions and Its Implications.
SIAM J. Discret. Math., 2014

Generalized skew bisubmodularity: A characterization and a min-max theorem.
Discret. Optim., 2014

Bisubmodular polyhedra, simplicial divisions, and discrete convexity.
Discret. Optim., 2014

2013
A note on polylinking flow networks.
Math. Program., 2013

On the feasible payoff set of two-player repeated games with unequal discounting.
Int. J. Game Theory, 2013

Independent arborescences in directed graphs.
Discret. Math., 2013

2012
The root location problem for arc-disjoint arborescences.
Discret. Appl. Math., 2012

2010
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization.
Math. Program., 2010

A note on disjoint arborescences.
Comb., 2010

Lattice Polyhedra and Submodular Flows.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009
Minimizing Continuous Extensions of Discrete Convex Functions with Linear Inequality Constraints.
SIAM J. Optim., 2009

Minimum Transversals in Posimodular Systems.
SIAM J. Discret. Math., 2009

A general model for matroids and the greedy algorithm.
Math. Program., 2009

A Structure Theory for the Parametric Submodular Intersection Problem.
Math. Oper. Res., 2009

A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph.
Inf. Process. Lett., 2009

2008
Minimizing a monotone concave function with laminar covering constraints.
Discret. Appl. Math., 2008

Minimum Cost Source Location Problems with Flow Requirements.
Algorithmica, 2008

Theory of Principal Partitions Revisited.
Proceedings of the Research Trends in Combinatorial Optimization, 2008

2007
A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis.
Math. Oper. Res., 2007

Matroids on convex geometries (cg-matroids).
Discret. Math., 2007

2006
An O(n log<sup>2</sup>n) algorithm for the optimal sink location problem in dynamic tree networks.
Discret. Appl. Math., 2006

A general two-sided matching market with discrete concave utility functions.
Discret. Appl. Math., 2006

Minimum Transversals in Posi-modular Systems.
Proceedings of the Algorithms, 2006

2005
Bisubmodular Function Minimization.
SIAM J. Discret. Math., 2005

2004
Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2.
Discret. Math., 2004

Dual greedy polyhedra, choice functions, and abstract convex geometries.
Discret. Optim., 2004

An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003
A maximum flow algorithm using MA ordering.
Oper. Res. Lett., 2003

Source location problem with flow requirements in directed networks.
Optim. Methods Softw., 2003

Submodular function minimization and related topics.
Optim. Methods Softw., 2003

A Note on Kelso and Crawford's Gross Substitutes Condition.
Math. Oper. Res., 2003

A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002
A descent method for submodular function minimization.
Math. Program., 2002

Locating Sources to Meet Flow Demands in Undirected Networks.
J. Algorithms, 2002

A simple matching algorithm for regular bipartite graphs.
Inf. Process. Lett., 2002

Optimal Sink Location Problem for Dynamic Flows in a Tree Network.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

2001
A combinatorial strongly polynomial algorithm for minimizing submodular functions.
J. ACM, 2001

Realization of set functions as cut functions of graphs and hypergraphs.
Discret. Math., 2001

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

A note on Faigle and Kern's dual greedy polyhedra.
Math. Program., 2000

A laminarity property of the polyhedron described by a weakly posi-modular set function.
Discret. Appl. Math., 2000

A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999
Minimizing a Submodular Function Arising From a Concave Function.
Discret. Appl. Math., 1999

1997
A Min-Max Theorem for Bisubmodular Polyhedra.
SIAM J. Discret. Math., 1997

1996
On structures of bisubmodular polyhedra.
Math. Program., 1996

A characterization of bisubmodular functions.
Discret. Math., 1996

Decomposition of a Bidirected Graph into Strongly Connected Components and Its Signed Poset Structure.
Discret. Appl. Math., 1996

1994
A New Scaling Algorithm for the Maximum Mean Cut Problem.
Algorithmica, 1994

1992
A note on the Frank-Tardos bi-truncation algorithm for crossing-submodular functions.
Math. Program., 1992

1991
A Speculative Contraction Method for Minimum Cost Flows: Toward a Practical Algorithm.
Proceedings of the Network Flows And Matching, 1991

1989
A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems.
Math. Oper. Res., 1989

1988
Optimization over the polyhedron determined by a submodular function on a co-intersecting family.
Math. Program., 1988

The Fair Resource Allocation Problem with Submodular Constraints.
Math. Oper. Res., 1988

1987
Finding a homotopy base for directed paths in an acyclic graph.
Discret. Appl. Math., 1987

An out-of-kilter method for submodular flows.
Discret. Appl. Math., 1987

1986
A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm.
Math. Program., 1986

Book reviews.
Z. Oper. Research, 1986

1985
A decomposition of distributive lattices.
Discret. Math., 1985

1984
On the subdifferential of a submodular function.
Math. Program., 1984

Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions.
Math. Program., 1984

Structures of polyhedra determined by submodular functions on crossing families.
Math. Program., 1984

A note on Frank's generalized polymatroids.
Discret. Appl. Math., 1984

1983
Canonical decompositions of symmetric submodular systems.
Discret. Appl. Math., 1983

1981
A note on the problem of updating shortest paths.
Networks, 1981

1980
Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector.
Math. Oper. Res., 1980

An Efficient PQ-Graph Algorithm for Solving the Graph-Realization Problem.
J. Comput. Syst. Sci., 1980

Principal structures of submodular systems.
Discret. Appl. Math., 1980

1978
Polymatroidal Dependence Structure of a Set of Random Variables
Inf. Control., October, 1978

1976
Comments on "Optimal Control of Unreliable Dynamic Systems with Discrete Time Inspections".
IEEE Trans. Syst. Man Cybern., 1976

1974
Remarks on "optimal stochastic control for discrete-time linear system with interrupted observations".
Autom., 1974

1972
Sequential State Estimation with Interrupted Observation
Inf. Control., August, 1972


  Loading...