Harold T. Wareham
List of publications from the
| 2008 |
|---|
| 21 | EE | Rhonda Chaytor,
Patricia A. Evans,
Todd Wareham:
Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries.
COCOA 2008: 23-31 |
| 20 | EE | Iris van Rooij,
Todd Wareham:
Parameterized Complexity in Cognitive Modeling: Foundations, Applications and Opportunities.
Comput. J. 51(3): 385-404 (2008) |
| 2007 |
|---|
| 19 | | Selim G. Akl,
Cristian S. Calude,
Michael J. Dinneen,
Grzegorz Rozenberg,
Todd Wareham:
Unconventional Computation, 6th International Conference, UC 2007, Kingston, Canada, August 13-17, 2007, Proceedings
Springer 2007 |
| 18 | EE | Iris van Rooij,
Matthew Hamilton,
Moritz Müller,
Todd Wareham:
Approximating Solution Structure.
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 |
| 2006 |
|---|
| 17 | EE | Matthew Hamilton,
Rhonda Chaytor,
Todd Wareham:
The Parameterized Complexity of Enumerating Frequent Itemsets.
IWPEC 2006: 227-238 |
| 2004 |
|---|
| 16 | EE | Louigi Addario-Berry,
Benny Chor,
Michael T. Hallett,
Jens Lagergren,
Alessandro Panconesi,
Todd Wareham:
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard.
J. Bioinformatics and Computational Biology 2(2): 257-272 (2004) |
| 2003 |
|---|
| 15 | EE | Louigi Addario-Berry,
Benny Chor,
Michael T. Hallett,
Jens Lagergren,
Alessandro Panconesi,
Todd Wareham:
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard.
WABI 2003: 202-215 |
| 14 | EE | Patricia A. Evans,
Andrew D. Smith,
Harold T. Wareham:
On the complexity of finding common approximate substrings.
Theor. Comput. Sci. 306(1-3): 407-430 (2003) |
| 2002 |
|---|
| 13 | EE | Gianluca Della Vedova,
Todd Wareham:
Optimal algorithms for local vertex quartet cleaning.
SAC 2002: 173-177 |
| 12 | | Gianluca Della Vedova,
Todd Wareham:
Optimal algorithms for local vertex quartet cleaning.
Bioinformatics 18(10): 1297-1304 (2002) |
| 2001 |
|---|
| 11 | EE | Patricia A. Evans,
Harold T. Wareham:
Exact Algorithms for Computing Pairwise Alignments and 3-Medians From Structure-Annotated Sequences (Extended Abstract).
Pacific Symposium on Biocomputing 2001: 559-570 |
| 2000 |
|---|
| 10 | EE | Todd Wareham:
The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata.
CIAA 2000: 302-310 |
| 9 | EE | Vincent Berry,
David Bryant,
Tao Jiang,
Paul E. Kearney,
Ming Li,
Todd Wareham,
Haoyong Zhang:
A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract).
SODA 2000: 287-296 |
| 8 | EE | Hans L. Bodlaender,
Michael R. Fellows,
Michael T. Hallett,
Todd Wareham,
Tandy Warnow:
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs.
Theor. Comput. Sci. 244(1-2): 167-188 (2000) |
| 1999 |
|---|
| 7 | EE | Vincent Berry,
Tao Jiang,
Paul E. Kearney,
Ming Li,
Todd Wareham:
Quartet Cleaning: Improved Algorithms and Simulations.
ESA 1999: 313-324 |
| 1995 |
|---|
| 6 | | Hans L. Bodlaender,
Rodney G. Downey,
Michael R. Fellows,
Michael T. Hallett,
Harold T. Wareham:
Parameterized complexity analysis in computational biology.
Computer Applications in the Biosciences 11(1): 49-57 (1995) |
| 5 | | Harold T. Wareham:
A Simplified Proof of the NP- and MAX SNP-Hardness of Multiple Sequence Tree Alignment.
Journal of Computational Biology 2(4): 509-514 (1995) |
| 4 | EE | Hans L. Bodlaender,
Rodney G. Downey,
Michael R. Fellows,
Harold T. Wareham:
The Parameterized Complexity of Sequence Alignment and Consensus.
Theor. Comput. Sci. 147(1&2): 31-54 (1995) |
| 1994 |
|---|
| 3 | | Hans L. Bodlaender,
Rodney G. Downey,
Michael R. Fellows,
Harold T. Wareham:
The Parameterized Complexity of Sequence Alignment and Consensus.
CPM 1994: 15-30 |
| 2 | | Michael T. Hallett,
Harold T. Wareham:
The Parameterized Complexity of Some Problems in Logic and Linguistics.
LFCS 1994: 89-100 |
| 1993 |
|---|
| 1 | | Michael R. Fellows,
Michael T. Hallett,
Harold T. Wareham:
DNA Physical Mapping: Three Ways Difficult.
ESA 1993: 157-168 |
