Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Hard problems in similarity searching
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Distortion Is Fixed Parameter Tractable
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Hard problems in similarity searching
Discrete Applied Mathematics
Parameterized complexity and approximability of the SLCS problem
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Subexponential parameterized algorithm for minimum fill-in
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fixed parameter tractability of binary near-perfect phylogenetic tree reconstruction
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Using treemaps to visualize phylogenetic trees
ISBMDA'05 Proceedings of the 6th International conference on Biological and Medical Data Analysis
RAxML-OMP: an efficient program for phylogenetic inference on SMPs
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
A parameterized algorithm for chordal sandwich
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Parameterized complexity and approximability of the Longest Compatible Sequence problem
Discrete Optimization
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Distortion is Fixed Parameter Tractable
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 5.23 |