1: A Recursive Algorithmic Approach to the Finding of Permutations for the Combination of Any Two Sets
2: A Solution of Degree Constrained Spanning Tree Using Hybrid GA
3: Approximating Large Frequency Moments with $O(n^{1-2/k})$ Bits
4: Simple linear algorithms for mining graph cores
5: Skew in Parallel Query Processing
6: Temporal Graph Traversals: Definitions, Algorithms, and Applications
7: Binary Jumbled Pattern Matching via All-Pairs Shortest Paths
8: On the Nearest Neighbor Rule for the Metric Traveling Salesman Problem
9: NextBestOnce: Achieving Polylog Routing despite Non-greedy Embeddings
10: A Second Look at Counting Triangles in Graph Streams (revised)
11: A lower bound for metric 1-median selection
12: BPP: Large Graph Storage for Efficient Disk Based Processing
13: Approximation Algorithm Project
14: New algorithms and lower bounds for circuits with linear threshold gates
15: Stretching Stretch
16: QoS Constrained Optimal Sink and Relay Placement in Planned Wireless Sensor Networks
17: Optimal Embedding of Functions for In-Network Computation: Complexity Analysis and Algorithms
18: Parameterized Complexity of Edge Interdiction Problems
19: Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits
20: Directed Width Parameters and Circumference of Digraphs
21: Inifnite hypercomplex number system factorization methods
22: Constant Factor Approximation for Capacitated k-Center with Outliers
23: A tight lower bound instance for k-means++ in constant dimension
24: An iterative merging placement algorithm for the fixed-outline floorplanning