内容

目次

Equitable and m-bounded coloring of split graphs.- Four coloring for a subset of maximal planar graphs with minimum degree five.- Enumeration algorithm for the edge coloring problem on bipartite graphs.- On-line recognition of interval graphs in O(m+nlog n) time.- Connected proper interval graphs and the guard problem in spiral polygons.- Weighted connected domination and Steiner trees in distance-hereditary graphs.- On central spanning trees of a graph.- Complete bipartite decompositions of crowns, with applications to complete directed graphs.- Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament.- Complementary ?1-graphs and related combinatorial structures.- Double description method revisited.- On skeletons, diameters and volumes of metric polyhedra.- Improving branch and bound for Jobshop scheduling with constraint propagation.- A new efficiently solvable special case of the three-dimensional axial bottleneck assignment problem.- Ramsey numbers by stochastic algorithms with new heuristics.- On the hybrid neural network model for solving optimization problems.- Constructive — non-constructive approximation and maximum independent set problem.- Weakly greedy algorithm and pair-delta-matroids.- On integer multiflows and metric packings in matroids.- Optimum alphabetic binary trees.- Block codes for dyadic phase shift keying.- Zigzag codes and z-free hulls.- Contiguity orders.- Worst-case analysis for on-line data compression.- Gossiping in cayley graphs by packets.- On embedding 2-dimensional toroidal grids into de Bruijn graphs with clocked congestion one.- N-cube string matching algorithm with long texts.- Combinatorics for multiprocessor scheduling optimization and other contexts in computer architecture.- Some applications of combinatorial optimization in parallel computing.- On the parallel complexity of the alternating Hamiltonian cycle problem.- Threshold graphs and synchronization protocols.- Task assignment in distributed systems using network flow methods.- Distributed rerouting in DCS mesh networks.