LIPIcs, Volume 297, ICALP 2024

Karl Bringmann, Martin Grohe, Gabriele Puppis, and Ola Svensson LIPIcs, Volume 297, ICALP 2024, Complete Volume 10.4230/LIPIcs.ICALP.2024
Karl Bringmann, Martin Grohe, Gabriele Puppis, and Ola Svensson Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ICALP.2024.0
Anuj Dawar Limits of Symmetric Computation (Invited Talk) 10.4230/LIPIcs.ICALP.2024.1
Edith Elkind Group Fairness: Multiwinner Voting and Beyond (Invited Talk) 10.4230/LIPIcs.ICALP.2024.2
Danupon Nanongkai Cross-Paradigm Graph Algorithms (Invited Talk) 10.4230/LIPIcs.ICALP.2024.3
Merav Parter Graphs Shortcuts: New Bounds and Algorithms (Invited Talk) 10.4230/LIPIcs.ICALP.2024.4
Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo, Jarosław Byrka, Fabrizio Grandoni, Krzysztof Sornat, and Antoine Tinguely An O(loglog n)-Approximation for Submodular Facility Location 10.4230/LIPIcs.ICALP.2024.5
Fateme Abbasi, Sandip Banerjee, Jarosław Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, and Joachim Spoerhase Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces 10.4230/LIPIcs.ICALP.2024.6
Elie Abboud and Noga Ron-Zewi Finer-Grained Reductions in Fine-Grained Hardness of Approximation 10.4230/LIPIcs.ICALP.2024.7
Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, and Andreas Wiese Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects 10.4230/LIPIcs.ICALP.2024.8
Shyan Akmal, Virginia Vassilevska Williams, and Nicole Wein Detecting Disjoint Shortest Paths in Linear Time and More 10.4230/LIPIcs.ICALP.2024.9
Emile Anand, Jan van den Brand, Mehrdad Ghadiri, and Daniel J. Zhang The Bit Complexity of Dynamic Algebraic Formulas and Their Determinants 10.4230/LIPIcs.ICALP.2024.10
Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, and Jiaheng Wang Approximate Counting for Spin Systems in Sub-Quadratic Time 10.4230/LIPIcs.ICALP.2024.11
Noel Arteche, Erfan Khaniki, Ján Pich, and Rahul Santhanam From Proof Complexity to Circuit Complexity via Interactive Protocols 10.4230/LIPIcs.ICALP.2024.12
Srinivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutiérrez, and Carlos Palazuelos Learning Low-Degree Quantum Objects 10.4230/LIPIcs.ICALP.2024.13
Vikraman Arvind and Pushkar S. Joglekar A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results 10.4230/LIPIcs.ICALP.2024.14
Yossi Azar, Shahar Lewkowicz, and Danny Vainstein List Update with Delays or Time Windows 10.4230/LIPIcs.ICALP.2024.15
Omkar Baraskar, Agrim Dewan, Chandan Saha, and Pulkit Sinha NP-Hardness of Testing Equivalence to Sparse Polynomials and to Constant-Support Polynomials 10.4230/LIPIcs.ICALP.2024.16
Surender Baswana and Koustav Bhanja Vital Edges for (s,t)-Mincut: Efficient Algorithms, Compact Structures, & Optimal Sensitivity Oracles 10.4230/LIPIcs.ICALP.2024.17
MohammadHossein Bateni, Laxman Dhulipala, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, and Jakub Łącki It’s Hard to HAC Average Linkage! 10.4230/LIPIcs.ICALP.2024.18
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, and Amin Saberi Sublinear Algorithms for TSP via Path Covers 10.4230/LIPIcs.ICALP.2024.19
Djamal Belazzougui, Gregory Kucherov, and Stefan Walzer Better Space-Time-Robustness Trade-Offs for Set Reconciliation 10.4230/LIPIcs.ICALP.2024.20
Shalev Ben-David and Srijita Kundu Oracle Separation of QMA and QCMA with Bounded Adaptivity 10.4230/LIPIcs.ICALP.2024.21
Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, and Tuukka Korhonen Two-Sets Cut-Uncut on Planar Graphs 10.4230/LIPIcs.ICALP.2024.22
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, and Shubhang Kulkarni Splitting-Off in Hypergraphs 10.4230/LIPIcs.ICALP.2024.23
Somnath Bhattacharjee, Markus Bläser, Pranjal Dutta, and Saswata Mukherjee Exponential Lower Bounds via Exponential Sums 10.4230/LIPIcs.ICALP.2024.24
Chiranjib Bhattacharyya, Ravindran Kannan, and Amit Kumar Random Separating Hyperplane Theorem and Learning Polytopes 10.4230/LIPIcs.ICALP.2024.25
Andreas Björklund, Petteri Kaski, and Jesper Nederlof Another Hamiltonian Cycle in Bipartite Pfaffian Graphs 10.4230/LIPIcs.ICALP.2024.26
Greg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay, and Chen Wang The Discrepancy of Shortest Paths 10.4230/LIPIcs.ICALP.2024.27
Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, and Zixuan Xu Additive Spanner Lower Bounds with Optimal Inner Graph Structure 10.4230/LIPIcs.ICALP.2024.28
Narek Bojikian and Stefan Kratsch A Tight Monte-Carlo Algorithm for Steiner Tree Parameterized by Clique-Width 10.4230/LIPIcs.ICALP.2024.29
Itai Boneh, Shay Golan, Shay Mozes, and Oren Weimann Õptimal Dynamic Time Warping on Run-Length Encoded Strings 10.4230/LIPIcs.ICALP.2024.30
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, and Maksim Zhukovskii Tight Bounds on Adjacency Labels for Monotone Graph Classes 10.4230/LIPIcs.ICALP.2024.31
Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani, Patrick Schnider, and Simon Weber Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents 10.4230/LIPIcs.ICALP.2024.32
Marin Bougeret, Bart M. P. Jansen, and Ignasi Sau Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations 10.4230/LIPIcs.ICALP.2024.33
Barış Can Esmer, Jacob Focke, Dániel Marx, and Paweł Rzążewski Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness 10.4230/LIPIcs.ICALP.2024.34
Charlie Carlson, Ewan Davies, Alexandra Kolla, and Aditya Potukuchi A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs 10.4230/LIPIcs.ICALP.2024.35
Maxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin, and Stéphan Thomassé Vertex-Minor Universal Graphs for Generating Entangled Quantum Subsystems 10.4230/LIPIcs.ICALP.2024.36
Keren Censor-Hillel, Tomer Even, and Virginia Vassilevska Williams Fast Approximate Counting of Cycles 10.4230/LIPIcs.ICALP.2024.37
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, and Sorrachai Yingchareonthawornchai The Group Access Bounds for Binary Search Trees 10.4230/LIPIcs.ICALP.2024.38
Panagiotis Charalampopoulos, Paweł Gawrychowski, and Samah Ghazawi Optimal Bounds for Distinct Quartics 10.4230/LIPIcs.ICALP.2024.39
Shiri Chechik, Doron Mukhtar, and Tianyi Zhang Streaming Edge Coloring with Subquadratic Palette Size 10.4230/LIPIcs.ICALP.2024.40
Shiri Chechik and Tianyi Zhang Faster Algorithms for Dual-Failure Replacement Paths 10.4230/LIPIcs.ICALP.2024.41
Shiri Chechik and Tianyi Zhang Path-Reporting Distance Oracles with Logarithmic Stretch and Linear Size 10.4230/LIPIcs.ICALP.2024.42
Chung Shue Chen, Peter Keevash, Sean Kennedy, Élie de Panafieu, and Adrian Vetta Robot Positioning Using Torus Packing for Multisets 10.4230/LIPIcs.ICALP.2024.43
Junjie Chen, Minming Li, Haifeng Xu, and Song Zuo Bayesian Calibrated Click-Through Auctions 10.4230/LIPIcs.ICALP.2024.44
Li Chen and Mingquan Ye High-Accuracy Multicommodity Flows via Iterative Refinement 10.4230/LIPIcs.ICALP.2024.45
Yu Chen, Michael Kapralov, Mikhail Makarov, and Davide Mazzali On the Streaming Complexity of Expander Decomposition 10.4230/LIPIcs.ICALP.2024.46
Yu Chen and Zihan Tan Lower Bounds on 0-Extension with Steiner Nodes 10.4230/LIPIcs.ICALP.2024.47
Andrei Constantinescu, Pascal Lenzner, Rebecca Reiffenhäuser, Daniel Schmand, and Giovanna Varricchio Solving Woeginger’s Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games 10.4230/LIPIcs.ICALP.2024.48
Mónika Csikós and Nabil H. Mustafa An Optimal Sparsification Lemma for Low-Crossing Matchings and Its Applications to Discrepancy and Approximations 10.4230/LIPIcs.ICALP.2024.49
Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, and Pavel Veselý Fully-Scalable MPC Algorithms for Clustering in High Dimension 10.4230/LIPIcs.ICALP.2024.50
Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, and Martin Milanič Computing Tree Decompositions with Small Independence Number 10.4230/LIPIcs.ICALP.2024.51
Sami Davies, Benjamin Moseley, and Heather Newman Simultaneously Approximating All 𝓁_p-Norms in Correlation Clustering 10.4230/LIPIcs.ICALP.2024.52
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, and M. S. Ramanujan Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy 10.4230/LIPIcs.ICALP.2024.53
Holger Dell, John Lapinskas, and Kitty Meeks Nearly Optimal Independence Oracle Algorithms for Edge Estimation in Hypergraphs 10.4230/LIPIcs.ICALP.2024.54
Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, and William K. Moses Jr. Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous 10.4230/LIPIcs.ICALP.2024.55
Ilan Doron-Arad, Ariel Kulik, and Hadas Shachnai Lower Bounds for Matroid Optimization Problems with a Linear Constraint 10.4230/LIPIcs.ICALP.2024.56
Ilan Doron-Arad and Joseph (Seffi) Naor Non-Linear Paging 10.4230/LIPIcs.ICALP.2024.57
Michal Dory, Sebastian Forster, Yasamin Nazari, and Tijn de Vos New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths 10.4230/LIPIcs.ICALP.2024.58
Aditi Dudeja Decremental Matching in General Weighted Graphs 10.4230/LIPIcs.ICALP.2024.59
Talya Eden, Reut Levi, and Dana Ron Testing C_k-Freeness in Bounded-Arboricity Graphs 10.4230/LIPIcs.ICALP.2024.60
Andreas Emil Feldmann and Michael Lampis Parameterized Algorithms for Steiner Forest in Bounded Width Graphs 10.4230/LIPIcs.ICALP.2024.61
Weiming Feng and Heng Guo An FPRAS for Two Terminal Reliability in Directed Acyclic Graphs 10.4230/LIPIcs.ICALP.2024.62
Yuda Feng and Shi Li A Note on Approximating Weighted Nash Social Welfare with Additive Valuations 10.4230/LIPIcs.ICALP.2024.63
Nick Fischer and Leo Wennmann Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time 10.4230/LIPIcs.ICALP.2024.64
Cella Florescu, Rasmus Kyng, Maximilian Probst Gutenberg, and Sushant Sachdeva Optimal Electrical Oblivious Routing on Expanders 10.4230/LIPIcs.ICALP.2024.65
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, and Prafullkumar Tale Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover 10.4230/LIPIcs.ICALP.2024.66
Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, and Roohani Sharma Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification 10.4230/LIPIcs.ICALP.2024.67
Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, and Mateusz Rychlicki A Tight Subexponential-Time Algorithm for Two-Page Book Embedding 10.4230/LIPIcs.ICALP.2024.68
Serge Gaspers and Jerry Zirui Li Quantum Algorithms for Graph Coloring and Other Partitioning, Covering, and Packing Problems 10.4230/LIPIcs.ICALP.2024.69
Sevag Gharibian and Jonas Kamminga BQP, Meet NP: Search-To-Decision Reductions and Approximate Counting 10.4230/LIPIcs.ICALP.2024.70
Prantar Ghosh and Manuel Stoeckl Low-Memory Algorithms for Online Edge Coloring 10.4230/LIPIcs.ICALP.2024.71
Yiannis Giannakopoulos, Alexander Grosz, and Themistoklis Melissourgos On the Smoothed Complexity of Combinatorial Local Search 10.4230/LIPIcs.ICALP.2024.72
Matan Gilboa A Characterization of Complexity in Public Goods Games 10.4230/LIPIcs.ICALP.2024.73
Guy Goldberg Linear Relaxed Locally Decodable and Correctable Codes Do Not Need Adaptivity and Two-Sided Error 10.4230/LIPIcs.ICALP.2024.74
Lucas Gretta and Eric Price Sharp Noisy Binary Search with Monotonic Probabilities 10.4230/LIPIcs.ICALP.2024.75
Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, and Sebastian Siebertz Solution Discovery via Reconfiguration for Problems in P 10.4230/LIPIcs.ICALP.2024.76
Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, and Paweł Rzążewski Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters 10.4230/LIPIcs.ICALP.2024.77
Martin Grohe and Daniel Neuen Isomorphism for Tournaments of Small Twin Width 10.4230/LIPIcs.ICALP.2024.78
Leonid Gurvits, Nathan Klein, and Jonathan Leake From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP 10.4230/LIPIcs.ICALP.2024.79
Mohammad T. HajiAghayi, Dariusz R. Kowalski, and Jan Olkowski Distributed Fast Crash-Tolerant Consensus with Nearly-Linear Quantum Communication 10.4230/LIPIcs.ICALP.2024.80
Sariel Har-Peled, Elfarouk Harb, and Vasilis Livanos Oracle-Augmented Prophet Inequalities 10.4230/LIPIcs.ICALP.2024.81
Hamed Hatami, Kaave Hosseini, Shachar Lovett, and Anthony Ostuni Refuting Approaches to the Log-Rank Conjecture for XOR Functions 10.4230/LIPIcs.ICALP.2024.82
Klaus Heeger, Danny Hermelin, Matthias Mnich, and Dvir Shabtay No Polynomial Kernels for Knapsack 10.4230/LIPIcs.ICALP.2024.83
Sophia Heimann, Hung P. Hoang, and Stefan Hougardy The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5 10.4230/LIPIcs.ICALP.2024.84
Shuichi Hirahara and Naoto Ohsaka Optimal PSPACE-Hardness of Approximating Set Cover Reconfiguration 10.4230/LIPIcs.ICALP.2024.85
Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, and Tamás Schwarcz Problems on Group-Labeled Matroid Bases 10.4230/LIPIcs.ICALP.2024.86
Kevin Hua, Daniel Li, Jaewoo Park, and Thatchaphol Saranurak Finding Most-Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time 10.4230/LIPIcs.ICALP.2024.87
Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, and Anannya Upasana Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints 10.4230/LIPIcs.ICALP.2024.88
Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, and Ayumi Shinohara Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching 10.4230/LIPIcs.ICALP.2024.89
Rajesh Jayaram, Jakub Łącki, Slobodan Mitrović, Krzysztof Onak, and Piotr Sankowski Dynamic PageRank: Algorithms and Lower Bounds 10.4230/LIPIcs.ICALP.2024.90
Agastya Vibhuti Jha and Akash Kumar A Sublinear Time Tester for Max-Cut on Clusterable Graphs 10.4230/LIPIcs.ICALP.2024.91
Shaofeng H.-C. Jiang, Wenqian Wang, Yubo Zhang, and Yuhao Zhang Algorithms for the Generalized Poset Sorting Problem 10.4230/LIPIcs.ICALP.2024.92
Ce Jin, Michael Kapralov, Sepideh Mahabadi, and Ali Vakilian Streaming Algorithms for Connectivity Augmentation 10.4230/LIPIcs.ICALP.2024.93
Ce Jin and Hongxun Wu A Faster Algorithm for Pigeonhole Equal Sums 10.4230/LIPIcs.ICALP.2024.94
Adam Karczmarz and Marcin Smulewicz Fully Dynamic Strongly Connected Components in Planar Digraphs 10.4230/LIPIcs.ICALP.2024.95
Yasushi Kawase, Koichi Nishimura, and Hanna Sumita Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets 10.4230/LIPIcs.ICALP.2024.96
Yotam Kenneth and Robert Krauthgamer Cut Sparsification and Succinct Representation of Submodular Hypergraphs 10.4230/LIPIcs.ICALP.2024.97
Sanjeev Khanna, Aaron (Louie) Putterman, and Madhu Sudan Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs 10.4230/LIPIcs.ICALP.2024.98
Boris Klemz and Marie Diana Sieper Constrained Level Planarity Is FPT with Respect to the Vertex Cover Number 10.4230/LIPIcs.ICALP.2024.99
Yusuke Kobayashi and Tatsuya Terao Subquadratic Submodular Maximization with a General Matroid Constraint 10.4230/LIPIcs.ICALP.2024.100
Tsvi Kopelowitz, Ariel Korin, and Liam Roditty On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch 10.4230/LIPIcs.ICALP.2024.101
Soh Kumabe and Yuichi Yoshida Lipschitz Continuous Allocations for Optimization Games 10.4230/LIPIcs.ICALP.2024.102
William Kuszmaul and Zoe Xi Towards an Analysis of Quadratic Probing 10.4230/LIPIcs.ICALP.2024.103
Kasper Green Larsen, Rasmus Pagh, Giuseppe Persiano, Toniann Pitassi, Kevin Yeo, and Or Zamir Optimal Non-Adaptive Cell Probe Dictionaries and Hashing 10.4230/LIPIcs.ICALP.2024.104
Eunou Lee and Ojas Parekh An Improved Quantum Max Cut Approximation via Maximum Matching 10.4230/LIPIcs.ICALP.2024.105
Shi Li, Chenyang Xu, and Ruilong Zhang Polylogarithmic Approximations for Robust s-t Path 10.4230/LIPIcs.ICALP.2024.106
Shuangle Li, Bingkai Lin, and Yuwei Liu Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems Under ETH 10.4230/LIPIcs.ICALP.2024.107
Xin Li and Yan Zhong Two-Source and Affine Non-Malleable Extractors for Small Entropy 10.4230/LIPIcs.ICALP.2024.108
Yaowei Long and Yunfan Wang Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity 10.4230/LIPIcs.ICALP.2024.109
Zhenjian Lu and Rahul Santhanam Impagliazzo’s Worlds Through the Lens of Conditional Kolmogorov Complexity 10.4230/LIPIcs.ICALP.2024.110
Yury Makarychev, Max Ovsiankin, and Erasmo Tani Approximation Algorithms for 𝓁_p-Shortest Path and 𝓁_p-Group Steiner Tree 10.4230/LIPIcs.ICALP.2024.111
Augusto Modanese and Yuichi Yoshida Testing Spreading Behavior in Networks with Arbitrary Topologies 10.4230/LIPIcs.ICALP.2024.112
Naoto Ohsaka Alphabet Reduction for Reconfiguration Problems 10.4230/LIPIcs.ICALP.2024.113
Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, and Sebastian Wiederrecht Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces 10.4230/LIPIcs.ICALP.2024.114
Orestis Plevrakis, Seyoon Ragavan, and S. Matthew Weinberg On the Cut-Query Complexity of Approximating Max-Cut 10.4230/LIPIcs.ICALP.2024.115
Vladimir V. Podolskii and Dmitrii Sluch One-Way Communication Complexity of Partial XOR Functions 10.4230/LIPIcs.ICALP.2024.116
Aaron Potechin and Aaron Zhang Bounds on the Total Coefficient Size of Nullstellensatz Proofs of the Pigeonhole Principle 10.4230/LIPIcs.ICALP.2024.117
Kent Quanrud Adaptive Sparsification for Matroid Intersection 10.4230/LIPIcs.ICALP.2024.118
Sushant Sachdeva, Anvith Thudi, and Yibin Zhao Better Sparsifiers for Directed Eulerian Graphs 10.4230/LIPIcs.ICALP.2024.119
Yaniv Sadeh and Haim Kaplan Caching Connections in Matchings 10.4230/LIPIcs.ICALP.2024.120
Mohammad Saneian and Soheil Behnezhad Streaming Edge Coloring with Asymptotically Optimal Colors 10.4230/LIPIcs.ICALP.2024.121
Niklas Schlomberg An Improved Integrality Gap for Disjoint Cycles in Planar Graphs 10.4230/LIPIcs.ICALP.2024.122
Kingsley Yung Limits of Sequential Local Algorithms on the Random k-XORSAT Problem 10.4230/LIPIcs.ICALP.2024.123
Rohan Acharya, Marcin Jurdziński, and Aditya Prakash Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata 10.4230/LIPIcs.ICALP.2024.124
C. Aiswarya, Amaldev Manuel, and Saina Sunny Edit Distance of Finite State Transducers 10.4230/LIPIcs.ICALP.2024.125
Pascal Baumann, Eren Keskin, Roland Meyer, and Georg Zetzsche Separability in Büchi VASS and Singly Non-Linear Systems of Inequalities 10.4230/LIPIcs.ICALP.2024.126
Michael Benedikt, Chia-Hsuan Lu, Boris Motik, and Tony Tan Decidability of Graph Neural Networks via Logical Characterizations 10.4230/LIPIcs.ICALP.2024.127
Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, and Adriano Peron Automata-Theoretic Characterisations of Branching-Time Temporal Logics 10.4230/LIPIcs.ICALP.2024.128
Manon Blanc and Olivier Bournez The Complexity of Computing in Continuous Time: Space Complexity Is Precision 10.4230/LIPIcs.ICALP.2024.129
Mikołaj Bojańczyk, Lê Thành Dũng (Tito) Nguyễn, and Rafał Stefański Function Spaces for Orbit-Finite Sets 10.4230/LIPIcs.ICALP.2024.130
Arnaud Carayol and Lucien Charamond The Structure of Trees in the Pushdown Hierarchy 10.4230/LIPIcs.ICALP.2024.131
Dmitry Chistikov, Alessio Mansutti, and Mikhail R. Starchak Integer Linear-Exponential Programming in NP by Quantifier Elimination 10.4230/LIPIcs.ICALP.2024.132
Mohan Dantam and Richard Mayr Finite-Memory Strategies for Almost-Sure Energy-MeanPayoff Objectives in MDPs 10.4230/LIPIcs.ICALP.2024.133
Julian Dörfler and Christian Ikenmeyer Functional Closure Properties of Finite ℕ-Weighted Automata 10.4230/LIPIcs.ICALP.2024.134
Amina Doumane, Samuel Humeau, and Damien Pous A Finite Presentation of Graphs of Treewidth at Most Three 10.4230/LIPIcs.ICALP.2024.135
Yuxi Fu, Qizhe Yang, and Yangluo Zheng Improved Algorithm for Reachability in d-VASS 10.4230/LIPIcs.ICALP.2024.136
Jakub Gajarský and Rose McCarty On Classes of Bounded Tree Rank, Their Interpretations, and Efficient Sparsification 10.4230/LIPIcs.ICALP.2024.137
Paul Gallot, Sebastian Maneth, Keisuke Nakano, and Charles Peyrat Deciding Linear Height and Linear Size-To-Height Increase of Macro Tree Transducers 10.4230/LIPIcs.ICALP.2024.138
Raphael Douglas Giles, Vincent Jackson, and Christine Rizkallah T-Rex: Termination of Recursive Functions Using Lexicographic Linear Combinations 10.4230/LIPIcs.ICALP.2024.139
Quentin Guilmant, Engel Lefaucheux, Joël Ouaknine, and James Worrell The 2-Dimensional Constraint Loop Problem Is Decidable 10.4230/LIPIcs.ICALP.2024.140
Roland Guttenberg Flattability of Priority Vector Addition Systems 10.4230/LIPIcs.ICALP.2024.141
Christoph Haase, Shankara Narayanan Krishna, Khushraj Madnani, Om Swostik Mishra, and Georg Zetzsche An Efficient Quantifier Elimination Procedure for Presburger Arithmetic 10.4230/LIPIcs.ICALP.2024.142
Go Hashimoto, Daniel Găină, and Ionuţ Ţuţu Forcing, Transition Algebras, and Calculi 10.4230/LIPIcs.ICALP.2024.143
Pavol Kebis, Florian Luca, Joël Ouaknine, Andrew Scoones, and James Worrell On Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy Words 10.4230/LIPIcs.ICALP.2024.144
George Kenison The Threshold Problem for Hypergeometric Sequences with Quadratic Parameters 10.4230/LIPIcs.ICALP.2024.145
Alberto Larrauri and Stanislav Živný Solving Promise Equations over Monoids and Groups 10.4230/LIPIcs.ICALP.2024.146
Bruno Loff and Mateusz Skomra Smoothed Analysis of Deterministic Discounted and Mean-Payoff Games 10.4230/LIPIcs.ICALP.2024.147
Antoine Mottet, Tomáš Nagy, and Michael Pinsker An Order out of Nowhere: A New Algorithm for Infinite-Domain {CSP}s 10.4230/LIPIcs.ICALP.2024.148
Wojciech Różowski A Complete Quantitative Axiomatisation of Behavioural Distance of Regular Expressions 10.4230/LIPIcs.ICALP.2024.149
Jakub Rydval Homogeneity and Homogenizability: Hard Problems for the Logic SNP 10.4230/LIPIcs.ICALP.2024.150
Jakub Rydval, Žaneta Semanišinová, and Michał Wrona Identifying Tractable Quantified Temporal Constraints Within Ord-Horn 10.4230/LIPIcs.ICALP.2024.151
Benjamin Scheidt On Homomorphism Indistinguishability and Hypertree Depth 10.4230/LIPIcs.ICALP.2024.152
Sylvain Schmitz and Lia Schütze On the Length of Strongly Monotone Descending Chains over ℕ^d 10.4230/LIPIcs.ICALP.2024.153
Guillaume Theyssier FO Logic on Cellular Automata Orbits Equals MSO Logic 10.4230/LIPIcs.ICALP.2024.154
Yuya Uezato Regular Expressions with Backreferences and Lookaheads Capture NLOG 10.4230/LIPIcs.ICALP.2024.155
Steffen van Bergerem, Roland Guttenberg, Sandra Kiefer, Corto Mascle, Nicolas Waldburger, and Chana Weil-Kennedy Verification of Population Protocols with Unordered Data 10.4230/LIPIcs.ICALP.2024.156
Cheng Zhang, Arthur Azevedo de Amorim, and Marco Gaboardi Domain Reasoning in TopKAT 10.4230/LIPIcs.ICALP.2024.157