Остановите войну!
for scientists:
default search action
Satoru Fujishige
- > Home > Persons > Satoru Fujishige
Publications
- 2023
- [c15]Satoru Fujishige, Tomonari Kitahara, László A. Végh:
An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem. IPCO 2023: 142-156 - 2022
- [j79]Satoru Fujishige, Hiroshi Hirai:
Compression of M♮-convex functions - Flag matroids and valuated permutohedra. J. Comb. Theory, Ser. A 185: 105525 (2022) - [j78]Satoru Fujishige, Tamás Király, Kazuhisa Makino, Kenjiro Takazawa, Shin-ichi Tanigawa:
Minimizing submodular functions on diamonds via generalized fractional matroid matchings. J. Comb. Theory, Ser. B 157: 294-345 (2022) - [j77]Satoru Fujishige, Fabio Tardella:
Discrete 2-convex functions. Math. Program. 195(1): 831-854 (2022) - 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, Yoshio Sano, Ping Zhan:
Submodular optimization views on the random assignment problem. Math. Program. 178(1-2): 485-501 (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
- [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, Zaifu Yang:
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
- [j65]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
- [j64]Satoru Fujishige, Shin-ichi Tanigawa, Yuichi Yoshida:
Generalized skew bisubmodularity: A characterization and a min-max theorem. Discret. Optim. 12: 1-9 (2014) - [j62]Satoru Fujishige, Shin-ichi Tanigawa:
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, Naoyuki Kamiyama, Naoki Katoh:
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) - 2012
- [j58]Satoru Fujishige, Naoyuki Kamiyama:
The root location problem for arc-disjoint arborescences. Discret. Appl. Math. 160(13-14): 1964-1970 (2012) - 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 - 2009
- [j55]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) - [j54]Satoru Fujishige, Kiyohito Nagano:
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, Takumi Hayashi, Kiyohito Nagano:
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) - [c11]S. Thomas McCormick, Satoru Fujishige:
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. SODA 2008: 44-53 - 2007
- [j48]Satoru Fujishige, Gleb A. Koshevoy, Yoshio Sano:
Matroids on convex geometries (cg-matroids). Discret. Math. 307(15): 1936-1950 (2007) - [j47]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
- [j46]Satoru Fujishige, Akihisa Tamura:
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
- [j42]Satoru Fujishige, Kazuhisa Makino, Takashi Takabatake, Kenji Kashiwabara:
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) - [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) - [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, Satoru Iwata:
A descent method for submodular function minimization. Math. Program. 92(2): 387-390 (2002) - 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
- [j30]Satoru Fujishige, Kazuo Murota:
Notes on L-/M-convex functions and the separation theorems. Math. Program. 88(1): 129-146 (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 - 1999
- [j28]Satoru Fujishige, Satoru Iwata:
Minimizing a Submodular Function Arising From a Concave Function. Discret. Appl. Math. 92(2-3): 211-215 (1999) - 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) - 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 - 1988
- [j20]Satoru Fujishige, Naoki Katoh, Tetsuo Ichimori:
The Fair Resource Allocation Problem with Submodular Constraints. Math. Oper. Res. 13(1): 164-173 (1988) - 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)
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-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint