Journals in DBLP

Inf. Process. Lett.
2003, volume: 86, number: 3

1. Maciej Kurowski
   Simple and efficient floor-planning. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:3, pp:113-119 [Journal]
   
2. Nir Halman
   A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:3, pp:121-128 [Journal]
   
3. Camil Demetrescu, Irene Finocchi
   Combinatorial algorithms for feedback problems in directed graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:3, pp:129-136 [Journal]
   
4. Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger
   How to detect a counterfeit coin: Adaptive versus non-adaptive solutions. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:3, pp:137-141 [Journal]
   
5. Beate Bollig
   A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:3, pp:143-148 [Journal]
   
6. Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
   A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:3, pp:149-154 [Journal]
   
7. Loon-Been Chen
   An efficient minimum and maximum global snapshot algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:3, pp:155-159 [Journal]
   
8. Andreas Brandstädt, Hoàng-Oanh Le, Jean-Marie Vanherpe
   Structure and stability number of chair-, co-P- and gem-free graphs revisited. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:3, pp:161-167 [Journal]