Donald K. Wagner

Publication Activity (10 Years)

Years Active: 1985-2021
Publications (10 Years): 5

Top Topics

Axiomatic Characterization

Independent Set

Digital Circuits

Top Venues

SIAM J. Discret. Math.

Discret. Appl. Math.

J. Comb. Theory, Ser. B

Publications

Donald K. Wagner
Nonseparating Cocircuits in Binary Matroids. SIAM J. Discret. Math. 35 (4) (2021)
Donald K. Wagner
A Characterization of Graphic Matroids Based on Circuit Orderings. SIAM J. Discret. Math. 32 (2) (2018)
Donald K. Wagner
A note on immersion minors and planarity. Discret. Math. 341 (6) (2018)
Donald K. Wagner
Bipartite and Eulerian minors. Eur. J. Comb. 74 (2018)
Donald K. Wagner
A circuit characterization of graphic matroids. J. Comb. Theory, Ser. B 118 (2016)
Donald K. Wagner
Delta-wye reduction of almost-planar graphs. Discret. Appl. Math. 180 (2015)
Donald K. Wagner
On Mighton's characterization of graphic matroids. J. Comb. Theory, Ser. B 100 (5) (2010)
Donald K. Wagner
Weakly 3-Connected Graphs. Comb. Probab. Comput. 15 (4) (2006)
Donald K. Wagner
Shortest paths in almost acyclic graphs. Oper. Res. Lett. 27 (4) (2000)
Collette R. Coullard, L. Leslie Gardner, Donald K. Wagner
Minimum-weight cycles in 3-separable graphs. Networks 29 (3) (1997)
Collette R. Coullard, Abdur Rais, Ronald L. Rardin, Donald K. Wagner
-free Graphs. Discret. Appl. Math. 66 (1) (1996)
Ramjee P. Swaminathan, Donald K. Wagner
The Arborescence-realization Problem. Discret. Appl. Math. 59 (3) (1995)
R. Swaminathan, Donald K. Wagner
On the Consecutive-Retrieval Problem. SIAM J. Comput. 23 (2) (1994)
Kalyan T. Talluri, Donald K. Wagner
On the k-cut subgraph polytope. Math. Program. 67 (1994)
Collette R. Coullard, L. Leslie Gardner, Donald K. Wagner
Decomposition of 3-connected graphs. Comb. 13 (1) (1993)
Collette R. Coullard, John G. Del Greco, Donald K. Wagner
Recognizing a Class of Bicircular Matroids. Discret. Appl. Math. 43 (3) (1993)
Collette R. Coullard, John G. Del Greco, Donald K. Wagner
Uncovering Generalized-Network Structure in Matrices. Discret. Appl. Math. 46 (3) (1993)
Donald K. Wagner, Hong Wan
A polynomial-time simplex method for the maximum k-flow problem. Math. Program. 60 (1993)
Collette R. Coullard, Abdur Rais, Ronald L. Rardin, Donald K. Wagner
Linear-time algorithms for the 2-connected steiner subgraph problem on special classes of graphs. Networks 23 (3) (1993)
R. Swaminathan, Donald K. Wagner
Vertex 2-isomorphism. J. Graph Theory 16 (4) (1992)
Collette R. Coullard, Donald K. Wagner
Decomposing 3-connected graphs. Graph Structure Theory (1991)
Collette R. Coullard, John G. Del Greco, Donald K. Wagner
Representations of bicircular matroids. Discret. Appl. Math. 32 (3) (1991)
Donald K. Wagner
)-cuts in a network. Networks 20 (4) (1990)
Donald K. Wagner
Equivalent factor matroids of graphs. Comb. 8 (4) (1988)
Robert E. Bixby, Donald K. Wagner
An Almost Linear-Time Algorithm for Graph Realization. Math. Oper. Res. 13 (1) (1988)
Donald K. Wagner
Forbidden subgraphs and graph decomposition. Networks 17 (1) (1987)
Donald K. Wagner
Connectivity in bicircular matroids. J. Comb. Theory, Ser. B 39 (3) (1985)
Donald K. Wagner
On theorems of Whitney and Tutte. Discret. Math. 57 (1-2) (1985)