Computing the strength of a graph

The network inhibition problem

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Algorithms for graphic polymatroids and parametric s-Sets

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms

Increasing the weight of minimum spanning trees

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms

Submodular Functions in Problems of Synthesis of Networks

Cybernetics and Systems Analysis

Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and Its Connections with Principal Partition

FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science

Improving graph partitions using submodular functions

Discrete Applied Mathematics - Submodularity

Clustering, community partition and disjoint spanning trees

ACM Transactions on Algorithms (TALG)

Transforming a graph into a 1-balanced graph

Discrete Applied Mathematics