We stand with Ukraine  

Donald K. Wagner

According to our database1, Donald K. Wagner authored at least 28 papers between 1985 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Nonseparating Cocircuits in Binary Matroids.
[BibTeX]
[DOI]
Donald K. Wagner
SIAM J. Discret. Math., 2021

2018
A Characterization of Graphic Matroids Based on Circuit Orderings.
[BibTeX]
[DOI]
Donald K. Wagner
SIAM J. Discret. Math., 2018

Bipartite and Eulerian minors.
[BibTeX]
[DOI]
Donald K. Wagner
Eur. J. Comb., 2018

A note on immersion minors and planarity.
[BibTeX]
[DOI]
Donald K. Wagner
Discret. Math., 2018

2016
A circuit characterization of graphic matroids.
[BibTeX]
[DOI]
Donald K. Wagner
J. Comb. Theory B, 2016

2015
Delta-wye reduction of almost-planar graphs.
[BibTeX]
[DOI]
Donald K. Wagner
Discret. Appl. Math., 2015

2010
On Mighton's characterization of graphic matroids.
[BibTeX]
[DOI]
Donald K. Wagner
J. Comb. Theory B, 2010

2006
Weakly 3-Connected Graphs.
[BibTeX]
[DOI]
Donald K. Wagner
Comb. Probab. Comput., 2006

2000
Shortest paths in almost acyclic graphs.
[BibTeX]
[DOI]
Donald K. Wagner
Oper. Res. Lett., 2000

1997
Minimum-weight cycles in 3-separable graphs.
[BibTeX]
[DOI]
Collette R. Coullard
,
L. Leslie Gardner
,
Donald K. Wagner
Networks, 1997

1996
The Dominant of the 2-connected-Steiner-subgraph Polytope for W<sub>4</sub>-free Graphs.
[BibTeX]
[DOI]
Collette R. Coullard
,
Abdur Rais
,
Ronald L. Rardin
,
Donald K. Wagner
Discret. Appl. Math., 1996

1995
The Arborescence-realization Problem.
[BibTeX]
[DOI]
Ramjee P. Swaminathan
,
Donald K. Wagner
Discret. Appl. Math., 1995

1994
On the Consecutive-Retrieval Problem.
[BibTeX]
[DOI]
R. Swaminathan
,
Donald K. Wagner
SIAM J. Comput., 1994

On the k-cut subgraph polytope.
[BibTeX]
[DOI]
Kalyan T. Talluri
,
Donald K. Wagner
Math. Program., 1994

1993
Linear-time algorithms for the 2-connected steiner subgraph problem on special classes of graphs.
[BibTeX]
[DOI]
Collette R. Coullard
,
Abdur Rais
,
Ronald L. Rardin
,
Donald K. Wagner
Networks, 1993

A polynomial-time simplex method for the maximum k-flow problem.
[BibTeX]
[DOI]
Donald K. Wagner
,
Hong Wan
Math. Program., 1993

Recognizing a Class of Bicircular Matroids.
[BibTeX]
[DOI]
Collette R. Coullard
,
John G. Del Greco
,
Donald K. Wagner
Discret. Appl. Math., 1993

Uncovering Generalized-Network Structure in Matrices.
[BibTeX]
[DOI]
Collette R. Coullard
,
John G. Del Greco
,
Donald K. Wagner
Discret. Appl. Math., 1993

Decomposition of 3-connected graphs.
[BibTeX]
[DOI]
Collette R. Coullard
,
L. Leslie Gardner
,
Donald K. Wagner
Comb., 1993

1992
Vertex 2-isomorphism.
[BibTeX]
[DOI]
R. Swaminathan
,
Donald K. Wagner
J. Graph Theory, 1992

1991
Representations of bicircular matroids.
[BibTeX]
[DOI]
Collette R. Coullard
,
John G. Del Greco
,
Donald K. Wagner
Discret. Appl. Math., 1991

Decomposing 3-connected graphs.
[BibTeX]
Collette R. Coullard
,
Donald K. Wagner
Proceedings of the Graph Structure Theory, 1991

1990
Disjoint (<i>s, t</i>)-cuts in a network.
[BibTeX]
[DOI]
Donald K. Wagner
Networks, 1990

1988
An Almost Linear-Time Algorithm for Graph Realization.
[BibTeX]
[DOI]
Robert E. Bixby
,
Donald K. Wagner
Math. Oper. Res., 1988

Equivalent factor matroids of graphs.
[BibTeX]
[DOI]
Donald K. Wagner
Comb., 1988

1987
Forbidden subgraphs and graph decomposition.
[BibTeX]
[DOI]
Donald K. Wagner
Networks, 1987

1985
Connectivity in bicircular matroids.
[BibTeX]
[DOI]
Donald K. Wagner
J. Comb. Theory B, 1985

On theorems of Whitney and Tutte.
[BibTeX]
[DOI]
Donald K. Wagner
Discret. Math., 1985


  Loading...