1 Table of Contents: “... Maximization in Social Networks -- A parallel algorithm for constructing multiple independent spanning trees...”

2 Table of Contents: “...-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton Algorithm -- The constrained parallel...”

3 Table of Contents: “... Algorithm and Spanning Tree -- 5. Incremental Method and Maximum Network Flow -- 6. Linear Programming -- 7...”

4 Table of Contents: “... Stock Allocation Problem -- Approximation Algorithm for the Minimum Directed Tree Cover --...”

5 Table of Contents: “... Algorithm for Powerful Alliances in Trees -- NP-Completeness of Spreading Colored Points -- Construction...”

6 Table of Contents: “... -- Simple Heuristics for the Rooted Max Tree Coverage Problem -- Efficient Algorithms for k-Submodular...”

7 Table of Contents: “... Increasing Subsequence -- Approximating Decision Trees with Priority Hypotheses -- Approximating the $\lambda...”

8 Table of Contents: “... for Competitive Influence Spread in Social Networks -- Improved Approximation Algorithms for Multidepot...”

9 Table of Contents: “... -- The Bag-Based Search: A meta-algorithm to construct tractable logical circuits for graphs based on tree...”