Theoretical Computer Science, Volume 361

Volume 361, Number 1, August 2006

• Michael D. Vose:
  Preface. 1
  Electronic Edition (link) BibTeX
• L. Darrell Whitley, Jonathan E. Rowe:
  Subthreshold-seeking local search. 2-17
  Electronic Edition (link) BibTeX
• Dirk V. Arnold:
  Weighted multirecombination evolution strategies. 18-37
  Electronic Edition (link) BibTeX
• Jens Jägersküpper:
  How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms. 38-56
  Electronic Edition (link) BibTeX
• Marc Toussaint:
  Compact representations as a search strategy: Compression EDAs. 57-71
  Electronic Edition (link) BibTeX
• Boris Mitavskiy, Jonathan E. Rowe:
  Some results about the Markov chains associated to GPs and general EAs. 72-110
  Electronic Edition (link) BibTeX
• Jonathan E. Rowe, Michael D. Vose, Alden H. Wright:
  Differentiable coarse graining. 111-129
  Electronic Edition (link) BibTeX

Volume 361, Numbers 2-3, September 2006

• Klaus Jansen, Roberto Solis-Oba:
  Preface. 131-132
  Electronic Edition (link) BibTeX

• Dániel Marx:
  Minimum sum multicoloring on the edges of trees. 133-149
  Electronic Edition (link) BibTeX
• Piotr Krysta, Krzysztof Lorys:
  Efficient approximation algorithms for the achromatic number. 150-171
  Electronic Edition (link) BibTeX
• Erik D. Demaine, Dotan Emanuel, Amos Fiat, Nicole Immorlica:
  Correlation clustering in general weighted graphs. 172-187
  Electronic Edition (link) BibTeX
• Inge Li Gørtz, Anthony Wirth:
  Asymmetry in k-center variants. 188-199
  Electronic Edition (link) BibTeX
• Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur:
  Tradeoffs in worst-case equilibria. 200-209
  Electronic Edition (link) BibTeX
• Etienne de Klerk, Monique Laurent, Pablo A. Parrilo:
  A PTAS for the minimization of polynomials of fixed degree over the simplex. 210-225
  Electronic Edition (link) BibTeX
• Thomas Decker, Thomas Lücking, Burkhard Monien:
  A 5/4-approximation algorithm for scheduling identical malleable tasks. 226-240
  Electronic Edition (link) BibTeX
• R. N. Uma, Joel Wein, David P. Williamson:
  On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems. 241-256
  Electronic Edition (link) BibTeX
• Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov:
  Open block scheduling in optical communication networks. 257-274
  Electronic Edition (link) BibTeX
• Dimitris Fotakis:
  Incremental algorithms for Facility Location and k-Median. 275-313
  Electronic Edition (link) BibTeX
• Yossi Azar, Amir Epstein, Leah Epstein:
  Load balancing of temporary tasks in the l_p norm. 314-328
  Electronic Edition (link) BibTeX
• Sandra Gutiérrez, Sven Oliver Krumke, Nicole Megow, Tjark Vredeveld:
  How to whack moles. 329-341
  Electronic Edition (link) BibTeX
• Erik D. Demaine, Sándor P. Fekete, Shmuel Gal:
  Online searching with turn cost. 342-355
  Electronic Edition (link) BibTeX