- Shlomi Dolev, Anat Eyal, Danny Hendler, Philip Derbeko, Marina Sadetsky. Upper bounds for multi-level multi-server paging. Inf. Process. Lett., 142:72-76, 2019.
- Chunhuan Zhao, Zhongxiang Zheng. Improved analysis of the reduction from BDD to uSVP. Inf. Process. Lett., 148:28-32, 2019.
- Yuxing Yang, Lingling Zhang. Fault-tolerant-prescribed hamiltonian laceability of balanced hypercubes. Inf. Process. Lett., 145:11-15, 2019.
- A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty. Bottleneck bichromatic full Steiner trees. Inf. Process. Lett., 142:14-19, 2019.
- Changming Zhu, Chengjiu Mei, Rigui Zhou. Weight-based label-unknown multi-view data set generation approach. Inf. Process. Lett., 146:1-12, 2019.
- Pedro Reviriego, Salvatore Pontarelli, Gil Levy. CuCoTrack: Cuckoo filter based connection tracking. Inf. Process. Lett., 147:55-60, 2019.
- Veli Mäkinen, Tuukka Norri. Applying the Positional Burrows-Wheeler Transform to all-pairs Hamming distance. Inf. Process. Lett., 146:17-19, 2019.
- Dekel Tsur. Faster parameterized algorithm for pumpkin vertex deletion set. Inf. Process. Lett., 147:74-76, 2019.
- Carl Feghali. Paths between colourings of graphs with bounded tree-width. Inf. Process. Lett., 144:37-38, 2019.
- Stasys Jukna, Hannes Seiwert. Greedy can beat pure dynamic programming. Inf. Process. Lett., 142:90-95, 2019.