1: Symmetry and approximability of submodular maximization problems
2: Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
3: Constant-factor approximation of domination number in sparse graphs
4: String Indexing for Patterns with Wildcards
5: Computing a Longest Common Palindromic Subsequence
6: Is it possible to find the maximum clique in general graphs?
7: Mirroring co-evolving trees in the light of their topologies
8: Secondary Spectrum Auctions for Symmetric and Submodular Bidders
9: Overlapping Community Detection in Networks: the State of the Art and Comparative Study
10: Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_2$