| 2022 | 33rd International Symposium on Algorithms and Computation, ISAAC 2022, Seoul, South Korea, December 19-21, 2022 Sang Won Bae, Heejin Park |
| 2022 | A Local Search Algorithm for the Min-Sum Submodular Cover Problem. Lisa Hellerstein, Thomas Lidbetter, R. Teal Witter |
| 2022 | Algorithms for Coloring Reconfiguration Under Recolorability Digraphs. Soichiro Fujii, Yuni Iwamasa, Kei Kimura, Akira Suzuki |
| 2022 | Algorithms for Landmark Hub Labeling. Sabine Storandt |
| 2022 | An Optimal Oracle Separation of Classical and Quantum Hybrid Schemes. Atsuya Hasegawa, François Le Gall |
| 2022 | Approximating the Minimum Logarithmic Arrangement Problem. Julián Mestre, Sergey Pupyrev |
| 2022 | Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP. Zachary Friggstad, Ramin Mousavi |
| 2022 | Budgeted Out-Tree Maximization with Submodular Prizes. Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert |
| 2022 | Clustering with Faulty Centers. Kyle Fox, Hongyao Huang, Benjamin Raichel |
| 2022 | Combinatorial and Algorithmic Aspects of Monadic Stability. Jan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, Alexandre Vigny |
| 2022 | Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh |
| 2022 | Computation of Cycle Bases in Surface Embedded Graphs. Kyle Fox, Thomas Stanley |
| 2022 | Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws. Michal Debski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, Pawel Rzazewski |
| 2022 | Computing Palindromes on a Trie in Linear Time. Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga |
| 2022 | Distortion-Oblivious Algorithms for Scheduling on Multiple Machines. Yossi Azar, Eldad Peretz, Noam Touitou |
| 2022 | Efficiently Reconfiguring a Connected Swarm of Labeled Robots. Sándor P. Fekete, Peter Kramer, Christian Rieck, Christian Scheffer, Arne Schmidt |
| 2022 | Entropy Matters: Understanding Performance of Sparse Random Embeddings. Maciej Skorski |
| 2022 | Evacuation from a Disk for Robots with Asymmetric Communication. Konstantinos Georgiou, Nikos Giachoudis, Evangelos Kranakis |
| 2022 | Extended MSO Model Checking via Small Vertex Integrity. Tatsuya Gima, Yota Otachi |
| 2022 | External-Memory Dictionaries with Worst-Case Update Cost. Rathish Das, John Iacono, Yakov Nekrich |
| 2022 | Finding Matching Cuts in H-Free Graphs. Felicia Lucke, Daniël Paulusma, Bernard Ries |
| 2022 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2022 | Graph Product Structure for h-Framed Graphs. Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann |
| 2022 | Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy. Tatiana Belova, Ivan Bliznets |
| 2022 | Hierarchical Categories in Colored Searching. Peyman Afshani, Rasmus Killmann, Kasper Green Larsen |
| 2022 | How to Base Security on the Perfect/Statistical Binding Property of Quantum Bit Commitment? Junbin Fang, Dominique Unruh, Jun Yan, Dehua Zhou |
| 2022 | Improved Compression of the Okamura-Seymour Metric. Shay Mozes, Nathan Wallheimer, Oren Weimann |
| 2022 | Improving the Bounds of the Online Dynamic Power Management Problem. Ya-Chun Liang, Kazuo Iwama, Chung-Shou Liao |
| 2022 | Integer Complexity and Mixed Binary-Ternary Representation. Kazuyuki Amano |
| 2022 | List Locally Surjective Homomorphisms in Hereditary Graph Classes. Pavel Dvorák, Tomás Masarík, Jana Novotná, Monika Krawczyk, Pawel Rzazewski, Aneta Zuk |
| 2022 | Locally Checkable Problems Parameterized by Clique-Width. Narmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries, David Schindl |
| 2022 | Lower Bounds on Retroactive Data Structures. Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch |
| 2022 | Minimizing the Maximum Flow Time in the Online Food Delivery Problem. Xiangyu Guo, Kelin Luo, Shi Li, Yuhao Zhang |
| 2022 | Minimum Link Fencing. Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu |
| 2022 | Multi-Robot Motion Planning for Unit Discs with Revolving Areas. Pankaj K. Agarwal, Tzvika Geft, Dan Halperin, Erin Taylor |
| 2022 | Nested Active-Time Scheduling. Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh |
| 2022 | On Algorithmic Self-Assembly of Squares by Co-Transcriptional Folding. Szilárd Zsolt Fazekas, Hwee Kim, Ryuichi Matsuoka, Shinnosuke Seki, Hinano Takeuchi |
| 2022 | On Constrained Intersection Representations of Graphs and Digraphs. Ferdinando Cicalese, Clément Dallard, Martin Milanic |
| 2022 | On Finding Short Reconfiguration Sequences Between Independent Sets. Akanksha Agrawal, Soumita Hait, Amer E. Mouawad |
| 2022 | On Graphs Coverable by k Shortest Paths. Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca |
| 2022 | On Maximizing Sums of Non-Monotone Submodular and Linear Functions. Benjamin Qi |
| 2022 | On Reverse Shortest Paths in Geometric Proximity Graphs. Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir |
| 2022 | On the Complexity of Rainbow Vertex Colouring Diametral Path Graphs. Jakob Dyrseth, Paloma T. Lima |
| 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 the Cop Number of String Graphs. Sandip Das, Harmender Gahlawat |
| 2022 | On the Parameterized Intractability of Determinant Maximization. Naoto Ohsaka |
| 2022 | One-Face Shortest Disjoint Paths with a Deviation Terminal. Yusuke Kobayashi, Tatsuya Terao |
| 2022 | Optimizing Quantum Circuit Parameters via SDP. Eunou Lee |
| 2022 | Package Delivery Using Drones with Restricted Movement Areas. Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma |
| 2022 | Parameterized Approximation Algorithms for TSP. Jianqi Zhou, Peihua Li, Jiong Guo |
| 2022 | Partial and Simultaneous Transitive Orientations via Modular Decompositions. Miriam Münch, Ignaz Rutter, Peter Stumpf |
| 2022 | Polynomial Threshold Functions for Decision Lists. Vladimir V. Podolskii, Nikolay V. Proskurin |
| 2022 | Pop & Push: Ordered Tree Iteration in 𝒪(1)-Time. Paul W. Lapey, Aaron Williams |
| 2022 | Popular Edges with Critical Nodes. Kushagra Chatterjee, Prajakta Nimbhorkar |
| 2022 | Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average. Yusuke Kobayashi, Ryoga Mahara |
| 2022 | Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor. Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer |
| 2022 | Range Updates and Range Sum Queries on Multidimensional Points with Monoid Weights. Shangqi Lu, Yufei Tao |
| 2022 | Segment Visibility Counting Queries in Polygons. Kevin Buchin, Bram Custers, Ivor van der Hoog, Maarten Löffler, Aleksandr Popov, Marcel Roeloffzen, Frank Staals |
| 2022 | Shortest Beer Path Queries in Interval Graphs. Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, Kaiyu Wu |
| 2022 | Simon's Congruence Pattern Matching. Sungmin Kim, Sang-Ki Ko, Yo-Sub Han |
| 2022 | Simple Order-Isomorphic Matching Index with Expected Compact Space. Sung-Hwan Kim, Hwan-Gue Cho |
| 2022 | Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings. Frank Kammer, Johannes Meintrup |
| 2022 | Subquadratic Weighted Matroid Intersection Under Rank Oracles. Ta-Wei Tu |
| 2022 | Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems. Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid |
| 2022 | Succinct List Indexing in Optimal Time. William L. Holland |
| 2022 | Succinct Representations of Graphs (Invited Talk). Kunihiko Sadakane |
| 2022 | Super-Cubic Lower Bound for Generalized Karchmer-Wigderson Games. Artur Ignatiev, Ivan Mihajlin, Alexander Smal |
| 2022 | The Dispersive Art Gallery Problem. Christian Rieck, Christian Scheffer |
| 2022 | The Tragedy of Being Almost but Not Quite Planar (Invited Talk). Jeff Erickson |