Satoru Fujishige

101 papers A* 2A 1B 5C 3Journal 85Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Universally Efficient Dynamic Auction for All Unimodular Demand Types. Math. Oper. Res. Satoru Fujishige, Zaifu Yang
2026	J	`jnl`	Tandem concavity with application to matching problems. Oper. Res. Lett. Satoru Fujishige, Koji Yokote
2025	J	`jnl`	A note on ordinally concave functions. Discret. Appl. Math. Satoru Fujishige, Fuhito Kojima, Koji Yokote
2025	J	`jnl`	An update-and-stabilize framework for the minimum-norm-point problem. Math. Program. Satoru Fujishige, Tomonari Kitahara, László A. Végh
2023	B	`conf`	An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem. IPCO Satoru Fujishige, Tomonari Kitahara, László A. Végh
2022	J	`jnl`	Compression of M J. Comb. Theory A Satoru Fujishige, Hiroshi Hirai
2022	J	`jnl`	Discrete 2-convex functions. Math. Program. Satoru Fujishige, Fabio Tardella
2022	J	`jnl`	Minimizing submodular functions on diamonds via generalized fractional matroid matchings. J. Comb. Theory B Satoru Fujishige, Tamás Király, Kazuhisa Makino, Kenjiro Takazawa, Shin-ichi Tanigawa
2021	J	`jnl`	Signed ring families and signed posets. Optim. Methods Softw. Kazutoshi Ando, Satoru Fujishige
2019	J	`jnl`	A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids. CoRR Satoru Fujishige, Kenjiro Takazawa, Yu Yokoi
2019	J	`jnl`	A note on submodular function minimization by Chubanov's LP algorithm. Discret. Optim. Satoru Fujishige
2019	J	`jnl`	Greedy systems of linear inequalities and lexicographically optimal solutions. RAIRO Oper. Res. Satoru Fujishige
2019	J	`jnl`	Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016. J. Comb. Optim. Satoru Fujishige, Ali Ridha Mahjoub, Franz Rendl
2019	J	`jnl`	Submodular optimization views on the random assignment problem. Math. Program. Satoru Fujishige, Yoshio Sano, Ping Zhan
2018	J	`jnl`	Polynomial combinatorial algorithms for skew-bisubmodular function minimization. Math. Program. Satoru Fujishige, Shin-ichi Tanigawa
2018	J	`jnl`	The Random Assignment Problem with Submodular Constraints on Goods. ACM Trans. Economics and Comput. Satoru Fujishige, Yoshio Sano, Ping Zhan
2017	J	`jnl`	Matroids Are Immune to Braess' Paradox. Math. Oper. Res. Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen
2017	J	`jnl`	Parametric bisubmodular function minimization and its associated signed ring family. Discret. Appl. Math. Satoru Fujishige
2016	C	`ed.`	Combinatorial Optimization - 4th International Symposium, ISCO 2016, Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers ISCO Raffaele Cerulli, Satoru Fujishige, Ali Ridha Mahjoub
2016	J	`jnl`	Random decentralized market processes for stable job matchings with competitive salaries. J. Econ. Theory Bo Chen, Satoru Fujishige, Zaifu Yang
2015	J	`jnl`	Congestion games viewed from M-convexity. Oper. Res. Lett. Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen
2015	J	`jnl`	Dual consistent systems of linear inequalities and cardinality constrained polytopes. Math. Program. Satoru Fujishige, Jens Maßberg
2015	J	`jnl`	Matroids are Immune to Braess Paradox. CoRR Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen
2014	J	`jnl`	A Min-Max Theorem for Transversal Submodular Functions and Its Implications. SIAM J. Discret. Math. Satoru Fujishige, Shin-ichi Tanigawa
2014	J	`jnl`	Bisubmodular polyhedra, simplicial divisions, and discrete convexity. Discret. Optim. Satoru Fujishige
2014	J	`jnl`	Generalized skew bisubmodularity: A characterization and a min-max theorem. Discret. Optim. Satoru Fujishige, Shin-ichi Tanigawa, Yuichi Yoshida
2013	J	`jnl`	A note on polylinking flow networks. Math. Program. Satoru Fujishige
2013	J	`jnl`	Independent arborescences in directed graphs. Discret. Math. András Frank, Satoru Fujishige, Naoyuki Kamiyama, Naoki Katoh
2013	J	`jnl`	On the feasible payoff set of two-player repeated games with unequal discounting. Int. J. Game Theory Bo Chen, Satoru Fujishige
2012	C	`conf`	Dual Consistent Systems of Linear Inequalities and Cardinality Constrained Polytopes. ISCO Satoru Fujishige, Jens Maßberg
2012	J	`jnl`	The root location problem for arc-disjoint arborescences. Discret. Appl. Math. Satoru Fujishige, Naoyuki Kamiyama
2010	J	`jnl`	A note on disjoint arborescences. Comb. Satoru Fujishige
2010	C	`conf`	Lattice Polyhedra and Submodular Flows. CTW Satoru Fujishige, Britta Peis
2010	J	`jnl`	Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. Math. Program. S. Thomas McCormick, Satoru Fujishige
2009	J	`jnl`	A Structure Theory for the Parametric Submodular Intersection Problem. Math. Oper. Res. Satoru Fujishige, Kiyohito Nagano
2009	J	`jnl`	A general model for matroids and the greedy algorithm. Math. Program. Ulrich Faigle, Satoru Fujishige
2009	J	`jnl`	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. Kristóf Bérczi, Satoru Fujishige, Naoyuki Kamiyama
2009	J	`jnl`	Minimizing Continuous Extensions of Discrete Convex Functions with Linear Inequality Constraints. SIAM J. Optim. Satoru Fujishige, Takumi Hayashi, Kiyohito Nagano
2009	J	`jnl`	Minimum Transversals in Posimodular Systems. SIAM J. Discret. Math. Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige
2008	J	`jnl`	Minimizing a monotone concave function with laminar covering constraints. Discret. Appl. Math. Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige
2008	J	`jnl`	Minimum Cost Source Location Problems with Flow Requirements. Algorithmica Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige
2008	A*	`conf`	Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. SODA S. Thomas McCormick, Satoru Fujishige
2008	—	`conf`	Theory of Principal Partitions Revisited. Bonn Workshop of Combinatorial Optimization Satoru Fujishige
2007	J	`jnl`	A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis. Math. Oper. Res. Satoru Fujishige, Akihisa Tamura
2007	J	`jnl`	Matroids on convex geometries (cg-matroids). Discret. Math. Satoru Fujishige, Gleb A. Koshevoy, Yoshio Sano
2006	J	`jnl`	A general two-sided matching market with discrete concave utility functions. Discret. Appl. Math. Satoru Fujishige, Akihisa Tamura
2006	J	`jnl`	An O(n log Discret. Appl. Math. Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige
2006	B	`conf`	Minimum Cost Source Location Problems with Flow Requirements. LATIN Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige
2006	A	`conf`	Minimum Transversals in Posi-modular Systems. ESA Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige
2005	J	`jnl`	Bisubmodular Function Minimization. SIAM J. Discret. Math. Satoru Fujishige, Satoru Iwata
2005	B	`conf`	Minimizing a Monotone Concave Function with Laminar Covering Constraints. ISAAC Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige
2004	—	`conf`	An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks. IFIP TCS Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige
2004	J	`jnl`	Dual greedy polyhedra, choice functions, and abstract convex geometries. Discret. Optim. Satoru Fujishige
2004	J	`jnl`	Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2. Discret. Math. Satoru Fujishige, Kazuhisa Makino, Takashi Takabatake, Kenji Kashiwabara
2003	B	`conf`	A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model. ISAAC Akinobu Eguchi, Satoru Fujishige, Akihisa Tamura
2003	J	`jnl`	A Note on Kelso and Crawford's Gross Substitutes Condition. Math. Oper. Res. Satoru Fujishige, Zaifu Yang
2003	J	`jnl`	A maximum flow algorithm using MA ordering. Oper. Res. Lett. Satoru Fujishige
2003	J	`jnl`	Source location problem with flow requirements in directed networks. Optim. Methods Softw. Hiro Ito, Kazuhisa Makino, Kouji Arata, Shoji Honami, Yuichiro Itatsu, Satoru Fujishige
2003	J	`jnl`	Submodular function minimization and related topics. Optim. Methods Softw. Satoru Fujishige
2002	J	`jnl`	A descent method for submodular function minimization. Math. Program. Satoru Fujishige, Satoru Iwata
2002	J	`jnl`	A simple matching algorithm for regular bipartite graphs. Inf. Process. Lett. Kazuhisa Makino, Takashi Takabatake, Satoru Fujishige
2002	J	`jnl`	Locating Sources to Meet Flow Demands in Undirected Networks. J. Algorithms Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige
2002	J	`jnl`	Optimal Sink Location Problem for Dynamic Flows in a Tree Network. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Satoko Mamada, Kazuhisa Makino, Satoru Fujishige
2001	J	`jnl`	A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM Satoru Iwata, Lisa Fleischer, Satoru Fujishige
2001	B	`conf`	Bisubmodular Function Minimization. IPCO Satoru Fujishige, Satoru Iwata
2001	J	`jnl`	Realization of set functions as cut functions of graphs and hypergraphs. Discret. Math. Satoru Fujishige, Sachin B. Patkar
2000	A*	`conf`	A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. STOC Satoru Iwata, Lisa Fleischer, Satoru Fujishige
2000	J	`jnl`	A laminarity property of the polyhedron described by a weakly posi-modular set function. Discret. Appl. Math. Satoru Fujishige
2000	J	`jnl`	A note on Faigle and Kern's dual greedy polyhedra. Math. Program. Satoru Fujishige
2000	—	`conf`	Locating Sources to Meet Flow Demands in Undirected Networks. SWAT Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige
2000	J	`jnl`	Notes on L-/M-convex functions and the separation theorems. Math. Program. Satoru Fujishige, Kazuo Murota
1999	J	`jnl`	Minimizing a Submodular Function Arising From a Concave Function. Discret. Appl. Math. Satoru Fujishige, Satoru Iwata
1997	J	`jnl`	A Min-Max Theorem for Bisubmodular Polyhedra. SIAM J. Discret. Math. Satoru Fujishige
1996	J	`jnl`	A characterization of bisubmodular functions. Discret. Math. Kazutoshi Ando, Satoru Fujishige, Takeshi Naitoh
1996	J	`jnl`	Decomposition of a Bidirected Graph into Strongly Connected Components and Its Signed Poset Structure. Discret. Appl. Math. Kazutoshi Ando, Satoru Fujishige, Toshio Nemoto
1996	J	`jnl`	On structures of bisubmodular polyhedra. Math. Program. Kazutoshi Ando, Satoru Fujishige
1994	J	`jnl`	A New Scaling Algorithm for the Maximum Mean Cut Problem. Algorithmica Kazuo Iwano, Shinji Misono, Shu Tezuka, Satoru Fujishige
1992	J	`jnl`	A note on the Frank-Tardos bi-truncation algorithm for crossing-submodular functions. Math. Program. Takeshi Naitoh, Satoru Fujishige
1991	—	`conf`	A Speculative Contraction Method for Minimum Cost Flows: Toward a Practical Algorithm. Network Flows And Matching Satoru Fujishige, Kazuo Iwano, J. Nakano, Shu Tezuka
1989	J	`jnl`	A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems. Math. Oper. Res. Satoru Fujishige, Hans Röck, Uwe Zimmermann
1988	J	`jnl`	Optimization over the polyhedron determined by a submodular function on a co-intersecting family. Math. Program. Satoru Fujishige
1988	J	`jnl`	The Fair Resource Allocation Problem with Submodular Constraints. Math. Oper. Res. Satoru Fujishige, Naoki Katoh, Tetsuo Ichimori
1987	J	`jnl`	An out-of-kilter method for submodular flows. Discret. Appl. Math. Satoru Fujishige
1987	J	`jnl`	Finding a homotopy base for directed paths in an acyclic graph. Discret. Appl. Math. Kazuo Murota, Satoru Fujishige
1986	J	`jnl`	A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm. Math. Program. Satoru Fujishige
1986	J	`jnl`	Book reviews. Z. Oper. Research David F. Shanno, A. J. J. Talman, Satoru Fujishige, Steven Nahmias, Karl Straßner, Götz Uebe
1985	J	`jnl`	A decomposition of distributive lattices. Discret. Math. Satoru Fujishige
1984	J	`jnl`	A note on Frank's generalized polymatroids. Discret. Appl. Math. Satoru Fujishige
1984	J	`jnl`	On the subdifferential of a submodular function. Math. Program. Satoru Fujishige
1984	J	`jnl`	Structures of polyhedra determined by submodular functions on crossing families. Math. Program. Satoru Fujishige
1984	J	`jnl`	Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions. Math. Program. Satoru Fujishige
1983	J	`jnl`	Canonical decompositions of symmetric submodular systems. Discret. Appl. Math. Satoru Fujishige
1981	J	`jnl`	A note on the problem of updating shortest paths. Networks Satoru Fujishige
1980	J	`jnl`	An Efficient PQ-Graph Algorithm for Solving the Graph-Realization Problem. J. Comput. Syst. Sci. Satoru Fujishige
1980	—	`conf`	Canonical decompositions of symmetric submodular systems. Graph Theory and Algorithms Satoru Fujishige
1980	J	`jnl`	Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector. Math. Oper. Res. Satoru Fujishige
1980	J	`jnl`	Principal structures of submodular systems. Discret. Appl. Math. Satoru Fujishige
1978	J	`jnl`	Polymatroidal Dependence Structure of a Set of Random Variables Inf. Control. Satoru Fujishige
1976	J	`jnl`	Comments on "Optimal Control of Unreliable Dynamic Systems with Discrete Time Inspections". IEEE Trans. Syst. Man Cybern. Satoru Fujishige
1974	J	`jnl`	Remarks on "optimal stochastic control for discrete-time linear system with interrupted observations". Autom. Satoru Fujishige
1972	J	`jnl`	Sequential State Estimation with Interrupted Observation Inf. Control. Yoshikazu Sawaragi, T. Katayama, Satoru Fujishige