1: The multi-vehicle covering tour problem: building routes for urban patrolling
2: Substring Suffix Selection
3: Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems
4: Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem
5: PROBI: A Heuristic for the probabilistic k-median problem
6: Simple Destination-Swap Strategies for Adaptive Intra- and Inter-Tenant VM Migration
7: A Probabilistic Analysis of Kademlia Networks
8: XML Compression via DAGs
9: Applications of Continuous Amortization to Bisection-based Root Isolation
10: Beyond the Shannon’s Bound
11: Discordant Compact Logic-Arithmetic Structures in Discrete Optimization Problems
12: A Simple FPTAS for Counting Edge Covers
13: Partition-Merge: Distributed Inference and Modularity Optimization
14: Playing with parameters: structural parameterization in graphs
15: Order-preserving pattern matching with k mismatches
16: Online Bin Covering: Expectations vs. Guarantees
17: The Computational Complexity of the Game of Set and its Theoretical Applications
18: The Random Bit Complexity of Mobile Robots Scattering
19: On the Connectivity Preserving Minimum Cut Problem
20: Minimizing Rosenthal Potential in Multicast Games
21: Structured Convex Optimization under Submodular Constraints
22: Treedy: A Heuristic for Counting and Sampling Subsets
23: On MAP Inference by MWSS on Perfect Graphs
24: How good is the Chord algorithm?
25: A general method for common intervals
26: Decompositions of Triangle-Dense Graphs