Lyu, Zhenhua Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints. (English) Zbl 1464.05162 J. Comb. Optim. 41, No. 3, 762-779 (2021). MSC: 05C20 05C38 05C12 05C35 PDFBibTeX XMLCite \textit{Z. Lyu}, J. Comb. Optim. 41, No. 3, 762--779 (2021; Zbl 1464.05162) Full Text: DOI
Borgwardt, Steffen; Patterson, Stephan On the computational complexity of finding a sparse Wasserstein barycenter. (English) Zbl 1511.68122 J. Comb. Optim. 41, No. 3, 736-761 (2021). MSC: 68Q17 05C70 49Q22 68Q25 90B80 PDFBibTeX XMLCite \textit{S. Borgwardt} and \textit{S. Patterson}, J. Comb. Optim. 41, No. 3, 736--761 (2021; Zbl 1511.68122) Full Text: DOI arXiv
Ekim, Tınaz; Shalom, Mordechai; Şeker, Oylum The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation. (English) Zbl 1468.05192 J. Comb. Optim. 41, No. 3, 710-735 (2021). MSC: 05C62 05C05 05C85 68Q17 PDFBibTeX XMLCite \textit{T. Ekim} et al., J. Comb. Optim. 41, No. 3, 710--735 (2021; Zbl 1468.05192) Full Text: DOI arXiv
Xi, Wenying; Lin, Wensong On maximum \(P_3\)-packing in claw-free subcubic graphs. (English) Zbl 1464.05310 J. Comb. Optim. 41, No. 3, 694-709 (2021). MSC: 05C70 05C35 PDFBibTeX XMLCite \textit{W. Xi} and \textit{W. Lin}, J. Comb. Optim. 41, No. 3, 694--709 (2021; Zbl 1464.05310) Full Text: DOI
Yang, Jinling; Wang, Ligong; Yang, Xiuwen Some mixed graphs with \(H\)-rank 4, 6 or 8. (English) Zbl 1464.05256 J. Comb. Optim. 41, No. 3, 678-693 (2021). MSC: 05C50 05C20 PDFBibTeX XMLCite \textit{J. Yang} et al., J. Comb. Optim. 41, No. 3, 678--693 (2021; Zbl 1464.05256) Full Text: DOI
Khalilpourazari, Soheyl; Pasandideh, Seyed Hamid Reza Designing emergency flood evacuation plans using robust optimization and artificial intelligence. (English) Zbl 1468.90078 J. Comb. Optim. 41, No. 3, 640-677 (2021). MSC: 90C17 90C90 PDFBibTeX XMLCite \textit{S. Khalilpourazari} and \textit{S. H. R. Pasandideh}, J. Comb. Optim. 41, No. 3, 640--677 (2021; Zbl 1468.90078) Full Text: DOI
Wei, Qi; Sun, Jie; Tan, Xuehou; Yao, Xiaolin; Ren, Yonggong The simple grid polygon exploration problem. (English) Zbl 1468.90117 J. Comb. Optim. 41, No. 3, 625-639 (2021). MSC: 90C27 90C90 PDFBibTeX XMLCite \textit{Q. Wei} et al., J. Comb. Optim. 41, No. 3, 625--639 (2021; Zbl 1468.90117) Full Text: DOI
Ravelo, Santiago Valdés Minimum constellation covers: hardness, approximability and polynomial cases. (English) Zbl 1468.90114 J. Comb. Optim. 41, No. 3, 603-624 (2021). MSC: 90C27 PDFBibTeX XMLCite \textit{S. V. Ravelo}, J. Comb. Optim. 41, No. 3, 603--624 (2021; Zbl 1468.90114) Full Text: DOI
Alexandrino, Alexsandro Oliveira; Miranda, Guilherme Henrique Santos; Lintzmayer, Carla Negri; Dias, Zanoni Length-weighted \(\lambda\)-rearrangement distance. (English) Zbl 1467.90047 J. Comb. Optim. 41, No. 3, 579-602 (2021). MSC: 90C27 90C90 PDFBibTeX XMLCite \textit{A. O. Alexandrino} et al., J. Comb. Optim. 41, No. 3, 579--602 (2021; Zbl 1467.90047) Full Text: DOI