The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Todd Wareham: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Matthew Hamilton, Rhonda Chaytor, Todd Wareham
    The Parameterized Complexity of Enumerating Frequent Itemsets. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:227-238 [Conf]
  3. Gianluca Della Vedova, Todd Wareham
    Optimal algorithms for local vertex quartet cleaning. [Citation Graph (0, 0)][DBLP]
    SAC, 2002, pp:173-177 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]

  10. Approximating Solution Structure. [Citation Graph (, )][DBLP]


  11. Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries. [Citation Graph (, )][DBLP]


  12. Parameterized Complexity in Cognitive Modeling: Foundations, Applications and Opportunities. [Citation Graph (, )][DBLP]


Search in 0.012secs, Finished in 0.013secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002