Journals in DBLP

Inf. Process. Lett.
2003, volume: 87, number: 1

1. Uriel Feige, Orly Yahalom
   On the complexity of finding balanced oneway cuts. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:87, n:1, pp:1-5 [Journal]
   
2. Jörg Rothe
   Exact complexity of Exact-Four-Colorability. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:87, n:1, pp:7-12 [Journal]
   
3. Friedrich Eisenbrand, Fabrizio Grandoni
   Detecting directed 4-cycles still faster. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:87, n:1, pp:13-15 [Journal]
   
4. Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir
   A note on an expressiveness hierarchy for multi-exit iteration. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:87, n:1, pp:17-23 [Journal]
   
5. Beate Bollig, Ingo Wegener
   Functions that have read-once branching programs of quadratic size are not necessarily testable. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:87, n:1, pp:25-29 [Journal]
   
6. Jae-Hoon Kim, Kyung-Yong Chwa
   Non-clairvoyant scheduling for weighted flow time. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:87, n:1, pp:31-37 [Journal]
   
7. Amir M. Ben-Amram
   Tighter constant-factor time hierarchies. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:87, n:1, pp:39-44 [Journal]
   
8. Chung-Shou Liao, Gerard J. Chang
   k-tuple domination in graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:87, n:1, pp:45-50 [Journal]
   
9. Guillaume Fertin, Emmanuel Godard, André Raspaud
   Acyclic and k-distance coloring of the grid. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:87, n:1, pp:51-58 [Journal]