| 2019 | Burrows-Wheeler Transform of Words Defined by Morphisms. | Srecko Brlek, Andrea Frosini, Ilaria Mancini, Elisa Pergola, Simone Rinaldi |
| 2019 | Call Admission Problems on Trees with Advice - (Extended Abstract). | Hans-Joachim Bckenhauer, Nina Corvelo Benz, Dennis Komm |
| 2019 | Solving Group Interval Scheduling Efficiently. | Arindam Biswas, Venkatesh Raman, Saket Saurabh |
| 2019 | Parameterized Complexity of Min-Power Asymmetric Connectivity. | Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, Andr Nichterlein |
| 2019 | Finding Periods in Cartesian Tree Matching. | Magsarjav Bataa, Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park |
| 2019 | Fixed-Parameter Tractability of (n-k) List Coloring. | Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman |
| 2019 | Algorithm and Hardness Results on Liar's Dominating Set and \varveck -tuple Dominating Set. | Sandip Banerjee, Sujoy Bhore |
| 2019 | On Erdős-Szekeres-Type Problems for k-convex Point Sets. | Martin Balko, Sujoy Bhore, Leonardo Martnez-Sandoval, Pavel Valtr |
| 2019 | An Improved Scheme in the Two Query Adaptive Bitprobe Model. | Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani |
| 2019 | Computing the k-Crossing Visibility Region of a Point in a Polygon. | Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer |
| 2019 | Cops and Robber on Some Families of Oriented Graphs. | Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen |
| 2018 | An Efficient Representation of Partitions of Integers. | Kentaro Sumigawa, Kunihiko Sadakane |
| 2018 | Separating Interaction Effects Using Locating and Detecting Arrays. | Stephen A. Seidel, Kaushik Sarkar, Charles J. Colbourn, Violet R. Syrotiuk |
| 2018 | Faster Coreset Construction for Projective Clustering via Low-Rank Approximation. | Rameshwar Pratap, Sandeep Sen |
| 2018 | LZ-ABT: A Practical Algorithm for α-Balanced Grammar Compression. | Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto |
| 2018 | Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem. | Alexey Nikolaev, Mikhail Batsyn |
| 2018 | Placing Segments on Parallel Arcs. | Yen Kaow Ng, Wenlong Jia, Shuai Cheng Li |
| 2018 | Cryptographic Limitations on Polynomial-Time a Posteriori Query Learning. | Mikito Nanashima |
| 2018 | The Crossing Number of Seq-Shellable Drawings of Complete Graphs. | Petra Mutzel, Lutz Oettershagen |
| 2018 | Zero-Suppression and Computation Models. | Hiroki Morizumi |
| 2018 | Analysis of Information Leakage Due to Operative Errors in Card-Based Protocols. | Takaaki Mizuki, Yuichi Komano |
| 2018 | On the Parameterized Complexity of Colorful Components and Related Problems. | Neeldhara Misra |
| 2018 | Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem. | Robin Milosz, Sylvie Hamel, Adeline Pierrot |
| 2018 | Fully Leafed Induced Subtrees. | Alexandre Blondin Mass, Julien de Carufel, Alain Goupil, Mlodie Lapointe, mile Nadeau, lise Vandomme |
| 2018 | An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. | Christine Markarian |