- Carol T. Zamfirescu. Vertex degrees and 2-cuts in graphs with many hamiltonian vertex-deleted subgraphs. Inf. Process. Lett., 174:106192, 2022.
- Guido Fiorino. A non-clausal tableau calculus for MinSat. Inf. Process. Lett., 173:106167, 2022.
- Meibiao Zou, Zhifeng Wang, Jianxin Wang, Yixin Cao 0001. End vertices of graph searches on bipartite graphs. Inf. Process. Lett., 173:106176, 2022.
- Dominique Barth, Thierry Mautor, Dimitri Watel, Marc-Antoine Weisser. A polynomial algorithm for deciding the validity of an electrical distribution tree. Inf. Process. Lett., 176:106249, 2022.
- Ajinkya Gaikwad, Soumen Maity. Globally minimal defensive alliances. Inf. Process. Lett., 177:106253, 2022.
- Vorapong Suppakitpaisarn. Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools. Inf. Process. Lett., 175:106226, 2022.
- Sangram K. Jena, Ramesh K. Jallu, Gautam K. Das. r)-domination in graphs. Inf. Process. Lett., 174:106178, 2022.
- Fei Zhu, Feihong Xu, Xu Yang 0002, Xun Yi, Alsharif Abuadbba. Cryptanalysis and improvements of an efficient certificate-based proxy signature scheme for IIoT environments. Inf. Process. Lett., 173:106170, 2022.
- Hendrik Molter. The complexity of finding temporal separators under waiting time constraints. Inf. Process. Lett., 175:106229, 2022.
- Barnaby Martin, Daniël Paulusma, Siani Smith. Hard problems that quickly become very easy. Inf. Process. Lett., 174:106213, 2022.