H. Todd Wareham

663 total citations
17 papers, 262 citations indexed

About

H. Todd Wareham is a scholar working on Artificial Intelligence, Molecular Biology and Computational Theory and Mathematics. According to data from OpenAlex, H. Todd Wareham has authored 17 papers receiving a total of 262 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Artificial Intelligence, 8 papers in Molecular Biology and 6 papers in Computational Theory and Mathematics. Recurrent topics in H. Todd Wareham's work include Algorithms and Data Compression (6 papers), Genomics and Phylogenetic Studies (5 papers) and DNA and Biological Computing (3 papers). H. Todd Wareham is often cited by papers focused on Algorithms and Data Compression (6 papers), Genomics and Phylogenetic Studies (5 papers) and DNA and Biological Computing (3 papers). H. Todd Wareham collaborates with scholars based in Canada, Netherlands and Italy. H. Todd Wareham's co-authors include Michael R. Fellows, Hans L. Bodlaender, Patricia Evans, Rodney G. Downey, Michael Hallett, Andrew D. Smith, Moritz Müller, Marco Cesati, Tandy Warnow and Gianluca Della Vedova and has published in prestigious journals such as Bioinformatics, Language and Cognitive Science.

In The Last Decade

H. Todd Wareham

17 papers receiving 225 citations

Peers

H. Todd Wareham

CTM

CNC

GENET

Paul Ruet France

Robert Veroff United States

Tomasz Waleń Poland

Jan Holub Czechia

Max Dauchet France

Noa Lewenstein Israel

Gheorghe Ştefănescu Romania

Marie-Pierre Béal France

Ricardo Rocha Portugal

Hal Sudborough United States

Paul Ruet France

H. Todd Wareham

121 ×0.8

145 ×1.3

127 ×1.2

CTM

28 ×0.7

CNC

16 ×0.5

GENET

Citations per year, relative to H. Todd Wareham H. Todd Wareham (= 1×) peers Paul Ruet

Countries citing papers authored by H. Todd Wareham

Since Specialization

Citations

This map shows the geographic impact of H. Todd Wareham's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by H. Todd Wareham with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites H. Todd Wareham more than expected).

Fields of papers citing papers by H. Todd Wareham

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by H. Todd Wareham. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by H. Todd Wareham. The network helps show where H. Todd Wareham may publish in the future.

Co-authorship network of co-authors of H. Todd Wareham

This figure shows the co-authorship network connecting the top 25 collaborators of H. Todd Wareham. A scholar is included among the top collaborators of H. Todd Wareham based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with H. Todd Wareham. H. Todd Wareham is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

17 of 17 papers shown

Blokpoel, Mark, et al.. (2011). The computational costs of recipient design and intention recognition in communication. Cognitive Science. 33(33). 465–470. 4 indexed citations

Müller, Moritz, et al.. (2009). Similarity as tractable transformation. Data Archiving and Networked Services (DANS). 31(31). 50–55. 9 indexed citations

Evans, Patricia, et al.. (2009). Fixed-parameter tractability of anonymizing data by suppressing entries. Journal of Combinatorial Optimization. 18(4). 362–375. 6 indexed citations

Evans, Patricia, et al.. (2008). Identifying Sources of Intractability in Cognitive Models: An Illustration Using Analogical Structure Mapping. Conference Cognitive Science. 30(30). 915–920. 27 indexed citations

Evans, Patricia, Andrew D. Smith, & H. Todd Wareham. (2003). On the complexity of finding common approximate substrings. Theoretical Computer Science. 306(1-3). 407–430. 44 indexed citations

Evans, Patricia, Andrew D. Smith, & H. Todd Wareham. (2003). On the complexity of #nding common approximate substrings. 3 indexed citations

Vedova, Gianluca Della & H. Todd Wareham. (2002). Optimal algorithms for local vertex quartet cleaning. Bioinformatics. 18(10). 1297–1304. 3 indexed citations

Cesati, Marco & H. Todd Wareham. (2002). Parameterized complexity analysis in robot motion planning. Cineca Institutional Research Information System (Tor Vergata University). 1. 880–885. 8 indexed citations

Vedova, Gianluca Della & H. Todd Wareham. (2002). Optimal algorithms for local vertex quartet cleaning. PubMed. 18(10). 173–177. 4 indexed citations

10.

Bodlaender, Hans L., Michael R. Fellows, Michael Hallett, H. Todd Wareham, & Tandy Warnow. (2000). The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. Theoretical Computer Science. 244(1-2). 167–188. 22 indexed citations

11.

Evans, Patricia & H. Todd Wareham. (2000). EXACT ALGORITHMS FOR COMPUTING PAIRWISE ALIGNMENTS AND 3-MEDIANS FROM STRUCTURE-ANNOTATED SEQUENCES (EXTENDED ABSTRACT). PubMed. 559–570. 3 indexed citations

12.

Wareham, H. Todd, et al.. (1999). STOCHASTIC HEURISTIC ALGORITHMS FOR TARGET MOTIF IDENTIFICATION (EXTENDED ABSTRACT). PubMed. 392–403. 1 indexed citations

13.

Wareham, H. Todd. (1996). Language computations. Ed. by Eric Sven Ristad. (DIMACS series in discrete mathematics and theoretical computer science, 17.) Providence, RI: American Mathematical Society, 1994. Pp. xiv, 198.. Language. 72(1). 186–187. 1 indexed citations

14.

Bodlaender, Hans L., Rodney G. Downey, Michael R. Fellows, & H. Todd Wareham. (1995). The parameterized complexity of sequence alignment and consensus. Theoretical Computer Science. 147(1-2). 31–54. 43 indexed citations

15.

Wareham, H. Todd. (1995). A Simplified Proof of the NP- and MAX SNP-Hardness of Multiple Sequence Tree Alignment. Journal of Computational Biology. 2(4). 509–514. 17 indexed citations

16.

Bodlaender, Hans L., Rodney G. Downey, Michael R. Fellows, Michael Hallett, & H. Todd Wareham. (1995). Parameterized complexity analysis in computational biology. Computer applications in the biosciences. 11(1). 49–57. 62 indexed citations

17.

Hallett, Michael & H. Todd Wareham. (1994). A compendium of parameterized complexity results. ACM SIGACT News. 25(3). 122–123. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact