Journals in DBLP

Theor. Comput. Sci.
2002, volume: 285, number: 1

1. Gian Carlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi
   Foreword. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:285, n:1, pp:1- [Journal]
   
2. Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
   Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:285, n:1, pp:3-24 [Journal]
   
3. Domenico Cantone, Gianluca Cincotti
   QuickHeapsort, an efficient mix of classical sorting algorithms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:285, n:1, pp:25-42 [Journal]
   
4. Peter Damaschke
   Online strategies for backups. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:285, n:1, pp:43-53 [Journal]
   
5. Irit Dinur
   Approximating SVP_infinity to within almost-polynomial factors is NP-hard. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:285, n:1, pp:55-71 [Journal]
   
6. Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri
   Modified binary searching for static tables. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:285, n:1, pp:73-88 [Journal]
   
7. Sebastian Seibert, Walter Unger
   The hardness of placing street names in a Manhattan type map. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:285, n:1, pp:89-99 [Journal]
   
8. Kathleen Steinhöfel, Andreas Alexander Albrecht, C. K. Wong
   The convergence of stochastic algorithms solving flow shop scheduling. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:285, n:1, pp:101-117 [Journal]