Journals in DBLP

Theor. Comput. Sci.
2005, volume: 339, number: 2-3

1. Yijia Chen, Jörg Flum, Martin Grohe
   Machine-based methods in parameterized complexity theory. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:339, n:2-3, pp:167-199 [Journal]
   
2. Andreas Maletti
   HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:339, n:2-3, pp:200-240 [Journal]
   
3. Shengyu Zhang
   On the power of Ambainis lower bounds. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:339, n:2-3, pp:241-256 [Journal]
   
4. Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu
   The super connectivity of the pancake graphs and the super laceability of the star graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:339, n:2-3, pp:257-271 [Journal]
   
5. Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos
   Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:339, n:2-3, pp:272-292 [Journal]
   
6. Yong He, Yiwei Jiang
   Optimal semi-online preemptive algorithms for machine covering on two uniform machines. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:339, n:2-3, pp:293-314 [Journal]
   
7. Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
   Short length Menger's theorem and reliable optical routing. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:339, n:2-3, pp:315-332 [Journal]
   
8. Peter Damaschke, Zhen Zhou
   On queuing lengths in on-line switching. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:339, n:2-3, pp:333-343 [Journal]
   
9. Murray J. Elder
   A context-free and a 1-counter geodesic language for a Baumslag-Solitar group. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:339, n:2-3, pp:344-371 [Journal]