In celebration of the launch of our new journal Computer Science Review we have opened up the first review articles and book reviews to be published in Volume 1 (2007) and 2 (2008). 

Issues 1, 2 and 3 of Volume 2 are now online on ScienceDirect. When Issue 4 is published it will be added to this list below.

If your institution has a subscription to ScienceDirect you can access the full-text articles. In the case your institution does not have a subscription to ScienceDirect a PDF of each article has been made available to download.

J. Díaz, Universitat Politecnica de Catalunya, Spain
J. Nešetřil, Charles University, Czech Republic
Editors-in-Chief – Computer Science Review

Volume 2, Issue 3 (December 2008)

1. A survey of constraint-based programming paradigms
Maria Grazia Buscemi, Ugo Montanari
[PDF]

2. Colouring, constraint satisfaction, and complexity
Pavol Hell, Jaroslav Nešetřil
[PDF]

3. The saga of minimum spanning trees
Martin Mareš
[PDF]

Volume 2, Issue 2 (August 2008)

1. Randomly colouring graphs (a combinatorial view)
Jean-Sébastien Sereni
[PDF]

2. Locally constrained graph homomorphisms—structure, complexity, and applications
Jiří Fiala, Jan Kratochvíl
[PDF]

3. Environment for statistical computing
Jaromír Antoch
[PDF]

Book Reviews

4. Rina Dechter , Constraint Processing, Morgan Kaufmann Publisher (2003) ISBN 1-55860-890-7; Francesca Rossi, Peter van Beek and Toby Walsh, Editors, Handbook of Constraint Programming, Elsevier (2006) ISBN 978-0-444-52726-4
Roman Barták
[PDF]

5. Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani , Algorithms, McGraw Hill, Boston (2007) ISBN 978-007352340-8;  Jon Kleinberg and Éva Tardos, Algorithm Design, Pearson/Addison Wesley, Boston (2006) ISBN 978-032129535-4
Martin Dietzfelbinger
[PDF]

Volume 2, Issue 1 (April 2008)

1. A survey of state vectors
Ward Douglas Maurer
[PDF]

2. Subexponential parameterized algorithms
Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
[PDF]

3. The consequences of eliminating NP solutions
Piotr Faliszewski, Lane A. Hemaspaandra
[PDF]

Book Reviews

4. E. Grädel, P. Kolaitis, L. Libkin, M. Marx, I. Spencer, M. Vardi, Y. Venema and S. Weinstein , Finite Model Theory and Its Applications, Springer-Verlag (2007).
Albert Atserias
[PDF]

5. Review of “Introduction to clustering large and high-dimensional data” by J. Kogan
Dieter Mitsche
[PDF]

Volume 1, Issue 2 (December 2007)

1. Designing reliable algorithms in unreliable memories
Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
[PDF]

2. Recent development in computational complexity characterization of Nash equilibrium
Xi Chen, Xiaotie Deng
[PDF]

3. Nash equilibrium and economics: Remarks
Andreu Mas-Colell
[PDF]

 Book Review

4. Invitation to fixed-parameter algorithms
Dimitrios M. Thilikos
[PDF]

Volume 1, Issue 1 (August 2007)

1. Introduction
J. Díaz, J. Nešetřil
[PDF]

2. Sampling-based robot motion planning: Towards realistic applications
Konstantinos I. Tsianos, Ioan A. Sucan, Lydia E. Kavraki
[PDF]

3. Combinatorial and computational aspects of graph packing and graph decomposition
Raphael Yuster
[PDF]

4. Graph clustering
Satu Elisa Schaeffer
[PDF]

5. Reminiscences related to graph theory
Miroslav Fiedler
[PDF]

Book Reviews

6. Understanding motion planning better: A comparative review of “Principles of Robot Motion: Theory, Algorithms, and Implementations” by H. Choset et al.
Pablo Jiménez
[PDF]

7. Phillip Kaye, Raymond Laflamme and Michele Mosca, An Introduction to Quantum Computing, Oxford University Press (2007) ISBN 019857049X
Mika Hirvensalo
[PDF]