The SCEAS System
Navigation Menu

Journals in DBLP

Algorithmica
2001, volume: 30, number: 3

  1. Klaus Jansen, José D. P. Rolim
    Guest Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:3, pp:351-352 [Journal]
  2. Joseph Cheriyan, Tibor Jordán, Zeev Nutov
    On Rooted Node-Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:3, pp:353-375 [Journal]
  3. Prasad Tetali, Santosh Vempala
    Random Sampling of Euler Tours. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:3, pp:376-385 [Journal]
  4. Marek Karpinski
    Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:3, pp:386-397 [Journal]
  5. Maxim Sviridenko
    Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:3, pp:398-405 [Journal]
  6. V. Kumar
    An Approximation Algorithm for Circular Arc Colouring. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:3, pp:406-417 [Journal]
  7. Michael E. Saks, Shiyu Zhou
    Sample Spaces with Small Bias on Neighborhoods and Error-Correcting Communication Protocols. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:3, pp:418-431 [Journal]
  8. Guy Kortsarz
    On the Hardness of Approximating Spanners. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:3, pp:432-450 [Journal]
  9. Christoph Baur, Sándor P. Fekete
    Approximation of Geometric Dispersion Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:3, pp:451-470 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002