Journals in DBLP

Inf. Process. Lett.
2006, volume: 99, number: 6

1. André Große, Jörg Rothe, Gerd Wechsung
   On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:6, pp:215-221 [Journal]
   
2. Stavros Tripakis
   Folk theorems on the determinization and minimization of timed automata. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:6, pp:222-226 [Journal]
   
3. C. R. Subramanian
   Analysis of a heuristic for acyclic edge colouring. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:6, pp:227-229 [Journal]
   
4. Adrian Kosowski, Michal Malafiejski, Pawel Zylinski
   An approximation algorithm for maximum P₃-packing in subcubic graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:6, pp:230-233 [Journal]
   
5. Amin Coja-Oghlan, Lars Kuhtz
   An improved algorithm for approximating the chromatic number of G_{n, p}. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:6, pp:234-238 [Journal]
   
6. Felix A. Fischer, Markus Holzer, Stefan Katzenbeisser
   The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:6, pp:239-245 [Journal]
   
7. Travis Gagie
   Large alphabets and incompressibility. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:6, pp:246-251 [Journal]