| 2008 |
|---|
| 36 | EE | S. Thomas McCormick,
Satoru Fujishige:
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization.
SODA 2008: 44-53 |
| 35 | EE | Mariko Sakashita,
Kazuhisa Makino,
Satoru Fujishige:
Minimum Cost Source Location Problems with Flow Requirements.
Algorithmica 50(4): 555-583 (2008) |
| 34 | EE | Mariko Sakashita,
Kazuhisa Makino,
Satoru Fujishige:
Minimizing a monotone concave function with laminar covering constraints.
Discrete Applied Mathematics 156(11): 2004-2019 (2008) |
| 2007 |
|---|
| 33 | EE | Satoru Fujishige,
Gleb A. Koshevoy,
Yoshio Sano:
Matroids on convex geometries (cg-matroids).
Discrete Mathematics 307(15): 1936-1950 (2007) |
| 2006 |
|---|
| 32 | EE | Mariko Sakashita,
Kazuhisa Makino,
Hiroshi Nagamochi,
Satoru Fujishige:
Minimum Transversals in Posi-modular Systems.
ESA 2006: 576-587 |
| 31 | EE | Mariko Sakashita,
Kazuhisa Makino,
Satoru Fujishige:
Minimum Cost Source Location Problems with Flow Requirements.
LATIN 2006: 769-780 |
| 30 | EE | 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) |
| 29 | EE | Satoru Fujishige,
Akihisa Tamura:
A general two-sided matching market with discrete concave utility functions.
Discrete Applied Mathematics 154(6): 950-970 (2006) |
| 2005 |
|---|
| 28 | EE | Mariko Sakashita,
Kazuhisa Makino,
Satoru Fujishige:
Minimizing a Monotone Concave Function with Laminar Covering Constraints.
ISAAC 2005: 71-81 |
| 27 | EE | Satoru Fujishige,
Satoru Iwata:
Bisubmodular Function Minimization.
SIAM J. Discrete Math. 19(4): 1065-1073 (2005) |
| 2004 |
|---|
| 26 | | 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 |
| 25 | EE | 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) |
| 24 | EE | Satoru Fujishige:
Dual greedy polyhedra, choice functions, and abstract convex geometries.
Discrete Optimization 1(1): 41-49 (2004) |
| 2003 |
|---|
| 23 | EE | Akinobu Eguchi,
Satoru Fujishige,
Akihisa Tamura:
A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model.
ISAAC 2003: 495-504 |
| 22 | EE | Satoru Fujishige,
Zaifu Yang:
A Note on Kelso and Crawford's Gross Substitutes Condition.
Math. Oper. Res. 28(3): 463-469 (2003) |
| 21 | EE | Satoru Fujishige:
A maximum flow algorithm using MA ordering.
Oper. Res. Lett. 31(3): 176-178 (2003) |
| 2002 |
|---|
| 20 | EE | Kazuhisa Makino,
Takashi Takabatake,
Satoru Fujishige:
A simple matching algorithm for regular bipartite graphs.
Inf. Process. Lett. 84(4): 189-193 (2002) |
| 19 | EE | Kouji Arata,
Satoru Iwata,
Kazuhisa Makino,
Satoru Fujishige:
Locating Sources to Meet Flow Demands in Undirected Networks.
J. Algorithms 42(1): 54-68 (2002) |
| 2001 |
|---|
| 18 | EE | Satoru Fujishige,
Satoru Iwata:
Bisubmodular Function Minimization.
IPCO 2001: 160-169 |
| 17 | EE | Satoru Fujishige,
Sachin B. Patkar:
Realization of set functions as cut functions of graphs and hypergraphs.
Discrete Mathematics 226(1-3): 199-210 (2001) |
| 16 | EE | Satoru Iwata,
Lisa Fleischer,
Satoru Fujishige:
A combinatorial strongly polynomial algorithm for minimizing submodular functions.
J. ACM 48(4): 761-777 (2001) |
| 2000 |
|---|
| 15 | EE | Satoru Iwata,
Lisa Fleischer,
Satoru Fujishige:
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions.
STOC 2000: 97-106 |
| 14 | EE | Kouji Arata,
Satoru Iwata,
Kazuhisa Makino,
Satoru Fujishige:
Locating Sources to Meet Flow Demands in Undirected Networks.
SWAT 2000: 300-313 |
| 13 | | 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) |
| 1999 |
|---|
| 12 | EE | Satoru Fujishige,
Satoru Iwata:
Minimizing a Submodular Function Arising From a Concave Function.
Discrete Applied Mathematics 92(2-3): 211-215 (1999) |
| 1997 |
|---|
| 11 | EE | Satoru Fujishige:
A Min-Max Theorem for Bisubmodular Polyhedra.
SIAM J. Discrete Math. 10(2): 294-308 (1997) |
| 1996 |
|---|
| 10 | EE | 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) |
| 9 | EE | Kazutoshi Ando,
Satoru Fujishige,
Takeshi Naitoh:
A characterization of bisubmodular functions.
Discrete Mathematics 148(1-3): 299-303 (1996) |
| 8 | | Kazutoshi Ando,
Satoru Fujishige:
On structures of bisubmodular polyhedra.
Math. Program. 74: 293-317 (1996) |
| 1994 |
|---|
| 7 | | 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 |
|---|
| 6 | | Takeshi Naitoh,
Satoru Fujishige:
A note on the Frank-Tardos bi-truncation algorithm for crossing-submodular functions.
Math. Program. 53: 361-363 (1992) |
| 1985 |
|---|
| 5 | EE | Satoru Fujishige:
A decomposition of distributive lattices.
Discrete Mathematics 55(1): 35-55 (1985) |
| 1980 |
|---|
| 4 | | Satoru Fujishige:
Canonical decompositions of symmetric submodular systems.
Graph Theory and Algorithms 1980: 53-64 |
| 3 | | Satoru Fujishige:
An Efficient PQ-Graph Algorithm for Solving the Graph-Realization Problem.
J. Comput. Syst. Sci. 21(1): 63-86 (1980) |
| 1978 |
|---|
| 2 | | Satoru Fujishige:
Polymatroidal Dependence Structure of a Set of Random Variables
Information and Control 39(1): 55-72 (1978) |
| 1972 |
|---|
| 1 | | Y. Sawaragi,
T. Katayama,
Satoru Fujishige:
Sequential State Estimation with Interrupted Observation
Information and Control 21(1): 56-71 (1972) |
