Volume 13, April 2003CTW 2003 - 2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization, University of Twente, Enschede, the Netherlands, 14 - 16 May 2003
Paul S. Bonsma
: The Complexity of the Matching-cut Problem for Various Graph Classes.
: The Relation between the no-wait Job Shop Problem and the Traveling Salesman Problem.
: Distributed Algorithms in Wireless Sensor Networks.
: Using mincuts to design secret sharing schemes in graphs.
: Average Complexity of Addition Updates and Range Queries over an Array using Graphs.