The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Applied Mathematics
1993, volume: 44, number: 1-3

  1. Martin Charles Golumbic, Renu Laskar
    Introduction. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:1-3 [Journal]
  2. Pavol Hell
    Biography of Martin Farber, 1951-1989. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:5-7 [Journal]
  3. Hans-Jürgen Bandelt, Martin Farber, Pavol Hell
    Absolute Reflexive Retracts and Absolute Bipartite Retracts. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:9-20 [Journal]
  4. Ilan Adler, Alan J. Hoffman, Ron Shamir
    Monge and Feasibility Sequences in General Flow Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:21-38 [Journal]
  5. Vasek Chvátal
    Which Claw-Free Graphs are Perfectly Orderable? [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:39-63 [Journal]
  6. Ehab S. Elmallah, Lorna K. Stewart
    Independence and domination in Polygon Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:65-77 [Journal]
  7. Martin Charles Golumbic, Renu Laskar
    Irredundancy in Circular Arc Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:79-89 [Journal]
  8. Michael S. Jacobson, Kenneth Peters
    A Note on Graphs Which Have Upper Irredundance Equal to Independence. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:91-97 [Journal]
  9. Philip J. Bernhard, Stephen T. Hedetniemi, David Pokrass Jacobs
    Efficient Sets in Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:99-108 [Journal]
  10. Jan Arne Telle, Andrzej Proskurowski
    Efficient Sets in Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:109-117 [Journal]
  11. Jean R. S. Blair
    The Efficiency of AC Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:119-138 [Journal]
  12. Leizhen Cai, Frédéric Maffray
    On the SPANNING k-Tree Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:139-156 [Journal]
  13. Garth Isaak
    Bounded Discrete Representations of Interval Orders. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:157-183 [Journal]
  14. Srinivasa Rao Arikati, Uri N. Peled
    A Linear Algorithm for the Group Path Problem on Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:185-190 [Journal]
  15. Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak
    Ø-Threshold and Ø-Tolerance Chain Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:191-203 [Journal]
  16. Yi-Wu Chang, Michael S. Jacobson, Clyde L. Monma, Douglas B. West
    Subtree and Substar Intersection Numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:205-220 [Journal]
  17. Charles J. Colbourn, Appajosyula Satyanarayana, Charles L. Suffel, Klaus Sutner
    Computing Residual Connectedness Reliability for Restricted Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:221-232 [Journal]
  18. Edward R. Scheinerman, Ann N. Trenk
    On Generalized Perfect Graphs: Bounded Degree and Bounded Edge Perfection. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:233-245 [Journal]
  19. Richard P. Anstee
    Minimum Vertex Weighted Deficiency of (g, f)-Factors: A Greedy Algorithm. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:247-260 [Journal]
  20. Peter C. Fishburn, Fred S. Roberts
    Elemantary Sequences, Sub-Fibonacci Sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:261-281 [Journal]
  21. Hans Jürgen Prömel, Angelika Steger
    Excluding Induced Subgraphs II: Extremal Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:283-294 [Journal]
  22. Teresa W. Haynes, Robert C. Brigham, Ronald D. Dutton
    Extremal Graphs Domination Insensitive to the Removal of k Edges. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:295-304 [Journal]
  23. Alan Hartman, Yoav Medan
    Covering the Complete Graph with Plane Cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:305-310 [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