| 2020 | (In)approximability of Maximum Minimal FVS. | Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos |
| 2020 | Discriminating Codes in Geometric Setups. | Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen |
| 2020 | Recursed Is Not Recursive: A Jarring Result. | Erik D. Demaine, Justin Kopinsky, Jayson Lynch |
| 2020 | Quantum-Inspired Algorithms for Solving Low-Rank Linear Equation Systems with Logarithmic Dependence on the Dimension. | Nai-Hui Chia, Andrs Gilyn, Han-Hsuan Lin, Seth Lloyd, Ewin Tang, Chunhao Wang |
| 2020 | Sparsification Lower Bounds for List H-Coloring. | Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski |
| 2020 | Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. | Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy |
| 2020 | Finding Temporal Paths Under Waiting Time Constraints. | Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche |
| 2020 | Signal Passing Self-Assembly Simulates Tile Automata. | Angel A. Cantu, Austin Luchsinger, Robert Schweller, Tim Wylie |
| 2020 | Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard. | Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Julian Wellman |
| 2020 | An SPQR-Tree-Like Embedding Representation for Level Planarity. | Guido Brckner, Ignaz Rutter |
| 2020 | Flexible List Colorings in Graphs with Special Degeneracy Conditions. | Peter Bradshaw, Toms Masark, Ladislav Stacho |
| 2020 | Linear Transformations Between Dominating Sets in the TAR-Model. | Nicolas Bousquet, Alice Joffard, Paul Ouvrard |
| 2020 | Random Access in Persistent Strings. | Philip Bille, Inge Li Grtz |
| 2020 | Partial Function Extension with Applications to Learning and Property Testing. | Umang Bhaskar, Gunjan Kumar |
| 2020 | The Online Broadcast Range-Assignment Problem. | Mark de Berg, Aleksandar Markovic, Seeun William Umboh |
| 2020 | Market Pricing for Matroid Rank Valuations. | Kristf Brczi, Naonori Kakimura, Yusuke Kobayashi |
| 2020 | Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. | Matthias Bentert, Klaus Heeger, Dusan Knop |
| 2020 | The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs. | Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge |
| 2020 | On Girth and the Parameterized Complexity of Token Sliding and Token Jumping. | Valentin Bartier, Nicolas Bousquet, Clment Dallard, Kyle Lomer, Amer E. Mouawad |
| 2020 | Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts. | Takao Asano, Hiroyuki Umeda |
| 2020 | Geometric Pattern Matching Reduces to k-SUM. | Boris Aronov, Jean Cardinal |
| 2020 | Update Query Time Trade-Off for Dynamic Suffix Arrays. | Amihood Amir, Itai Boneh |
| 2020 | Arithmetic Expression Construction. | Leo Alcock, Sualeh Asif, Jeffrey Bosboom, Josh Brunner, Charlotte Chen, Erik D. Demaine, Rogers Epstein, Adam Hesterberg, Lior Hirschfeld, William Hu, Jayson Lynch, Sarah Scheffler, Lillian Zhang |
| 2020 | Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion. | Jungho Ahn, Eun Jung Kim, Euiwoong Lee |
| 2020 | A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem. | Anadi Agrawal, Pawel Gawrychowski |