The following pages link to David Fernández Baca (Q324833):
Displaying 50 items.
- (Q203730) (redirect page) (← links)
- Compatibility, incompatibility, tree-width, and forbidden phylogenetic minors (Q324834) (← links)
- (Q411842) (redirect page) (← links)
- An axiomatic study of majority-rule \((+)\) and associated consensus functions on hierarchies (Q411843) (← links)
- A simple characterization of the minimal obstruction sets for three-state perfect phylogenies (Q450220) (← links)
- Majority-rule (+) consensus trees (Q608873) (← links)
- Graph triangulations and the compatibility of unrooted phylogenetic trees (Q628277) (← links)
- Comparing and aggregating partially resolved trees (Q650896) (← links)
- Weighted search in the plane (Q673472) (← links)
- Fast compatibility testing for rooted phylogenetic trees (Q724246) (← links)
- Parametric multiple sequence alignment and phylogeny construction (Q876718) (← links)
- Computing distances between partial rankings (Q976084) (← links)
- Nonserial dynamic programming formulations of satisfiability (Q1099093) (← links)
- On the efficiency of maximum-flow algorithms on networks with small integer capacities (Q1111460) (← links)
- On matroids and hierarchical graphs (Q1178207) (← links)
- On the approximability of the Steiner tree problem in phylogeny (Q1281766) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q1391297) (← links)
- Decomposable multi-parameter matroid optimization problems. (Q1401298) (← links)
- Bounds for parametric sequence comparison (Q1602688) (← links)
- Fast compatibility testing for phylogenies with nested taxa (Q1708416) (← links)
- On compatibility and incompatibility of collections of unrooted phylogenetic trees (Q1752481) (← links)
- Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study (Q2312406) (← links)
- (Q2723941) (← links)
- Fixed-Parameter Algorithms for Finding Agreement Supertrees (Q2904511) (← links)
- Parametric analysis for ungapped Markov models of evolution (Q2930271) (← links)
- Optimal Parametric Search on Graphs of Bounded Tree-Width (Q3128194) (← links)
- (Q3129922) (← links)
- Fast Algorithms for Bipartite Network Flow (Q3754450) (← links)
- (Q3787503) (← links)
- (Q3829325) (← links)
- (Q4028919) (← links)
- Parametric Problems on Graphs of Bounded Tree-Width (Q4290915) (← links)
- (Q4326211) (← links)
- A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed (Q4327418) (← links)
- A Polynomial-Time Algorithm for Near-Perfect Phylogeny (Q4429677) (← links)
- (Q4508378) (← links)
- Solving parametric problems on trees (Q4732107) (← links)
- (Q4808627) (← links)
- (Q4808660) (← links)
- (Q4818875) (← links)
- Inverse parametric sequence alignment (Q4826762) (← links)
- Weighted Multidimensional Search and Its Application to Convex Optimization (Q4875446) (← links)
- SIMPLE ALGORITHMS FOR PERFECT PHYLOGENY AND TRIANGULATING COLORED GRAPHS (Q4888365) (← links)
- Using sparsification for parametric minimum spanning tree problems (Q5054811) (← links)
- Space-sweep algorithms for parametric optimization (Q5056109) (← links)
- On matroids and hierarchical graphs (Q5056114) (← links)
- Parametric problems on graphs of bounded tree-width (Q5056150) (← links)
- Optimal parametric search on graphs of bounded tree-width (Q5056174) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q5096337) (← links)
- Fixed-Parameter Algorithms for Finding Agreement Supertrees (Q5252691) (← links)
