Остановите войну!
for scientists:
default search action
David Fernández-Baca
- > Home > Persons > David Fernández-Baca
Publications
- 2004
- [j23]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) - 2002
- [j20]David Fernández-Baca, Timo Seppäläinen, Giora Slutzki:
Bounds for parametric sequence comparison. Discret. Appl. Math. 118(3): 181-198 (2002) - 2000
- [c16]David Fernández-Baca, Timo Seppäläinen, Giora Slutzki:
Parametric Multiple Sequence Alignment and Phylogeny Construction. CPM 2000: 69-83 - 1999
- [c14]David Fernández-Baca, Timo Seppäläinen, Giora Slutzki:
Bounds for Parametric Sequence Comparison. SPIRE/CRIWG 1999: 55-62 - 1997
- [j17]David Fernández-Baca, Giora Slutzki:
Optimal Parametric Search on Graphs of Bounded Tree-Width. J. Algorithms 22(2): 212-240 (1997) - [j16]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
- [j15]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) - [j14]David Fernández-Baca, Giora Slutzki, David Eppstein:
Using Sparsification for Parametric Minimum Spanning Tree Problems. Nord. J. Comput. 3(4): 352-366 (1996) - [j13]Richa Agarwala, David Fernández-Baca:
Weighted Multidimensional Search and Its Application to Convex Optimization. SIAM J. Comput. 25(1): 83-99 (1996) - [c10]David Fernández-Baca, Giora Slutzki, David Eppstein:
Using Sparsification for Parametric Minimum Spanning Tree Problems. SWAT 1996: 149-160 - 1995
- [j12]Richa Agarwala, David Fernández-Baca:
Weighted Search in the Plane. Inf. Process. Lett. 54(2): 97-100 (1995) - [j11]Richa Agarwala, David Fernández-Baca, Giora Slutzki:
Fast Algorithms for Inferring Evolutionary Trees. J. Comput. Biol. 2(3): 397-407 (1995) - [c9]David Fernández-Baca, Giora Slutzki:
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs. LATIN 1995: 257-271 - 1994
- [j10]David Fernández-Baca, Giora Slutzki:
Parametric Problems on Graphs of Bounded Tree-Width. J. Algorithms 16(3): 408-430 (1994) - [j9]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) - [c8]David Fernández-Baca, Giora Slutzki:
Optimal Parametric Search on Graphs of Bounded Tree-Width. SWAT 1994: 155-166 - 1993
- [c7]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 - 1992
- [c6]Richa Agarwala, David Fernández-Baca:
Solving the Lagrangian Dual when the Number of Constraints is Fixed. FSTTCS 1992: 164-175 - [c5]David Fernández-Baca, Giora Slutzki:
Parametric Problems on Graphs of Bounded Tree-Width. SWAT 1992: 304-316 - 1989
- [j4]David Fernández-Baca, Giora Slutzki:
Solving Parametric Problems on Trees. J. Algorithms 10(3): 381-402 (1989) - 1988
- [c1]David Fernández-Baca, Giora Slutzki:
Solving Parametric Problems on Trees. STACS 1988: 52-60
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint