Journals in DBLP

Theor. Comput. Sci.
2006, volume: 361, number: 2-3

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