1: The K Shortest Paths Problem with Application to Routing
2: P_3-Games on Chordal Bipartite Graphs
3: Local Maxima and Improved Exact Algorithm for MAX-2-SAT
4: Output-sensitive Complexity of Multiobjective Combinatorial Optimization
5: A Polynomial Kernel for Distance-Hereditary Vertex Deletion
6: Molecular solutions for the Maximum K-colourable Sub graph Problem in Adleman-Lipton model
7: On Solving Non-preemptive Mixed-criticality Match-up Scheduling Problem with Two and Three Criticality Levels
8: An Attempt to Design a Better Algorithm for the Uncapacitated Facility Location Problem
9: A Proposed Algorithm for Minimum Vertex Cover Problem and its Testing
10: Target Set Selection in Dense Graph Classes
11: Online and Random-order Load Balancing Simultaneously
12: Bias-Aware Sketches
13: Derandomization for k-submodular maximization
14: Hardness of approximation for strip packing
15: Online Submodular Maximization with Free Disposal: Randomization Beats 0.25 for Partition Matroids
16: Subexponential parameterized algorithms for graphs of polynomial growth
17: Nested algorithms for optimal reservoir operation and their embedding in a decision support platform
18: Almost Optimal Streaming Algorithms for Coverage Problems
19: Efficient Pattern Matching in Elastic-Degenerate Strings
20: LP Rounding and Combinatorial Algorithms for Minimizing Active and Busy Time
21: Optimal In-Place Suffix Sorting
22: On-line algorithms for multiplication and division in real and complex numeration systems
23: On the Exact Amount of Missing Information that makes Finding Possible Winners Hard
24: Finding Largest Common Substructures of Molecules in Quadratic Time
25: Aligning coding sequences with frameshift extension penalties
26: Logarithmic Query Complexity for Approximate Nash Computation in Large Games
27: Scheduling Distributed Clusters of Parallel Machines: Primal-Dual and LP-based Approximation Algorithms [Full Version]
28: Towards Asymptotically Optimal One-to-One PDP Algorithms for Capacity 2+ Vehicles
29: Performance evaluation of explicit finite difference algorithms with varying amounts of computational and memory intensity
30: Sort well with energy-constrained comparisons