Journals in DBLP

Algorithmica
2009, volume: 55, number: 1

1. 
   An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. [Citation Graph (, )][DBLP]
   
   
2. 
   A Separation Bound for Real Algebraic Expressions. [Citation Graph (, )][DBLP]
   
   
3. 
   A Fast Algorithm for Adaptive Prefix Coding. [Citation Graph (, )][DBLP]
   
   
4. 
   An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs. [Citation Graph (, )][DBLP]
   
   
5. 
   Indexing Factors with Gaps. [Citation Graph (, )][DBLP]
   
   
6. 
   The Network as a Storage Device: Dynamic Routing with Bounded Buffers. [Citation Graph (, )][DBLP]
   
   
7. 
   Incremental Construction of Minimal Tree Automata. [Citation Graph (, )][DBLP]
   
   
8. 
   Foreword. [Citation Graph (, )][DBLP]
   
   
9. 
   Derandomized Constructions of k-Wise (Almost) Independent Permutations. [Citation Graph (, )][DBLP]
   
   
10. 
    Reconstructive Dispersers and Hitting Set Generators. [Citation Graph (, )][DBLP]
    
    
11. 
    What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. [Citation Graph (, )][DBLP]
    
    
12. 
    Approximating the Bandwidth of Caterpillars. [Citation Graph (, )][DBLP]
    
    
13. 
    Scheduling on Unrelated Machines under Tree-Like Precedence Constraints. [Citation Graph (, )][DBLP]
    
    
14. 
    A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses. [Citation Graph (, )][DBLP]
    
    
15. 
    Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems. [Citation Graph (, )][DBLP]