Computer Science

Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory.

DMTCS is a high standard peer-reviewed electronic journal devoted to rapid publication of innovative research which covers the fields of Discrete Mathematics and Theoretical Computer Science and puts a certain emphasis on the intersection of these two fields. Coverage includes analysis of algorithms; automata, logics, and semantics; combinatorics; discrete algorithms; distributed computing and networking; graph theory.