Joseph Douglas Horton

29 papers A 5B 1Journal 18Unranked 5
YearRankTypeTitle / Venue / Authors
2013 J jnl
Conditioning on Disjunctive Knowledge: Defaults and Probabilities
CoRR
Eric Neufeld, Joseph Douglas Horton
2005 — conf
Cross-Stitching Using Little Thread.
CCCG
Therese Biedl, Joseph Douglas Horton, Alejandro López-Ortiz
2003 A conf
On the number of distributed measurement points for network tomography.
Internet Measurement Conference
Joseph Douglas Horton, Alejandro López-Ortiz
2003 A conf
Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting.
ESA
Therese Biedl, Erik D. Demaine, Alexander Golynski, Joseph Douglas Horton, Alejandro López-Ortiz, Guillaume Poirier, Claude-Guy Quimper
2002 — conf
A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid.
SWAT
Alexander Golynski, Joseph Douglas Horton
2002 J jnl
Factoring the cartesian product of a cubic graph and a triangle.
Discret. Math.
Joseph Douglas Horton, Walter D. Wallis
2002 — conf
Searching for the center of a circle.
CCCG
Therese Biedl, Masud Hasan, Joseph Douglas Horton, Alejandro López-Ortiz, Tomás Vinar
2000 J jnl
Efficient Algorithms to Detect and Restore Minimality, an Extension of the Regular Restriction of Resolution.
J. Autom. Reason.
Bruce Spencer, Joseph Douglas Horton
2000 A conf
Support Ordered Resolution.
CADE
Bruce Spencer, Joseph Douglas Horton
1999 B conf
Merge Path Improvements for Minimal Model Hyper Tableaux.
TABLEAUX
Peter Baumgartner, Joseph Douglas Horton, Bruce Spencer
1998 A conf
Rank/Activity: A Canonical Form for Binary Resolution.
CADE
Joseph Douglas Horton, Bruce Spencer
1997 J jnl
Clause Trees: A Tool for Understanding and Implementing Resolution in Automated Reasoning.
Artif. Intell.
Joseph Douglas Horton, Bruce Spencer
1997 — conf
Dynamizing domination queries in 2-dimensions: The paper stabbing problem revisited.
CCCG
Michael G. Lamoureux, Joseph Douglas Horton, Bradford G. Nickerson
1997 — conf
Extending the Regular Restriction of Resolution to Non-Linear Subdeductions.
AAAI/IAAI
Bruce Spencer, Joseph Douglas Horton
1993 J jnl
Minimum Edge Dominating Sets.
SIAM J. Discret. Math.
Joseph Douglas Horton, Kyriakos Kilakos
1993 J jnl
The Cascade Vulnerability Problem.
J. Comput. Secur.
Joseph Douglas Horton, Rodney H. Cooper, W. F. Hyslop, Bradford G. Nickerson, O. K. Ward, Robert Harland, Elton Ashby, W. M. Stewart
1991 J jnl
A hyperfactorization of order 8, index 2.
Discret. Math.
Joseph Douglas Horton
1991 J jnl
Self-orthogonal Hamilton path decompositions.
Discret. Math.
Joseph Douglas Horton, Gillian M. Nonay
1991 J jnl
Symmetric
J. Comb. Theory B
Joseph Douglas Horton, I. Z. Bouwer
1990 J jnl
Orthogonal starters in finite abelian groups.
Discret. Math.
Joseph Douglas Horton
1989 A conf
Conditioning on Disjunctive Knowledge: Simpson's Paradox in Default Logic.
UAI
Eric Neufeld, Joseph Douglas Horton
1987 J jnl
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph.
SIAM J. Comput.
Joseph Douglas Horton
1985 J jnl
Resolvable Path Designs.
J. Comb. Theory A
Joseph Douglas Horton
1983 J jnl
Non-hamiltonian 3-connected cubic bipartite graphs.
J. Comb. Theory B
Mark N. Ellingham, Joseph Douglas Horton
1983 J jnl
The construction of Kotzig factorizations.
Discret. Math.
Joseph Douglas Horton
1982 J jnl
On two-factors of bipartite regular graphs.
Discret. Math.
Joseph Douglas Horton
1974 J jnl
Sub-Latin Squares and Incomplete Orthogonal Arrays.
J. Comb. Theory A
Joseph Douglas Horton
1972 J jnl
A Multiplication Theorem for Room Squares.
J. Comb. Theory A
R. G. Stanton, Joseph Douglas Horton
1971 J jnl
On Covering Sets and Error-Correcting Codes.
J. Comb. Theory A
J. G. Kalbfleisch, R. G. Stanton, Joseph Douglas Horton