| 2020 | A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic Chips. Miguel Coviello Gonzalez, Marek Chrobak |
| 2020 | An Experimental Study of a 1-Planarity Testing and Embedding Algorithm. Carla Binucci, Walter Didimo, Fabrizio Montecchiani |
| 2020 | Angle Covers: Algorithms and Complexity. William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff |
| 2020 | Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs. Yuma Tamura, Takehiro Ito, Xiao Zhou |
| 2020 | Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons. Chuzo Iwamoto, Tatsuaki Ibusuki |
| 2020 | Designing Survivable Networks with Zero-Suppressed Binary Decision Diagrams. Hirofumi Suzuki, Masakazu Ishihata, Shin-ichi Minato |
| 2020 | Dispersion of Mobile Robots on Grids. Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma |
| 2020 | Drawing Planar Graphs. Md. Saidur Rahman, Md. Rezaul Karim |
| 2020 | Efficient Enumeration of Non-isomorphic Ptolemaic Graphs. Dat Hoang Tran, Ryuhei Uehara |
| 2020 | Fast Multiple Pattern Cartesian Tree Matching. Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park |
| 2020 | Faster Privacy-Preserving Computation of Edit Distance with Moves. Yohei Yoshimoto, Masaharu Kataoka, Yoshimasa Takabatake, Tomohiro I, Kilho Shin, Hiroshi Sakamoto |
| 2020 | Generalized Dictionary Matching Under Substring Consistent Equivalence Relations. Diptarama Hendrian |
| 2020 | Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration. Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shin-ichi Minato |
| 2020 | Matching Random Colored Points with Rectangles. Josué Corujo, David Flores-Peñaloza, Clemens Huemer, Pablo Pérez-Lantero, Carlos Seara |
| 2020 | Maximum Bipartite Subgraph of Geometric Intersection Graphs. Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy |
| 2020 | On the Maximum Edge-Pair Embedding Bipartite Matching. Cam Ly Nguyen, Vorapong Suppakitpaisarn, Athasit Surarerks, Phanu Vajanopath |
| 2020 | Optimum Algorithm for the Mutual Visibility Problem. Subhash Bhagat |
| 2020 | Packing Arc-Disjoint Cycles in Bipartite Tournaments. Ajay Saju Jacob, R. Krithika |
| 2020 | Packing Trees into 1-Planar Graphs. Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath |
| 2020 | Packing and Covering with Segments. Joseph S. B. Mitchell, Supantha Pandit |
| 2020 | Parameterized Algorithms for the Happy Set Problem. Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru |
| 2020 | Partitioning a Graph into Complementary Subgraphs. Julliano Rosa Nascimento, Uéverton S. Souza, Jayme Luiz Szwarcfiter |
| 2020 | Recent Progresses in the Combinatorial and Algorithmic Study of Rooted Phylogenetic Networks. Louxin Zhang |
| 2020 | Reconfiguring k-path Vertex Covers. Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita |
| 2020 | Routing in Histograms. Man-Kwun Chiu, Jonas Cleve, Katharina Klost, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Max Willert |
| 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 | Space Efficient Separator Algorithms for Planar Graphs. Osamu Watanabe |
| 2020 | The Stub Resolution of 1-Planar Graphs. Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr |
| 2020 | Train Scheduling: Hardness and Algorithms. Christian Scheffer |
| 2020 | Trichotomy for the Reconfiguration Problem of Integer Linear Systems. Kei Kimura, Akira Suzuki |
| 2020 | WALCOM: Algorithms and Computation - 14th International Conference, WALCOM 2020, Singapore, March 31 - April 2, 2020, Proceedings M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung |