| |
| 2006 | ||
|---|---|---|
| 2 | EE | Jason DeVinney, Carey E. Priebe: A new family of proximity graphs: Class cover catch digraphs. Discrete Applied Mathematics 154(14): 1975-1982 (2006) |
| 2002 | ||
| 1 | EE | Norman D. Curet, Jason DeVinney, Matthew E. Gaston: An efficient network flow code for finding all minimum cost s-t cutsets. Computers & OR 29(3): 205-219 (2002) |
| 1 | Norman D. Curet | [1] |
| 2 | Matthew E. Gaston | [1] |
| 3 | Carey E. Priebe | [2] |