Journals in DBLP

Theor. Comput. Sci.
1998, volume: 203, number: 1

1. Krzysztof Diks, Torben Hagerup
   More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1998, v:203, n:1, pp:3-29 [Journal]
   
2. Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz
   Switchbox Routing in VLSI Design: Closing the Complexity Gap. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1998, v:203, n:1, pp:31-49 [Journal]
   
3. Pierluigi Crescenzi, Paolo Penna
   Strictly-upward Drawings of Ordered Search Trees. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1998, v:203, n:1, pp:51-67 [Journal]
   
4. Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese
   A Uniform Approach to Semi-Dynamic Problems on Digraphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1998, v:203, n:1, pp:69-90 [Journal]
   
5. Kay U. Drangmeister, Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi
   Modifying Edges of a Network to Obtain Short Subgraphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1998, v:203, n:1, pp:91-121 [Journal]
   
6. Jens Gustedt
   Efficient Union-Find for Planar Graphs and other Sparse Graph Classes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1998, v:203, n:1, pp:123-141 [Journal]
   
7. Tadao Takaoka
   Shortest Path Algorithms for Nearly Acyclic Directed Graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1998, v:203, n:1, pp:143-150 [Journal]
   
8. Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg
   Approximate Maxima Finding of Continuous Functions under Restricted Budget. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1998, v:203, n:1, pp:151-162 [Journal]
   
9. Krzysztof Diks, Andrzej Pelc
   System Diagnosis with Smallest Risk of Error. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1998, v:203, n:1, pp:163-173 [Journal]