Publications (by area)

Cognitive Science

• Adolfi, F., Wareham, T., and van Rooij, I. (2022) "Computational Complexity of Segmentation." In the Proceedings of the 44th Annual Meeting of the Cognitive Science Society (CogSci 2022).
• Adolfi, F., Wareham, T., and van Rooij, I. (2022) "Computational Complexity of Segmentation." CoRR abs/2201.13106 (8 pages) [PDF]
• Adolfi, F., Wareham, T., and van Rooij, I. (2023) "A Computational Complexity Perspective on Segmentation as a Cognitive Subcomputation." Topics in Cognitive Science, 15(2), 255-273.
• Adolfi, F., Wareham, T., and Vilas, M. (To appear) ``Complexity-theoretic Limits on the Promises of Artificial Neural Network Reverse-Engineering.'' In the Proceedings of the 46th Annual Meeting of the Cognitive Science Society (CogSci 2024).
• Blokpoel, M., Kwisthout, J., Wareham, T., Haselager, P., and van Rooij, I. (2011) "The computational costs of recipient design and intention recognition in communication." In L. Carlson, C. Hoelscher, and T.F. Shipley (eds.) Proceedings of the 33rd Annual Meeting of the Cognitive Science Society. Cognitive Science Society; Austin, TX. 465-470.
• Blokpoel, M., Kwisthout, J. van der Weide, T.P., Wareham, T., and van Rooij, I. (2013) "A computational-level explanation of the speed of goal inference." Journal of Mathematical Psychology, 57(3/4), 117-133.
• Blokpoel, M., Wareham, T., de Ruiter, J.P., Haselager, P., Toni, I., and van Rooij, I. (2015) "Bridging the communicative gap between robots and humans, by analogy (Poster Abstract)." In Noelle, D. C., Dale, R., Warlaumont, A. S., Yoshimi, J., Matlock, T., Jennings, C. D., and Maglio, P. P. (eds.) Proceedings of the 37th Annual Meeting of the Cognitive Science Society. (p. 2854). Austin, TX: Cognitive Science Society.
• Blokpoel, M., Wareham, T., Haselager, P., Toni, I., and van Rooij, I. (2018) "Deep analogical inference as the origin of hypotheses." Journal of Problem Solving, 11(1), 3:1-3:24.
• Blokpoel, M., Wareham, T., Toni, I., and van Rooij, I. (2013) "Modeling the genesis of a novel communicative system (Poster Abstract)." In M. Knauff, M. Pauen, N. Sebanz, and I. Wachsmuth (Eds.) Proceedings of the 35th Annual Meeting of the Cognitive Science Society (p. 3883). Austin, TX: Cognitive Science Society.
• Evans, P., Gedge, J., Muller, M., van Rooij, I., and Wareham, T. (2008) "On the Computational Complexity of Analogy Derivation in the Strtucture-Mapping Framework." Technical Report 2008-03, Department of Computer Science, Memorial University of Newfoundland.
• Grootswagers, T., Wareham, T., and van Rooij, I. (2013) "Closer than you think?: Options for efficiently approximating optimal analogies under Structure Mapping Theory (Poster Abstract)." In M. Knauff, M. Pauen, N. Sebanz, and I. Wachsmuth (Eds.) Proceedings of the 35th Annual Meeting of the Cognitive Science Society (p. 4161). Austin, TX: Cognitive Science Society.
• Hamilton, R. and Wareham, T. (2012) "Practical Algorithms for Schema-based Analogy Mapping." In N. Russwinkel, U. Drewitz, and H. van Rijn (eds.) Proceedings of ICCM 2012: 11th International Conference on Cognitive Modeling. TU Berlin. 311-312.
• Haxhimusa, Y., van Rooij, I., Varma, S., and Wareham, T. (2014) "Resource-bounded Problem Solving (Dagstuhl Seminar 14341)". Dagstuhl Reports, 4(8), 45-72.
• Kwisthout, J., Wareham, T., and van Rooij, I. (2011) "Bayesian Intractability is not an Ailment that Approximation can Cure." Cognitive Science, 35(5), 779-784.
• Muller, M., van Rooij, I., and Wareham, T. (2009) "Similarity as Tractable Transformation." In N.A. Taatgen and H. van Rijn (eds.) Proceedings of the 31st Annual Meeting of the Cognitive Science Society. Cognitive Science Society; Austin, TX. 49-55.
• Otworowska, M., Blokpoel, M., Sweers, M., Wareham, T., and van Rooij, I. (2018) "Demons of Ecological Rationality." Cognitive Science, 42(3), 1057-1066.
• Otworowska, M., Sweers, M., Wellner, R., Uhlmann, M., Wareham, T., and van Rooij, I. (2015) "How did Homo Heuristicus become ecologically rational?" In Arienti, G., Bara, B.G., and Sandini, G. (eds.) Proceedings of the EuroAsianPacific Joint Conference on Cognitive Science (EAPCogSci 2015). EUR Workshop Proceedings Vol. 1419. 324-329.
• Otworowska, M., Sweers, M., Wellner, R., Wareham, T., and van Rooij, I. (2015) "How did Homo Heuristicus become ecologically rational? (Poster Abstract)." In Noelle, D. C., Dale, R., Warlaumont, A. S., Yoshimi, J., Matlock, T., Jennings, C. D., and Maglio, P. P. (eds.) Proceedings of the 37th Annual Meeting of the Cognitive Science Society. (p. 2959). Austin, TX: Cognitive Science Society.
• Rich, P., Blokpoel, M., de Haan, R., Otworowska, M., Sweers, M., Wareham, T., and van Rooij, I. (2021) "Naturalism, Tractability and the Adaptive Toolbox", Synthese, 198(6), 5749-5784.
• Rich, P., de Haan, R., Wareham, T., and van Rooij, I. (2021) "How hard is Cognitive Science?" In the Proceedings of the 43rd Annual Meeting of the Cognitive Science Society (CogSci 2021). 3034-3040.
• Sajedinia, Z. and Wareham, T. (2014) "Assessing the computational adequacy of the General Problem Solver model (Poster Abstract)." In P. Bello, M. Guarini, M. McShane, and B. Scassellati (Eds.) Proceedings of the 36th Annual Meeting of the Cognitive Science Society (p. 3403). Austin, TX: Cognitive Science Society.
• Sajedinia, Z. and Wareham, T. (2014) "On the Computational Complexity of the General Problem Solver Model (Extended Abstract)." In Proceedings of the 24th Annual Newfoundland Electrical and Computer Engineering Conference (NECEC 2014).
• van Rooij, I., Blokpoel, M., de Haan, R., and Wareham, T. (2019) "Tractable embodied cognition needs embeddedness". Italian Journal of Cognitive Sciences, 8(15), 25-38.
• van Rooij, I., Blokpoel, M., Kwisthout, J., and Wareham, T. (2019) Cognition and Intractability: A Guide to Classical and Parameterized Complexity Analysis. Cambridge University Press.
• van Rooij, I., Evans, P., Muller, M., Gedge, J., and Wareham, T. (2008) "Identifying Sources of Intractability in Cognitive Models: An Illustration using Analogical Structure Mapping." In B.C. Love, K. McRae, and V.M. Sloutsky (eds.) Proceedings of the 30th Annual Meeting of the Cognitive Science Society. Cognitive Science Society; Austin, TX. 915-920.
• van Rooij, I., Kwisthout, J., Blokpoel, M., Szymanik, J., Wareham, T., and Toni, I. (2011) "Intentional Communication: Computationally Easy or Difficult?" Frontiers in Human Neuroscience, 5. DOI: 10.3389/fnhum.2011.00052.
• van Rooij, I. and Wareham, T. (2008) "Parameterized Complexity in Cognitive Modeling: Foundations, Applications, and Opportunities." Computer Journal, 51(3), 385-404.
• van Rooij, I. and Wareham, T. (2012) "Intractability and Approximation of Optimization Theories of Cognition." Journal of Mathematical Psychology, 56(4), 232-247.
• van Rooij, I., Wright, C., Kwisthout, J., and Wareham, T. (2018) "Rational Analysis, Intractability and 'As If' Explanations in Cognitive Psychology." Synthese. 195(2), 491-510.
• van Rooij, I, Wright, C.D., and Wareham, T. (2012) "Intractability and the Use of Heuristics in Psychological Explanation." Synthese, 187, 471-487.
• Wareham, H.T. (1996) "The Role of Parameterized Computational Complexity Theory in Cognitive Modeling." AAAI-96 Workshop Working Notes: Computational Cognitive Modeling: Source of the Power. (PDF [6 pages])
• Wareham, T. (2012) "What Can (and Can't) Make Problem Solving by Insight Possible? A Complexity-Theoretic Investigation." In N. Russwinkel, U. Drewitz, and H. van Rijn (eds.) Proceedings of ICCM 2012: 11th International Conference on Cognitive Modeling. TU Berlin. 142-143.
• Wareham, T. (2017) "The Roles of Internal Representation and Processing in Problem Solving Involving Insight: A Computational Complexity Perspective." Journal of Problem Solving, 10(1), 3:1-3:17.
• Wareham, T., Evans, P., and van Rooij, I. (2011) "What Does (and Doesn't) Make Analogical Problem Solving Easy? A Complexity-Theoretic Investigation." Journal of Problem Solving, 3(2), 30-71.
• Wareham, T., Robere, R., and van Rooij, I. (2012) "A Change for the Better? Assessing the Computational Cost of Re-Representation." In N. Russwinkel, U. Drewitz, and H. van Rijn (eds.) Proceedings of ICCM 2012: 11th International Conference on Cognitive Modeling. TU Berlin. 111-116.
• Wareham, T. and van Rooij, I (2011) "On the Computational Challenges of Analogy-based Generalization." Cognitive Systems Research, 12, 266-280.
• Wareham, T., van Rooij, I., and Muller, M. (2008) "Commentary: Computational complexity analysis can help, but first we need a theory." Behavioral & Brain Sciences, 31(4), 399-400.
• Wijnia, A., van Rooij, I., and Wareham, T. (2014) "Can Tractable Algorithmic-level Explanations be Evolved? (Poster Abstract)." In P. Bello, M. Guarini, M. McShane, and B. Scassellati (Eds.) Proceedings of the 36th Annual Meeting of the Cognitive Science Society (p. 3408). Austin, TX: Cognitive Science Society.
• Woensdregt, M., Spike, M., de Haan, R., Wareham, T., van Rooij, I., and Blokpoel, M. (2021) "Why is scaling up models of language evolution hard?" In the Proceedings of the 43rd Annual Meeting of the Cognitive Science Society (CogSci 2021). 209-215.

