Hellmuth, Marc; Schaller, David; Stadler, Peter F. Compatibility of partitions with trees, hierarchies, and split systems. (English) Zbl 1486.05243 Discrete Appl. Math. 314, 265-283 (2022). MSC: 05C70 05C05 05C90 92D15 PDFBibTeX XMLCite \textit{M. Hellmuth} et al., Discrete Appl. Math. 314, 265--283 (2022; Zbl 1486.05243) Full Text: DOI arXiv
Azam, Naveed Ahmed; Shurbevski, Aleksandar; Nagamochi, Hiroshi A method for enumerating pairwise compatibility graphs with a given number of vertices. (English) Zbl 1472.05068 Discrete Appl. Math. 303, 171-185 (2021). MSC: 05C30 05C60 90C05 PDFBibTeX XMLCite \textit{N. A. Azam} et al., Discrete Appl. Math. 303, 171--185 (2021; Zbl 1472.05068) Full Text: DOI
Long, Yangjing; Stadler, Peter F. Exact-2-relation graphs. (English) Zbl 1447.05198 Discrete Appl. Math. 285, 212-226 (2020). MSC: 05C90 92D10 05C20 05C05 05C12 PDFBibTeX XMLCite \textit{Y. Long} and \textit{P. F. Stadler}, Discrete Appl. Math. 285, 212--226 (2020; Zbl 1447.05198) Full Text: DOI arXiv
Bellanger, A.; Janiak, A.; Kovalyov, M. Y.; Oulamara, A. Scheduling an unbounded batching machine with job processing time compatibilities. (English) Zbl 1238.90060 Discrete Appl. Math. 160, No. 1-2, 15-23 (2012). MSC: 90B35 90C39 PDFBibTeX XMLCite \textit{A. Bellanger} et al., Discrete Appl. Math. 160, No. 1--2, 15--23 (2012; Zbl 1238.90060) Full Text: DOI
Brandes, Ulrik; Cornelsen, Sabine Phylogenetic graph models beyond trees. (English) Zbl 1163.92030 Discrete Appl. Math. 157, No. 10, 2361-2369 (2009). MSC: 92D15 05C05 05C90 65Y20 PDFBibTeX XMLCite \textit{U. Brandes} and \textit{S. Cornelsen}, Discrete Appl. Math. 157, No. 10, 2361--2369 (2009; Zbl 1163.92030) Full Text: DOI
Blanchet-Sadri, F.; Anavekar, Arundhati R. Testing primitivity on partial words. (English) Zbl 1108.68093 Discrete Appl. Math. 155, No. 3, 279-287 (2007). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{A. R. Anavekar}, Discrete Appl. Math. 155, No. 3, 279--287 (2007; Zbl 1108.68093) Full Text: DOI Link
Huber, Katharina T.; Moulton, Vincent; Semple, Charles Replacing cliques by stars in quasi-median graphs. (English) Zbl 1053.05040 Discrete Appl. Math. 143, No. 1-3, 194-203 (2004). MSC: 05C12 05C69 PDFBibTeX XMLCite \textit{K. T. Huber} et al., Discrete Appl. Math. 143, No. 1--3, 194--203 (2004; Zbl 1053.05040) Full Text: DOI
Semple, Charles Reconstructing minimal rooted trees. (English) Zbl 1038.05014 Discrete Appl. Math. 127, No. 3, 489-503 (2003). Reviewer: Vincent Moulton (Uppsala) MSC: 05C05 92D15 PDFBibTeX XMLCite \textit{C. Semple}, Discrete Appl. Math. 127, No. 3, 489--503 (2003; Zbl 1038.05014) Full Text: DOI
Hein, Jotun; Jiang, Tao; Wang, Lusheng; Zhang, Kaizhong On the complexity of comparing evolutionary trees. (English) Zbl 0876.92020 Discrete Appl. Math. 71, No. 1-3, 153-169 (1996). MSC: 92D15 68Q25 05C90 PDFBibTeX XMLCite \textit{J. Hein} et al., Discrete Appl. Math. 71, No. 1--3, 153--169 (1996; Zbl 0876.92020) Full Text: DOI Link
Raychaudhuri, Arundhati Optimal multiple interval assignments in frequency assignment and traffic phasing. (English) Zbl 0768.68175 Discrete Appl. Math. 40, No. 3, 319-332 (1992). MSC: 68R10 68Q25 90C05 PDFBibTeX XMLCite \textit{A. Raychaudhuri}, Discrete Appl. Math. 40, No. 3, 319--332 (1992; Zbl 0768.68175) Full Text: DOI