Journals in DBLP

Algorithmica
2010, volume: 56, number: 4

1. 
   On Independent Vertex Sets in Subclasses of Apple-Free Graphs. [Citation Graph (, )][DBLP]
   
   
2. 
   A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph. [Citation Graph (, )][DBLP]
   
   
3. 
   Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs. [Citation Graph (, )][DBLP]
   
   
4. 
   An Algorithm for Minimum Cost Arc-Connectivity Orientations. [Citation Graph (, )][DBLP]
   
   
5. 
   Approximation Algorithms for Treewidth. [Citation Graph (, )][DBLP]
   
   
6. 
   Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-Assembly. [Citation Graph (, )][DBLP]
   
   
7. 
   Bin Packing with Rejection Revisited. [Citation Graph (, )][DBLP]
   
   
8. 
   Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing. [Citation Graph (, )][DBLP]
   
   
9. 
   A Timing Assumption and Two t-Resilient Protocols for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems. [Citation Graph (, )][DBLP]
   
   
10. 
    l₂² Spreading Metrics for Vertex Ordering Problems. [Citation Graph (, )][DBLP]
    
    
11. 
    Random Matrices and Codes for the Erasure Channel. [Citation Graph (, )][DBLP]