The SCEAS System
Navigation Menu

Journals in DBLP

Algorithmica
2000, volume: 27, number: 3

  1. Hans L. Bodlaender
    Introduction. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:209-211 [Journal]
  2. Shiva Chaudhuri, Christos D. Zaroliagis
    Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:212-226 [Journal]
  3. Xiao Zhou, K. Fuse, Takao Nishizeki
    A Linear Algorithm for Finding [{g, f}]-Colorings of Partial {k}-Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:227-243 [Journal]
  4. Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup
    Generalized Dominators for Structured Programs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:244-253 [Journal]
  5. Arvind Gupta, Damon Kaller, Thomas C. Shermer
    Linear-Time Algorithms for Partial k-Tree Complements. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:254-274 [Journal]
  6. David Eppstein
    Diameter and Treewidth in Minor-Closed Graph Families. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:275-291 [Journal]
  7. Torben Hagerup
    Dynamic Algorithms for Graphs of Bounded Treewidth. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:292-315 [Journal]
  8. Corinne Lucet, Jean-Francois Manouvrier, Jacques Carlier
    Evaluating Network Reliability and 2-Edge-Connected Reliability in Linear Time for Bounded Pathwidth Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:316-336 [Journal]
  9. Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski
    Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:337-347 [Journal]
  10. Damon Kaller
    Definability Equals Recognizability of Partial 3-Trees and k-Connected Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:348-381 [Journal]
  11. Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski
    Memory Requirements for Table Computations in Partial k-Tree Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:382-394 [Journal]
  12. Sheng-Lung Peng, Chuan Yi Tang, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu
    Graph Searching on Some Subclasses of Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:395-426 [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