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
Gutin, Gregory; Razgon, Igor; Kim, Eun Jung Minimum leaf out-branching and related problems. (English) Zbl 1343.68183 Theor. Comput. Sci. 410, No. 45, 4571-4579 (2009). MSC: 68R10 05C20 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{G. Gutin} et al., Theor. Comput. Sci. 410, No. 45, 4571--4579 (2009; Zbl 1343.68183) Full Text: DOI
Gutin, Gregory; Yeo, Anders On the number of connected convex subgraphs of a connected acyclic digraph. (English) Zbl 1228.05173 Discrete Appl. Math. 157, No. 7, 1660-1662 (2009). MSC: 05C30 05C20 05C40 PDFBibTeX XMLCite \textit{G. Gutin} and \textit{A. Yeo}, Discrete Appl. Math. 157, No. 7, 1660--1662 (2009; Zbl 1228.05173) Full Text: DOI
Balister, Paul; Gerke, Stefanie; Gutin, Gregory Convex sets in acyclic digraphs. (English) Zbl 1225.05106 Order 26, No. 1, 95-100 (2009). MSC: 05C20 05C38 05C85 68R10 PDFBibTeX XMLCite \textit{P. Balister} et al., Order 26, No. 1, 95--100 (2009; Zbl 1225.05106) Full Text: DOI arXiv