- Frank Duque, Ruy Fabila Monroy, César Hernández-Vélez, Carlos Hidalgo-Toscano. Counting the number of crossings in geometric graphs. Inf. Process. Lett., 165:106028, 2021.
- Katarzyna Paluch 0001, Mateusz Wasylkiewicz. A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs - via half-edges. Inf. Process. Lett., 171:106146, 2021.
- Dusan Knop. Local linear set on graphs with bounded twin cover number. Inf. Process. Lett., 170:106118, 2021.
- Adam S. Jobson, André E. Kézdy, Jeno Lehel. Minimal 2-connected graphs satisfying the even cut condition. Inf. Process. Lett., 167:106080, 2021.
- Olaf Beyersdorff, Joshua Blinkhorn. A simple proof of QBF hardness. Inf. Process. Lett., 168:106093, 2021.
- Chris R. Giannella. Instability results for Euclidean distance, nearest neighbor search on high dimensional Gaussian data. Inf. Process. Lett., 169:106115, 2021.
- Mohammad Ali Abam, Mohammad Javad Rezaei Seraji. Geodesic spanners for points in R3 amid axis-parallel boxes. Inf. Process. Lett., 166:106063, 2021.
- Jakob Cetti Hansen, Adam Husted Kjelstrøm, Andreas Pavlogiannis. Tight bounds for reachability problems on one-counter and pushdown systems. Inf. Process. Lett., 171:106135, 2021.
- Dekel Tsur. t-free Edge Deletion. Inf. Process. Lett., 167:106082, 2021.
- Naoto Ohsaka. A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph. Inf. Process. Lett., 171:106137, 2021.