DNA Physical Mapping: Three Ways Difficult. - Michael R. Fellows; Michael T. Hallett; Harold T. Wareham (ESA, 1993)

The Parameterized Complexity of Some Problems in Logic and Linguistics. - Bruce M. Kapron; Michael R. Fellows; Rodney G. Downey; Michael T. Hallett; Harold T. Wareham (LFCS, 1994)

A compendium of parameterized complexity results. - Michael T. Hallett; Todd Wareham (SIGACT News, 1994)

Parameterized complexity analysis in computational biology. - Hans L. Bodlaender; Rodney G. Downey; Michael R. Fellows; Michael T. Hallett; Harold T. Wareham (Comput. Appl. Biosci., 1995)

A Simplified Proof of the NP- and MAX SNP-Hardness of Multiple Sequence Tree Alignment. - Harold T. Wareham (J. Comput. Biol., 1995)

The Parameterized Complexity of Sequence Alignment and Consensus. - Hans L. Bodlaender; Rodney G. Downey; Michael R. Fellows; Harold T. Wareham (Theor. Comput. Sci., 1995)

Jennifer Cole, Georgia M. Green and Jerry L. Morgan, editors, Linguistics and Computation. CLSI Lecture Notes no 52. Stanford, CA: CLSI, 1995. ISBN 1 881526 81 X, £14.95, xi+296 pages. - Todd Wareham (Nat. Lang. Eng., 1998)

Quartet Cleaning: Improved Algorithms and Simulations. - Vincent Berry; Tao Jiang 001; Paul E. Kearney; Ming Li 001; Todd Wareham (ESA, 1999)

Systematic parameterized complexity analysis in computational phonology. - Todd Wareham (1999)

A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract). - Vincent Berry; David Bryant; Tao Jiang 001; Paul E. Kearney; Ming Li 001; Todd Wareham; Haoyong Zhang (SODA, 2000)

The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata. - Todd Wareham (CIAA, 2000)

The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. - Hans L. Bodlaender; Michael R. Fellows; Michael T. Hallett; Todd Wareham; Tandy J. Warnow (Theor. Comput. Sci., 2000)

Exact Algorithms for Computing Pairwise Alignments and 3-Medians From Structure-Annotated Sequences (Extended Abstract). - Patricia A. Evans; Harold T. Wareham (Pacific Symposium on Biocomputing, 2001)

Optimal algorithms for local vertex quartet cleaning. - Gianluca Della Vedova; Todd Wareham (Bioinform., 2002)

On the complexity of finding common approximate substrings. - Patricia A. Evans; Andrew D. Smith; Harold T. Wareham (Theor. Comput. Sci., 2003)

Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. - Louigi Addario-Berry; Benny Chor; Michael T. Hallett; Jens Lagergren; Alessandro Panconesi; Todd Wareham (J. Bioinform. Comput. Biol., 2004)

The Parameterized Complexity of Enumerating Frequent Itemsets. - Matthew Hamilton; Rhonda Chaytor; Todd Wareham (IWPEC, 2006)

Approximating Solution Structure. - Iris van Rooij; Matthew Hamilton; Moritz Müller; Todd Wareham (Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 2007)

Parameterized Complexity in Cognitive Modeling: Foundations, Applications and Opportunities. - Iris van Rooij; Todd Wareham (Comput. J., 2008)

Fixed-parameter tractability of anonymizing data by suppressing entries. - Patricia A. Evans; Todd Wareham; Rhonda Chaytor (J. Comb. Optim., 2009)

The computational costs of recipient design and intention recognition in communication. - Mark Blokpoel; Johan Kwisthout; Todd Wareham; Pim Haselager; Ivan Toni; Iris van Rooij (CogSci, 2011)

Ignorance is bliss: A complexity perspective on adapting reactive architectures. - Todd Wareham; Johan Kwisthout; Pim Haselager; Iris van Rooij (ICDL-EPIROB, 2011)

Bayesian Intractability Is Not an Ailment That Approximation Can Cure. - Johan Kwisthout; Todd Wareham; Iris van Rooij (Cogn. Sci., 2011)

On the computational challenges of analogy-based generalization. - Todd Wareham; Iris van Rooij (Cogn. Syst. Res., 2011)

What Does (and Doesn’t) Make Analogical Problem Solving Easy? A Complexity-Theoretic Perspective. - Todd Wareham; Patricia A. Evans; Iris van Rooij (J. Probl. Solving, 2011)

Flyby: Life Before, During, and After Graduate Studies with Mike Fellows. - Todd Wareham (The Multivariate Algorithmic Revolution and Beyond, 2012)

Intractability and the use of heuristics in psychological explanations. - Iris van Rooij; Cory D. Wright; Todd Wareham (Synth., 2012)

Modeling the genesis of a novel communicative system. - Mark Blokpoel; Todd Wareham; Ivan Toni; Iris van Rooij (CogSci, 2013)

Computational complexity analysis for cognitive scientists. - Iris van Rooij; Johan Kwisthout; Mark Blokpoel; Todd Wareham (CogSci, 2013)

Closer than you think?: Options for efficiently approximating optimal analogies under Structure Mapping Theory. - Todd Wareham; Tijl Grootswagers; Iris van Rooij (CogSci, 2013)

Phon: A Computational Basis for Phonological Database Building and Model Testing. - Yvan Rose; Gregory J. Hedlund; Rod Byrne; Todd Wareham; Brian MacWhinney (Cognitive Aspects of Computational Language Acquisition, 2013)

Assessing the computational adequacy of the General Problem Solver model. - Zahra Sajedinia; Todd Wareham (CogSci, 2014)

Can Tractable Algorithmic-level Explanations Be Evolved? - Arne Wijnia; Todd Wareham; Iris van Rooij (CogSci, 2014)

