default search action
Satoru 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
2020 – today
- 2023
- [c15]Satoru Fujishige
, Tomonari Kitahara
An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem. IPCO 2023: 142-156 - 2022
- [j79]Satoru Fujishige
Compression of M♮-convex functions - Flag matroids and valuated permutohedra. J. Comb. Theory A 185: 105525 (2022) - [j78]Satoru Fujishige
Minimizing submodular functions on diamonds via generalized fractional matroid matchings. J. Comb. Theory B 157: 294-345 (2022) - [j77]Satoru Fujishige
Discrete 2-convex functions. Math. Program. 195(1): 831-854 (2022) - 2021
- [j76]Kazutoshi Ando
Signed ring families and signed posets. Optim. Methods Softw. 36(2-3): 262-278 (2021)
2010 – 2019
- 2019
- [j75]Satoru Fujishige
A note on submodular function minimization by Chubanov's LP algorithm. Discret. Optim. 33: 140-145 (2019) - [j74]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) - [j73]Satoru Fujishige
Submodular optimization views on the random assignment problem. Math. Program. 178(1-2): 485-501 (2019) - [j72]Satoru Fujishige
Greedy systems of linear inequalities and lexicographically optimal solutions. RAIRO Oper. Res. 53(5): 1929-1935 (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
- [j71]Satoru Fujishige, Shin-ichi Tanigawa
Polynomial combinatorial algorithms for skew-bisubmodular function minimization. Math. Program. 171(1-2): 87-114 (2018) - [j70]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
- [j69]Satoru Fujishige:
Parametric bisubmodular function minimization and its associated signed ring family. Discret. Appl. Math. 227: 142-148 (2017) - [j68]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
- [j67]Bo Chen, Satoru Fujishige
Random decentralized market processes for stable job matchings with competitive salaries. J. Econ. 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
- [j66]Satoru Fujishige
Dual consistent systems of linear inequalities and cardinality constrained polytopes. Math. Program. 150(1): 35-48 (2015) - [j65]Satoru Fujishige
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
- [j64]Satoru Fujishige
Generalized skew bisubmodularity: A characterization and a min-max theorem. Discret. Optim. 12: 1-9 (2014) - [j63]Satoru Fujishige
Bisubmodular polyhedra, simplicial divisions, and discrete convexity. Discret. Optim. 12: 115-120 (2014) - [j62]Satoru Fujishige
A Min-Max Theorem for Transversal Submodular Functions and Its Implications. SIAM J. Discret. Math. 28(4): 1855-1875 (2014) - 2013
- [j61]András Frank, Satoru Fujishige
Independent arborescences in directed graphs. Discret. Math. 313(4): 453-459 (2013) - [j60]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) - [j59]Satoru Fujishige
A note on polylinking flow networks. Math. Program. 137(1-2): 601-607 (2013) - 2012
- [j58]Satoru Fujishige
The root location problem for arc-disjoint arborescences. Discret. Appl. Math. 160(13-14): 1964-1970 (2012) - [c14]Satoru Fujishige
Dual Consistent Systems of Linear Inequalities and Cardinality Constrained Polytopes. ISCO 2012: 153-164 - 2010
- [j57]Satoru Fujishige
A note on disjoint arborescences. Comb. 30(2): 247-252 (2010) - [j56]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
- [j55]Kristóf Bérczi, Satoru Fujishige
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) - [j54]Satoru Fujishige
A Structure Theory for the Parametric Submodular Intersection Problem. Math. Oper. Res. 34(3): 513-521 (2009) - [j53]Ulrich Faigle, Satoru Fujishige
A general model for matroids and the greedy algorithm. Math. Program. 119(2): 353-369 (2009) - [j52]Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige
Minimum Transversals in Posimodular Systems. SIAM J. Discret. Math. 23(2): 858-871 (2009) - [j51]Satoru Fujishige
Minimizing Continuous Extensions of Discrete Convex Functions with Linear Inequality Constraints. SIAM J. Optim. 20(2): 856-867 (2009) - 2008
- [j50]Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige
Minimum Cost Source Location Problems with Flow Requirements. Algorithmica 50(4): 555-583 (2008) - [j49]Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige
Minimizing a monotone concave function with laminar covering constraints. Discret. Appl. Math. 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
- [j48]Satoru Fujishige
Matroids on convex geometries (cg-matroids). Discret. Math. 307(15): 1936-1950 (2007) - [j47]Satoru Fujishige
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
- [j46]Satoru Fujishige
A general two-sided matching market with discrete concave utility functions. Discret. Appl. Math. 154(6): 950-970 (2006) - [j45]Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige
An O(n log2n) algorithm for the optimal sink location problem in dynamic tree networks. Discret. Appl. Math. 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
- [j44]Satoru Fujishige, Satoru Iwata:
Bisubmodular Function Minimization. SIAM J. Discret. 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
- [j43]Satoru Fujishige
Dual greedy polyhedra, choice functions, and abstract convex geometries. Discret. Optim. 1(1): 41-49 (2004) - [j42]Satoru Fujishige
Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2. Discret. Math. 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
- [j41]Satoru Fujishige, Zaifu Yang:
A Note on Kelso and Crawford's Gross Substitutes Condition. Math. Oper. Res. 28(3): 463-469 (2003) - [j40]Satoru Fujishige
Submodular function minimization and related topics. Optim. Methods Softw. 18(2): 167-180 (2003) - [j39]Hiro Ito, Kazuhisa Makino, Kouji Arata, Shoji Honami, Yuichiro Itatsu, Satoru Fujishige:
Source location problem with flow requirements in directed networks. Optim. Methods Softw. 18(4): 427-435 (2003) - [j38]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
- [j37]Satoko Mamada, Kazuhisa Makino, Satoru Fujishige:
Optimal Sink Location Problem for Dynamic Flows in a Tree Network. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(5): 1020-1025 (2002) - [j36]Kazuhisa Makino, Takashi Takabatake, Satoru Fujishige
A simple matching algorithm for regular bipartite graphs. Inf. Process. Lett. 84(4): 189-193 (2002) - [j35]Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige
Locating Sources to Meet Flow Demands in Undirected Networks. J. Algorithms 42(1): 54-68 (2002) - [j34]Satoru Fujishige
A descent method for submodular function minimization. Math. Program. 92(2): 387-390 (2002) - 2001
- [j33]Satoru Fujishige, Sachin B. Patkar:
Realization of set functions as cut functions of graphs and hypergraphs. Discret. Math. 226(1-3): 199-210 (2001) - [j32]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
- [j31]Satoru Fujishige:
A laminarity property of the polyhedron described by a weakly posi-modular set function. Discret. Appl. Math. 100(1-2): 123-126 (2000) - [j30]Satoru Fujishige, Kazuo Murota:
Notes on L-/M-convex functions and the separation theorems. Math. Program. 88(1): 129-146 (2000) - [j29]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
- [j28]Satoru Fujishige, Satoru Iwata:
Minimizing a Submodular Function Arising From a Concave Function. Discret. Appl. Math. 92(2-3): 211-215 (1999) - 1997
- [j27]Satoru Fujishige:
A Min-Max Theorem for Bisubmodular Polyhedra. SIAM J. Discret. Math. 10(2): 294-308 (1997) - 1996
- [j26]Kazutoshi Ando
Decomposition of a Bidirected Graph into Strongly Connected Components and Its Signed Poset Structure. Discret. Appl. Math. 68(3): 237-248 (1996) - [j25]Kazutoshi Ando
A characterization of bisubmodular functions. Discret. Math. 148(1-3): 299-303 (1996) - [j24]Kazutoshi Ando
On structures of bisubmodular polyhedra. Math. Program. 74: 293-317 (1996) - 1994
- [j23]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
- [j22]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
- [j21]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
- [j20]Satoru Fujishige, Naoki Katoh, Tetsuo Ichimori:
The Fair Resource Allocation Problem with Submodular Constraints. Math. Oper. Res. 13(1): 164-173 (1988) - [j19]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
- [j18]Satoru Fujishige
An out-of-kilter method for submodular flows. Discret. Appl. Math. 17(1-2): 3-16 (1987) - [j17]Kazuo Murota, Satoru Fujishige
Finding a homotopy base for directed paths in an acyclic graph. Discret. Appl. Math. 17(1-2): 157-162 (1987) - 1986
- [j16]David F. Shanno, A. J. J. Talman, Satoru Fujishige, Steven Nahmias, Karl Straßner, Götz Uebe:
Book reviews. Z. Oper. Research 30(3) (1986) - [j15]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
- [j14]Satoru Fujishige
A decomposition of distributive lattices. Discret. Math. 55(1): 35-55 (1985) - 1984
- [j13]Satoru Fujishige
A note on Frank's generalized polymatroids. Discret. Appl. Math. 7(1): 105-109 (1984) - [j12]Satoru Fujishige
Structures of polyhedra determined by submodular functions on crossing families. Math. Program. 29(2): 125-141 (1984) - [j11]Satoru Fujishige
Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions. Math. Program. 29(2): 142-155 (1984) - [j10]Satoru Fujishige
On the subdifferential of a submodular function. Math. Program. 29(3): 348-360 (1984) - 1983
- [j9]Satoru Fujishige
Canonical decompositions of symmetric submodular systems. Discret. Appl. Math. 5(2): 175-190 (1983) - 1981
- [j8]Satoru Fujishige
A note on the problem of updating shortest paths. Networks 11(3): 317-319 (1981) - 1980
- [j7]Satoru Fujishige
Principal structures of submodular systems. Discret. Appl. Math. 2(1): 77-79 (1980) - [j6]Satoru Fujishige:
An Efficient PQ-Graph Algorithm for Solving the Graph-Realization Problem. J. Comput. Syst. Sci. 21(1): 63-86 (1980) - [j5]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
- [j4]Satoru Fujishige
Polymatroidal Dependence Structure of a Set of Random Variables. Inf. Control. 39(1): 55-72 (1978) - 1976
- [j3]Satoru Fujishige:
Comments on "Optimal Control of Unreliable Dynamic Systems with Discrete Time Inspections". IEEE Trans. Syst. Man Cybern. 6(10): 720-721 (1976) - 1974
- [j2]Satoru Fujishige
Remarks on "optimal stochastic control for discrete-time linear system with interrupted observations". Autom. 10(2): 213-214 (1974) - 1972
- [j1]Yoshikazu Sawaragi, T. Katayama, Satoru Fujishige
Sequential State Estimation with Interrupted Observation. Inf. Control. 21(1): 56-71 (1972)
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-10-07 21:19 CEST 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: