| 1155 | -- | 1157 | Nadia Pisanti, Charles J. Colbourn, Roberto Grossi. Editorial: Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019) |
| 1158 | -- | 1182 | Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein. Parameterized Complexity of Min-Power Asymmetric Connectivity |
| 1183 | -- | 1196 | Juho Lauri, Christodoulos Mitillos. Complexity of Fall Coloring for Restricted Graph Classes |
| 1197 | -- | 1224 | Florian Stober, Armin Weiß. On the Average Case of MergeInsertion |
| 1225 | -- | 1241 | Michael A. Henning, Arti Pandey, Vikash Tripathi. Complexity and Algorithms for Semipaired Domination in Graphs |
| 1242 | -- | 1272 | Zola Donovan, K. Subramani, Vahan V. Mkrtchyan. Analyzing Clustering and Partitioning Problems in Selected VLSI Models |
| 1273 | -- | 1291 | Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings |
| 1292 | -- | 1306 | Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer. Computing the k-Visibility Region of a Point in a Polygon |
| 1307 | -- | 1316 | Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman 0001. Fixed-Parameter Tractability of (n - k) List Coloring |