Search the dblp DataBase
Todd Wareham :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Vincent Berry , Tao Jiang , Paul E. Kearney , Ming Li , Todd Wareham Quartet Cleaning: Improved Algorithms and Simulations. [Citation Graph (0, 0)][DBLP ] ESA, 1999, pp:313-324 [Conf ] Matthew Hamilton , Rhonda Chaytor , Todd Wareham The Parameterized Complexity of Enumerating Frequent Itemsets. [Citation Graph (0, 0)][DBLP ] IWPEC, 2006, pp:227-238 [Conf ] Gianluca Della Vedova , Todd Wareham Optimal algorithms for local vertex quartet cleaning. [Citation Graph (0, 0)][DBLP ] SAC, 2002, pp:173-177 [Conf ] 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). [Citation Graph (0, 0)][DBLP ] SODA, 2000, pp:287-296 [Conf ] Louigi Addario-Berry , Benny Chor , Michael T. Hallett , Jens Lagergren , Alessandro Panconesi , Todd Wareham Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. [Citation Graph (0, 0)][DBLP ] WABI, 2003, pp:202-215 [Conf ] Todd Wareham The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:302-310 [Conf ] Gianluca Della Vedova , Todd Wareham Optimal algorithms for local vertex quartet cleaning. [Citation Graph (0, 0)][DBLP ] Bioinformatics, 2002, v:18, n:10, pp:1297-1304 [Journal ] Louigi Addario-Berry , Benny Chor , Michael T. Hallett , Jens Lagergren , Alessandro Panconesi , Todd Wareham Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. [Citation Graph (0, 0)][DBLP ] J. Bioinformatics and Computational Biology, 2004, v:2, n:2, pp:257-272 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2000, v:244, n:1-2, pp:167-188 [Journal ] Approximating Solution Structure. [Citation Graph (, )][DBLP ] Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries. [Citation Graph (, )][DBLP ] Parameterized Complexity in Cognitive Modeling: Foundations, Applications and Opportunities. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.004secs