Leo Liberti, Francesco Maffioli (Eds.):
CTW04 Workshop on Graphs and Combinatorial Optimization, Scientific Program, Villa Vigoni, Menaggio (CO), Italy, 31st May to 2nd June 2004.
: Submodular Function Minimization in Zetan and Searching in Monge arrays.
: Polynomial Solvability of Mader's Edge-disjoint Paths Problem.
, N. Serna
: The Proper Interval Colored Graph Problem for Caterpillar Trees.
: New Exponential Neighbourhood for Polynomially Solvable TSPs.
M. Reza Emamy-Khansary
: The Cut Number of the n-Cube, Boolean Methods and a Geometric Connection to Threshold Logic.
: On a Packet Scheduling Problem for Smart Antennas and Polyhedra Defined Circular-ones Matrices.
: k-Pseudosnakes in n-dimensional Hypercubes.
: Connections between Continuous and Combinatorial Optimization Problems through an Extension of the Fundamental Theorem of Linear Programming.
, Hiro Ito
: Subdivision of the Hierarchy of H-colorable Graph Classes by Circulant Graphs.
: The Complexity of Arc-coloring for Directed Hypergraphs.