- Combinatorics, Probability and Computing - (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 theory
- Computational Complexity - (Birkhauser) Tables of contents from vol.7 (1998) on. Full text to subscribers via LINK.
- Discrete Applied Mathematics - (Elsevier) Combinatorial Algorithms, Optimization and Computer Science.
- The Electronic Journal of Combinatorics - A refereed all-electronic journal that welcomes papers in all branches of discrete mathematics. Full text is available free on-line.
- Information Processing Letters - The aim of IPL is to allow rapid dissemination of interesting results in the field of information processing in the form of short, concise papers.
- Journal of Complexity - Editor's site. Author and subscriber information.
- Random Structures and Algorithms - 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 combinatori
- Journal of Algorithms - (Academic Press) Contents from vol.14 (1993). Full text to subscribers.
- Journal of Symbolic Computation - (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.
- Journal of Complexity - (Elsevier) Mathematical results on complexity as broadly conceived.
- Journal of Graph Algorithms and Applications - An electronic journal available via WWW. All papers freely available in PostScript and PDF.
- Journal of Algorithms Bibliography - A hypertext bibliography containing papers published in the Journal of Algorithms, 1980-1999.
- Computational Optimization and Applications - (Kluwer) Abstracts and contents from vol.4 (1995). Full text to subscribers.
|
