| 2020 | (In)approximability of Maximum Minimal FVS. Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos |
| 2020 | 31st International Symposium on Algorithms and Computation, ISAAC 2020, Hong Kong (Virtual Conference), December 14-18, 2020 Yixin Cao, Siu-Wing Cheng, Minming Li |
| 2020 | A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem. Anadi Agrawal, Pawel Gawrychowski |
| 2020 | A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. Yoshifumi Sakai, Shunsuke Inenaga |
| 2020 | A Unified Framework of FPT Approximation Algorithms for Clustering Problems. Qilong Feng, Zhen Zhang, Ziyun Huang, Jinhui Xu, Jianxin Wang |
| 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 | An SPQR-Tree-Like Embedding Representation for Level Planarity. Guido Brückner, Ignaz Rutter |
| 2020 | Approximating the Packedness of Polygonal Curves. Joachim Gudmundsson, Yuan Sha, Sampson Wong |
| 2020 | Approximation Algorithms for Generalized Path Scheduling. Haozhou Pang, Mohammad R. Salavatipour |
| 2020 | Approximations for Throughput Maximization. Dylan Hyatt-Denesik, Mirmahdi Rahgoshay, Mohammad R. Salavatipour |
| 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 | Between Shapes, Using the Hausdorff Distance. Marc J. van Kreveld, Tillmann Miltzow, Tim Ophelders, Willem Sonke, Jordi L. Vermeulen |
| 2020 | Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs. Trung Thanh Nguyen, Jörg Rothe |
| 2020 | Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts. Takao Asano, Hiroyuki Umeda |
| 2020 | Compact Routing in Unit Disk Graphs. Wolfgang Mulzer, Max Willert |
| 2020 | Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard. Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Julian Wellman |
| 2020 | Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines. Martin Koutecký, Johannes Zink |
| 2020 | Complexity of Stability. Fabian Frei, Edith Hemaspaandra, Jörg Rothe |
| 2020 | Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. Tomohiro Koana, Christian Komusiewicz, Frank Sommer |
| 2020 | Constant-Factor Approximation Algorithms for the Parity-Constrained Facility Location Problem. Kangsan Kim, Yongho Shin, Hyung-Chan An |
| 2020 | Contracting to a Longest Path in H-Free Graphs. Walter Kern, Daniël Paulusma |
| 2020 | Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs. Bartlomiej Dudek, Pawel Gawrychowski |
| 2020 | Discriminating Codes in Geometric Setups. Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen |
| 2020 | Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu |
| 2020 | Diverse Pairs of Matchings. Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov |
| 2020 | Efficient Labeling for Reachability in Directed Acyclic Graphs. Maciej Duleba, Pawel Gawrychowski, Wojciech Janczewski |
| 2020 | Efficiently Computing All Delaunay Triangles Occurring over All Contiguous Subsequences. Stefan Funke, Felix Weitbrecht |
| 2020 | Enumerating Range Modes. Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2020 | Finding Temporal Paths Under Waiting Time Constraints. Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche |
| 2020 | Flexible List Colorings in Graphs with Special Degeneracy Conditions. Peter Bradshaw, Tomás Masarík, Ladislav Stacho |
| 2020 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2020 | Geometric Pattern Matching Reduces to k-SUM. Boris Aronov, Jean Cardinal |
| 2020 | Gourds: A Sliding-Block Puzzle with Turning. Joep Hamersma, Marc J. van Kreveld, Yushi Uno, Tom C. van der Zanden |
| 2020 | How to Decompose a Graph into a Tree-Like Structure (Invited Talk). Sang-il Oum |
| 2020 | Improved FPT Algorithms for Deletion to Forest-Like Structures. Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh |
| 2020 | Indexing Isodirectional Pointer Sequences. Sung-Hwan Kim, Hwan-Gue Cho |
| 2020 | Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. Matthias Bentert, Klaus Heeger, Dusan Knop |
| 2020 | Linear Transformations Between Dominating Sets in the TAR-Model. Nicolas Bousquet, Alice Joffard, Paul Ouvrard |
| 2020 | Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems. Loukas Georgiadis, Evangelos Kosinas |
| 2020 | Market Pricing for Matroid Rank Valuations. Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi |
| 2020 | Minimization and Parameterized Variants of Vertex Partition Problems on Graphs. Yuma Tamura, Takehiro Ito, Xiao Zhou |
| 2020 | Multicommodity Flows in Planar Graphs with Demands on Faces. Nikhil Kumar |
| 2020 | Multiparty Selection. Ke Chen, Adrian Dumitrescu |
| 2020 | Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs. Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche |
| 2020 | On Girth and the Parameterized Complexity of Token Sliding and Token Jumping. Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad |
| 2020 | Online Primal-Dual Algorithms with Configuration Linear Programs. Kim Thang Nguyen |
| 2020 | Partial Function Extension with Applications to Learning and Property Testing. Umang Bhaskar, Gunjan Kumar |
| 2020 | Quantum-Inspired Algorithms for Solving Low-Rank Linear Equation Systems with Logarithmic Dependence on the Dimension. Nai-Hui Chia, András Gilyén, Han-Hsuan Lin, Seth Lloyd, Ewin Tang, Chunhao Wang |
| 2020 | Random Access in Persistent Strings. Philip Bille, Inge Li Gørtz |
| 2020 | Recency Queries with Succinct Representation. William L. Holland, Anthony Wirth, Justin Zobel |
| 2020 | Recursed Is Not Recursive: A Jarring Result. Erik D. Demaine, Justin Kopinsky, Jayson Lynch |
| 2020 | Shared vs Private Randomness in Distributed Interactive Proofs. Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport |
| 2020 | Shortest-Path Queries in Geometric Networks. Eunjin Oh |
| 2020 | Signal Passing Self-Assembly Simulates Tile Automata. Angel A. Cantu, Austin Luchsinger, Robert Schweller, Tim Wylie |
| 2020 | Size, Depth and Energy of Threshold Circuits Computing Parity Function. Kei Uchizawa |
| 2020 | Sorting by Prefix Block-Interchanges. Anthony Labarre |
| 2020 | Space Hardness of Solving Structured Linear Systems. Xuangui Huang |
| 2020 | Sparse Hop Spanners for Unit Disk Graphs. Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth |
| 2020 | Sparsification Lower Bounds for List H-Coloring. Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski |
| 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 | The Online Broadcast Range-Assignment Problem. Mark de Berg, Aleksandar Markovic, Seeun William Umboh |
| 2020 | The k-Server Problem with Delays on the Uniform Metric Space. Predrag Krnetic, Darya Melnyk, Yuyi Wang, Roger Wattenhofer |
| 2020 | Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion. Jungho Ahn, Eun Jung Kim, Euiwoong Lee |
| 2020 | Update Query Time Trade-Off for Dynamic Suffix Arrays. Amihood Amir, Itai Boneh |
| 2020 | Weakly Submodular Function Maximization Using Local Submodularity Ratio. Richard Santiago, Yuichi Yoshida |
| 2020 | Wear Leveling Revisited. Taku Onodera, Tetsuo Shibuya |
| 2020 | Worst-Case Optimal Join Algorithms (Invited Talk). Ke Yi |