| 2009 |
|---|
| 47 | EE | Mukul S. Bansal,
Wen-Chieh Chang,
Oliver Eulenstein,
David Fernández-Baca:
Generalized Binary Tanglegrams: Algorithms and Applications.
BICoB 2009: 114-125 |
| 46 | EE | Mukul S. Bansal,
David Fernández-Baca:
Computing distances between partial rankings.
Inf. Process. Lett. 109(4): 238-241 (2009) |
| 2008 |
|---|
| 45 | EE | Mukul S. Bansal,
Jianrong Dong,
David Fernández-Baca:
Comparing and Aggregating Partially Resolved Trees.
LATIN 2008: 72-83 |
| 2006 |
|---|
| 44 | EE | Duhong Chen,
Oliver Eulenstein,
David Fernández-Baca,
Michael Sanderson:
Minimum-Flip Supertrees: Complexity and Algorithms.
IEEE/ACM Trans. Comput. Biology Bioinform. 3(2): 165-173 (2006) |
| 2005 |
|---|
| 43 | EE | David Fernández-Baca,
Balaji Venkatachalam:
Parametric Analysis for Ungapped Markov Models of Evolution.
CPM 2005: 394-405 |
| 2004 |
|---|
| 42 | EE | Duhong Chen,
Oliver Eulenstein,
David Fernández-Baca:
Rainbow: a toolbox for phylogenetic supertree construction and analysis.
Bioinformatics 20(16): 2872-2873 (2004) |
| 41 | EE | Fangting Sun,
David Fernández-Baca,
Wei Yu:
Inverse parametric sequence alignment.
J. Algorithms 53(1): 36-54 (2004) |
| 40 | EE | David Fernández-Baca,
Timo Seppäläinen,
Giora Slutzki:
Parametric multiple sequence alignment and phylogeny construction.
J. Discrete Algorithms 2(2): 271-287 (2004) |
| 2003 |
|---|
| 39 | EE | David Fernández-Baca,
Jens Lagergren:
A Polynomial-Time Algorithm for Near-Perfect Phylogeny.
SIAM J. Comput. 32(5): 1115-1127 (2003) |
| 38 | EE | David Fernández-Baca:
Decomposable multi-parameter matroid optimization problems.
Theor. Comput. Sci. 297(1-3): 183-198 (2003) |
| 2002 |
|---|
| 37 | EE | Duhong Chen,
Oliver Eulenstein,
David Fernández-Baca,
Michael Sanderson:
Supertrees by Flipping.
COCOON 2002: 391-400 |
| 36 | EE | Fangting Sun,
David Fernández-Baca,
Wei Yu:
Inverse Parametric Sequence Alignment.
COCOON 2002: 97-106 |
| 35 | | David Fernández-Baca,
Timo Seppäläinen,
Giora Slutzki:
Bounds for parametric sequence comparison.
Discrete Applied Mathematics 118(3): 181-198 (2002) |
| 2001 |
|---|
| 34 | EE | David Fernández-Baca:
On Nonlinear Parametric Search.
Algorithmica 30(1): 1-11 (2001) |
| 2000 |
|---|
| 33 | EE | David Fernández-Baca,
Timo Seppäläinen,
Giora Slutzki:
Parametric Multiple Sequence Alignment and Phylogeny Construction.
CPM 2000: 69-83 |
| 32 | | David Fernández-Baca:
Multi-parameter Minimum Spanning Trees.
LATIN 2000: 217-226 |
| 1999 |
|---|
| 31 | EE | David Fernández-Baca,
Timo Seppäläinen,
Giora Slutzki:
Bounds for Parametric Sequence Comparison.
SPIRE/CRIWG 1999: 55-62 |
| 1998 |
|---|
| 30 | EE | David Fernández-Baca:
Faster Non-linear Parametric Search with Applications to Optimazation and Dynamic Geometry.
LATIN 1998: 33-41 |
| 29 | EE | David Fernández-Baca,
Jens Lagergren:
On the Approximability of the Steiner Tree Problem in Phylogeny.
Discrete Applied Mathematics 88(1-3): 129-145 (1998) |
| 1997 |
|---|
| 28 | | David Fernández-Baca,
Giora Slutzki:
Optimal Parametric Search on Graphs of Bounded Tree-Width.
J. Algorithms 22(2): 212-240 (1997) |
| 27 | EE | David Fernández-Baca,
Giora Slutzki:
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs.
Theor. Comput. Sci. 181(1): 57-74 (1997) |
| 1996 |
|---|
| 26 | | David Fernández-Baca,
Jens Lagergren:
A Polynomial-Time Algorithm for Near-Perfect Phylogeny.
ICALP 1996: 670-680 |
| 25 | | David Fernández-Baca,
Jens Lagergren:
On the Approximability of the Steiner Tree Problem in Phylogeny.
ISAAC 1996: 65-74 |
| 24 | | David Fernández-Baca,
Giora Slutzki,
David Eppstein:
Using Sparsification for Parametric Minimum Spanning Tree Problems.
SWAT 1996: 149-160 |
| 23 | | Richa Agarwala,
David Fernández-Baca:
Simple Algorithms for Perfect Phylogeny and Triangulating Colored Graphs.
Int. J. Found. Comput. Sci. 7(1): 11-22 (1996) |
| 22 | | David Fernández-Baca,
Giora Slutzki,
David Eppstein:
Using Sparsification for Parametric Minimum Spanning Tree Problems.
Nord. J. Comput. 3(4): 352-366 (1996) |
| 21 | | Richa Agarwala,
David Fernández-Baca:
Weighted Multidimensional Search and Its Application to Convex Optimization.
SIAM J. Comput. 25(1): 83-99 (1996) |
| 1995 |
|---|
| 20 | | David Fernández-Baca,
Giora Slutzki:
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs.
LATIN 1995: 257-271 |
| 19 | EE | Richa Agarwala,
David Fernández-Baca:
Weighted Search in the Plane.
Inf. Process. Lett. 54(2): 97-100 (1995) |
| 18 | | Richa Agarwala,
David Fernández-Baca,
Giora Slutzki:
Fast Algorithms for Inferring Evolutionary Trees.
Journal of Computational Biology 2(3): 397-407 (1995) |
| 1994 |
|---|
| 17 | | David Fernández-Baca,
Giora Slutzki:
Optimal Parametric Search on Graphs of Bounded Tree-Width.
SWAT 1994: 155-166 |
| 16 | | David Fernández-Baca,
Giora Slutzki:
Parametric Problems on Graphs of Bounded Tree-Width.
J. Algorithms 16(3): 408-430 (1994) |
| 15 | | Richa Agarwala,
David Fernández-Baca:
A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed.
SIAM J. Comput. 23(6): 1216-1224 (1994) |
| 1993 |
|---|
| 14 | | Richa Agarwala,
David Fernández-Baca:
A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed
FOCS 1993: 140-147 |
| 13 | | David Fernández-Baca,
A. Medepalli:
Parametric Module Allocation on Partial k-Trees.
IEEE Trans. Computers 42(6): 738-742 (1993) |
| 1992 |
|---|
| 12 | | Richa Agarwala,
David Fernández-Baca:
Solving the Lagrangian Dual when the Number of Constraints is Fixed.
FSTTCS 1992: 164-175 |
| 11 | | David Fernández-Baca,
Giora Slutzki:
Parametric Problems on Graphs of Bounded Tree-Width.
SWAT 1992: 304-316 |
| 1991 |
|---|
| 10 | | David Fernández-Baca,
Mark A. Williams:
On Matroids and Hierarchical Graphs.
Inf. Process. Lett. 38(3): 117-121 (1991) |
| 1990 |
|---|
| 9 | | David Fernández-Baca:
Space-Sweep Algorithms for Parametric Optimization (Extended Abstract).
SWAT 1990: 264-275 |
| 8 | | David Fernández-Baca,
Mark A. Williams:
On Matroids and Hierarchical Graphs.
SWAT 1990: 320-331 |
| 1989 |
|---|
| 7 | | David Fernández-Baca,
Mark A. Williams:
Augmentation Problems on Hierarchically Defined Graphs (Preliminary Version).
WADS 1989: 563-576 |
| 6 | | David Fernández-Baca,
Charles U. Martel:
On the Efficiency of Maximum-Flow Algorithms on Networks with Small Integer Capacities.
Algorithmica 4(2): 173-189 (1989) |
| 5 | EE | David Fernández-Baca:
Allocating Modules to Processors in a Distributed System.
IEEE Trans. Software Eng. 15(11): 1427-1436 (1989) |
| 4 | | David Fernández-Baca,
Giora Slutzki:
Solving Parametric Problems on Trees.
J. Algorithms 10(3): 381-402 (1989) |
| 1988 |
|---|
| 3 | | David Fernández-Baca,
Giora Slutzki:
Solving Parametric Problems on Trees.
STACS 1988: 52-60 |
| 2 | | David Fernández-Baca:
Nonserial Dynamic Programming Formulations of Satisfiability.
Inf. Process. Lett. 27(6): 323-326 (1988) |
| 1987 |
|---|
| 1 | | Dan Gusfield,
Charles U. Martel,
David Fernández-Baca:
Fast Algorithms for Bipartite Network Flow.
SIAM J. Comput. 16(2): 237-251 (1987) |
