LIPIcs, Volume 261, ICALP 2023

Kousha Etessami, Uriel Feige, and Gabriele Puppis LIPIcs, Volume 261, ICALP 2023, Complete Volume 10.4230/LIPIcs.ICALP.2023
Kousha Etessami, Uriel Feige, and Gabriele Puppis Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ICALP.2023.0
Anna R. Karlin A (Slightly) Improved Approximation Algorithm for the Metric Traveling Salesperson Problem (Invited Talk) 10.4230/LIPIcs.ICALP.2023.1
Rasmus Kyng An Almost-Linear Time Algorithm for Maximum Flow and More (Invited Talk) 10.4230/LIPIcs.ICALP.2023.2
Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, and Georg Zetzsche Context-Bounded Analysis of Concurrent Programs (Invited Talk) 10.4230/LIPIcs.ICALP.2023.3
Thomas Vidick Quantum Codes, Local Testability and Interactive Proofs: State of the Art and Open Questions (Invited Talk) 10.4230/LIPIcs.ICALP.2023.4
James Worrell The Skolem Landscape (Invited Talk) 10.4230/LIPIcs.ICALP.2023.5
Anders Aamand, Adam Karczmarz, Jakub Łącki, Nikos Parotsidis, Peter M. R. Rasmussen, and Mikkel Thorup Optimal Decremental Connectivity in Non-Sparse Graphs 10.4230/LIPIcs.ICALP.2023.6
Peyman Afshani, Pingan Cheng, Aniket Basu Roy, and Zhewei Wei On Range Summary Queries 10.4230/LIPIcs.ICALP.2023.7
Ishan Agarwal and Richard Cole Stable Matching: Choosing Which Proposals to Make 10.4230/LIPIcs.ICALP.2023.8
Daniel Agassy, Dani Dorfman, and Haim Kaplan Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player 10.4230/LIPIcs.ICALP.2023.9
Amirreza Akbari, Navid Eslami, Henrik Lievonen, Darya Melnyk, Joona Särkijärvi, and Jukka Suomela Locality in Online, Dynamic, Sequential, and Distributed Graph Algorithms 10.4230/LIPIcs.ICALP.2023.10
Shyan Akmal and Ce Jin An Efficient Algorithm for All-Pairs Bounded Edge Connectivity 10.4230/LIPIcs.ICALP.2023.11
Prashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha, and Bhargav Thankey Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization 10.4230/LIPIcs.ICALP.2023.12
Yossi Azar and Danny Vainstein Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering 10.4230/LIPIcs.ICALP.2023.13
Amir Azarmehr and Soheil Behnezhad Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation 10.4230/LIPIcs.ICALP.2023.14
Ishan Bansal, Joseph Cheriyan, Logan Grout, and Sharat Ibrahimpur Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions 10.4230/LIPIcs.ICALP.2023.15
Siddharth Barman and Pooja Kulkarni Approximation Algorithms for Envy-Free Cake Division with Connected Pieces 10.4230/LIPIcs.ICALP.2023.16
Paul Beame and Niels Kornerup Cumulative Memory Lower Bounds for Randomized and Quantum Computation 10.4230/LIPIcs.ICALP.2023.17
Petra Berenbrink, Lukas Hintze, Hamed Hosseinpour, Dominik Kaaser, and Malin Rau Dynamic Averaging Load Balancing on Arbitrary Graphs 10.4230/LIPIcs.ICALP.2023.18
Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, and László Kozma Fast Approximation of Search Trees on Trees with Centroid Trees 10.4230/LIPIcs.ICALP.2023.19
Thiago Bergamaschi Improved Product-State Approximation Algorithms for Quantum Local Hamiltonians 10.4230/LIPIcs.ICALP.2023.20
Rajarshi Bhattacharjee, Gregory Dexter, Petros Drineas, Cameron Musco, and Archan Ray Sublinear Time Eigenvalue Approximation via Random Sampling 10.4230/LIPIcs.ICALP.2023.21
Sudatta Bhattacharya and Michal Koucký Streaming k-Edit Approximate Pattern Matching via String Decomposition 10.4230/LIPIcs.ICALP.2023.22
Therese Biedl and Karthik Murali On Computing the Vertex Connectivity of 1-Plane Graphs 10.4230/LIPIcs.ICALP.2023.23
Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, and Martin Schirneck Fault-Tolerant ST-Diameter Oracles 10.4230/LIPIcs.ICALP.2023.24
Hadley Black, Iden Kalemaj, and Sofya Raskhodnikova Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing 10.4230/LIPIcs.ICALP.2023.25
Guy E. Blelloch and Magdalen Dobson The Geometry of Tree-Based Sorting 10.4230/LIPIcs.ICALP.2023.26
Hans L. Bodlaender, Carla Groenland, and Michał Pilipczuk Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters 10.4230/LIPIcs.ICALP.2023.27
Andrej Bogdanov and Alon Rosen Nondeterministic Interactive Refutations for Nearest Boolean Vector 10.4230/LIPIcs.ICALP.2023.28
Miguel Bosch-Calvo, Fabrizio Grandoni, and Afrouz Jabal Ameli A 4/3 Approximation for 2-Vertex-Connectivity 10.4230/LIPIcs.ICALP.2023.29
Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan, and Shay Sapir Lower Bounds for Pseudo-Deterministic Counting in a Stream 10.4230/LIPIcs.ICALP.2023.30
Manuel Cáceres Minimum Chain Cover in Almost Linear Time 10.4230/LIPIcs.ICALP.2023.31
Chris Cade, Marten Folkertsma, Sevag Gharibian, Ryu Hayakawa, François Le Gall, Tomoyuki Morimae, and Jordi Weggemans Improved Hardness Results for the Guided Local Hamiltonian Problem 10.4230/LIPIcs.ICALP.2023.32
Jin-Yi Cai and Ben Young Planar #CSP Equality Corresponds to Quantum Isomorphism - A Holant Viewpoint 10.4230/LIPIcs.ICALP.2023.33
Timothy M. Chan, Qizheng He, and Yuancheng Yu On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete k-Center for Small k 10.4230/LIPIcs.ICALP.2023.34
Yi-Jun Chang Ortho-Radial Drawing in Near-Linear Time 10.4230/LIPIcs.ICALP.2023.35
Chandra Chekuri and Rhea Jain Approximation Algorithms for Network Design in Non-Uniform Fault Models 10.4230/LIPIcs.ICALP.2023.36
Yu Chen, Sanjeev Khanna, and Zihan Tan Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics 10.4230/LIPIcs.ICALP.2023.37
Yanlin Chen and Ronald de Wolf Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints 10.4230/LIPIcs.ICALP.2023.38
Lijie Chen, Xin Lyu, Avishay Tal, and Hongxun Wu New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs 10.4230/LIPIcs.ICALP.2023.39
Siu-Wing Cheng and Haoqiang Huang Approximate Nearest Neighbor for Polygonal Curves Under Fréchet Distance 10.4230/LIPIcs.ICALP.2023.40
Kuan Cheng, Zhengzhong Jin, Xin Li, Zhide Wei, and Yu Zheng Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes 10.4230/LIPIcs.ICALP.2023.41
Tsun-Ming Cheung, Hamed Hatami, Pooya Hatami, and Kaave Hosseini Online Learning and Disambiguations of Partial Concept Classes 10.4230/LIPIcs.ICALP.2023.42
Ilan Reuven Cohen and Debmalya Panigrahi A General Framework for Learning-Augmented Online Allocation 10.4230/LIPIcs.ICALP.2023.43
Omer Cohen Sidon and Dana Ron Sample-Based Distance-Approximation for Subsequence-Freeness 10.4230/LIPIcs.ICALP.2023.44
Spencer Compton, Slobodan Mitrović, and Ronitt Rubinfeld New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling 10.4230/LIPIcs.ICALP.2023.45
Sam Coy, Artur Czumaj, Peter Davies, and Gopinath Mishra Optimal (Degree+1)-Coloring in Congested Clique 10.4230/LIPIcs.ICALP.2023.46
Yann Disser, Max Klimm, Kevin Schewior, and David Weckbecker Incremental Maximization via Continuization 10.4230/LIPIcs.ICALP.2023.47
Andrzej Dorobisz and Jakub Kozik Local Computation Algorithms for Hypergraph Coloring - Following Beck’s Approach 10.4230/LIPIcs.ICALP.2023.48
Ilan Doron-Arad, Ariel Kulik, and Hadas Shachnai An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets 10.4230/LIPIcs.ICALP.2023.49
Lukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt, and Julian Wargalla Connected k-Center and k-Diameter Clustering 10.4230/LIPIcs.ICALP.2023.50
Shaddin Dughmi, Yusuf Hakan Kalayci, and Neel Patel On Sparsification of Stochastic Packing Problems 10.4230/LIPIcs.ICALP.2023.51
Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, and Adam Smith Triangle Counting with Local Edge Differential Privacy 10.4230/LIPIcs.ICALP.2023.52
Klim Efremenko, Gillat Kol, Dmitry Paramonov, and Raghuvansh R. Saxena Protecting Single-Hop Radio Networks from Message Drops 10.4230/LIPIcs.ICALP.2023.53
Charilaos Efthymiou and Weiming Feng On the Mixing Time of Glauber Dynamics for the Hard-Core and Related Models on G(n,d/n) 10.4230/LIPIcs.ICALP.2023.54
Charilaos Efthymiou and Kostas Zampetakis Broadcasting with Random Matrices 10.4230/LIPIcs.ICALP.2023.55
David Eppstein and Daniel Frishberg Improved Mixing for the Convex Polygon Triangulation Flip Walk 10.4230/LIPIcs.ICALP.2023.56
Louis Esperet, Nathaniel Harms, and Viktor Zamaraev Optimal Adjacency Labels for Subgraphs of Cartesian Products 10.4230/LIPIcs.ICALP.2023.57
Michal Feldman, Federico Fusco, Simon Mauras, and Rebecca Reiffenhäuser Truthful Matching with Online Items and Offline Agents 10.4230/LIPIcs.ICALP.2023.58
Robert Ferens and Marek Szykuła Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper Bounds 10.4230/LIPIcs.ICALP.2023.59
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, and Kirill Simonov Approximating Long Cycle Above Dirac’s Guarantee 10.4230/LIPIcs.ICALP.2023.60
Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, and Dimitrios M. Thilikos Compound Logics for Modification Problems 10.4230/LIPIcs.ICALP.2023.61
Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, and Leon Schiller Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs 10.4230/LIPIcs.ICALP.2023.62
Zachary Friggstad and Ramin Mousavi An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs 10.4230/LIPIcs.ICALP.2023.63
Honghao Fu, Daochen Wang, and Qi Zhao Parallel Self-Testing of EPR Pairs Under Computational Assumptions 10.4230/LIPIcs.ICALP.2023.64
Mohit Garg, Felix Hommelsheim, and Nicole Megow Matching Augmentation via Simultaneous Contractions 10.4230/LIPIcs.ICALP.2023.65
Badih Ghazi, Pritish Kamath, Ravi Kumar, Pasin Manurangsi, and Kewen Wu On Differentially Private Counting on Trees 10.4230/LIPIcs.ICALP.2023.66
Alexandru Gheorghiu, Tony Metger, and Alexander Poremba Quantum Cryptography with Classical Communication: Parallel Remote State Preparation for Copy-Protection, Verification, and More 10.4230/LIPIcs.ICALP.2023.67
Leslie Ann Goldberg and Marc Roth Parameterised and Fine-Grained Subgraph Counting, Modulo 2 10.4230/LIPIcs.ICALP.2023.68
Gramoz Goranci and Monika Henzinger Efficient Data Structures for Incremental Exact and Approximate Maximum Flow 10.4230/LIPIcs.ICALP.2023.69
Mohak Goyal, Sukolsak Sakshuwong, Sahasrajit Sarmasarkar, and Ashish Goel Low Sample Complexity Participatory Budgeting 10.4230/LIPIcs.ICALP.2023.70
Daniel Hader and Matthew J. Patitz The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Cross-Model Simulation in Tile-Based Self-Assembly 10.4230/LIPIcs.ICALP.2023.71
David G. Harris and Vladimir Kolmogorov Parameter Estimation for Gibbs Distributions 10.4230/LIPIcs.ICALP.2023.72
Ishay Haviv On Finding Constrained Independent Sets in Cycles 10.4230/LIPIcs.ICALP.2023.73
Monika Henzinger, Paul Liu, Jan Vondrák, and Da Wei Zheng Faster Submodular Maximization for Several Classes of Matroids 10.4230/LIPIcs.ICALP.2023.74
Petr Hliněný and Jan Jedelský Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite Planar 10.4230/LIPIcs.ICALP.2023.75
Jakob Bæk Tejs Houen and Mikkel Thorup A Sparse Johnson-Lindenstrauss Transform Using Fast Hashing 10.4230/LIPIcs.ICALP.2023.76
Jun-Ting Hsieh and Pravesh K. Kothari Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm 10.4230/LIPIcs.ICALP.2023.77
Jun-Ting Hsieh, Pravesh K. Kothari, Aaron Potechin, and Jeff Xu Ellipsoid Fitting up to a Constant 10.4230/LIPIcs.ICALP.2023.78
Dylan Hyatt-Denesik, Afrouz Jabal Ameli, and Laura Sanità Finding Almost Tight Witness Trees 10.4230/LIPIcs.ICALP.2023.79
Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, and Joshua R. Wang Efficient Caching with Reserves via Marking 10.4230/LIPIcs.ICALP.2023.80
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki Rerouting Planar Curves and Disjoint Paths 10.4230/LIPIcs.ICALP.2023.81
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, and Yoshio Okamoto Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra 10.4230/LIPIcs.ICALP.2023.82
Siddharth Iyer and Michael Whitmeyer Searching for Regularity in Bounded Functions 10.4230/LIPIcs.ICALP.2023.83
Adam Karczmarz and Piotr Sankowski Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs 10.4230/LIPIcs.ICALP.2023.84
Shimon Kogan and Merav Parter New Additive Emulators 10.4230/LIPIcs.ICALP.2023.85
Shi Li Nearly-Linear Time LP Solvers and Rounding Algorithms for Scheduling Problems 10.4230/LIPIcs.ICALP.2023.86
Xiantao Li and Chunhao Wang Simulating Markovian Open Quantum Systems Using Higher-Order Series Expansion 10.4230/LIPIcs.ICALP.2023.87
S. Cliff Liu, Zhao Song, Hengjie Zhang, Lichen Zhang, and Tianyi Zhou Space-Efficient Interior Point Method, with Applications to Linear Programming and Maximum Weight Bipartite Matching 10.4230/LIPIcs.ICALP.2023.88
Shu Liu, Chaoping Xing, and Chen Yuan List Decoding of Rank-Metric Codes with Row-To-Column Ratio Bigger Than 1/2 10.4230/LIPIcs.ICALP.2023.89
Daniel Lokshtanov, Saket Saurabh, and Vaishali Surianarayanan Breaking the All Subsets Barrier for Min k-Cut 10.4230/LIPIcs.ICALP.2023.90
Claire Mathieu and Hang Zhou A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees 10.4230/LIPIcs.ICALP.2023.91
Konstantina Mellou, Marco Molinaro, and Rudy Zhou Online Demand Scheduling with Failovers 10.4230/LIPIcs.ICALP.2023.92
Laure Morelle, Ignasi Sau, Giannos Stamoulis, and Dimitrios M. Thilikos Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes 10.4230/LIPIcs.ICALP.2023.93
Kazusato Oko, Shinsaku Sakaue, and Shin-ichi Tanigawa Nearly Tight Spectral Sparsification of Directed Hypergraphs 10.4230/LIPIcs.ICALP.2023.94
Rotem Oshman and Tal Roth The Communication Complexity of Set Intersection Under Product Distributions 10.4230/LIPIcs.ICALP.2023.95
Pan Peng and Yuyang Wang An Optimal Separation Between Two Property Testing Models for Bounded Degree Directed Graphs 10.4230/LIPIcs.ICALP.2023.96
Minglong Qin and Penghui Yao Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States 10.4230/LIPIcs.ICALP.2023.97
Rajmohan Rajaraman, David Stalfa, and Sheng Yang Scheduling Under Non-Uniform Job and Machine Delays 10.4230/LIPIcs.ICALP.2023.98
Nicolas Resch, Chen Yuan, and Yihan Zhang Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery 10.4230/LIPIcs.ICALP.2023.99
Eric Rivals, Michelle Sweering, and Pengfei Wang Convergence of the Number of Period Sets in Strings 10.4230/LIPIcs.ICALP.2023.100
David E. Roberson and Tim Seppelt Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability 10.4230/LIPIcs.ICALP.2023.101
Ittai Rubinstein Average-Case to (Shifted) Worst-Case Reduction for the Trace Reconstruction Problem 10.4230/LIPIcs.ICALP.2023.102
Thomas Sauerwald, He Sun, and Danny Vagnozzi The Support of Open Versus Closed Random Walks 10.4230/LIPIcs.ICALP.2023.103
Tatsuya Terao Faster Matroid Partition Algorithms 10.4230/LIPIcs.ICALP.2023.104
Noam Touitou Frameworks for Nonclairvoyant Network Design with Deadlines or Delay 10.4230/LIPIcs.ICALP.2023.105
Michał Włodarczyk Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth 10.4230/LIPIcs.ICALP.2023.106
Or Zamir The Wrong Direction of Jensen’s Inequality Is Algorithmically Right 10.4230/LIPIcs.ICALP.2023.107
Ruizhe Zhang and Xinzhi Zhang A Hyperbolic Extension of Kadison-Singer Type Results 10.4230/LIPIcs.ICALP.2023.108
Bader Abu Radi and Orna Kupferman On Semantically-Deterministic Automata 10.4230/LIPIcs.ICALP.2023.109
Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, and Georg Zetzsche Checking Refinement of Asynchronous Programs Against Context-Free Specifications 10.4230/LIPIcs.ICALP.2023.110
Bartosz Bednarczyk, Daumantas Kojelis, and Ian Pratt-Hartmann On the Limits of Decision: the Adjacent Fragment of First-Order Logic 10.4230/LIPIcs.ICALP.2023.111
Michael Benedikt, Dmitry Chistikov, and Alessio Mansutti The Complexity of Presburger Arithmetic with Power or Powers 10.4230/LIPIcs.ICALP.2023.112
Christoph Berkholz and Harry Vinall-Smeeth A Dichotomy for Succinct Representations of Homomorphisms 10.4230/LIPIcs.ICALP.2023.113
Fabian Birkmann, Stefan Milius, and Henning Urbat Nominal Topology for Data Languages 10.4230/LIPIcs.ICALP.2023.114
Michael Blondin and François Ladouceur Population Protocols with Unordered Data 10.4230/LIPIcs.ICALP.2023.115
Manuel Bodirsky and Simon Knäuer Network Satisfaction Problems Solved by k-Consistency 10.4230/LIPIcs.ICALP.2023.116
Mikołaj Bojańczyk and Lê Thành Dũng (Tito) Nguyễn Algebraic Recognition of Regular Functions 10.4230/LIPIcs.ICALP.2023.117
Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour, and Pierre Vandenhove How to Play Optimally for Regular Objectives? 10.4230/LIPIcs.ICALP.2023.118
Samuel Braunfeld, Anuj Dawar, Ioannis Eleftheriadis, and Aris Papadopoulos Monadic NIP in Monotone Classes of Relational Structures 10.4230/LIPIcs.ICALP.2023.119
Titouan Carette, Etienne Moutot, Thomas Perez, and Renaud Vilmart Compositionality of Planar Perfect Matchings: A Universal and Complete Fragment of ZW-Calculus 10.4230/LIPIcs.ICALP.2023.120
Olivier Carton, Gaëtan Douéneau-Tabot, Emmanuel Filiot, and Sarah Winter Deterministic Regular Functions of Infinite Words 10.4230/LIPIcs.ICALP.2023.121
Antonio Casares and Pierre Ohlmann Characterising Memory in Infinite Games 10.4230/LIPIcs.ICALP.2023.122
Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar, and Kuldeep S. Meel Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle? 10.4230/LIPIcs.ICALP.2023.123
Ruiwen Dong The Identity Problem in ℤ ≀ ℤ Is Decidable 10.4230/LIPIcs.ICALP.2023.124
Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, and Szymon Toruńczyk Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes 10.4230/LIPIcs.ICALP.2023.125
Javier Esparza and Vincent P. Grande Black-Box Testing Liveness Properties of Partially Observable Stochastic Systems 10.4230/LIPIcs.ICALP.2023.126
Austen Z. Fan, Paraschos Koutris, and Hangdong Zhao The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems 10.4230/LIPIcs.ICALP.2023.127
Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michał Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokołowski, and Szymon Toruńczyk Flipper Games for Monadically Stable Graph Classes 10.4230/LIPIcs.ICALP.2023.128
Thomas A. Henzinger, Pavol Kebis, Nicolas Mazzocchi, and N. Ege Saraç Regular Methods for Operator Precedence Languages 10.4230/LIPIcs.ICALP.2023.129
George Kenison, Joris Nieuwveld, Joël Ouaknine, and James Worrell Positivity Problems for Reversible Linear Recurrence Sequences 10.4230/LIPIcs.ICALP.2023.130
Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, and Karol Węgrzycki Coverability in VASS Revisited: Improving Rackoff’s Bound to Obtain Conditional Optimality 10.4230/LIPIcs.ICALP.2023.131
Michael Lampis First Order Logic on Pathwidth Revisited Again 10.4230/LIPIcs.ICALP.2023.132
Moritz Lichter Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting 10.4230/LIPIcs.ICALP.2023.133
Markus Lohrey and Andreas Rosowski On the Complexity of Diameter and Related Problems in Permutation Groups 10.4230/LIPIcs.ICALP.2023.134
Pierre Ohlmann, Michał Pilipczuk, Wojciech Przybyszewski, and Szymon Toruńczyk Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes 10.4230/LIPIcs.ICALP.2023.135
Wojciech Różowski, Tobias Kappé, Dexter Kozen, Todd Schmid, and Alexandra Silva Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity 10.4230/LIPIcs.ICALP.2023.136
Frits Vaandrager and Thorsten Wißmann Action Codes 10.4230/LIPIcs.ICALP.2023.137