The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Donald K. Wagner: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. R. Swaminathan, Donald K. Wagner
    On the Consecutive-Retrieval Problem. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:2, pp:398-414 [Journal]
  2. Collette R. Coullard, Donald K. Wagner
    Decomposing 3-connected graphs. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:631-634 [Conf]
  3. Collette R. Coullard, L. Leslie Gardner, Donald K. Wagner
    Decomposition of 3-connected graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:1, pp:7-30 [Journal]
  4. Donald K. Wagner
    Equivalent factor matroids of graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:4, pp:372-377 [Journal]
  5. Collette R. Coullard, John G. Del Greco, Donald K. Wagner
    Uncovering Generalized-Network Structure in Matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:46, n:3, pp:191-220 [Journal]
  6. Collette R. Coullard, John G. Del Greco, Donald K. Wagner
    Recognizing a Class of Bicircular Matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:43, n:3, pp:197-215 [Journal]
  7. Collette R. Coullard, Abdur Rais, Ronald L. Rardin, Donald K. Wagner
    The Dominant of the 2-connected-Steiner-subgraph Polytope for W4-free Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:66, n:1, pp:33-43 [Journal]
  8. Ramjee P. Swaminathan, Donald K. Wagner
    The Arborescence-realization Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:59, n:3, pp:267-283 [Journal]
  9. Donald K. Wagner
    Connectivity in bicircular matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:39, n:3, pp:308-324 [Journal]
  10. Kalyan T. Talluri, Donald K. Wagner
    On the k-cut subgraph polytope. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1994, v:67, n:, pp:121-132 [Journal]
  11. Donald K. Wagner, Hong Wan
    A polynomial-time simplex method for the maximum k-flow problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:115-123 [Journal]
  12. Collette R. Coullard, L. Leslie Gardner, Donald K. Wagner
    Minimum-weight cycles in 3-separable graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:3, pp:151-160 [Journal]
  13. Donald K. Wagner
    Shortest paths in almost acyclic graphs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:27, n:4, pp:143-147 [Journal]
  14. Donald K. Wagner
    On theorems of Whitney and Tutte. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:57, n:1-2, pp:147-154 [Journal]

  15. Weakly 3-Connected Graphs. [Citation Graph (, )][DBLP]


  16. Representations of bicircular matroids. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002