| 2022 | Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor. | Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer |
| 2022 | Minimum Link Fencing. | Sujoy Bhore, Fabian Klute, Maarten Lffler, Martin Nllenburg, Soeren Terziadis, Anas Villedieu |
| 2022 | Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy. | Tatiana Belova, Ivan Bliznets |
| 2022 | Graph Product Structure for h-Framed Graphs. | Michael A. Bekos, Giordano Da Lozzo, Petr Hlinen, Michael Kaufmann |
| 2022 | Locally Checkable Problems Parameterized by Clique-Width. | Narmina Baghirova, Carolina Luca Gonzalez, Bernard Ries, David Schindl |
| 2022 | Distortion-Oblivious Algorithms for Scheduling on Multiple Machines. | Yossi Azar, Eldad Peretz, Noam Touitou |
| 2022 | Integer Complexity and Mixed Binary-Ternary Representation. | Kazuyuki Amano |
| 2022 | On the Complexity of Tree Edit Distance with Variables. | Tatsuya Akutsu, Tomoya Mori, Naotoshi Nakamura, Satoshi Kozawa, Yuhei Ueno, Thomas N. Sato |
| 2022 | On Finding Short Reconfiguration Sequences Between Independent Sets. | Akanksha Agrawal, Soumita Hait, Amer E. Mouawad |
| 2022 | On Reverse Shortest Paths in Geometric Proximity Graphs. | Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir |
| 2022 | Multi-Robot Motion Planning for Unit Discs with Revolving Areas. | Pankaj K. Agarwal, Tzvika Geft, Dan Halperin, Erin Taylor |
| 2022 | Hierarchical Categories in Colored Searching. | Peyman Afshani, Rasmus Killmann, Kasper Green Larsen |
| 2022 | One-Face Shortest Disjoint Paths with a Deviation Terminal. | Yusuke Kobayashi, Tatsuya Terao |
| 2022 | Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average. | Yusuke Kobayashi, Ryoga Mahara |
| 2022 | On the Cop Number of String Graphs. | Sandip Das, Harmender Gahlawat |
| 2022 | The Tragedy of Being Almost but Not Quite Planar (Invited Talk). | Jeff Erickson |
| 2021 | An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints. | Yu Yokoi |
| 2021 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2021 | Nearly-Tight Lower Bounds for Set Cover and Network Design with Deadlines/Delay. | Noam Touitou |
| 2021 | Adaptive Regularized Submodular Maximization. | Shaojie Tang, Jing Yuan |
| 2021 | Computing Shapley Values for Mean Width in 3-D. | Shuhao Tan |
| 2021 | Streaming Pattern Matching (Invited Talk). | Tatiana Starikovskaya |
| 2021 | Making Three out of Two: Three-Way Online Correlated Selection. | Yongho Shin, Hyung-Chan An |
| 2021 | The Complexity of Sharing a Pizza. | Patrick Schnider |
| 2021 | Enclosing Depth and Other Depth Measures. | Patrick Schnider |