1: Recursive Shortest Path Algorithm with Application to Density-integration of Weighted Graphs
2: Fast Local Computation Algorithms
3: A Family of Encodings for Translating Pseudo-Boolean Constraints into SAT
4: On-line construction of position heaps
5: Effective partitioning method for computing weighted Moore-Penrose inverse
6: Symbolic computation of weighted Moore-Penrose inverse using partitioning method
7: Computing generalized inverses using LU factorization of matrix product
8: About the generalized LM-inverse and the weighted Moore-Penrose inverse
9: Optimal Column-Based Low-Rank Matrix Reconstruction
10: Dimensionality Decrease Heuristics for NP Complete Problems
11: Randomized $\Delta$-Edge-Coloring via Quaternion of Complex Colors
12: A Note On Estimating the Spectral Norm of A Matrix Efficiently
13: Subexponential Parameterized Algorithm for Minimum Fill-in
14: Approximate Tree Decompositions of Planar Graphs in Linear Time
15: Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem
16: Dynamic Programming for Graphs on Surfaces
17: Faster Information Dissemination in Dynamic Networks via Network Coding
18: Kernels for Global Constraints
19: Mathematical aspects of phylogenetic groves
20: Parallel calculation of the median and order statistics on GPUs with application to robust regression
21: Discovering a junction tree behind a Markov network by a greedy algorithm