- Florian Horn:
**Dicing on the Streett.**1-9

- N. S. Narayanaswamy, N. Belkale, L. Sunil Chandran, Naveen Sivadasan:
**A note on the Hadwiger number of circular arc graphs.**10-13

- Géraldine Jean, Macha Nikolski:
**Genome rearrangements: a correct algorithm for optimal capping.**14-20

- Asaf Levin:
**The finite horizon investor problem with a budget constraint.**21-28

- Tomás Masopust, Alexander Meduna:
**Descriptional complexity of semi-conditional grammars.**29-31

- Saulius Minkevicius:
**The impact of overload conditions on computer network reliability.**32-35

- Vlady Ravelomanana:
**Another proof of Wright's inequalities.**36-39

- Toru Hasunuma, Misa Hirota:
**An improved upper bound on the queuenumber of the hypercube.**41-44

- Guohua Wan, Joseph Y.-T. Leung, Michael Pinedo:
**Scheduling imprecise computation tasks on uniform processors.**45-52

- Igor Razgon:
**A 2**53-58^{O(k)}poly(n) algorithm for the parameterized Convex Recoloring problem.

- Selim G. Akl, Kamrul Islam, Henk Meijer:
**On planar path transformation.**59-64

- Venkatesh Raman, Saket Saurabh:
**Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG.**65-72

- ChenGuang Liu, Kazuyuki Tanaka:
**Eigen-distribution on random assignments for game trees.**73-77

- Venkatesh Raman, Somnath Sikdar:
**Parameterized complexity of the induced subgraph problem in directed graphs.**79-85

- Toru Araki:
**On the k-tuple domination of de Bruijn and Kautz digraphs.**86-90

- Mikolaj Bojanczyk:
**A new algorithm for testing if a regular language is locally threshold testable.**91-94

- Markus E. Nebel:
**On the lexicographical generation of compressed codes.**95-100

- Sylvain Duquesne:
**Improving the arithmetic of elliptic curves in the Jacobi model.**101-105

- Mariano Zelke:
**Optimal per-edge processing times in the semi-streaming model.**106-112

- Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Shayan Oveis Gharan, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam:
**Spanning trees with minimum weighted degrees.**113-116

- Yuren Zhou, Jun He:
**Convergence analysis of a self-adaptive multi-objective evolutionary algorithm based on grids.**117-122

- Wolfgang W. Bein, Lawrence L. Larmore, John Noga:
**Uniform metrical task systems with a limited number of states.**123-128

- Thomas Chatain, Victor Khomenko:
**On the well-foundedness of adequate orders used for construction of complete unfolding prefixes.**129-136

- Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie Wang:
**On constructing an optimal consensus clustering from multiple clusterings.**137-145

- Liang Shen, Yingqian Wang:
**A sufficient condition for a planar graph to be 3-choosable.**146-151

- Mingsheng Ying, Jianxin Chen, Yuan Feng, Runyao Duan:
**Commutativity of quantum weakest preconditions.**152-158

- K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachariasen:
**Bounding component sizes of two-connected Steiner networks.**159-163

- Petr Jancar, Zdenek Sawa:
**A note on emptiness for alternating finite automata with a one-letter alphabet.**164-167

- Rahul Roy, Amitava Bagchi:
**On estimating the time taken to rectify faults in a software package during the system testing phase.**168-172

- Hiroshi Nagamochi, Kohei Okada:
**Approximating the minmax rooted-tree cover in a tree.**173-178

- Hossein Ghodosi:
**On insecurity of Naor-Pinkas' distributed oblivious transfer.**179-182

- Jaechul Sung, Deukjo Hong, Seokhie Hong:
**Cryptanalysis of an involutional block cipher using cellular automata.**183-185

- Michael Elkin, Christian Liebchen, Romeo Rizzi:
**New length bounds for cycle bases.**186-193

- Eberhard Bertsch, Mark-Jan Nederhof:
**Some observations on LR-like parsing with delayed reduction.**195-199

- Alon Itai, Irit Katriel:
**Canonical density control.**200-204

- Ilan Gronau, Shlomo Moran:
**Optimal implementations of UPGMA and other common clustering algorithms.**205-210

- Xie-Bin Chen:
**Cycles passing through prescribed edges in a hypercube with some faulty edges.**211-215

- Klaus Meer:
**Simulated Annealing versus Metropolis for a TSP instance.**216-219

- Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski:
**Note on covering monotone orthogonal polygons with star-shaped polygons.**220-227

- Jessica Enright, Lorna Stewart:
**Subtree filament graphs are subtree overlap graphs.**228-232