A refereed all-electronic journal that welcomes papers in all branches of discrete mathematics. Full text is available free on-line.

(CUP) Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the th...

An electronic journal available via WWW. All papers freely available in PostScript and PDF.

Tables of contents from vol.7 (1998) on. Full text to subscribers via LINK.

(Academic Press) A forum for research in the algorithmic treatment of all types of symbolic objects. Tables of contents from vol.15 (1993). Full text to subscribers.

Aims to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Full text by subscription.

Results concerning random graphs, hypergraphs, matroids, trees, mappings, permutations, matrices, sets and orders, as well as stochastic graph processes and networks are presented with particular emphasis on the use of probabilistic methods in combina...

Editor's site. Author and subscriber information.

(Academic Press) Contents from vol.14 (1993). Full text to subscribers.

A hypertext bibliography containing papers published in the Journal of Algorithms, 1980-1999.