| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2006 | |
|---|---|---|
| 3 |      | Jason DeVinney, Carey E. Priebe: A new family of proximity graphs: Class cover catch digraphs. Discrete Applied Mathematics 154(14): 1975-1982 (2006) |
| 2003 | ||
| 2 | | Carey E. Priebe, David J. Marchette, Jason DeVinney, Diego A. Socolinsky: Classification Using Class Cover Catch Digraphs. J. Classification 20(1): 003-023 (2003) |
| 2002 | ||
| 1 | | 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 | David J. Marchette | [2] |
| 4 | Carey E. Priebe | [2] [3] |
| 5 | Diego A. Socolinsky | [2] |
Colors in the list of coauthors
Last update Tue May 29 01:28:40 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page