Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Fern{\'a}ndez-Baca, David"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fixed-parameter algorithms for finding agreement supertrees
David Fernández-Baca
,
Sylvain Guillemot
,
Brad Shutters
,
Sudheer Vakati
Lecture Notes in Computer Science
7354
, 2012, pp. 373-384
Comparing and aggregating partially resolved trees
Mukul S. Bansal
,
Jianrong Dong
,
David Fernández-Baca
Theoretical Computer Science
412
(48), 2011, pp. 6634-6652
Parametric analysis for ungapped Markov models of evolution
David Fernández-Baca
,
Balaji Venkatachalam
Lecture Notes in Computer Science
3537
, 2005, pp. 394-405
Inverse parametric sequence alignment
Fangting Sun
,
David Fernández-Baca
,
Wei Yu
Journal of Algorithms
53
(1), 2004, pp. 36-54
Supertrees by flipping
D. Chen
,
O. Eulenstein
,
David Fernández-Baca
,
M. Sanderson
Lecture Notes in Computer Science
2387
, 2002, pp. 391-400
Inverse parametric sequence alignment
Fangting Sun
,
David Fernández-Baca
,
Wei Yu
Lecture Notes in Computer Science
2387
, 2002, pp. 97-106
Parametric multiple sequence alignment and phylogeny construction
David Fernández-Baca
,
Timo Seppäläinen
,
Giora Slutzki
Lecture Notes in Computer Science
1848
, 2000, pp. 69-83
A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed
Richa Agarwala
,
David Fernández-Baca
SIAM Journal on Computing
23
(6), 1994, pp. 1216-1224
Parametric problems on graphs of bounded tree-width
David Fernández-Baca
,
Giora Slutzki
Journal of Algorithms
16
(3), 1994, pp. 408-430
A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed
Richa Agarwala
,
David Fernández-Baca
Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, FOCS'93 (Palo Alto, CA, November 3-5, 1993)
, 1993, pp. 140-147
Solving the Lagrangian dual when the number of constraints is fixed
Richa Agarwala
,
David Fernández-Baca
Lecture Notes in Computer Science
652
, 1992, pp. 164-175
Parametric problems on graphs of bounded tree-width
David Fernández-Baca
,
Giora Slutzki
Lecture Notes in Computer Science
621
, 1992, pp. 304-316
On matroids and hierarchical graphs
David Fernández-Baca
,
Mark A. Williams
Information Processing Letters
38
, 1991, pp. 117-121
On matroids and hierarchical graphs
David Fernández-Baca
,
Mark A. Williams
Lecture Notes in Computer Science
447
, 1990, pp. 320-331
Space-sweep algorithms for parametric optimization
David Fernández-Baca
Lecture Notes in Computer Science
447
, 1990, pp. 264-275
Solving parametric problems on trees
David Fernández-Baca
,
Giora Slutzki
Journal of Algorithms
10
, 1989, pp. 381-402
Augmentation problems on hierarchically defined graphs
David Fernández-Baca
,
Mark A. Williams
Lecture Notes in Computer Science
382
, 1989, pp. 563-576
Theoretical efficiency of maximum flow algorithms on networks with small integer capacities
David Fernández-Baca
,
Charles U. Martel
Technical Report (87-4), 1987, February