LIPIcs, Volume 283, ISAAC 2023

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