Crochemore, Maxime; Giambruno, Laura; Langiu, Alessio; Mignosi, Filippo; Restivo, Antonio Dictionary-symbolwise flexible parsing. (English) Zbl 1252.68099 J. Discrete Algorithms 14, 74-90 (2012). MSC: 68P20 68P30 68W32 PDFBibTeX XMLCite \textit{M. Crochemore} et al., J. Discrete Algorithms 14, 74--90 (2012; Zbl 1252.68099) Full Text: DOI
Gutin, G.; Johnstone, A.; Reddington, J.; Scott, E.; Yeo, A. An algorithm for finding input-output constrained convex sets in an acyclic digraph. (English) Zbl 1248.05078 J. Discrete Algorithms 13, 47-58 (2012). MSC: 05C20 52A15 68M99 68R10 PDFBibTeX XMLCite \textit{G. Gutin} et al., J. Discrete Algorithms 13, 47--58 (2012; Zbl 1248.05078) Full Text: DOI
Balister, P.; Gerke, S.; Gutin, G.; Johnstone, A.; Reddington, J.; Scott, E.; Soleimanfallah, A.; Yeo, A. Algorithms for generating convex sets in acyclic digraphs. (English) Zbl 1213.05241 J. Discrete Algorithms 7, No. 4, 509-518 (2009). MSC: 05C85 05C38 05C20 68M99 52A99 PDFBibTeX XMLCite \textit{P. Balister} et al., J. Discrete Algorithms 7, No. 4, 509--518 (2009; Zbl 1213.05241) Full Text: DOI
Ando, Ei; Nakata, Toshio; Yamashita, Masafumi Approximating the longest path length of a stochastic DAG by a normal distribution in linear time. (English) Zbl 1176.90595 J. Discrete Algorithms 7, No. 4, 420-438 (2009). MSC: 90C35 90B15 90C15 94C05 PDFBibTeX XMLCite \textit{E. Ando} et al., J. Discrete Algorithms 7, No. 4, 420--438 (2009; Zbl 1176.90595) Full Text: DOI
Crochemore, Maxime; Melichar, Bořivoj; Troníček, Zdeněk Directed acyclic subsequence graph – overview. (English) Zbl 1074.68044 J. Discrete Algorithms 1, No. 3-4, 255-280 (2003). MSC: 68R10 PDFBibTeX XMLCite \textit{M. Crochemore} et al., J. Discrete Algorithms 1, No. 3--4, 255--280 (2003; Zbl 1074.68044) Full Text: DOI