Nonconstructive advances in polynomial-time complexity
Information Processing Letters
SIAM Journal on Computing
Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
On limited nondeterminism and the complexity of the V-C dimension
Journal of Computer and System Sciences
An integrated complexity analysis of problems from computational biology
An integrated complexity analysis of problems from computational biology
An improved fixed-parameter algorithm for vertex cover
Information Processing Letters
Simplicity and Robustness of Fast and Frugal Heuristics
Minds and Machines
Minds and Machines
Gene Trees and Species Trees: The Gene-Duplication Problem in Fixed-Parameter Tractable
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
On the Multiple Gene Duplication Problem
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Vertex Cover: Further Observations and Further Improvements
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
DNA Physical Mapping: Three Ways Difficult
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Analogs and Duals of teh MAST Problem for Sequences and Trees
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Two Strikes Against Perfect Phylogeny
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Systematic parameterized complexity analysis in computational phonology
Systematic parameterized complexity analysis in computational phonology
Algorithms and complexity for annotated sequence analysis
Algorithms and complexity for annotated sequence analysis
Solving large FPT problems on coarse-grained parallel machines
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Simultaneous identification of duplications and lateral transfers
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Vision: A Computational Investigation into the Human Representation and Processing of Visual Information
Parameterizing above or below guaranteed values
Journal of Computer and System Sciences
Upper bounds for vertex cover further improved
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A Note on the Fixed Parameter Tractability of the Gene-Duplication Problem
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Parameterized Algorithmics for Finding Connected Motifs in Biological Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Improved parameterized upper bounds for vertex cover
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.00 |
We discuss interdisciplinary parameterized complexity research in biology and cognitive science.