| 2020 | A Family of Tree-Based Generators for Bubbles in Directed Graphs. Vicente Acuña, Leandro Lima, Giuseppe F. Italiano, Luca Pepè Sciarria, Marie-France Sagot, Blerina Sinaimeri |
| 2020 | A Parameterized Perspective on Attacking and Defending Elections. Kishen N. Gowda, Neeldhara Misra, Vraj Patel |
| 2020 | Acyclic Matching in Some Subclasses of Graphs. B. S. Panda, Juhi Chaudhary |
| 2020 | Algorithms for Constructing Anonymizing Arrays. Erin Lanus, Charles J. Colbourn |
| 2020 | Between Proper and Strong Edge-Colorings of Subcubic Graphs. Hervé Hocquard, Dimitri Lajou, Borut Luzar |
| 2020 | Bounded Degree Group Steiner Tree Problems. Guy Kortsarz, Zeev Nutov |
| 2020 | Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings Leszek Gasieniec, Ralf Klasing, Tomasz Radzik |
| 2020 | Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions. Toru Hasunuma |
| 2020 | Coordinating Swarms of Objects at Extreme Dimensions. Sándor P. Fekete |
| 2020 | Decremental Optimization of Dominating Sets Under the Reconfiguration Framework. Alexandre Blanché, Haruka Mizuta, Paul Ouvrard, Akira Suzuki |
| 2020 | Edge-Disjoint Branchings in Temporal Graphs. Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva |
| 2020 | Equitable d-degenerate Choosability of Graphs. Ewa Drgas-Burchardt, Hanna Furmanczyk, Elzbieta Sidorowicz |
| 2020 | Fair Packing of Independent Sets. Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer |
| 2020 | Further Results on Online Node- and Edge-Deletion Problems with Advice. Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith |
| 2020 | Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination. Ioannis Lamprou, Ioannis Sigalas, Vassilis Zissimopoulos |
| 2020 | Iterated Type Partitions. Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno |
| 2020 | New Bounds for Maximizing Revenue in Online Dial-a-Ride. Ananya Christman, Christine Chung, Nicholas Jaczko, Tianzhi Li, Scott Westvold, Xinyue Xu, David S. Yuen |
| 2020 | Nonexistence Certificates for Ovals in a Projective Plane of Order Ten. Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh |
| 2020 | On Proper Labellings of Graphs with Minimum Label Sum. Julien Bensmail, Foivos Fioravantes, Nicolas Nisse |
| 2020 | On the Complexity of Broadcast Domination and Multipacking in Digraphs. Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora |
| 2020 | On the Complexity of Singly Connected Vertex Deletion. Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh |
| 2020 | On the Complexity of Stackelberg Matroid Pricing Problems. Toni Böhnlein, Oliver Schaudt |
| 2020 | Optimal In-place Algorithms for Basic Graph Problems. Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2020 | Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges. Peter Damaschke |
| 2020 | Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs. Vahan Mkrtchyan, Garik Petrosyan, K. Subramani, Piotr Wojciechowski |
| 2020 | Parameterized Complexity of (A, ℓ )-Path Packing. Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi |
| 2020 | Polynomial Time Algorithms for Tracking Path Problems. Pratibha Choudhary |
| 2020 | Skyline Computation with Noisy Comparisons. Benoît Groz, Frederik Mallmann-Trenn, Claire Mathieu, Victor Verdugo |
| 2020 | Strongly Stable and Maximum Weakly Stable Noncrossing Matchings. Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto |
| 2020 | The Micro-world of Cographs. Bogdan Alecu, Vadim V. Lozin, Dominique de Werra |
| 2020 | The Steiner Problem for Count Matroids. Tibor Jordán, Yusuke Kobayashi, Ryoga Mahara, Kazuhisa Makino |
| 2020 | Two Robots Patrolling on a Line: Integer Version and Approximability. Peter Damaschke |