Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarSatoru Fujishige
Person information
- affiliation: Kyoto University, Research Institute for Mathematical Sciences
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2019
[j71]Satoru Fujishige:
A note on submodular function minimization by Chubanov's LP algorithm. Discrete Optimization 33: 140-145 (2019)- [j70]
Satoru Fujishige, Ali Ridha Mahjoub, Franz Rendl:
Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016. J. Comb. Optim. 37(1): 418-422 (2019) - [i2]
Satoru Fujishige, Kenjiro Takazawa, Yu Yokoi:
A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids. CoRR abs/1909.13261 (2019) - 2018
- [j69]
Satoru Fujishige, Shin-ichi Tanigawa:
Polynomial combinatorial algorithms for skew-bisubmodular function minimization. Math. Program. 171(1-2): 87-114 (2018) - [j68]
Satoru Fujishige, Yoshio Sano, Ping Zhan:
The Random Assignment Problem with Submodular Constraints on Goods. ACM Trans. Economics and Comput. 6(1): 3:1-3:28 (2018) - 2017
- [j67]
Satoru Fujishige:
Parametric bisubmodular function minimization and its associated signed ring family. Discrete Applied Mathematics 227: 142-148 (2017) - [j66]
Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen:
Matroids Are Immune to Braess' Paradox. Math. Oper. Res. 42(3): 745-761 (2017) - 2016
- [j65]
Bo Chen, Satoru Fujishige, Zaifu Yang:
Random decentralized market processes for stable job matchings with competitive salaries. J. Economic Theory 165: 25-36 (2016) - [e1]
Raffaele Cerulli, Satoru Fujishige, Ali Ridha Mahjoub:
Combinatorial Optimization - 4th International Symposium, ISCO 2016, Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers. Lecture Notes in Computer Science 9849, Springer 2016, ISBN 978-3-319-45586-0 [contents] - 2015
- [j64]
Satoru Fujishige, Jens Maßberg:
Dual consistent systems of linear inequalities and cardinality constrained polytopes. Math. Program. 150(1): 35-48 (2015) - [j63]
Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen:
Congestion games viewed from M-convexity. Oper. Res. Lett. 43(3): 329-333 (2015) - [i1]
Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen:
Matroids are Immune to Braess Paradox. CoRR abs/1504.07545 (2015) - 2014
- [j62]
Satoru Fujishige, Shin-ichi Tanigawa, Yuichi Yoshida:
Generalized skew bisubmodularity: A characterization and a min-max theorem. Discrete Optimization 12: 1-9 (2014) - [j61]
Satoru Fujishige:
Bisubmodular polyhedra, simplicial divisions, and discrete convexity. Discrete Optimization 12: 115-120 (2014) - [j60]
Satoru Fujishige, Shin-ichi Tanigawa:
A Min-Max Theorem for Transversal Submodular Functions and Its Implications. SIAM J. Discrete Math. 28(4): 1855-1875 (2014) - 2013
- [j59]
András Frank, Satoru Fujishige, Naoyuki Kamiyama, Naoki Katoh:
Independent arborescences in directed graphs. Discrete Mathematics 313(4): 453-459 (2013) - [j58]
Bo Chen, Satoru Fujishige:
On the feasible payoff set of two-player repeated games with unequal discounting. Int. J. Game Theory 42(1): 295-303 (2013) - [j57]
Satoru Fujishige:
A note on polylinking flow networks. Math. Program. 137(1-2): 601-607 (2013) - 2012
- [j56]
Satoru Fujishige, Naoyuki Kamiyama:
The root location problem for arc-disjoint arborescences. Discrete Applied Mathematics 160(13-14): 1964-1970 (2012) - [c14]
Satoru Fujishige, Jens Maßberg:
Dual Consistent Systems of Linear Inequalities and Cardinality Constrained Polytopes. ISCO 2012: 153-164 - 2010
- [j55]
Satoru Fujishige:
A note on disjoint arborescences. Combinatorica 30(2): 247-252 (2010) - [j54]
S. Thomas McCormick, Satoru Fujishige:
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. Math. Program. 122(1): 87-120 (2010) - [c13]
Satoru Fujishige, Britta Peis:
Lattice Polyhedra and Submodular Flows. CTW 2010: 55-59
2000 – 2009
- 2009
- [j53]
Kristóf Bérczi, Satoru Fujishige, Naoyuki Kamiyama:
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. 109(23-24): 1227-1231 (2009) - [j52]
Satoru Fujishige, Kiyohito Nagano:
A Structure Theory for the Parametric Submodular Intersection Problem. Math. Oper. Res. 34(3): 513-521 (2009) - [j51]
Ulrich Faigle, Satoru Fujishige:
A general model for matroids and the greedy algorithm. Math. Program. 119(2): 353-369 (2009) - [j50]
Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige:
Minimum Transversals in Posimodular Systems. SIAM J. Discrete Math. 23(2): 858-871 (2009) - [j49]
Satoru Fujishige, Takumi Hayashi, Kiyohito Nagano:
Minimizing Continuous Extensions of Discrete Convex Functions with Linear Inequality Constraints. SIAM Journal on Optimization 20(2): 856-867 (2009) - 2008
- [j48]
Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige:
Minimum Cost Source Location Problems with Flow Requirements. Algorithmica 50(4): 555-583 (2008) - [j47]
Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige:
Minimizing a monotone concave function with laminar covering constraints. Discrete Applied Mathematics 156(11): 2004-2019 (2008) - [c12]
Satoru Fujishige:
Theory of Principal Partitions Revisited. Bonn Workshop of Combinatorial Optimization 2008: 127-162 - [c11]
S. Thomas McCormick, Satoru Fujishige:
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. SODA 2008: 44-53 - 2007
- [j46]
Satoru Fujishige, Gleb A. Koshevoy, Yoshio Sano:
Matroids on convex geometries (cg-matroids). Discrete Mathematics 307(15): 1936-1950 (2007) - [j45]
Satoru Fujishige, Akihisa Tamura:
A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis. Math. Oper. Res. 32(1): 136-155 (2007) - 2006
- [j44]
Satoru Fujishige, Akihisa Tamura:
A general two-sided matching market with discrete concave utility functions. Discrete Applied Mathematics 154(6): 950-970 (2006) - [j43]
Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige:
An O(n log2n) algorithm for the optimal sink location problem in dynamic tree networks. Discrete Applied Mathematics 154(16): 2387-2401 (2006) - [c10]
Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige:
Minimum Transversals in Posi-modular Systems. ESA 2006: 576-587 - [c9]
Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige:
Minimum Cost Source Location Problems with Flow Requirements. LATIN 2006: 769-780 - 2005
- [j42]
Satoru Fujishige, Satoru Iwata:
Bisubmodular Function Minimization. SIAM J. Discrete Math. 19(4): 1065-1073 (2005) - [c8]
Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige:
Minimizing a Monotone Concave Function with Laminar Covering Constraints. ISAAC 2005: 71-81 - 2004
- [j41]
Satoru Fujishige:
Dual greedy polyhedra, choice functions, and abstract convex geometries. Discrete Optimization 1(1): 41-49 (2004) - [j40]
Satoru Fujishige, Kazuhisa Makino, Takashi Takabatake, Kenji Kashiwabara:
Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2. Discrete Mathematics 280(1-3): 13-27 (2004) - [c7]
Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige:
An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks. IFIP TCS 2004: 251-264 - 2003
- [j39]
Satoru Fujishige, Zaifu Yang:
A Note on Kelso and Crawford's Gross Substitutes Condition. Math. Oper. Res. 28(3): 463-469 (2003) - [j38]
Satoru Fujishige:
Submodular function minimization and related topics. Optimization Methods and Software 18(2): 167-180 (2003) - [j37]
Hiro Ito, Kazuhisa Makino, Kouji Arata, Shoji Honami, Yuichiro Itatsu, Satoru Fujishige:
Source location problem with flow requirements in directed networks. Optimization Methods and Software 18(4): 427-435 (2003) - [j36]
Satoru Fujishige:
A maximum flow algorithm using MA ordering. Oper. Res. Lett. 31(3): 176-178 (2003) - [c6]
Akinobu Eguchi, Satoru Fujishige, Akihisa Tamura:
A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model. ISAAC 2003: 495-504 - 2002
- [j35]
Kazuhisa Makino, Takashi Takabatake, Satoru Fujishige:
A simple matching algorithm for regular bipartite graphs. Inf. Process. Lett. 84(4): 189-193 (2002) - [j34]
Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige:
Locating Sources to Meet Flow Demands in Undirected Networks. J. Algorithms 42(1): 54-68 (2002) - [j33]
Satoru Fujishige, Satoru Iwata:
A descent method for submodular function minimization. Math. Program. 92(2): 387-390 (2002) - 2001
- [j32]
Satoru Fujishige, Sachin B. Patkar:
Realization of set functions as cut functions of graphs and hypergraphs. Discrete Mathematics 226(1-3): 199-210 (2001) - [j31]
Satoru Iwata, Lisa Fleischer, Satoru Fujishige:
A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48(4): 761-777 (2001) - [c5]
Satoru Fujishige, Satoru Iwata:
Bisubmodular Function Minimization. IPCO 2001: 160-169 - 2000
- [j30]
Satoru Fujishige:
A laminarity property of the polyhedron described by a weakly posi-modular set function. Discrete Applied Mathematics 100(1-2): 123-126 (2000) - [j29]
Satoru Fujishige, Kazuo Murota:
Notes on L-/M-convex functions and the separation theorems. Math. Program. 88(1): 129-146 (2000) - [j28]
Satoru Fujishige:
A note on Faigle and Kern's dual greedy polyhedra. Math. Program. 88(1): 217-220 (2000) - [c4]
Satoru Iwata, Lisa Fleischer, Satoru Fujishige:
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. STOC 2000: 97-106 - [c3]
Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige:
Locating Sources to Meet Flow Demands in Undirected Networks. SWAT 2000: 300-313
1990 – 1999
- 1999
- [j27]
Satoru Fujishige, Satoru Iwata:
Minimizing a Submodular Function Arising From a Concave Function. Discrete Applied Mathematics 92(2-3): 211-215 (1999) - 1997
- [j26]
Satoru Fujishige:
A Min-Max Theorem for Bisubmodular Polyhedra. SIAM J. Discrete Math. 10(2): 294-308 (1997) - 1996
- [j25]
Kazutoshi Ando, Satoru Fujishige, Toshio Nemoto:
Decomposition of a Bidirected Graph into Strongly Connected Components and Its Signed Poset Structure. Discrete Applied Mathematics 68(3): 237-248 (1996) - [j24]
Kazutoshi Ando, Satoru Fujishige, Takeshi Naitoh:
A characterization of bisubmodular functions. Discrete Mathematics 148(1-3): 299-303 (1996) - [j23]
Kazutoshi Ando, Satoru Fujishige:
On structures of bisubmodular polyhedra. Math. Program. 74: 293-317 (1996) - 1994
- [j22]
Kazuo Iwano, Shinji Misono, Shu Tezuka, Satoru Fujishige:
A New Scaling Algorithm for the Maximum Mean Cut Problem. Algorithmica 11(3): 243-255 (1994) - 1992
- [j21]
Takeshi Naitoh, Satoru Fujishige:
A note on the Frank-Tardos bi-truncation algorithm for crossing-submodular functions. Math. Program. 53: 361-363 (1992) - 1991
- [c2]
Satoru Fujishige, Kazuo Iwano, J. Nakano, Shu Tezuka:
A Speculative Contraction Method for Minimum Cost Flows: Toward a Practical Algorithm. Network Flows And Matching 1991: 219-245
1980 – 1989
- 1989
- [j20]
Satoru Fujishige, Hans Röck, Uwe Zimmermann:
A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems. Math. Oper. Res. 14(1): 60-69 (1989) - 1988
- [j19]
Satoru Fujishige, Naoki Katoh, Tetsuo Ichimori:
The Fair Resource Allocation Problem with Submodular Constraints. Math. Oper. Res. 13(1): 164-173 (1988) - [j18]
Satoru Fujishige:
Optimization over the polyhedron determined by a submodular function on a co-intersecting family. Math. Program. 42(1-3): 565-577 (1988) - 1987
- [j17]
Satoru Fujishige:
An out-of-kilter method for submodular flows. Discrete Applied Mathematics 17(1-2): 3-16 (1987) - [j16]
Kazuo Murota, Satoru Fujishige:
Finding a homotopy base for directed paths in an acyclic graph. Discrete Applied Mathematics 17(1-2): 157-162 (1987) - 1986
- [j15]
David F. Shanno, A. J. J. Talman, Satoru Fujishige, Steven Nahmias, Karl Straßner, Götz Uebe:
Book reviews. Zeitschr. für OR 30(3) (1986) - [j14]
Satoru Fujishige:
A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm. Math. Program. 35(3): 298-308 (1986) - 1985
- [j13]
Satoru Fujishige:
A decomposition of distributive lattices. Discrete Mathematics 55(1): 35-55 (1985) - 1984
- [j12]
Satoru Fujishige:
A note on Frank's generalized polymatroids. Discrete Applied Mathematics 7(1): 105-109 (1984) - [j11]
Satoru Fujishige:
Structures of polyhedra determined by submodular functions on crossing families. Math. Program. 29(2): 125-141 (1984) - [j10]
Satoru Fujishige:
Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions. Math. Program. 29(2): 142-155 (1984) - [j9]
Satoru Fujishige:
On the subdifferential of a submodular function. Math. Program. 29(3): 348-360 (1984) - 1983
- [j8]
Satoru Fujishige:
Canonical decompositions of symmetric submodular systems. Discrete Applied Mathematics 5(2): 175-190 (1983) - 1981
- [j7]
Satoru Fujishige:
A note on the problem of updating shortest paths. Networks 11(3): 317-319 (1981) - 1980
- [j6]
Satoru Fujishige:
Principal structures of submodular systems. Discrete Applied Mathematics 2(1): 77-79 (1980) - [j5]
Satoru Fujishige:
An Efficient PQ-Graph Algorithm for Solving the Graph-Realization Problem. J. Comput. Syst. Sci. 21(1): 63-86 (1980) - [j4]
Satoru Fujishige:
Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector. Math. Oper. Res. 5(2): 186-196 (1980) - [c1]
Satoru Fujishige:
Canonical decompositions of symmetric submodular systems. Graph Theory and Algorithms 1980: 53-64
1970 – 1979
- 1978
- [j3]
Satoru Fujishige:
Polymatroidal Dependence Structure of a Set of Random Variables. Information and Control 39(1): 55-72 (1978) - 1976
- [j2]
Satoru Fujishige:
Comments on "Optimal Control of Unreliable Dynamic Systems with Discrete Time Inspections". IEEE Trans. Systems, Man, and Cybernetics 6(10): 720-721 (1976) - 1972
- [j1]
Yoshikazu Sawaragi, T. Katayama, Satoru Fujishige:
Sequential State Estimation with Interrupted Observation. Information and Control 21(1): 56-71 (1972)
Coauthor Index
last updated on 2019-10-20 23:31 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