Computational Biology

• Addario-Berry, L., Chor, B., Hallett, M., Lagergren, J., Panconesi, A., and Wareham, T. (2003) "Ancestral Maximum Likelihood of Evolutionary Trees is Hard." In Gary Benson and Roderic D.M. Page (eds.) Proceedings of the Third International Workshop on Algorithms in Bioinformatics (WABI'03). Lecture Notes in Computer Science no. 2812. Springer-Verlag; Berlin. 202-215. Appeared as Addario-Berry et al. (2004), Journal of Bioinformatics and Computational Biology.
• Addario-Berry, L., Chor, B., Hallett, M., Lagergren, J., Panconesi, A., and Wareham, T. (2004) "Ancestral Maximum Likelihood of Evolutionary Trees is Hard." Journal of Bioinformatics and Computational Biology, 2(2), 257-271.
• Berry, V., Jiang, T., Kearney, P., Li, M., and Wareham, H.T. (1999) "Quartet Cleaning: Improved Algorithms and Simulations." In Jaroslav Nesteril (ed.) Proceedings: ESA'99 - 7th Annual European Symposium on Algorithms. Lecture Notes in Computer Science no. 1643. Springer-Verlag; Berlin. 313-324.
• Bodlaender, H., Downey, R.G., Fellows, M.R., Hallett, M.T., and Wareham, H.T. (1994) "Parameterized Complexity Analysis in Computational Biology." In the Proceedings of the First International Workshop on Shape and Pattern Matching in Computational Biology. Privately published by the steering committee for this workshop (Andrea Califano and Isidore Rigoutsos, IBM T.J. Watson Research Center, Yorktown Heights, NY). 99-116. Appeared as Bodlaender et al. (1995), Computer Applications in the Biosciences.
• Bodlaender, H., Downey, R.G., Fellows, M.R., Hallett, M.T., and Wareham, H.T. (1995) "Parameterized Complexity Analysis in Computational Biology." Computer Applications in the Biosciences, 11(1), 49-57.
• Bodlaender, H., Downey, R.G., Fellows, M.R., and Wareham, H.T. (1994) "The Parameterized Complexity of Sequence Alignment and Consensus." In M. Crochemore and D. Gusfield (eds.) Proceedings of the Fifth Annual Symposium on Combinatorial Pattern Matching (CPM'94). Lecture Notes in Computer Science no. 807. Springer-Verlag; Berlin. 15-30. Appeared as Bodlaender et al. (1995), Theoretical Computer Science.
• Bodlaender, H., Downey, R.G., Fellows, M.R., and Wareham, H.T. (1995) "The Parameterized Complexity of Sequence Alignment and Consensus." Theoretical Computer Science, 147(1-2), 31-54.
• Bryant, D., Berry, V., Jiang, T., Kearney, P., Li, M., Wareham, T., and Zhang, H. (2000) "A Practical Algorithm for Recovering the Best Supported Edges of an Evolutionary Tree." In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000). ACM Press; New York. 287-296.
• Carr, S. M., Wareham, T., and Craig, D. (2014) "An algorithmic and computational approach to open reading frames in short dsDNA sequences: evaluation of 'Carr's Conjecture'". In Proceedings of the International Conference on Bioinformatics and Computational Biology. 37-43.
• Carr, S.M, Wareham, T., and Craig, D. (2014) "A Web Application for Generation of Random DNA Sequences with a Single Open Reading Frame: Exemplars for Genetics and Bioinformatics Education." CBE -- Life Sciences Education, 13(3), 373-374.
• Carr, S.M., Marshall, D., Wareham, T., and Craig, D. (2015) "The Big ORF Theory: Algorithmic, computational, and approximation approaches to Open Reading Frames in short- and medium-length sequences." In Q.-N. Tran and H.R. Arabnia (eds.) Emerging Trends in Computational Biology, Bioinformatics, and Systems Biology. Elsevier. 277-286.
• Churchill, D., Gillard, P., Hamilton, M., and Wareham, T. (2004) "Prototyping Parallel Sequence Edit-Distance Algorithms in FPGA Hardware." In Proceedings of the Fourteenth Annual Newfoundland Electrical and Computer Engineering Conference (NECEC 2004).
• Della Vedova, G. and Wareham, H.T. (2002) "Optimal Algorithms for Local Vertex Quartet Cleaning." In the Proceedings of the 17th ACM Symposium on Applied Computing (SAC 2002). ACM Press; New York. 173-177. Appeared as Della Vedova and Wareham (2002), Bioinformatics.
• Della Vedova, G. and Wareham, H.T. (2002) "Optimal Algorithms for Local Vertex Quartet Cleaning." Bioinformatics, 18(10), 1297-1304.
• Evans, P., Smith, A., and Wareham, T. (2001) "The Parameterized Complexity of p-Center Approximate Substring Problems." Technical report TR01-149, Faculty of Computer Science, University of New Brunswick.
• Evans, P.A., Smith, A.D., and Wareham, H.T. (2003) "On the Complexity of Finding Common Approximate Substrings." Theoretical Computer Science, 306(1-3), 407-430.
• Evans, P.A. and Wareham, H.T. (2001) "Practical Algorithms for Universal DNA Primer Design: An Exercise in Algorithm Engineering". In N. El-Mabrouk, T. Lengauer, and D. Sankoff (eds.) Currents in Computational Molecular Biology 2001. Les Publications CRM; Montreal, PQ. 25-26.
• Evans, P.A. and Wareham, H.T. (2001) "Exact Algorithms for Computing Pairwise Alignments and 3-Medians from Structure-Annotated Sequences (Extended Abstract)." In the Proceedings of the Sixth Pacific Symposium on Biocomputing (PSB 2001). World Scientific Press; Singapore. 559-570.
• Evans, P.A. and Wareham, H.T. (2011) "Efficient Restricted-Case Algorithms for Problems in Computational Biology." In M. Elloumi and A.Y. Zomaya (eds.) Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications. Wiley. 27-49.
• Fellows, M.R., Hallett, M.T., and Wareham, H.T. (1993) "DNA Physical Mapping: Three Ways Difficult." In T. Lengauer (ed.) Proceedings: ESA'93 - European Symposium on Algorithms. Lecture Notes in Computer Science no. 726. Springer-Verlag; Berlin. 157-168.
• Uddin, M., Yu, T., and Wareham, T. (2008) "A Cooperative Coevolutionary Algorithm for Haplotype Pattern Detection in Case-Control Data." Proceedings of the 3rd Annual Canadian Student Conference on Biomedical Computing (CSCBC 2008).
• Uddin, M., Wareham, T., Rahman, P., Peddle, L., Maksymowych, W.P., Yoshikawa, T., and Yu, T. (2008) "A Robust Evolutionary Algorithm for Computing Significant Haplotype Patterns with Arbitrary Number and Distribution of Markers in Case-Control Data." Proceedings of the 10th International Meeting on Human Genome Variation (HGV2008) (p. 23).
• van Rooij, T., Roederer, M., Wareham, T., van Rooij, I., McLeod, H.L., and Marsh, S. (2015) "Fast and Frugal Trees: Translating Population-Based Pharmacogenomics to Medication Prioritization." Personalized Medicine, 12(2), 117-128.
• Wareham, H.T. (1993) On the Computational Complexity of Inferring Evolutionary Trees. M.Sc. thesis. Technical Report no. 9301, Department of Computer Science, Memorial University of Newfoundland, March 1993.
• Wareham, T. (1995) "A Simplified Proof of the NP- and MAX SNP-hardness of Multiple Sequence Tree Alignment." Journal of Computational Biology, 2(4), 509-514.
• Wareham, H.T., Jiang, T., Zhang, X., and Trendall, C.G. (2000) "Stochastic Heuristic Algorithms for Target Motif Identification (Extended Abstract)." In the Proceedings of the Fifth Pacific Symposium on Biocomputing (PSB 2000). World Scientific Press; Singapore. 389-400,

Robotics

• Cesati, M. and Wareham, H.T. (1995) "Parameterized Complexity Analysis in Robot Motion Planning." In Proceedings of the 25th IEEE International Conference on Systems, Man, and Cybernetics: Volume 1. IEEE Press; Los Alamitos, CA. 880-885.
• Timmar, M. and Wareham, T. (2019) "The Computational Complexity of Controller-Environment Co-design using Library Selection for Distributed Construction." In N. Correll, M. Schwager, and M. Otte (Eds.) Distributed Autonomous Robotic Systems: The 14th International Symposium. Springer Proceedings in Advance Robotics vol. 9. Springer Nature Switzerland AG. 51-63.
• Wareham, T. (2015) "Exploring the Algorithmic Options for the Efficient Design and Reconfiguration of Reactive Robot Swarms.'' In Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (BICT 2015). Institute for Computer Sciences, Social-informatics, and Telecommunications Engineering (ICST); Brussels. 295-302
• Wareham, T. (2016) "Exploring the Algorithmic Options for the Efficient Design and Reconfiguration of Reactive Robot Swarms.'' EAI Endorsed Transactions on Serious Games 16(9): e4. Previously appeared as Wareham (2015), BICT 2015.
• Wareham, T. (2019) "Designing Robot Teams for Distributed Construction, Repair, and Maintenance." ACM Transactions on Autonomous and Adaptive Systems, 14(1), 2:1-2:29.
• Wareham, T. (2022) "Creating Teams of Simple Agents for Specified Tasks: A Computational Complexity Perspective." CoRR abs/2205.02061 (20 pages) [PDF]
• Wareham, T., de Haan, R., Vardy, A., and van Rooij, I. (2023) "Swarm Control for Distributed Construction: A Computational Complexity Perspective." ACM Transactions on Human-Robot Interaction, 12(1), 6:1-6:45.
• Wareham, T., Kwisthout, J., Haselager, W., and van Rooij, I. (2011) "Ignorance is Bliss: A Complexity Perspective on Adapting Reactive Architectures." In the Proceedings of the First Joint IEEE International Conference on Development and Learning and on Epigenetic Robotics (Volume 2). 1-5. DOI: 10.1109/DEVLRN.2011.6037337.
• Wareham, T. and Vardy, A. (2018) "Viable Algorithmic Options for Designing Reactive Robot Swarms." ACM Transactions on Autonomous and Adaptive Systems, 13(1), 5:1-5:23.
• Wareham, T. and Vardy, A. (2018) "Putting It Together: The Computational Complexity of Designing Robot Controllers and Environments for Distributed Construction." Swarm Intelligence, 12(2), 111-128.
• Wareham, T. and Vardy, A. (2021) "The Computational Complexity of Designing Scalar-field Sensing Robot Teams and Environments for Distributed Construction (Extended Abstract)." In the Proceedings of the 4th International Workshop on Self-Organised Construction (SOCO 2021). 2021 IEEE International Conference on Autonomic Computing and Self-Organizing Systems Companion (ACSOS-C). IEEE Computer Society; Los Alamitos, CA. 232-237.
• Wareham, T. and Vardy, A. (2022) "Environmental Sensing Options for Robot Teams: A Computational Complexity Perspective." CoRR abs/2205.05034 (77 pages) [PDF]

Computational Linguistics

• Downey, R.G., Fellows, M.R., Kapron, B.M., Hallett, M.T., and Wareham, H.T. (1994) "Parameterized Complexity of Some Problems in Logic and Linguistics (Extended Abstract)." In A. Nerode and Y.V. Matiyasevich (eds.) Logical Foundations of Computer Science. Lecture Notes in Computer Science no. 813. Springer-Verlag; Berlin. 89-101.
• Gedge, J., Hedlund, G.J., Rose, Y., and Wareham, T. (2007) "Natural Language Process Detection: From Conception to Implementation." Proceedings of the 17th Annual Newfoundland Electrical and Computer Engineering Conference (NECEC 2007).
• Hedlund, G.J., Maddocks, K., Rose, Y., and Wareham, T. (2005) "Natural Language Syllable Alignment: From Conception to Implementation." In Proceedings of the Fifteenth Annual Newfoundland Electrical and Computer Engineering Conference (NECEC 2005). (PDF/5 pages)
• Rose, Y., MacWhinney, B., Byrne, R., Hedlund, G., Maddocks, K., O'Brien, P., and Wareham, T. (2006) "Introducing Phon: A Software Solution for the Study of Phonological Acquisition." In D. Bamman, T. Magnitskaia, and C. Zaller (eds.) Proceedings of the 30th Annual Boston University Conference on Language Development. Cascadilla Press; Somerville, MA. 489-500.
• Rose, Y., Hedlund, G.J., Byrne, R., Wareham, T. and MacWhinney, B. (2007) "Phon 1.2: A Computational Basis for Phonological Database Elaboration and Model Testing." In P. Buttery, A. Villavicencio and A. Korhonen (eds.) Proceedings of the Workshop on Cognitive Aspects of Computational Language Acquisition: 45th Annual Meeting of the Association for Computational Linguistics. ACL; Stroudsburg, PA. 17-24.
• Rose, Y., Hedlund, G.J., Byrne, R., Wareham, T. and MacWhinney, B. (2013) "Phon: A Computational Basis for Phonological Database Elaboration and Model Testing." In A. Villavicencio, T. Poibeau, A. Korhonen, and A. Alishahi (eds.) Cognitive Aspects of Computational Language Acquisition. Springer. 29-50.
• Wareham, H.T. (1996) "Book Notice: Eric Sven Ristad (ed.) Language Computations." Language, 72(1), 186-187.
• Wareham, H.T. (1998) "Book Review: Jennifer Cole, Georgia M. Green and Jerry L. Morgan (eds.) Linguistics and Computation." Natural Language Engineering, 4(3), 277-279.
• Wareham, H.T. (1999) "Systematic Parameterized Complexity Analysis in Computational Phonology." Ph.D. thesis, Department of Computer Science, University of Victoria, April 1999. Technical Report ROA-318-0599, Rutgers Optimality Archive.
• Wareham, H.T. (2001) "The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata." In Proceedings of the Fifth International Conference on Implementation and Application of Automata. Lecture Notes in Computer Science no. 2088. Springer-Verlag; Berlin. 302-310.

Privacy

• Brown, E., Johnston, R., Wareham, H., Farrell, G., and Hoekman, T. (2008) Private / Public Sharing of Personal Information: Lessons from the Health Care Sector. Research Project Report (Contributions Program), Office of the Privacy Commissioner of Canada, March 2008.
• Brown, E., Wareham, H., Farrell, G., Hoekman, T., Chaytor, R., Barrigar, J., Kosa, T., Barton, C., Barrett, N., Mercer, C., and Thoms, A. (2007) Technology Choices and Privacy Policy in Health Care. Research Project Report (Contributions Program), Office of the Privacy Commissioner of Canada, April 2007.
• Chaytor, R., Brown, E., and Wareham, T. (2006) "Privacy Advisors for Personal Information Management." Workshop Proceedings: Personal Information Management -- Now That We're Talking, What are We Learning?, Twenty-Ninth Annual International SIGIR Conference on Search and Development in Information Retrieval. 28-31.
• Chaytor, R., Evans, P., and Wareham, T. (2008) "Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries." In B. Yang, D.-Z. Du, and C.A. Wang (eds.) Proceedings of the 2nd International Conference on Combinatorial Optimization and Applications (COCOA 2008). Lecture Notes in Computer Science no. 5165. Springer-Verlag; Berlin. 23-31.
• Chaytor, R., Gillard, P., and and Wareham, T. (2007) "High Performance Privacy Protection Hardware." Proceedings of the 17th Annual Newfoundland Electrical and Computer Engineering Conference (NECEC 2007).
• Evans, P.A., Wareham, H.T., and Chaytor, R. (2009) "Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries." Journal of Combinatorial Optimization, 18(4), 362-375.

Software Engineering

• Wareham, T. (2015) "On the Computational Complexity of Software (Re)Modularization: Elaborations and Opportunities." In Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (BICT 2015). Institute for Computer Sciences, Social-informatics, and Telecommunications Engineering (ICST); Brussels. 418-424.
• Wareham, T. (2016) "On the Computational Complexity of Software (Re)Modularization: Elaborations and Opportunities." EAI Endorsed Transactions on Self-Adaptive Systems 16(7): e4. Previously appeared as Wareham (2015), BICT 2015.
• Wareham, T. and de Haan, R. (2022) "Viable Algorithmic Options for Creating and Adapting Emergent Software Systems.'' CoRR abs/2205.06097 (76 pages) [PDF]
• Wareham, T. and Sweers, M. (2015) "On the Computational Complexity of Designing and Reconfiguring Component-based Software Systems." In Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (BICT 2015). Institute for Computer Sciences, Social-informatics, and Telecommunications Engineering (ICST); Brussels. 425-432.
• Wareham, T. and Sweers, M. (2016) "On the Computational Complexity of Designing and Reconfiguring Component-based Software Systems." EAI Endorsed Transactions on Self-Adaptive Systems 16(5): e4. Previously appeared as Wareham and Sweers (2015), BICT 2015.
• Wareham, T. and Sweers, M. (2022) "Exploring Viable Algorithmic Options for Automatically Creating and Reconfiguring Component-based Software Systems: A Computational Complexity Approach (Full Version)." CoRR abs/2205.05001 (38 pages) [PDF]

Theoretical Computer Science

• Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hallett, M.T., Wareham, H.T., and Warnow, T.J. (1995) "The Hardness of Problems on Thin Colored Graphs." Technical Report UU-CS-1995-36, Department of Computer Science, University of Utrecht.
• Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hallett, M.T., Wareham, H.T., and Warnow, T.J. (2000) "The Hardness of Perfect Phylogeny, Feasible Register Assignment and Other Problems on Thin Colored Graphs." Theoretical Computer Science, 244, 167-188.
• Hallett, M.T. and Wareham, H.T. (1994) "A Compendium of Parameterized Complexity Results." SIGACT News, 25(3), 122-123.
• Hamilton, M., Muller, M., van Rooij, I., and Wareham, T. (2007) "Approximating Solution Structure." Technical Report 2007-02, Department of Computer Science, Memorial University of Newfoundland.
• Hamilton, M., Muller, M., van Rooij, I., and Wareham, T. (2007) "Approximating Solution Structure." In E. Demaine, G.Z. Gutin, D. Marx, and U. Stege (eds.) Structure Theory and FPT Algorithmics for Graphs, Digraphs, and Hypergraphs. Dagstuhl Seminar Proceedings no. 07281. Internationales Begegnungs- und Forschungszentrum fur Informatik (IBFI), Schloss Dagstuhl, Germany.

Computer Games

• Wareham, T. and Watson, S. (2015) "Exploring Options for Efficiently Evaluating the Playability of Computer Game Agents." In Proceedings of the CGAMES 2015 International Computer Games Conference.
• Watson, S., Vardy, A., Banzhaf, W., and Wareham, T. (2015) "Machiavellian Agents: Player Modelling to Deceive and be Deceived." In Proceedings of the CGAMES 2015 International Computer Games Conference.

Data Mining

• Hamilton, M., Chaytor, R., and Wareham, T. (2006) "The Parameterized Complexity of Enumerating Frequent Itemsets." In H. Bodlaender and M. Langston (eds.) Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC'06). Lecture Notes in Computer Science no. 4169. Springer-Verlag; Berlin. 227-238.

Machine Learning

• Wareham, T. (2022) "Exploring Viable Algorithmic Options for Learning from Demonstration (LfD): A Parameterized Complexity Approach." CoRR abs/2205.04989 (38 pages) [PDF]

Social Networks

• Bozorgi, A., Samet, S., Kwisthout, J., and Wareham, T. (2017) "Community-based Influence Maximization in Social Networks under a Competitive Linear Threshold Model." Knowledge Based Systems, 134, 149-158.

Miscellaneous

• Akl, S.G., Calude, C.S., Dinneen, M.J., Rozenberg, G. and Wareham. H.T. (eds.) (2007) Unconventional Computation: Proceedings of the 6th International Conference, UC 2007. Lecture Notes in Computer Science no. 4618. Springer; Heidelberg.
• Wareham, T. (2012) "Flyby: Life Before, During, and After Graduate Studies with Mike Fellows." In H.L. Bodlaender, R.G. Downey, F.V. Fomin, and D. Marx (eds.) The Multivariate Algorithmic Revolution and Beyond: Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday. Lecture Notes in Computer Science no. 7370. Springer. 51-55.
• Evans, P.A. and Wareham, H.T. (2000) "Conference Report: CPM'2000." SIGBIO Newsletter, 20(3), 25.
• Wareham, H.T. (2000) "Conference Report: PSB'2000." SIGBIO Newsletter, 20(1), 27-28.
• Wareham, H.T. (2000) "Conference Report: RECOMB'2000." SIGBIO Newsletter, 20(2), 22.
• Wareham, H.T. (2001) "Conference Report: PSB'2001." SIGBIO Newsletter, 21(1). 27-28.