| 2023 | 34th International Symposium on Algorithms and Computation, ISAAC 2023, Kyoto, Japan, December 3-6, 2023 Satoru Iwata, Naonori Kakimura |
| 2023 | A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems. Kei Kimura, Kazuhisa Makino |
| 2023 | A Compact DAG for Storing and Searching Maximal Common Subsequences. Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno |
| 2023 | A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees. Shuai Shao, Stanislav Zivný |
| 2023 | A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules. Yann Disser, Nils Mosis |
| 2023 | An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-Cover. Yusuke Kobayashi, Takashi Noguchi |
| 2023 | An FPT Algorithm for Splitting a Necklace Among Two Thieves. Michaela Borzechowski, Patrick Schnider, Simon Weber |
| 2023 | Approximation Guarantees for Shortest Superstrings: Simpler and Better. Matthias Englert, Nicolaos Matsakis, Pavel Veselý |
| 2023 | Clustering What Matters in Constrained Settings: Improved Outlier to Outlier-Free Reductions. Ragesh Jaiswal, Amit Kumar |
| 2023 | Clustering in Polygonal Domains. Mark de Berg, Leyla Biabani, Morteza Monemizadeh, Leonidas Theocharous |
| 2023 | Coloring and Recognizing Mixed Interval Graphs. Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff, Johannes Zink |
| 2023 | Computing Paths of Large Rank in Planar Frameworks Deterministically. Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis |
| 2023 | Computing a Subtrajectory Cluster from c-Packed Trajectories. Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong |
| 2023 | Connected Vertex Cover on AT-Free Graphs. Joydeep Mukherjee, Tamojit Saha |
| 2023 | Depth-Three Circuits for Inner Product and Majority Functions. Kazuyuki Amano |
| 2023 | Distance Queries over Dynamic Interval Graphs. Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang |
| 2023 | Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets. Anubhav Dhar, Soumita Hait, Sudeshna Kolay |
| 2023 | Exact Matching: Correct Parity and FPT Parameterized by Independence Number. Nicolas El Maalouly, Raphael Steiner, Lasse Wulf |
| 2023 | FPT Approximation Using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set. Huairui Chu, Bingkai Lin |
| 2023 | Faithful Graph Drawing (Invited Talk). Seok-Hee Hong |
| 2023 | Fast Convolutions for Near-Convex Sequences. Cornelius Brand, Alexandra Lassota |
| 2023 | Finding Diverse Minimum s-t Cuts. Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma |
| 2023 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2023 | Geometric TSP on Sets. Henk Alkema, Mark de Berg |
| 2023 | Group Fairness: From Multiwinner Voting to Participatory Budgeting (Invited Talk). Edith Elkind |
| 2023 | Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost. Mong-Jen Kao |
| 2023 | Improved Approximation for Two-Dimensional Vector Multiple Knapsack. Tomer Cohen, Ariel Kulik, Hadas Shachnai |
| 2023 | Improved Guarantees for the a Priori TSP. Jannis Blauth, Meike Neuwohner, Luise Puhlmann, Jens Vygen |
| 2023 | Improved Smoothed Analysis of 2-Opt for the Euclidean TSP. Bodo Manthey, Jesse van Rhijn |
| 2023 | Is the Algorithmic Kadison-Singer Problem Hard? Ben Jourdan, Peter Macgregor, He Sun |
| 2023 | Matching Cuts in Graphs of High Girth and H-Free Graphs. Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries |
| 2023 | Matrix Completion: Approximating the Minimum Diameter. Diptarka Chakraborty, Sanjana Dey |
| 2023 | New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm |
| 2023 | Non-Clairvoyant Makespan Minimization Scheduling with Predictions. Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual |
| 2023 | On Min-Max Graph Balancing with Strict Negative Correlation Constraints. Ting-Yu Kuo, Yu-Han Chen, Andrea Frosini, Sun-Yuan Hsieh, Shi-Chun Tsai, Mong-Jen Kao |
| 2023 | On the Complexity of the Eigenvalue Deletion Problem. Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar |
| 2023 | On the Fine-Grained Query Complexity of Symmetric Functions. Supartha Podder, Penghui Yao, Zekun Ye |
| 2023 | On the Line-Separable Unit-Disk Coverage and Related Problems. Gang Liu, Haitao Wang |
| 2023 | Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections. Petr Gregor, Torsten Mütze, Namrata |
| 2023 | Prefix Sorting DFAs: A Recursive Algorithm. Nicola Cotumaccio |
| 2023 | Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs. David Eppstein, Daniel Frishberg |
| 2023 | Realizability of Free Spaces of Curves. Hugo A. Akitaya, Maike Buchin, Majid Mirzanezhad, Leonie Ryvkin, Carola Wenk |
| 2023 | Recognizing Unit Multiple Intervals Is Hard. Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette |
| 2023 | Reconfiguration of the Union of Arborescences. Yusuke Kobayashi, Ryoga Mahara, Tamás Schwarcz |
| 2023 | Rectilinear-Upward Planarity Testing of Digraphs. Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani |
| 2023 | Regularization of Low Error PCPs and an Application to MCSP. Shuichi Hirahara, Dana Moshkovitz |
| 2023 | Shortest Beer Path Queries Based on Graph Decomposition. Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama |
| 2023 | Shortest Beer Path Queries in Digraphs with Bounded Treewidth. Joachim Gudmundsson, Yuan Sha |
| 2023 | Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes. Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk |
| 2023 | Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares. Gabriel Bathie, Tomasz Kociumaka, Tatiana Starikovskaya |
| 2023 | Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski |
| 2023 | Structural Parameterizations of b-Coloring. Lars Jaffke, Paloma T. Lima, Roohani Sharma |
| 2023 | Substring Complexity in Sublinear Space. Giulia Bernardini, Gabriele Fici, Pawel Gawrychowski, Solon P. Pissis |
| 2023 | Succinct Planar Encoding with Minor Operations. Frank Kammer, Johannes Meintrup |
| 2023 | Temporal Separators with Deadlines. Hovhannes A. Harutyunyan, Kamran Koupayi, Denis Pankratov |
| 2023 | Testing Properties of Distributions in the Streaming Model. Sampriti Roy, Yadu Vasudev |
| 2023 | The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable. Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov |
| 2023 | Unified Almost Linear Kernels for Generalized Covering and Packing Problems on Nowhere Dense Classes. Jungho Ahn, Jinha Kim, O-joung Kwon |
| 2023 | k-Universality of Regular Languages. Duncan Adamson, Pamela Fleischmann, Annika Huch, Tore Koß, Florin Manea, Dirk Nowotka |