Kelk, Steven; Scornavacca, Celine Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable. (English) Zbl 1350.92036 Algorithmica 68, No. 4, 886-915 (2014). MSC: 92D15 05C05 68W05 68R10 PDFBibTeX XMLCite \textit{S. Kelk} and \textit{C. Scornavacca}, Algorithmica 68, No. 4, 886--915 (2014; Zbl 1350.92036) Full Text: DOI arXiv
Wagner, Stephan Asymptotic enumeration of extensional acyclic digraphs. (English) Zbl 1275.05029 Algorithmica 66, No. 4, 829-847 (2013). MSC: 05C30 05C20 05C38 PDFBibTeX XMLCite \textit{S. Wagner}, Algorithmica 66, No. 4, 829--847 (2013; Zbl 1275.05029) Full Text: DOI
Do, Huy Hoang; Sung, Wing Kin Compressed directed acyclic word graph with application in local alignment. (English) Zbl 1275.68063 Algorithmica 67, No. 2, 125-141 (2013). MSC: 68P05 68P30 68R10 PDFBibTeX XMLCite \textit{H. H. Do} and \textit{W. K. Sung}, Algorithmica 67, No. 2, 125--141 (2013; Zbl 1275.68063) Full Text: DOI
Stout, Quentin F. Isotonic regression via partitioning. (English) Zbl 1263.05080 Algorithmica 66, No. 1, 93-112 (2013). MSC: 05C70 PDFBibTeX XMLCite \textit{Q. F. Stout}, Algorithmica 66, No. 1, 93--112 (2013; Zbl 1263.05080) Full Text: DOI
Kaplan, Haim; Nussbaum, Yahav Maximum flow in directed planar graphs with vertex capacities. (English) Zbl 1223.05106 Algorithmica 61, No. 1, 174-189 (2011). MSC: 05C21 05C10 05C20 PDFBibTeX XMLCite \textit{H. Kaplan} and \textit{Y. Nussbaum}, Algorithmica 61, No. 1, 174--189 (2011; Zbl 1223.05106) Full Text: DOI Link
Chen, Chuhong; Bozorgzadeh, Elaheh; Srivastava, Ankur; Sarrafzadeh, Majid Budget management with applications. (English) Zbl 1016.68056 Algorithmica 34, No. 3, 261-275 (2002). MSC: 68R10 PDFBibTeX XMLCite \textit{C. Chen} et al., Algorithmica 34, No. 3, 261--275 (2002; Zbl 1016.68056) Full Text: DOI
Kalpakis, K.; Yesha, Y. Upper and lower bounds on the makespan of schedules for tree dags on linear arrays. (English) Zbl 0918.68044 Algorithmica 23, No. 2, 159-179 (1999). MSC: 68W15 68M20 PDFBibTeX XMLCite \textit{K. Kalpakis} and \textit{Y. Yesha}, Algorithmica 23, No. 2, 159--179 (1999; Zbl 0918.68044) Full Text: DOI
Zelikovsky, A. A series of approximation algorithms for the acyclic directed Steiner tree problem. (English) Zbl 0873.68079 Algorithmica 18, No. 1, 99-110 (1997). MSC: 68W10 68R10 PDFBibTeX XMLCite \textit{A. Zelikovsky}, Algorithmica 18, No. 1, 99--110 (1997; Zbl 0873.68079) Full Text: DOI
Bertolazzi, P.; Di Battista, G.; Liotta, G.; Mannino, C. Upward drawings of triconnected digraphs. (English) Zbl 1211.68477 Algorithmica 12, No. 6, 476-497 (1994). MSC: 68U10 05C10 05C20 68R10 PDFBibTeX XMLCite \textit{P. Bertolazzi} et al., Algorithmica 12, No. 6, 476--497 (1994; Zbl 1211.68477) Full Text: DOI
Gusfield, Dan; Naor, Dalit Extracting maximal information about sets of minimum cuts. (English) Zbl 0781.90087 Algorithmica 10, No. 1, 64-89 (1993). MSC: 90C35 90B10 90C60 68Q25 68R10 05C40 PDFBibTeX XMLCite \textit{D. Gusfield} and \textit{D. Naor}, Algorithmica 10, No. 1, 64--89 (1993; Zbl 0781.90087) Full Text: DOI