| 2005 |
|---|
| 22 | EE | Therese C. Biedl,
Joseph Douglas Horton,
Alejandro López-Ortiz:
Cross-Stitching Using Little Thread.
CCCG 2005: 199-202 |
| 21 | EE | Joseph D. Horton,
Franziska Berger:
Minimum cycle bases of graphs over different fields.
Electronic Notes in Discrete Mathematics 22: 501-505 (2005) |
| 2003 |
|---|
| 20 | EE | Therese C. Biedl,
Erik D. Demaine,
Alexander Golynski,
Joseph Douglas Horton,
Alejandro López-Ortiz,
Guillaume Poirier,
Claude-Guy Quimper:
Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting.
ESA 2003: 90-101 |
| 19 | EE | Joseph Douglas Horton,
Alejandro López-Ortiz:
On the number of distributed measurement points for network tomography.
Internet Measurement Comference 2003: 204-209 |
| 2002 |
|---|
| 18 | EE | Therese C. Biedl,
Masud Hasan,
Joseph Douglas Horton,
Alejandro López-Ortiz,
Tomás Vinar:
Searching for the center of a circle.
CCCG 2002: 137-141 |
| 17 | EE | Alexander Golynski,
Joseph Douglas Horton:
A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid.
SWAT 2002: 200-209 |
| 16 | EE | Joseph Douglas Horton,
Walter D. Wallis:
Factoring the cartesian product of a cubic graph and a triangle.
Discrete Mathematics 259(1-3): 137-146 (2002) |
| 2001 |
|---|
| 15 | EE | Joseph D. Horton:
Counting the Number of Equivalent Binary Resolution Proofs.
LPAR 2001: 157-171 |
| 2000 |
|---|
| 14 | | Bruce Spencer,
Joseph Douglas Horton:
Support Ordered Resolution.
CADE 2000: 385-400 |
| 13 | | Bruce Spencer,
Joseph Douglas Horton:
Efficient Algorithms to Detect and Restore Minimality, an Extension of the Regular Restriction of Resolution.
J. Autom. Reasoning 25(1): 1-34 (2000) |
| 1999 |
|---|
| 12 | | Peter Baumgartner,
Joseph Douglas Horton,
Bruce Spencer:
Merge Path Improvements for Minimal Model Hyper Tableaux.
TABLEAUX 1999: 51-65 |
| 1998 |
|---|
| 11 | EE | Joseph Douglas Horton,
Bruce Spencer:
Rank/Activity: A Canonical Form for Binary Resolution.
CADE 1998: 412-426 |
| 1997 |
|---|
| 10 | | Bruce Spencer,
Joseph Douglas Horton:
Extending the Regular Restriction of Resolution to Non-Linear Subdeductions.
AAAI/IAAI 1997: 478-483 |
| 9 | | Michael G. Lamoureux,
Joseph Douglas Horton,
Bradford G. Nickerson:
Dynamizing domination queries in 2-dimensions: The paper stabbing problem revisited.
CCCG 1997 |
| 8 | EE | Joseph Douglas Horton,
Bruce Spencer:
Clause Trees: A Tool for Understanding and Implementing Resolution in Automated Reasoning.
Artif. Intell. 92(1-2): 25-89 (1997) |
| 1993 |
|---|
| 7 | | Joseph Douglas Horton,
R. H. Cooper,
W. F. Hyslop,
Bradford G. Nickerson,
O. K. Ward,
R. Harland,
E. Ashby,
W. M. Stewart:
The Cascade Vulnerability Problem.
Journal of Computer Security 2(4): 279-290 (1993) |
| 1987 |
|---|
| 6 | | Joseph Douglas Horton:
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph.
SIAM J. Comput. 16(2): 358-366 (1987) |
| 1985 |
|---|
| 5 | | Joseph Douglas Horton:
Resolvable Path Designs.
J. Comb. Theory, Ser. A 39(2): 117-131 (1985) |
| 1983 |
|---|
| 4 | EE | Mark N. Ellingham,
Joseph Douglas Horton:
Non-hamiltonian 3-connected cubic bipartite graphs.
J. Comb. Theory, Ser. B 34(3): 350-353 (1983) |
| 1974 |
|---|
| 3 | | Joseph Douglas Horton:
Sub-Latin Squares and Incomplete Orthogonal Arrays.
J. Comb. Theory, Ser. A 16(1): 23-33 (1974) |
| 1972 |
|---|
| 2 | | R. G. Stanton,
Joseph Douglas Horton:
A Multiplication Theorem for Room Squares.
J. Comb. Theory, Ser. A 12(3): 322-325 (1972) |
| 1971 |
|---|
| 1 | | J. G. Kalbfleisch,
R. G. Stanton,
Joseph Douglas Horton:
On Covering Sets and Error-Correcting Codes.
J. Comb. Theory, Ser. A 11(3): 233-250 (1971) |
