1: Enhancing community detection using a network weighting strategy
2: A Novel Measure of Edge Centrality in Social Networks
3: Meta-Kernelization with Structural Parameters
4: On Finding Lekkerkerker-Boland Subgraphs
5: Revisiting the Nystrom Method for Improved Large-Scale Machine Learning
6: An Efficient Dynamic Programming Algorithm for the Generalized LCS Problem with Multiple Substring Exclusion Constrains
7: Competitive-Ratio Approximation Schemes for Minimizing the Makespan in the Online-List Model
8: Extended Fourier analysis of signals
9: Efficient Parallel Computation of the Estimated Covariance Matrix
10: Fast Arithmetic in Algorithmic Self-Assembly
11: A local constant-factor approximation algorithm for MDS problem in anonymous network
12: On the Complexity of Maximum Clique Algorithms: usage of coloring heuristics leads to the 2^(n\5) algorithm running time lower bound
13: Is Cheeger-type Approximation Possible for Nonuniform Sparsest Cut?
14: Further analysis of the binary Euclidean algorithm
15: Fairness in Academic Course Timetabling
16: Approximating 1-dimensional TSP Requires Omega(n log n) Comparisons
17: A Competitive Ratio Approximation Scheme for the k-Server Problem in Fixed Finite Metrics
18: On the Complexity of the Orbit Problem
19: String Submodular Functions with Curvature Constraints
20: A new type of judgement theorems for attribute characters in information system
21: An Optimal Randomized Online Algorithm for Reordering Buffer Management
22: Controling the number of focal elements
23: New modular multiplication and division algorithms based on continued fraction expansion
24: Alternating Traps in Muller and Parity Games