The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
2006, volume: 36, number: 2

  1. Fedor V. Fomin, Dimitrios M. Thilikos
    Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:281-309 [Journal]
  2. Dieter Kratsch, Jeremy Spinrad
    Between O(nm) and O(nalpha). [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:310-325 [Journal]
  3. Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad
    Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:326-353 [Journal]
  4. Yair Bartal, Amos Fiat, Stefano Leonardi
    Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:354-393 [Journal]
  5. Yossi Matias, Eran Segal, Jeffrey Scott Vitter
    Efficient Bundle Sorting. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:394-410 [Journal]
  6. Mohammad Mahdian, Yinyu Ye, Jiawei Zhang
    Approximation Algorithms for Metric Facility Location Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:411-432 [Journal]
  7. Michael Elkin
    An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:433-456 [Journal]
  8. Gunnar Hoest, Nir Shavit
    Toward a Topological Characterization of Asynchronous Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:457-497 [Journal]
  9. Julia Chuzhoy, Joseph Naor
    Covering Problems with Hard Capacities. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:498-515 [Journal]
  10. Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
    Properties of NP-Complete Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:516-542 [Journal]
  11. Jon Feldman, Matthias Ruhl
    The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:543-561 [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