| Publication | Date of Publication | Type |
|---|
Nonseparating Cocircuits in Binary Matroids
SIAM Journal on Discrete Mathematics | 2022-01-07 | Paper |
Bipartite and Eulerian minors
European Journal of Combinatorics | 2018-09-07 | Paper |
A characterization of graphic matroids based on circuit orderings
SIAM Journal on Discrete Mathematics | 2018-05-24 | Paper |
A note on immersion minors and planarity
Discrete Mathematics | 2018-04-19 | Paper |
A circuit characterization of graphic matroids
Journal of Combinatorial Theory. Series B | 2016-03-14 | Paper |
Delta-wye reduction of almost-planar graphs
Discrete Applied Mathematics | 2014-11-28 | Paper |
\(K_{3,3}\) minors and the maximum-flow problem
Algorithmic Operations Research | 2013-12-11 | Paper |
Graphs with no \(K_{3,3}\) minor containing a fixed edge
International Journal of Combinatorics | 2013-06-10 | Paper |
On Mighton's characterization of graphic matroids
Journal of Combinatorial Theory. Series B | 2010-06-03 | Paper |
Weakly 3-Connected Graphs
Combinatorics, Probability and Computing | 2007-07-30 | Paper |
Shortest paths in almost acyclic graphs
Operations Research Letters | 2000-01-01 | Paper |
scientific article; zbMATH DE number 1045607 (Why is no real title available?)
| 1997-12-08 | Paper |
The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
Discrete Applied Mathematics | 1996-09-30 | Paper |
The arborescence-realization problem
Discrete Applied Mathematics | 1995-07-03 | Paper |
On the \(k\)-cut subgraph polytope
Mathematical Programming. Series A. Series B | 1994-12-11 | Paper |
On the Consecutive-Retrieval Problem
SIAM Journal on Computing | 1994-09-14 | Paper |
scientific article; zbMATH DE number 475619 (Why is no real title available?)
| 1994-05-05 | Paper |
Uncovering generalized-network structure in matrices
Discrete Applied Mathematics | 1993-12-10 | Paper |
A polynomial-time simplex method for the maximum \(k\)-flow problem
Mathematical Programming. Series A. Series B | 1993-11-01 | Paper |
Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs
Networks | 1993-09-05 | Paper |
Decomposition of 3-connected graphs
Combinatorica | 1993-08-16 | Paper |
Recognizing a class of bicircular matroids
Discrete Applied Mathematics | 1993-08-10 | Paper |
Vertex 2-isomorphism
Journal of Graph Theory | 1992-10-05 | Paper |
Representations of bicircular matroids
Discrete Applied Mathematics | 1992-06-26 | Paper |
Disjoint (s, t)‐cuts in a network
Networks | 1992-06-25 | Paper |
An Almost Linear-Time Algorithm for Graph Realization
Mathematics of Operations Research | 1988-01-01 | Paper |
Equivalent factor matroids of graphs
Combinatorica | 1988-01-01 | Paper |
Recognizing max-flow min-cut path matrices
Operations Research Letters | 1988-01-01 | Paper |
Forbidden subgraphs and graph decomposition
Networks | 1987-01-01 | Paper |
A note on detecting simple redundancies in linear systems
Operations Research Letters | 1987-01-01 | Paper |
Connectivity in bicircular matroids
Journal of Combinatorial Theory. Series B | 1985-01-01 | Paper |
On the complexity of recognizing a class of generalized networks
Operations Research Letters | 1985-01-01 | Paper |
On theories of Whitney and Tutte
Discrete Mathematics | 1985-01-01 | Paper |
