1: Reconstruction and uniqueness of moving obstacles
2: Online Regenerator Placement
3: Algorithms versus Circuit Lower Bounds
4: Colored Packets with Deadlines and Metric Space Transition Cost
5: Unmixing Incoherent Structures of Big Data by Randomized or Greedy Decomposition
6: On the performance of a cavity method based algorithm for the Prize-Collecting Steiner Tree Problem on graphs
7: Parallel machine scheduling with step deteriorating jobs and setup times by a hybrid discrete cuckoo search algorithm
8: Approximate Constraint Satisfaction Requires Large LP Relaxations
9: Unidirectional Input/Output Streaming Complexity of Reversal and Sorting
10: Denoising Using Projection Onto Convex Sets (POCS) Based Framework
11: Shortest Paths in Microseconds
12: {\L}ukasiewicz mu-Calculus
13: Efficient Enumeration of Chordless Cycles
14: A proof for Padberg’s conjecture on rank of matching polytope
15: A Quantized Johnson Lindenstrauss Lemma: The Finding of Buffon’s Needle
16: Large induced subgraphs via triangulations and CMSO
17: Fast ranking algorithm for very large data
18: Throughput Maximization in the Speed-Scaling Setting
19: Algorithms for group isomorphism via group extensions and cohomology
20: Aggregate-Max Nearest Neighbor Searching in the Plane
21: Approximation Algorithms for the Load Balanced Capacitated Vehicle Routing Problem
22: A Brief Study of Open Source Graph Databases