Computational Complexity - Tables of contents from vol.7 (1998) on. Full text to subscribers via LINK. - http://www.springer.com/west/home/birkhauser/computer+science?SGWID=4-40353-70-1176553-0
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. - http://www.elsevier.com/wps/find/journaldescription.cws_home/505612/description
Discrete Applied Mathematics - 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. - http://www.elsevier.com/wps/find/journaldescription.cws_home/505609/description
Journal of Discrete Algorithms - Contact information, list of accepted and forthcoming papers. - http://www.sciencedirect.com/science/journal/15708667
Journal of Algorithms Bibliography - A hypertext bibliography containing papers published in the Journal of Algorithms, 1980-1999. - http://liinwww.ira.uka.de/bibliography/Misc/HBP/JALGO.html
Journal of Graph Algorithms and Applications - An electronic journal available via WWW. All papers freely available in PostScript and PDF. - http://www.cs.brown.edu/publications/jgaa/
Journal of Complexity - (Elsevier) Mathematical results on complexity as broadly conceived. - http://www.sciencedirect.com/science/journal/0885064X
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. - http://www.elsevier.com/locate/issn/0747-7171
Journal of Algorithms - (Academic Press) Contents from vol.14 (1993). Full text to subscribers. - http://www.elsevier.com/locate/issn/0196-6774
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 - http://www.interscience.wiley.com/jpages/1042-9832/
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. - http://www.combinatorics.org/
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 - http://uk.cambridge.org/journals/cpc/