| Introducing Phon: A software solution for the study of phonological acquisition Y Rose, B MacWhinney, R Byrne, G Hedlund, K Maddocks, P O'Brien, ... Proceedings of the... Annual Boston University Conference on Language …, 2006 | 223 | 2006 |
| Community-based influence maximization in social networks under a competitive linear threshold model A Bozorgi, S Samet, J Kwisthout, T Wareham Knowledge-Based Systems 134, 149-158, 2017 | 168 | 2017 |
| Parameterized complexity analysis in computational biology HL Bodlaender, RG Downey, MR Fellows, MT Hallett, HT Wareham Bioinformatics 11 (1), 49-57, 1995 | 142 | 1995 |
| Cognition and intractability: A guide to classical and parameterized complexity analysis I Van Rooij, M Blokpoel, J Kwisthout, T Wareham Cambridge University Press, 2019 | 115 | 2019 |
| Bayesian intractability is not an ailment that approximation can cure JHP Kwisthout, HT Wareham, I van Rooij | 112 | 2011 |
| Quartet cleaning: improved algorithms and simulations V Berry, T Jiang, P Kearney, M Li, T Wareham European Symposium on Algorithms, 313-324, 1999 | 99 | 1999 |
| The parameterized complexity of sequence alignment and consensus HL Bodlaender, RG Downey, MR Fellows, HT Wareham Theoretical Computer Science 147 (1-2), 31-54, 1995 | 93 | 1995 |
| On the complexity of finding common approximate substrings PA Evans, AD Smith, HT Wareham Theoretical Computer Science 306 (1-3), 407-430, 2003 | 87 | 2003 |
| DNA physical mapping: Three ways difficult MR Fellows, MT Hallett, HT Wareham European Symposium on Algorithms, 157-168, 1993 | 81 | 1993 |
| A practical algorithm for recovering the best supported edges of an evolutionary tree V Berry, D Bryant, T Jiang, PE Kearney, M Li, T Wareham, H Zhang SODA, 287-296, 2000 | 76 | 2000 |
| Intentional communication: Computationally easy or difficult? I Van Rooij, J Kwisthout, M Blokpoel, J Szymanik, T Wareham, I Toni Frontiers in Human Neuroscience 5, 52, 2011 | 73 | 2011 |
| Systematic parameterized complexity analysis in computational phonology HT Wareham | 70 | 1998 |
| The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs HL Bodlaender, MR Fellows, MT Hallett, HT Wareham, TJ Warnow Theoretical Computer Science 244 (1-2), 167-188, 2000 | 66 | 2000 |
| The parameterized complexity of some problems in logic and linguistics RG Downey, MR Fellows, BM Kapron, MT Hallett, HT Wareham International Symposium on Logical Foundations of Computer Science, 89-100, 1994 | 65 | 1994 |
| Parameterized complexity in cognitive modeling: Foundations, applications and opportunities I Van Rooij, T Wareham The Computer Journal 51 (3), 385-404, 2008 | 64 | 2008 |
| How hard is cognitive science? P Rich, R de Haan, T Wareham, I van Rooij Proceedings of the annual meeting of the cognitive science society 43 (43), 2021 | 63 | 2021 |
| Practical algorithms for universal DNA primer design: an exercise in algorithm engineering PA Evans, HT Wareham Currents in Computational Molecular Biology, 25-26, 2001 | 59 | 2001 |
| Intractability and the use of heuristics in psychological explanations I Van Rooij, CD Wright, T Wareham Synthese 187 (2), 471-487, 2012 | 52 | 2012 |
| The parameterized complexity of intersection and composition operations on sets of finite-state automata H Todd Wareham International conference on implementation and application of automata, 302-310, 2000 | 46 | 2000 |
| Rational analysis, intractability, and the prospects of ‘as if’-explanations I van Rooij, CD Wright, J Kwisthout, T Wareham Synthese 195 (2), 491-510, 2018 | 43 | 2018 |
