| 2020 | Packing Arc-Disjoint Cycles in Bipartite Tournaments. | Ajay Saju Jacob, R. Krithika |
| 2020 | Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons. | Chuzo Iwamoto, Tatsuaki Ibusuki |
| 2020 | Reconfiguring k-path Vertex Covers. | Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita |
| 2020 | Generalized Dictionary Matching Under Substring Consistent Equivalence Relations. | Diptarama Hendrian |
| 2020 | Fast Multiple Pattern Cartesian Tree Matching. | Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park |
| 2020 | A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic Chips. | Miguel Coviello Gonzalez, Marek Chrobak |
| 2020 | Angle Covers: Algorithms and Complexity. | William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff |
| 2020 | Shortest Covers of All Cyclic Shifts of a String. | Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2020 | Matching Random Colored Points with Rectangles. | Josu Corujo, David Flores-Pealoza, Clemens Huemer, Pablo Prez-Lantero, Carlos Seara |
| 2020 | Routing in Histograms. | Man-Kwun Chiu, Jonas Cleve, Katharina Klost, Matias Korman, Wolfgang Mulzer, Andr van Renssen, Marcel Roeloffzen, Max Willert |
| 2020 | An Experimental Study of a 1-Planarity Testing and Embedding Algorithm. | Carla Binucci, Walter Didimo, Fabrizio Montecchiani |
| 2020 | Optimum Algorithm for the Mutual Visibility Problem. | Subhash Bhagat |
| 2020 | Parameterized Algorithms for the Happy Set Problem. | Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru |
| 2020 | The Stub Resolution of 1-Planar Graphs. | Michael Kaufmann, Jan Kratochvl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr |
| 2020 | Drawing Planar Graphs. | Md. Saidur Rahman, Md. Rezaul Karim |
| 2019 | Matching Sets of Line Segments. | Hyeyun Yang, Antoine Vigneron |
| 2019 | Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components - (Extended Abstract). | Duygu Vietz, Stefan Hoffmann, Egon Wanke |
| 2019 | On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs. | Yanamandram B. Venkatakrishnan, H. Naresh Kumar |
| 2019 | A Fast Algorithm for Unbounded Monotone Integer Linear Systems with Two Variables per Inequality via Graph Decomposition. | Takuya Tamori, Kei Kimura |
| 2019 | Greedy Consensus Tree and Maximum Greedy Consensus Tree Problems. | Wing-Kin Sung |
| 2019 | The Prefix Frchet Similarity. | Christian Scheffer |
| 2019 | A Linear Time Algorithm for the r-Gathering Problem on the Line (Extended Abstract). | Anik Sarker, Wing-Kin Sung, M. Sohel Rahman |
| 2019 | Parameterized Computational Geometry via Decomposition Theorems. | Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2019 | Optimal Partition of a Tree with Social Distance. | Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono |
| 2019 | Efficient Algorithm for Box Folding. | Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara |