| 2008 |
|---|
| 13 | EE | Paraskevas Yiapanis,
David J. Haglin,
Anna M. Manning,
Ken Mayes,
John A. Keane:
Variable-grain and dynamic work generation for Minimal Unique Itemset mining.
CLUSTER 2008: 33-41 |
| 12 | EE | Anna M. Manning,
David J. Haglin,
John A. Keane:
A recursive search algorithm for statistical disclosure assessment.
Data Min. Knowl. Discov. 16(2): 165-196 (2008) |
| 2007 |
|---|
| 11 | | Dan Singer,
David J. Haglin,
Anna M. Manning:
Towards Average Case Analysis of Itemset Mining.
DMIN 2007: 127-133 |
| 10 | | David J. Haglin,
Anna M. Manning:
On Minimal Infrequent Itemset Mining.
DMIN 2007: 141-147 |
| 2005 |
|---|
| 9 | EE | Anna M. Manning,
David J. Haglin:
A New Algorithm for Finding Minimal Sample Uniques for Use in Statistical Disclosure Assessment.
ICDM 2005: 290-297 |
| 8 | EE | David J. Haglin,
Richard J. Roiger,
Jon Hakkila,
Timothy W. Giblin:
A tool for public analysis of scientific data.
Data Science Journal 4: 39-53 (2005) |
| 2001 |
|---|
| 7 | EE | David J. Haglin,
Rupert W. Ford:
The Message-Minimizing Load Redistribution Problem.
J. UCS 7(4): 291-306 (2001) |
| 1999 |
|---|
| 6 | | Marty J. Wolf,
David J. Haglin:
An Optimal Algorithm for Finding All Convex Subsets in Tournaments.
Ars Comb. 52: (1999) |
| 1996 |
|---|
| 5 | EE | David J. Haglin,
Marty J. Wolf:
On Convex Subsets in Tournaments.
SIAM J. Discrete Math. 9(1): 63-70 (1996) |
| 1995 |
|---|
| 4 | | David J. Haglin:
Bipartite Expander Matching is in NC.
Parallel Processing Letters 5: 413-420 (1995) |
| 1993 |
|---|
| 3 | | Ted Fischer,
Andrew V. Goldberg,
David J. Haglin,
Serge A. Plotkin:
Approximating Matchings in Parallel.
Inf. Process. Lett. 46(3): 115-118 (1993) |
| 1992 |
|---|
| 2 | | David J. Haglin:
Approximating Maximum 2-CNF Satisfiability.
Parallel Processing Letters 2: 181-187 (1992) |
| 1991 |
|---|
| 1 | | David J. Haglin,
Shankar M. Venkatesan:
Approximation and Intractability Results for the Maximum Cut Problem and its Variants.
IEEE Trans. Computers 40(1): 110-113 (1991) |
