1 Table of Contents: “...-oriented conjunctive queries is ? 2 p -hard -- Computing infinite relations using finite expressions: A new...”

2 Table of Contents: “... under Limits and Computable Operators -- Graph Theory and Algorithms 2 -- A Characterization of Graphs...”

3 Table of Contents: “... allocationhub location -- Approximation algorithm for the balanced 2-correlation clustering problem on well...”

4 Table of Contents: “... constrainedcluster sizes -- Two-Way Currency Trading Algorithms in the Discrete Setting -- Approximation Algorithms...”

5 Table of Contents: “... -- Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays -- Efficient Method for Periodic...”

6 Table of Contents: “...Preface -- 1. Introduction -- 2. Greedy Strategy -- 3. Restriction -- 4. Partition -- 5. Guillotine...”

7 Table of Contents: “... Constraints in Clouds -- Two-Stage Stochastic Max-Weight Independent Set Problems -- Routing and Scheduling...”

8 Table of Contents: “...Preface -- 1. Introduction -- 2. Sensor Cover -- 3. Connected Sensor Cover -- 4. lifetime...”

9 Table of Contents: “...1. Introduction.-2. Divide-and-Conquer -- 3. Dynamic Programming and Shortest Path -- 4. Greedy...”

10 Table of Contents: “...Part 2. Classic Problems -- The Steiner ratio of $L_p$-planes -- The Maximum Clique Problem...”

11 Table of Contents: “... Graphs -- An Approximation Algorithm for the B-prize-collecting Multicut Problem in Trees -- Two-Stage...”

12 Table of Contents: “... on aNew Graph Model -- Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint...”

13 Table of Contents: “...The Steiner Ratio of finite-dimensional ?p-spaces -- Shortest Networks for One line and Two Points...”

14 Table of Contents: “... Algorithms -- Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest...”

15 Table of Contents: “... for Bounded Pathwidth Graphs -- Two Paths Location of a Tree with Positive or Negative Weights...”

16 Table of Contents: “... in Wireless Sensor Networks -- On Approximation Algorithms for Interference-Aware Broadcast Scheduling in 2D...”

17 Table of Contents: “...On helping and interactive proof systems -- Average time complexity of the SAT 1.2 algorithm...”

18 “... papers presented together with 2 invited talks and 1 plenary lecture were carefully reviewed and selected...”

19 “... Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two...”