The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David Fernández-Baca: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  45. Comparing and Aggregating Partially Resolved Trees. [Citation Graph (, )][DBLP]


  46. Constructing Majority-Rule Supertrees. [Citation Graph (, )][DBLP]


  47. Generalized Binary Tanglegrams: Algorithms and Applications. [Citation Graph (, )][DBLP]


  48. Comparing and Aggregating Partially Resolved Trees [Citation Graph (, )][DBLP]


  49. Graph Triangulations and the Compatibility of Unrooted Phylogenetic Trees [Citation Graph (, )][DBLP]


Search in 0.159secs, Finished in 0.161secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002