| 2021 | 32nd International Symposium on Algorithms and Computation, ISAAC 2021, Fukuoka, Japan, December 6-8, 2021 Hee-Kap Ahn, Kunihiko Sadakane |
| 2021 | A Characterization of Individualization-Refinement Trees. Markus Anders, Jendrik Brachter, Pascal Schweitzer |
| 2021 | A Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities. Julian Enoch, Kyle Fox, Dor Mesica, Shay Mozes |
| 2021 | Adaptive Regularized Submodular Maximization. Shaojie Tang, Jing Yuan |
| 2021 | Algorithms and Complexity on Indexing Elastic Founder Graphs. Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen |
| 2021 | Algorithms for Normalized Multiple Sequence Alignments. Eloi Araujo, Luiz C. S. Rozante, Diego P. Rubert, Fábio Viduani Martinez |
| 2021 | An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints. Yu Yokoi |
| 2021 | An Improved Approximation Algorithm for the Matching Augmentation Problem. Joseph Cheriyan, Robert Cummings, Jack Dippel, Jasper Zhu |
| 2021 | Anonymity-Preserving Space Partitions. Úrsula Hébert-Johnson, Chinmay Sonar, Subhash Suri, Vaishali Surianarayanan |
| 2021 | Approximate Maximum Halfspace Discrepancy. Michael Matheny, Jeff M. Phillips |
| 2021 | Approximating Longest Spanning Tree with Neighborhoods. Ahmad Biniaz |
| 2021 | Augmenting Graphs to Minimize the Radius. Joachim Gudmundsson, Yuan Sha, Fan Yao |
| 2021 | Clique-Based Separators for Geometric Intersection Graphs. Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous |
| 2021 | Clustering with Neighborhoods. Hongyao Huang, Georgiy Klimenko, Benjamin Raichel |
| 2021 | Computing Shapley Values for Mean Width in 3-D. Shuhao Tan |
| 2021 | Connected Coordinated Motion Planning with Bounded Stretch. Sándor P. Fekete, Phillip Keldenich, Ramin Kosfeld, Christian Rieck, Christian Scheffer |
| 2021 | Cryptographic Hardness Under Projections for Time-Bounded Kolmogorov Complexity. Eric Allender, John Gouwar, Shuichi Hirahara, Caleb Robelle |
| 2021 | Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion. Andrzej Czygrinow, Michal Hanckowiak, Marcin Witkowski |
| 2021 | Dynamic Boolean Formula Evaluation. Rathish Das, Andrea Lincoln, Jayson Lynch, J. Ian Munro |
| 2021 | Dynamic Data Structures for k-Nearest Neighbor Queries. Sarita de Berg, Frank Staals |
| 2021 | Effective Resistance and Capacitance in Simplicial Complexes and a Quantum Algorithm. Mitchell Black, William Maxwell |
| 2021 | Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest. Sam Barr, Therese Biedl |
| 2021 | Enclosing Depth and Other Depth Measures. Patrick Schnider |
| 2021 | Essentially Tight Kernels For (Weakly) Closed Graphs. Tomohiro Koana, Christian Komusiewicz, Frank Sommer |
| 2021 | Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid |
| 2021 | Feedback Vertex Set on Geometric Intersection Graphs. Shinwoo An, Eunjin Oh |
| 2021 | Filling Crosswords Is Very Hard. Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos |
| 2021 | Fine-Grained Meta-Theorems for Vertex Integrity. Michael Lampis, Valia Mitsou |
| 2021 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2021 | Grid Recognition: Classical and Parameterized Computational Perspectives. Siddharth Gupta, Guy Sa'ar, Meirav Zehavi |
| 2021 | Group Evacuation on a Line by Agents with Different Communication Abilities. Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, Sunil M. Shende |
| 2021 | Identity Testing Under Label Mismatch. Clément L. Canonne, Karl Wimmer |
| 2021 | Illuminating the x-Axis by α-Floodlights. Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski |
| 2021 | Impatient PPSZ - A Faster Algorithm for CSP. Shibo Li, Dominik Scheder |
| 2021 | Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees. Anna Malafiejska, Michal Malafiejski, Krzysztof M. Ocetkiewicz, Krzysztof Pastuszak |
| 2021 | Interval Query Problem on Cube-Free Median Graphs. Soh Kumabe |
| 2021 | Inverse Suffix Array Queries for 2-Dimensional Pattern Matching in Near-Compact Space. Dhrumil Patel, Rahul Shah |
| 2021 | Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces. Kyungjin Cho, Eunjin Oh |
| 2021 | Lower Bounds for Induced Cycle Detection in Distributed Computing. François Le Gall, Masayuki Miyamoto |
| 2021 | MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems. Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis |
| 2021 | Machine Covering in the Random-Order Model. Susanne Albers, Waldo Gálvez, Maximilian Janke |
| 2021 | Making Three out of Two: Three-Way Online Correlated Selection. Yongho Shin, Hyung-Chan An |
| 2021 | Maximum-Weight Matching in Sliding Windows and Beyond. Leyla Biabani, Mark de Berg, Morteza Monemizadeh |
| 2021 | Multimodal Transportation with Ridesharing of Personal Vehicles. Qian-Ping Gu, Jiajian Leo Liang |
| 2021 | Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs. Jacob Evald, Viktor Fredslund-Hansen, Christian Wulff-Nilsen |
| 2021 | Nearly-Tight Lower Bounds for Set Cover and Network Design with Deadlines/Delay. Noam Touitou |
| 2021 | On Geometric Priority Set Cover Problems. Aritra Banik, Rajiv Raman, Saurabh Ray |
| 2021 | On the Extended TSP Problem. Julián Mestre, Sergey Pupyrev, Seeun William Umboh |
| 2021 | On the Kernel and Related Problems in Interval Digraphs. Mathew C. Francis, Pavol Hell, Dalu Jacob |
| 2021 | Partitioning H-Free Graphs of Bounded Diameter. Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith |
| 2021 | Pattern Masking for Dictionary Matching. Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski |
| 2021 | Piecewise-Linear Farthest-Site Voronoi Diagrams. Franz Aurenhammer, Evanthia Papadopoulou, Martin Suderland |
| 2021 | Preference-Based Trajectory Clustering - An Application of Geometric Hitting Sets. Florian Barth, Stefan Funke, Claudius Proissl |
| 2021 | Probabilistic Analysis of Euclidean Capacitated Vehicle Routing. Claire Mathieu, Hang Zhou |
| 2021 | Quantum Advantage with Shallow Circuits Under Arbitrary Corruption. Atsuya Hasegawa, François Le Gall |
| 2021 | Repetition- and Linearity-Aware Rank/Select Dictionaries. Paolo Ferragina, Giovanni Manzini, Giorgio Vinciguerra |
| 2021 | Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. Luciano Gualà, Stefano Leucci, Isabella Ziccardi |
| 2021 | Selected Neighbor Degree Forest Realization. Amotz Bar-Noy, David Peleg, Dror Rawitz, Elad Yehezkel |
| 2021 | Self-Improving Voronoi Construction for a Hidden Mixture of Product Distributions. Siu-Wing Cheng, Man Ting Wong |
| 2021 | Separated Red Blue Center Clustering. Marzieh Eskandari, Bhavika B. Khare, Nirman Kumar |
| 2021 | Shortest Beer Path Queries in Outerplanar Graphs. Joyce Bacic, Saeed Mehrabi, Michiel Smid |
| 2021 | Simple Envy-Free and Truthful Mechanisms for Cake Cutting with a Small Number of Cuts. Takao Asano |
| 2021 | Skeletons and Minimum Energy Scheduling. Antonios Antoniadis, Gunjan Kumar, Nikhil Kumar |
| 2021 | Space-Efficient Algorithms for Reachability in Directed Geometric Graphs. Sujoy Bhore, Rahul Jain |
| 2021 | Spanning Properties of Variants of the Delaunay Graph (Invited Talk). Prosenjit Bose |
| 2021 | Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia |
| 2021 | Streaming Pattern Matching (Invited Talk). Tatiana Starikovskaya |
| 2021 | Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir |
| 2021 | The Complexity of Sharing a Pizza. Patrick Schnider |
| 2021 | The Impact of Geometry on Monochrome Regions in the Flip Schelling Process. Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor |
| 2021 | The VC-Dimension of Limited Visibility Terrains. Matt Gibson-Lopez, Zhongxiu Yang |
| 2021 | Tight Competitive Analyses of Online Car-Sharing Problems. Ya-Chun Liang, Kuan-Yun Lai, Ho-Lin Chen, Kazuo Iwama |
| 2021 | Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs. Viktor Fredslund-Hansen, Shay Mozes, Christian Wulff-Nilsen |
| 2021 | Unique-Neighbor-Like Expansion and Group-Independent Cosystolic Expansion. Tali Kaufman, David Mass |
| 2021 | Untangling Circular Drawings: Algorithms and Complexity. Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu |
| 2021 | Γ-Graphic Delta-Matroids and Their Applications. Donggyu Kim, Duksang Lee, Sang-il Oum |