![]() | ![]() |
| 1988 | ||
|---|---|---|
| 2 | F. Hadlock: An Efficient Algorithm for Pattern Detection and Classification. IEA/AIE (Vol. 2) 1988: 645-653 | |
| 1975 | ||
| 1 | F. Hadlock: Finding a Maximum Cut of a Planar Graph in Polynomial Time. SIAM J. Comput. 4(3): 221-225 (1975) | |
Data released under the ODC-BY 1.0 license — See also our legal information page