| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Satoru Fujishige |
A note on disjoint arborescences.  |
Combinatorica  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Thomas McCormick, Satoru Fujishige |
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. |
Math. Program. |
2010 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) Primary: 65K05, Secondary: 90C27, 68W40 |
| 1 | Satoru Fujishige, Britta Peis |
Lattice Polyhedra and Submodular Flows. |
CTW |
2010 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Fujishige, Takumi Hayashi, Kiyohito Nagano |
Minimizing Continuous Extensions of Discrete Convex Functions with Linear Inequality Constraints. |
SIAM Journal on Optimization |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Fujishige, Kiyohito Nagano |
A Structure Theory for the Parametric Submodular Intersection Problem. |
Math. Oper. Res. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige |
Minimum Transversals in Posimodular Systems. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Faigle, Satoru Fujishige |
A general model for matroids and the greedy algorithm. |
Math. Program. |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C27, 68R99, 05B35 |
| 1 | Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige |
Minimum Cost Source Location Problems with Flow Requirements. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Approximation algorithm, Combinatorial optimization, Connectivity, Location problem |
| 1 | Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige |
Minimizing a monotone concave function with laminar covering constraints. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Thomas McCormick, Satoru Fujishige |
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Fujishige, Gleb A. Koshevoy, Yoshio Sano |
Matroids on convex geometries (cg-matroids). |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Fujishige, Akihisa Tamura |
A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis. |
Math. Oper. Res. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Fujishige, Akihisa Tamura |
A general two-sided matching market with discrete concave utility functions. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige |
Minimum Transversals in Posi-modular Systems. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige |
Minimum Cost Source Location Problems with Flow Requirements. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Fujishige, Satoru Iwata |
Bisubmodular Function Minimization. |
SIAM J. Discrete Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige |
Minimizing a Monotone Concave Function with Laminar Covering Constraints. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Fujishige |
Dual greedy polyhedra, choice functions, and abstract convex geometries. |
Discrete Optimization |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Fujishige, Kazuhisa Makino, Takashi Takabatake, Kenji Kashiwabara |
Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Satoru Fujishige |
A maximum flow algorithm using MA ordering. |
Oper. Res. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Fujishige, Zaifu Yang |
A Note on Kelso and Crawford's Gross Substitutes Condition. |
Math. Oper. Res. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Akinobu Eguchi, Satoru Fujishige, Akihisa Tamura |
A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuhisa Makino, Takashi Takabatake, Satoru Fujishige |
A simple matching algorithm for regular bipartite graphs. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige |
Locating Sources to Meet Flow Demands in Undirected Networks. |
J. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Fujishige, Satoru Iwata |
A descent method for submodular function minimization. |
Math. Program. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Fujishige, Sachin B. Patkar |
Realization of set functions as cut functions of graphs and hypergraphs. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Iwata, Lisa Fleischer, Satoru Fujishige |
A combinatorial strongly polynomial algorithm for minimizing submodular functions. |
J. ACM |
2001 |
DBLP DOI BibTeX RDF |
Discrete optimization, submodular function, strongly polynomial algorithm |
| 1 | Satoru Fujishige, Satoru Iwata |
Bisubmodular Function Minimization. |
IPCO |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Fujishige |
A laminarity property of the polyhedron described by a weakly posi-modular set function. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige |
Locating Sources to Meet Flow Demands in Undirected Networks. |
SWAT |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Iwata, Lisa Fleischer, Satoru Fujishige |
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Fujishige, Satoru Iwata |
Minimizing a Submodular Function Arising From a Concave Function. |
Discrete Applied Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Fujishige |
A Min-Max Theorem for Bisubmodular Polyhedra. |
SIAM J. Discrete Math. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazutoshi Ando, Satoru Fujishige, Takeshi Naitoh |
A characterization of bisubmodular functions. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazutoshi Ando, Satoru Fujishige, Toshio Nemoto |
Decomposition of a Bidirected Graph into Strongly Connected Components and Its Signed Poset Structure. |
Discrete Applied Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazutoshi Ando, Satoru Fujishige |
On structures of bisubmodular polyhedra. |
Math. Program. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwano, Shinji Misono, Shu Tezuka, Satoru Fujishige |
A New Scaling Algorithm for the Maximum Mean Cut Problem. |
Algorithmica |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeshi Naitoh, Satoru Fujishige |
A note on the Frank-Tardos bi-truncation algorithm for crossing-submodular functions. |
Math. Program. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Fujishige |
A decomposition of distributive lattices. |
Discrete Mathematics |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Fujishige |
An Efficient PQ-Graph Algorithm for Solving the Graph-Realization Problem. |
J. Comput. Syst. Sci. |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Fujishige |
Canonical decompositions of symmetric submodular systems. |
Graph Theory and Algorithms |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Fujishige |
Polymatroidal Dependence Structure of a Set of Random Variables |
Information and Control |
1978 |
DBLP DOI BibTeX RDF |
|
| 1 | Y. Sawaragi, T. Katayama, Satoru Fujishige |
Sequential State Estimation with Interrupted Observation |
Information and Control |
1972 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")