Zero knowledge and the chromatic number
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Rooted Maximum Agreement Supertrees
Algorithmica
Pattern Identification in Biogeography
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Analytic solutions for three taxon ML trees with variable rates across sites
Discrete Applied Mathematics
Maximum agreement and compatible supertrees
Journal of Discrete Algorithms
A fixed-parameter algorithm for the directed feedback vertex set problem
Journal of the ACM (JACM)
From Gene Trees to Species Trees through a Supertree Approach
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
New results on optimizing rooted triplets consistency
Discrete Applied Mathematics
The complexity of inferring a minimally resolved phylogenetic supertree
WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
Fixed-parameter tractability of the maximum agreement supertree problem
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Algorithms for building consensus MUL-trees
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Sitting closer to friends than enemies, revisited
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Generating functions for multi-labeled trees
Discrete Applied Mathematics
| Hi-index | 0.00 |
HASH(0x295bbbc)