Decomposition of submodular functionsCUNNINGHAM, W. H.Combinatorica (Print). 1983, Vol 3, Num 1, pp 53-68, issn 0209-9683Article

Balanced sets in an independence structure induced by a submodular functionDAWSON, J. E.Journal of mathematical analysis and applications. 1983, Vol 95, Num 1, pp 214-222, issn 0022-247XArticle

On testing convexity and submodularityPARNAS, Michal; RON, Dana; RUBINFELD, Ronitt et al.Lecture notes in computer science. 2002, pp 11-25, issn 0302-9743, isbn 3-540-44147-6, 15 p.Conference Paper

Disconnecting sets in single and two-terminal-pair networksGRANOT, F; PENN, M; QUEYRANNE, M et al.Networks (New York, NY). 1996, Vol 27, Num 2, pp 117-123, issn 0028-3045Article

Connectivity of submodular functionsOXLEY, J; WHITTLE, G.Discrete mathematics. 1992, Vol 105, Num 1-3, pp 173-184, issn 0012-365XArticle

The partial order of a polymatroid extreme pointBIXBY, R. E; CUNNINGHAM, W. H; TOPKIS, D. M et al.Mathematics of operations research. 1985, Vol 10, Num 3, pp 367-378, issn 0364-765XArticle

K-submodular functions and convexity of their Lovász extensionANDO, Kazutoshi.Discrete applied mathematics. 2002, Vol 122, Num 1-3, pp 1-12, issn 0166-218XArticle

A strongly polynomial time algorithm for a constrained submodular optimization problemHARTVIGSEN, David.Discrete applied mathematics. 2001, Vol 113, Num 2-3, pp 183-194, issn 0166-218XArticle

Minimizing symmetric submodular functions : Networks and matroidsQUEYRANNE, M.Mathematical programming. 1998, Vol 82, Num 1-2, pp 3-12, issn 0025-5610Article

A generalisation of the matroid lift constructionWHITTLE, G.Transactions of the American Mathematical Society. 1989, Vol 316, Num 1, pp 141-159, issn 0002-9947Article

Adjacency on polymatroidsTOPKIS, D. M.Mathematical programming. 1984, Vol 30, Num 2, pp 229-237, issn 0025-5610Article

A faster scaling algorithm for minimizing submodular functionsIWATA, Satoru.SIAM journal on computing (Print). 2003, Vol 32, Num 4, pp 833-840, issn 0097-5397, 8 p.Article

Upper envelopes of inner premeasuresKÖNIG, H.Annales de l'Institut Fourier. 2000, Vol 50, Num 2, issn 0373-0956, XI, XII, 401-422 [24 p.]Article

Fixed tree games with multilocated playersMIQUEL, S; VAN VEIZEN, B; HAMERS, H et al.Networks (New York, NY). 2006, Vol 47, Num 2, pp 93-101, issn 0028-3045, 9 p.Article

A faster scaling algorithm for minimizing submodular functionsIWATA, Satoru.Lecture notes in computer science. 2002, pp 1-8, issn 0302-9743, isbn 3-540-43676-6, 8 p.Conference Paper

A faster strongly polynomial time algorithm for submodular function minimizationORLIN, James B.Mathematical programming (Print). 2009, Vol 118, Num 2, pp 237-251, issn 0025-5610, 15 p.Article

Discrete convex analysisMUROTA, K.Mathematical programming. 1998, Vol 83, Num 3, pp 313-371, issn 0025-5610Article

Odd submodular functions, dilworth functions and discrete convex functionsLIQUN QI.Mathematics of operations research. 1988, Vol 13, Num 3, pp 435-446, issn 0364-765XArticle

A strongly polynomial cut canceling algorithm for minimum cost submodular flowIWATA, Satoru; MCCORMICK, S. Thomas; SHIGENO, Maiko et al.SIAM journal on discrete mathematics (Print). 2006, Vol 19, Num 2, pp 304-320, issn 0895-4801, 17 p.Article

A descent method for submodular function minimizationFUJISHIGE, Satoru; IWATA, Satoru.Mathematical programming. 2002, Vol 92, Num 2, pp 387-390, issn 0025-5610Article

PERFECTLY MATCHABLE SUBGRAPH PROBLEM ON A BIPARTITE GRAPHSHARIFOV, Firdovsi.RAIRO. Recherche opérationnelle. 2010, Vol 44, Num 1, pp 27-42, issn 0399-0559, 16 p.Article

The complexity of soft constraint satisfactionCOHEN, David A; COOPER, Martin C; JEAVONS, Peter G et al.Artificial intelligence. 2006, Vol 170, Num 11, pp 983-1016, issn 0004-3702, 34 p.Article

OPTIMIZING SENSING: FROM WATER TO THE WEB : Data mining and machine leardingKRAUSE, Andreas; GUESTRIN, Carlos.Computer (Long Beach, CA). 2009, Vol 42, Num 8, pp 38-45, issn 0018-9162, 8 p.Article

Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular SystemsOKUMOTO, Kazumasa; FUKUNAGA, Takuro; NAGAMOCHI, Hiroshi et al.Algorithmica. 2012, Vol 62, Num 3-4, pp 787-806, issn 0178-4617, 20 p.Article

Structural and algorithmic properties for parametric minimum cutsGRANOT, Frieda; MCCORMICK, S. Thomas; QUEYRANNE, Maurice et al.Mathematical programming (Print). 2012, Vol 135, Num 1-2, pp 337-367, issn 0025-5610, 31 p.Article