The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Satoru Fujishige: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige
    Minimum Transversals in Posi-modular Systems. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:576-587 [Conf]
  2. Satoru Fujishige
    Canonical decompositions of symmetric submodular systems. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:53-64 [Conf]
  3. Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige
    An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:251-264 [Conf]
  4. Satoru Fujishige, Satoru Iwata
    Bisubmodular Function Minimization. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:160-169 [Conf]
  5. Akinobu Eguchi, Satoru Fujishige, Akihisa Tamura
    A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:495-504 [Conf]
  6. Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige
    Minimizing a Monotone Concave Function with Laminar Covering Constraints. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:71-81 [Conf]
  7. Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige
    Minimum Cost Source Location Problems with Flow Requirements. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:769-780 [Conf]
  8. Satoru Iwata, Lisa Fleischer, Satoru Fujishige
    A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:97-106 [Conf]
  9. Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige
    Locating Sources to Meet Flow Demands in Undirected Networks. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:300-313 [Conf]
  10. Kazuo Iwano, Shinji Misono, Shu Tezuka, Satoru Fujishige
    A New Scaling Algorithm for the Maximum Mean Cut Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:3, pp:243-255 [Journal]
  11. Kazutoshi Ando, Satoru Fujishige, Toshio Nemoto
    Decomposition of a Bidirected Graph into Strongly Connected Components and Its Signed Poset Structure. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:68, n:3, pp:237-248 [Journal]
  12. Satoru Fujishige
    A laminarity property of the polyhedron described by a weakly posi-modular set function. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:100, n:1-2, pp:123-126 [Journal]
  13. Satoru Fujishige, Satoru Iwata
    Minimizing a Submodular Function Arising From a Concave Function. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:92, n:2-3, pp:211-215 [Journal]
  14. Satoru Fujishige, Akihisa Tamura
    A general two-sided matching market with discrete concave utility functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:6, pp:950-970 [Journal]
  15. Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige
    An O(n log2n) algorithm for the optimal sink location problem in dynamic tree networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2387-2401 [Journal]
  16. Satoru Fujishige, Kazuhisa Makino, Takashi Takabatake, Kenji Kashiwabara
    Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:13-27 [Journal]
  17. Satoru Fujishige, Sachin B. Patkar
    Realization of set functions as cut functions of graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:226, n:1-3, pp:199-210 [Journal]
  18. Satoru Fujishige, Gleb A. Koshevoy, Yoshio Sano
    Matroids on convex geometries (cg-matroids). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:15, pp:1936-1950 [Journal]
  19. Satoru Fujishige
    Polymatroidal Dependence Structure of a Set of Random Variables [Citation Graph (0, 0)][DBLP]
    Information and Control, 1978, v:39, n:1, pp:55-72 [Journal]
  20. Y. Sawaragi, T. Katayama, Satoru Fujishige
    Sequential State Estimation with Interrupted Observation [Citation Graph (0, 0)][DBLP]
    Information and Control, 1972, v:21, n:1, pp:56-71 [Journal]
  21. Kazuhisa Makino, Takashi Takabatake, Satoru Fujishige
    A simple matching algorithm for regular bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:4, pp:189-193 [Journal]
  22. Satoru Iwata, Lisa Fleischer, Satoru Fujishige
    A combinatorial strongly polynomial algorithm for minimizing submodular functions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:4, pp:761-777 [Journal]
  23. Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige
    Locating Sources to Meet Flow Demands in Undirected Networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:42, n:1, pp:54-68 [Journal]
  24. Satoru Fujishige
    An Efficient PQ-Graph Algorithm for Solving the Graph-Realization Problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:21, n:1, pp:63-86 [Journal]
  25. Satoru Fujishige, Zaifu Yang
    A Note on Kelso and Crawford's Gross Substitutes Condition. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2003, v:28, n:3, pp:463-469 [Journal]
  26. Kazutoshi Ando, Satoru Fujishige
    On structures of bisubmodular polyhedra. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:74, n:, pp:293-317 [Journal]
  27. Takeshi Naitoh, Satoru Fujishige
    A note on the Frank-Tardos bi-truncation algorithm for crossing-submodular functions. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:53, n:, pp:361-363 [Journal]
  28. Satoru Fujishige
    A maximum flow algorithm using MA ordering. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:176-178 [Journal]
  29. Satoru Fujishige
    A Min-Max Theorem for Bisubmodular Polyhedra. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:2, pp:294-308 [Journal]
  30. Satoru Fujishige, Satoru Iwata
    Bisubmodular Function Minimization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:4, pp:1065-1073 [Journal]
  31. Satoru Fujishige
    A decomposition of distributive lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:1, pp:35-55 [Journal]
  32. Kazutoshi Ando, Satoru Fujishige, Takeshi Naitoh
    A characterization of bisubmodular functions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:148, n:1-3, pp:299-303 [Journal]

  33. Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. [Citation Graph (, )][DBLP]


  34. Minimum Cost Source Location Problems with Flow Requirements. [Citation Graph (, )][DBLP]


  35. Minimizing a monotone concave function with laminar covering constraints. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002