Volume 136, Number 1, 30 January 2004 Discrete Mathematics and Theoretical Computer Science (DMTCS)
: On the computational complexity of upper total domination.
, Shilong Ma
: Limits of theory sequences over algebraically closed fields and applications.
: On unicyclic graphs whose second largest eigenvalue dose not exceed 1.
, Wei Li
: On the average similarity degree between solutions of random k-SAT and random CSPs.
Volume 136, Number 2-3, 15 February 2004 The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization
Paul S. Bonsma
: Sparsest cuts and concurrent flows in product graphs.
, Carlo Meloni
: A linear algorithm for the Hamiltonian completion number of the line graph of a cactus.
, Roded Sharan
: A fully dynamic algorithm for modular decomposition and recognition of cographs.
: Approximation algorithms for the watchman route and zookeeper's problems.