The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
2004, volume: 33, number: 2

  1. Refael Hassin, Asaf Levin
    An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:261-268 [Journal]
  2. Sariel Har-Peled, Yusu Wang
    Shape Fitting with Outliers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:269-285 [Journal]
  3. Zvi Lotker, Boaz Patt-Shamir, Adi Rosén
    New stability results for adversarial queuing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:286-303 [Journal]
  4. Iiro S. Honkala, Tero Laihonen
    On identifying codes in the triangular and square grids. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:304-312 [Journal]
  5. Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson
    A bound on the capacity of backoff and acknowledgment-based protocols. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:313-331 [Journal]
  6. Tim Roughgarden
    Stackelberg Scheduling Strategies. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:332-350 [Journal]
  7. Georg Gottlob, Reinhard Pichler
    Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:351-378 [Journal]
  8. William Y. C. Chen, Xueliang Li, Chao Wang, Xiaoyan Zhang
    The Minimum All-Ones Problem for Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:379-392 [Journal]
  9. Rolf H. Möhring, Martin Skutella, Frederik Stork
    Scheduling with AND/OR Precedence Constraints. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:393-415 [Journal]
  10. Leslie Ann Goldberg, Steven Kelk, Mike Paterson
    The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:416-432 [Journal]
  11. Kazuyuki Amano, Akira Maruoka
    The Potential of the Approximation Method. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:433-447 [Journal]
  12. Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan
    Algorithms for Data Migration with Cloning. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:448-461 [Journal]
  13. Christian Icking, Rolf Klein, Elmar Langetepe, Sven Schuierer, Ines Semrau
    An Optimal Competitive Strategy for Walking in Streets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:462-486 [Journal]
  14. Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov
    Learning a Hidden Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:487-501 [Journal]
  15. Victor Y. Pan, Xinmao Wang
    On Rational Number Reconstruction and Approximation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:502-503 [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