Resource-bounded Problem Solving (Dagstuhl Seminar 14341). - Yll Haxhimusa; Iris van Rooij; Sashank Varma; Todd Wareham (Dagstuhl Reports, 2014)

Exploring options for efficiently evaluating the playability of computer game agents. - Todd Wareham; Scott Watson (CGAMES, 2015)

Machiavellian agents: Player modelling to deceive and be deceived. - Scott Watson; Andrew Vardy; Wolfgang Banzhaf; Todd Wareham (CGAMES, 2015)

Bridging the communicative gap between robots and humans, by analogy. - Mark Blokpoel; Todd Wareham; Jan P. de Ruiter; Pim Haselager; Ivan Toni; Iris van Rooij (CogSci, 2015)

How did Homo Heuristicus become ecologically rational? - Maria Otworowska; Marieke Sweers; Robin Wellner; Todd Wareham; Iris van Rooij (CogSci, 2015)

How did Homo Heuristicus Become Ecologically Rational? - Maria Otworowska; Marieke Sweers; Robin Wellner; Marvin Uhlmann; Todd Wareham; Iris van Rooij (EAPCogSci, 2015)

On the Computational Complexity of Software (Re)Modularization: Elaborations and Opportunities. - Todd Wareham (EAI Endorsed Trans. Self Adapt. Syst., 2016)

On the Computational Complexity of Designing and Reconfiguring Component-based Software Systems. - Todd Wareham; Marieke Sweers (EAI Endorsed Trans. Self Adapt. Syst., 2016)

Exploring Algorithmic Options for the Efficient Design and Reconfiguration of Reactive Robot Swarms. - Todd Wareham (EAI Endorsed Trans. Serious Games, 2016)

The Roles of Internal Representation and Processing in Problem Solving Involving Insight: A Computational Complexity Perspective. - Todd Wareham (J. Probl. Solving, 2017)

Community-based influence maximization in social networks under a competitive linear threshold model. - Arastoo Bozorgi; Saeed Samet; Johan Kwisthout; Todd Wareham (Knowl. Based Syst., 2017)

The Computational Complexity of Controller-Environment Co-design Using Library Selection for Distributed Construction. - Mesam Timmar; Todd Wareham (DARS, 2018)

Demons of Ecological Rationality. - Maria Otworowska; Mark Blokpoel; Marieke Sweers; Todd Wareham; Iris van Rooij (Cogn. Sci., 2018)

Deep Analogical Inference as the Origin of Hypotheses. - Mark Blokpoel; Todd Wareham; Pim Haselager; Ivan Toni; Iris van Rooij (J. Probl. Solving, 2018)

Putting it together: the computational complexity of designing robot controllers and environments for distributed construction. - Todd Wareham; Andrew Vardy (Swarm Intell., 2018)

Rational analysis, intractability, and the prospects of 'as if'-explanations. - Iris van Rooij; Cory D. Wright; Johan Kwisthout; Todd Wareham (Synth., 2018)

Viable Algorithmic Options for Designing Reactive Robot Swarms. - Todd Wareham; Andrew Vardy (ACM Trans. Auton. Adapt. Syst., 2018)

Cognition and intractability: a guide to classical and parameterized complexity analysis. - Iris van Rooij; Mark Blokpoel; Johan Kwisthout; Todd Wareham (Cambridge University Press, 2019)

Designing Robot Teams for Distributed Construction, Repair, and Maintenance. - Todd Wareham (ACM Trans. Auton. Adapt. Syst., 2019)

The Computational Complexity of Designing Scalar-Field Sensing Robot Teams and Environments for Distributed Construction (Extended Abstract). - Todd Wareham; Andrew Vardy (ACSOS-C, 2021)

How hard is cognitive science? - Patricia Rich; Ronald de Haan; Todd Wareham; Iris van Rooij (CogSci, 2021)

Why is scaling up models of language evolution hard? - Marieke Woensdregt; Matthew Spike; Ronald de Haan; Todd Wareham; Iris van Rooij; Mark Blokpoel (CogSci, 2021)

Naturalism, tractability and the adaptive toolbox. - Patricia Rich; Mark Blokpoel; Ronald de Haan; Maria Otworowska; Marieke Sweers; Todd Wareham; Iris van Rooij (Synth., 2021)

Computational Complexity of Segmentation. - Federico Adolfi; Todd Wareham; Iris van Rooij (CogSci, 2022)

Creating Teams of Simple Agents for Specified Tasks: A Computational Complexity Perspective. - Todd Wareham (CoRR, 2022)

Exploring Viable Algorithmic Options for Learning from Demonstration (LfD): A Parameterized Complexity Approach. - Todd Wareham (CoRR, 2022)

Exploring Viable Algorithmic Options for Automatically Creating and Reconfiguring Component-based Software Systems: A Computational Complexity Approach (Full Version). - Todd Wareham; Marieke Sweers (CoRR, 2022)

Environmental Sensing Options for Robot Teams: A Computational Complexity Perspective. - Todd Wareham; Andrew Vardy (CoRR, 2022)

Viable Algorithmic Options for Creating and Adapting Emergent Software Systems. - Todd Wareham; Ronald de Haan (CoRR, 2022)

Swarm Control for Distributed Construction: A Computational Complexity Perspective. - Todd Wareham; Ronald de Haan; Andrew Vardy; Iris van Rooij (ACM Trans. Hum. Robot Interact., 2023)

A Computational Complexity Perspective on Segmentation as a Cognitive Subcomputation. - Federico Adolfi; Todd Wareham; Iris van Rooij (Top. Cogn. Sci., 2023)

The Computational Complexity of Circuit Discovery for Inner Interpretability. - Federico Adolfi; Martina G. Vilas; Todd Wareham (ICLR, 2025)