The SCEAS System
Navigation Menu

Journals in DBLP

J. Algorithms
1995, volume: 18, number: 1

  1. Pierre Kelsen, Vijaya Ramachandran
    On Finding Minimal Two-Connected Subgraphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:1, pp:1-49 [Journal]
  2. Richard Cole, Ofer Zajicek
    An Asynchronous Parallel Algorithm for Undirected Graph Connectivity. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:1, pp:50-97 [Journal]
  3. Bonnie Berger, Lenore Cowen
    Scheduling with Concurrency-Based Constraints. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:1, pp:98-123 [Journal]
  4. Ulrich Schmid, Johann Blieberger
    On Nonpreemptive LCFS Scheduling with Deadlines. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:1, pp:124-158 [Journal]
  5. Barun Chandra, Sundar Vishwanathan
    Constructing Reliable Communication Networks of Small Weight Online. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:1, pp:159-175 [Journal]
  6. Arvind Gupta, Naomi Nishimura
    The Parallel Complexity of Tree Embedding Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:1, pp:176-200 [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