LIPIcs, Volume 219, STACS 2022

• Petra Berenbrink and Benjamin Monmege LIPIcs, Volume 219, STACS 2022, Complete Volume 10.4230/LIPIcs.STACS.2022
• Petra Berenbrink and Benjamin Monmege Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.STACS.2022.0
• Marie Albenque Local Limit of Random Discrete Surface with (Or Without!) a Statistical Physics Model (Invited Talk) 10.4230/LIPIcs.STACS.2022.1
• Maria-Florina Balcan Generalization Guarantees for Data-Driven Mechanism Design (Invited Talk) 10.4230/LIPIcs.STACS.2022.2
• Fabian Kuhn Deterministic Distributed Symmetry Breaking at the Example of Distributed Graph Coloring (Invited Talk) 10.4230/LIPIcs.STACS.2022.3
• Ramtin Afshar, Michael T. Goodrich, Pedro Matias, and Martha C. Osegueda Mapping Networks via Parallel kth-Hop Traceroute Queries 10.4230/LIPIcs.STACS.2022.4
• S. Akshay, Hugo Bazille, Blaise Genest, and Mihir Vahanwala On Robustness for the Skolem and Positivity Problems 10.4230/LIPIcs.STACS.2022.5
• Yacine Al-Najjar, Walid Ben-Ameur, and Jérémie Leguay Approximability of Robust Network Design: The Directed Case 10.4230/LIPIcs.STACS.2022.6
• Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, and Georg Zetzsche Existential Definability over the Subword Ordering 10.4230/LIPIcs.STACS.2022.7
• Nikolay Bazhenov, Dariusz Kalociński, and Michał Wrocławski Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order 10.4230/LIPIcs.STACS.2022.8
• Pierre Bergé, Guillaume Ducoffe, and Michel Habib Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs 10.4230/LIPIcs.STACS.2022.9
• Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, and Gopinath Mishra Faster Counting and Sampling Algorithms Using Colorful Decision Oracle 10.4230/LIPIcs.STACS.2022.10
• Laurent Bienvenu, Valentino Delle Rose, and Tomasz Steifer Probabilistic vs Deterministic Gamblers 10.4230/LIPIcs.STACS.2022.11
• Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, and Mirko Rossi Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 10.4230/LIPIcs.STACS.2022.12
• Ahmad Biniaz, Majid Daliri, and Amir Hossein Moradpour A 10-Approximation of the π/2-MST 10.4230/LIPIcs.STACS.2022.13
• Jeremiah Blocki, Mike Cinkoske, Seunghoon Lee, and Jin Young Son On Explicit Constructions of Extremely Depth Robust Graphs 10.4230/LIPIcs.STACS.2022.14
• Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, and Kunihiro Wasa Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint 10.4230/LIPIcs.STACS.2022.15
• Patricia Bouyer, Mickael Randour, and Pierre Vandenhove Characterizing Omega-Regularity Through Finite-Memory Determinacy of Games on Infinite Graphs 10.4230/LIPIcs.STACS.2022.16
• Nader H. Bshouty and Catherine A. Haddad-Zaknoon On Testing Decision Tree 10.4230/LIPIcs.STACS.2022.17
• Andrei A. Bulatov and Akbar Rafiey The Ideal Membership Problem and Abelian Groups 10.4230/LIPIcs.STACS.2022.18
• Antonin Callard and Benjamin Hellouin de Menibus The Aperiodic Domino Problem in Higher Dimension 10.4230/LIPIcs.STACS.2022.19
• Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, and Ronald de Wolf Symmetry and Quantum Query-To-Communication Simulation 10.4230/LIPIcs.STACS.2022.20
• Jianer Chen, Qin Huang, Iyad Kanj, and Ge Xia Near-Optimal Algorithms for Point-Line Covering Problems 10.4230/LIPIcs.STACS.2022.21
• Leroy Chew and Friedrich Slivovsky Towards Uniform Certification in QBF 10.4230/LIPIcs.STACS.2022.22
• Yung-Chung Chiu and Hsueh-I Lu Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-Shortest Induced Paths 10.4230/LIPIcs.STACS.2022.23
• Stefan Dantchev, Nicola Galesi, Abdul Ghani, and Barnaby Martin Depth Lower Bounds in Stabbing Planes for Combinatorial Principles 10.4230/LIPIcs.STACS.2022.24
• Bireswar Das, Anant Kumar, Shivdutt Sharma, and Dhara Thakkar Linear Space Data Structures for Finite Groups with Constant Query-Time 10.4230/LIPIcs.STACS.2022.25
• Heiko Dietrich, Murray Elder, Adam Piggott, Youming Qiao, and Armin Weiß The Isomorphism Problem for Plain Groups Is in Σ₃^{𝖯} 10.4230/LIPIcs.STACS.2022.26
• Michael Elkin and Ofer Neiman Centralized, Parallel, and Distributed Multi-Source Shortest Paths via Hopsets and Rectangular Matrix Multiplication 10.4230/LIPIcs.STACS.2022.27
• Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, and Lars Rohwedder Cardinality Constrained Scheduling in Online Models 10.4230/LIPIcs.STACS.2022.28
• Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, and Saket Saurabh Detours in Directed Graphs 10.4230/LIPIcs.STACS.2022.29
• Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, and Malte Renken Delay-Robust Routes in Temporal Graphs 10.4230/LIPIcs.STACS.2022.30
• Hiromichi Goko, Kazuhisa Makino, Shuichi Miyazaki, and Yu Yokoi Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties 10.4230/LIPIcs.STACS.2022.31
• Hiromichi Goko, Akitoshi Kawamura, Yasushi Kawase, Kazuhisa Makino, and Hanna Sumita Online Scheduling on Identical Machines with a Metric State Space 10.4230/LIPIcs.STACS.2022.32
• Éric Goubault, Jérémy Ledent, and Sergio Rajsbaum A Simplicial Model for KB4_n: Epistemic Logic with Agents That May Die 10.4230/LIPIcs.STACS.2022.33
• Petr Gregor, Torsten Mütze, and Arturo Merino Star Transposition Gray Codes for Multiset Permutations 10.4230/LIPIcs.STACS.2022.34
• Sander Gribling and Harold Nieuwboer Improved Quantum Lower and Upper Bounds for Matrix Scaling 10.4230/LIPIcs.STACS.2022.35
• Carla Groenland, Isja Mannens, Jesper Nederlof, and Krisztina Szilágyi Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth 10.4230/LIPIcs.STACS.2022.36
• Paweł M. Idziak, Piotr Kawałek, and Jacek Krzaczkowski Satisfiability of Circuits and Equations over Finite Malcev Algebras 10.4230/LIPIcs.STACS.2022.37
• Lars Jaffke, O-joung Kwon, and Jan Arne Telle Classes of Intersection Digraphs with Good Algorithmic Properties 10.4230/LIPIcs.STACS.2022.38
• Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, and Saket Saurabh Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems 10.4230/LIPIcs.STACS.2022.39
• Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, and Sang-il Oum Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k 10.4230/LIPIcs.STACS.2022.40
• Telikepalli Kavitha Fairly Popular Matchings and Optimality 10.4230/LIPIcs.STACS.2022.41
• Tomohiro Koana, Christian Komusiewicz, André Nichterlein, and Frank Sommer Covering Many (Or Few) Edges with k Vertices in Sparse Graphs 10.4230/LIPIcs.STACS.2022.42
• Alexander Kozachinskiy One-To-Two-Player Lifting for Mildly Growing Memory 10.4230/LIPIcs.STACS.2022.43
• Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, and Anamay Tengse If VNP Is Hard, Then so Are Equations for It 10.4230/LIPIcs.STACS.2022.44
• Michael Lampis Determining a Slater Winner Is Complete for Parallel Access to NP 10.4230/LIPIcs.STACS.2022.45
• Sławomir Lasota Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem 10.4230/LIPIcs.STACS.2022.46
• Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, and Joshua R. Wang Scheduling with Communication Delay in Near-Linear Time 10.4230/LIPIcs.STACS.2022.47
• Jack H. Lutz, Neil Lutz, and Elvira Mayordomo Extending the Reach of the Point-To-Set Principle 10.4230/LIPIcs.STACS.2022.48
• Nikhil S. Mande, Swagato Sanyal, and Suhail Sherif One-Way Communication Complexity and Non-Adaptive Decision Trees 10.4230/LIPIcs.STACS.2022.49
• Jesper Nederlof, Michał Pilipczuk, Céline M. F. Swennenhuis, and Karol Węgrzycki Isolation Schemes for Problems on Decomposable Graphs 10.4230/LIPIcs.STACS.2022.50
• Daria Pchelina, Nicolas Schabanel, Shinnosuke Seki, and Guillaume Theyssier Oritatami Systems Assemble Shapes No Less Complex Than Tile Assembly Model (ATAM) 10.4230/LIPIcs.STACS.2022.51
• Michał Pilipczuk, Marek Sokołowski, and Anna Zych-Pawlewicz Compact Representation for Matrices of Bounded Twin-Width 10.4230/LIPIcs.STACS.2022.52
• C. Ramya and Anamay Tengse On Finer Separations Between Subclasses of Read-Once Oblivious ABPs 10.4230/LIPIcs.STACS.2022.53
• Hanlin Ren and Rahul Santhanam A Relativization Perspective on Meta-Complexity 10.4230/LIPIcs.STACS.2022.54
• András Z. Salamon and Michael Wehar Superlinear Lower Bounds Based on ETH 10.4230/LIPIcs.STACS.2022.55
• Martin Škoviera and Peter Varša NP-Completeness of Perfect Matching Index of Cubic Graphs 10.4230/LIPIcs.STACS.2022.56
• D. M. Stull Optimal Oracles for Point-To-Set Principles 10.4230/LIPIcs.STACS.2022.57
• Takeshi Tokuyama and Ryo Yoshimura High Quality Consistent Digital Curved Rays via Vector Field Rounding 10.4230/LIPIcs.STACS.2022.58
• Christopher Williamson Sharp Indistinguishability Bounds from Non-Uniform Approximations 10.4230/LIPIcs.STACS.2022.59
• Xinyu Wu Analyzing XOR-Forrelation Through Stochastic Calculus 10.4230/LIPIcs.STACS.2022.60