Paschos V.Th. (ed.) Combinatorial Optimization and Theoretical Computer Science: Interfaces And Perspectives

Wiley, 2008. — 516 p. — ISBN: 978-1-84821-021-9.The Complexity of Single Machine Scheduling Problems under Scenario-based Uncertainty (M. A. Aloulou, F. Della Croce).
(Non)-Approximability Results for the Multi-criteria Min and Max TSP(1, 2) (E. Angel, E. Bampis, L. Gourvès, J. Monnot).
Online Models for Set-covering: the Flaw of Greediness (G. Ausiello, A. Giannakos, V. Th. Paschos).
Comparison of Expressiveness for Timed Automata and Time Petri Nets (B. Bérard, F. Cassez, S. Haddad, D. Lime, O. H. Roux).
A “Maximum Node Clustering” Problem (G. Carello, F. Della Croce, A. Grosso, M. Locatelli).
The Patrolling Problem: Theoretical and Experimental Results (Y. Chevaleyre).
Restricted Classes of Utility Functions for Simple Negotiation Schemes: Sufficiency, Necessity and Maximality (Y. Chevaleyre, U. Endriss, N. Maudet).
Worst-case Complexity of Exact Algorithms for NP-hard Problems (F. Della Croce, B. Escoffier, M. Kaminski, V. Th. Paschos).
The Online Track Assignment Problem (M. Demange, G. Di Stefano, B. Leroy-Beaulieu).
Complexity and Approximation Results for the Min Weighted Node Coloring Problem (M. Demange et al).
Weighted Edge Coloring (M. Demange et al).
An Extensive Comparison of 0-1 Linear Programs for the Daily Satellite Mission Planning (Virginie Gabrel).
Dantzig-Wolfe Decomposition for Linearly Constrained Stable Set Problem (Virginie Gabrel).
Algorithmic Games (Aristotelis Giannakos et al).
Flows! (Michel Koskas, Cécile Murat).
The Complexity of the Exact Weighted Independent Set Problem (Martin Milanic, Jérôme Monnot).
The Labeled Perfect Matching in Bipartite Graphs: Complexity and (in) Approximability (Jérôme Monnot).
Complexity and Approximation Results for Bounded-size Paths Packing Problems (Jérôme Monnot, Sophie Toulouse).
An Upper Bound for the Integer Quadratic Multi-knapsack Problem (Dominique Quadri, Eric Soutif, Pierre Tolla).
List of Authors.