The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Applied Mathematics
2001, volume: 108, number: 1-2

  1. Juraj Hromkovic, Ondrej Sýkora
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:1-2 [Journal]
  2. Serafino Cicerone, Gabriele Di Stefano
    Graphs with bounded induced distance. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:3-21 [Journal]
  3. Bruno Courcelle, Johann A. Makowsky, Udi Rotics
    On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:23-52 [Journal]
  4. Peter Damaschke
    Minus domination in small-degree graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:53-64 [Journal]
  5. Luerbio Faria, Celina M. Herrera de Figueiredo, Candido Ferreira Xavier de Mendonça Neto
    SPLITTING NUMBER is NP-complete. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:65-83 [Journal]
  6. Sándor P. Fekete, Jana Kremer
    Tree spanners in planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:85-103 [Journal]
  7. Dagmar Handke
    Independent tree spanners: fault-tolerant spanning trees with constant distance guarantees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:105-127 [Journal]
  8. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth
    Upgrading bottleneck constrained forests. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:129-142 [Journal]
  9. Markus Röttger, Ulf-Peter Schroeder
    Efficient embeddings of grids into grids. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:143-173 [Journal]
  10. Farhad Shahrokhi, László A. Székely
    Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:175-191 [Journal]
  11. Maurizio Talamo, Paola Vocca
    Representing graphs implicitly using almost optimal space. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:193-210 [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