| | |
Joseph D. Horton
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2005 | |
|---|---|---|
| 30 |      | Therese C. Biedl, Joseph Douglas Horton, Alejandro López-Ortiz: Cross-Stitching Using Little Thread. CCCG 2005: 199-202 |
| 29 | | Joseph D. Horton, Franziska Berger: Minimum cycle bases of graphs over different fields. Electronic Notes in Discrete Mathematics 22: 501-505 (2005) |
| 2003 | ||
| 28 | | 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 |
| 27 | | Joseph Douglas Horton, Alejandro López-Ortiz: On the number of distributed measurement points for network tomography. Internet Measurement Comference 2003: 204-209 |
| 2002 | ||
| 26 | | 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 |
| 25 | | Alexander Golynski, Joseph Douglas Horton: A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid. SWAT 2002: 200-209 |
| 24 | | 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 | ||
| 23 | | Joseph D. Horton: Counting the Number of Equivalent Binary Resolution Proofs. LPAR 2001: 157-171 |
| 2000 | ||
| 22 | | Bruce Spencer, Joseph Douglas Horton: Support Ordered Resolution. CADE 2000: 385-400 |
| 21 | | 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 | ||
| 20 | | Peter Baumgartner, Joseph Douglas Horton, Bruce Spencer: Merge Path Improvements for Minimal Model Hyper Tableaux. TABLEAUX 1999: 51-65 |
| 1998 | ||
| 19 | | Joseph Douglas Horton, Bruce Spencer: Rank/Activity: A Canonical Form for Binary Resolution. CADE 1998: 412-426 |
| 1997 | ||
| 18 |  | Bruce Spencer, Joseph Douglas Horton: Extending the Regular Restriction of Resolution to Non-Linear Subdeductions. AAAI/IAAI 1997: 478-483 |
| 17 | | Michael G. Lamoureux, Joseph Douglas Horton, Bradford G. Nickerson: Dynamizing domination queries in 2-dimensions: The paper stabbing problem revisited. CCCG 1997 |
| 16 | | 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 | ||
| 15 | | 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) |
| 14 | | Joseph Douglas Horton, Kyriakos Kilakos: Minimum Edge Dominating Sets. SIAM J. Discrete Math. 6(3): 375-387 (1993) |
| 1991 | ||
| 13 | | Joseph Douglas Horton: A hyperfactorization of order 8, index 2. Discrete Mathematics 92(1-3): 127-129 (1991) |
| 12 | | Joseph Douglas Horton, Gillian M. Nonay: Self-orthogonal Hamilton path decompositions. Discrete Mathematics 97(1-3): 251-264 (1991) |
| 11 | | Joseph Douglas Horton, I. Z. Bouwer: Symmetric Y-graphs and H-graphs. J. Comb. Theory, Ser. B 53(1): 114-129 (1991) |
| 1990 | ||
| 10 | | Joseph Douglas Horton: Orthogonal starters in finite abelian groups. Discrete Mathematics 79(3): 265-278 (1990) |
| 1989 | ||
| 9 | | Eric Neufeld, Joseph Douglas Horton: Conditioning on Disjunctive Knowledge: Simpson's Paradox in Default Logic. UAI 1989: 117-128 |
| 1987 | ||
| 8 | | 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 | ||
| 7 | | Joseph Douglas Horton: Resolvable Path Designs. J. Comb. Theory, Ser. A 39(2): 117-131 (1985) |
| 1983 | ||
| 6 | | Joseph Douglas Horton: The construction of Kotzig factorizations. Discrete Mathematics 43(2-3): 199-206 (1983) |
| 5 | | Mark N. Ellingham, Joseph Douglas Horton: Non-hamiltonian 3-connected cubic bipartite graphs. J. Comb. Theory, Ser. B 34(3): 350-353 (1983) |
| 1982 | ||
| 4 | | Joseph Douglas Horton: On two-factors of bipartite regular graphs. Discrete Mathematics 41(1): 35-41 (1982) |
| 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) |
| 1 | E. Ashby | [15] |
| 2 | Peter Baumgartner | [20] |
| 3 | Franziska Berger | [29] |
| 4 | Therese C. Biedl | [26] [28] [30] |
| 5 | I. Z. Bouwer | [11] |
| 6 | R. H. Cooper | [15] |
| 7 | Erik D. Demaine | [28] |
| 8 | Mark N. Ellingham | [5] |
| 9 | Alexander Golynski | [25] [28] |
| 10 | R. Harland | [15] |
| 11 | Masud Hasan | [26] |
| 12 | W. F. Hyslop | [15] |
| 13 | J. G. Kalbfleisch | [1] |
| 14 | Kyriakos Kilakos | [14] |
| 15 | Michael G. Lamoureux | [17] |
| 16 | Alejandro López-Ortiz (Alex López-Ortiz) | [26] [27] [28] [30] |
| 17 | Eric Neufeld | [9] |
| 18 | Bradford G. Nickerson | [15] [17] |
| 19 | Gillian M. Nonay | [12] |
| 20 | Guillaume Poirier | [28] |
| 21 | Claude-Guy Quimper | [28] |
| 22 | Bruce Spencer | [16] [18] [19] [20] [21] [22] |
| 23 | R. G. Stanton | [1] [2] |
| 24 | W. M. Stewart | [15] |
| 25 | Tomás Vinar | [26] |
| 26 | Walter D. Wallis (W. D. Wallis) | [24] |
| 27 | O. K. Ward | [15] |
Colors in the list of coauthors
Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page