The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Applied Mathematics
1998, volume: 81, number: 1-3

  1. Jorge L. Ramírez Alfonsín
    On Variations of the Subset Sum Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:1-7 [Journal]
  2. Frank E. Bennett, Lisheng Wu
    Minimum Matrix Representation of Sperner Systems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:9-17 [Journal]
  3. Catherine Z. W. Hassell Sweatman, Gavin J. Gibson, Bernard Mulgrew
    Exact Classification with Two-layer Neural Nets in N Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:19-39 [Journal]
  4. Dih Jiun Guan
    Routing a Vehicle of Capacity Greater than one. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:41-57 [Journal]
  5. Petr Hlinený
    The Maximal Clique and Colourability of Curve Contact Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:59-68 [Journal]
  6. Yanpei Liu, Aurora Morgana, Bruno Simeone
    A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional Grid. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:69-91 [Journal]
  7. Claire Hanen, Alix Munier Kordon
    Performance of Coffman-Graham Schedules in the Presence of Unit Communication Delays. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:93-108 [Journal]
  8. James G. Oxley, Don Row
    Panelling Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:109-122 [Journal]
  9. Maria Grazia Scutellà
    A Strongly Polynomial Algorithm for the Uniform Balanced Network Flow Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:123-131 [Journal]
  10. Charles R. Blair
    Sensitivity Analysis for Knapsack Problems: A Negative Result. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:133-139 [Journal]
  11. Dasong Cao, George L. Nemhauser
    Polyhedral Characterizations, Perfection of Line Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:141-154 [Journal]
  12. Arturo Carpi
    On the Number of Abelian Square-free Words on Four Letters. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:155-167 [Journal]
  13. Lenwood S. Heath, John Paul C. Vergara
    Edge-packing Planar Graphs by Cyclic Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:169-180 [Journal]
  14. Ewa Kubicka, Grzegorz Kubicki, Ortrud Oellermann
    Steiner Intervals in Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:181-190 [Journal]
  15. Rong Lin, Stephan Olariu
    A Fast Parallel Algorithm to Recognize P4-sparse Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:191-215 [Journal]
  16. Gerard Sierksma
    Interchange Graphs and the Hamiltonian Cycle Polytope. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:217-224 [Journal]
  17. Roberto Conti, Pierluigi Contucci, Corrado Falcolini
    Polynomial Invariants for Trees a Statistical Mechanics Approach. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:225-237 [Journal]
  18. Kazuo Iwama, Eiji Miyano
    Better Approximations of Non-Hamiltonian Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:239-261 [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