LIPIcs, Volume 250, FSTTCS 2022

• Anuj Dawar and Venkatesan Guruswami LIPIcs, Volume 250, FSTTCS 2022, Complete Volume 10.4230/LIPIcs.FSTTCS.2022
• Anuj Dawar and Venkatesan Guruswami Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.FSTTCS.2022.0
• Anupam Gupta Algorithms for Uncertain Environments: Going Beyond the Worst-Case (Invited Talk) 10.4230/LIPIcs.FSTTCS.2022.1
• Rahul Santhanam Why MCSP Is a More Important Problem Than SAT (Invited Talk) 10.4230/LIPIcs.FSTTCS.2022.2
• Patricia Bouyer, Mickael Randour, and Pierre Vandenhove The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs (Invited Talk) 10.4230/LIPIcs.FSTTCS.2022.3
• Irit Dinur Expanders in Higher Dimensions (Invited Talk) 10.4230/LIPIcs.FSTTCS.2022.4
• Jasine Babu, R. Krithika, and Deepak Rajendraprasad Packing Arc-Disjoint 4-Cycles in Oriented Graphs 10.4230/LIPIcs.FSTTCS.2022.5
• Calvin Beideman, Karthekeyan Chandrasekaran, Chandra Chekuri, and Chao Xu Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions 10.4230/LIPIcs.FSTTCS.2022.6
• Gianfranco Bilardi and Lorenzo De Stefani The DAG Visit Approach for Pebbling and I/O Lower Bounds 10.4230/LIPIcs.FSTTCS.2022.7
• Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, and Manaswi Paraashar Counting and Sampling from Substructures Using Linear Algebraic Queries 10.4230/LIPIcs.FSTTCS.2022.8
• Pranav Bisht and Nitin Saxena Derandomization via Symmetric Polytopes: Poly-Time Factorization of Certain Sparse Polynomials 10.4230/LIPIcs.FSTTCS.2022.9
• Pranav Bisht and Ilya Volkovich On Solving Sparse Polynomial Factorization Related Problems 10.4230/LIPIcs.FSTTCS.2022.10
• Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, and Jakub Svoboda Complexity of Spatial Games 10.4230/LIPIcs.FSTTCS.2022.11
• Arkadev Chattopadhyay, Utsab Ghosal, and Partha Mukhopadhyay Robustly Separating the Arithmetic Monotone Hierarchy via Graph Inner-Product 10.4230/LIPIcs.FSTTCS.2022.12
• Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, and Hee-Kap Ahn Inscribing or Circumscribing a Histogon to a Convex Polygon 10.4230/LIPIcs.FSTTCS.2022.13
• Joshua Cook More Verifier Efficient Interactive Protocols for Bounded Space 10.4230/LIPIcs.FSTTCS.2022.14
• Arjan Cornelissen, Nikhil S. Mande, and Subhasree Patro Improved Quantum Query Upper Bounds Based on Classical Decision Trees 10.4230/LIPIcs.FSTTCS.2022.15
• Radu Curticapean, Nutan Limaye, and Srikanth Srinivasan On the VNP-Hardness of Some Monomial Symmetric Polynomials 10.4230/LIPIcs.FSTTCS.2022.16
• Minati De, Saksham Jain, Sarat Varma Kallepalli, and Satyam Singh Online Piercing of Geometric Objects 10.4230/LIPIcs.FSTTCS.2022.17
• Nandhana Duraisamy, Hannah Miller Hillberg, Ramesh K. Jallu, Erik Krohn, Anil Maheshwari, Subhas C. Nandy, and Alex Pahlow Half-Guarding Weakly-Visible Polygons and Terrains 10.4230/LIPIcs.FSTTCS.2022.18
• Rohith Reddy Gangam, Tung Mai, Nitya Raju, and Vijay V. Vazirani A Structural and Algorithmic Study of Stable Matching Lattices of "Nearby" Instances, with Applications 10.4230/LIPIcs.FSTTCS.2022.19
• Fulvio Gesmundo, Purnata Ghosal, Christian Ikenmeyer, and Vladimir Lysikov Degree-Restricted Strength Decompositions and Algebraic Branching Programs 10.4230/LIPIcs.FSTTCS.2022.20
• Utkarsh Joshi, Saladi Rahul, and Josson Joe Thoppil A Simple Polynomial Time Algorithm for Max Cut on Laminar Geometric Intersection Graphs 10.4230/LIPIcs.FSTTCS.2022.21
• Telikepalli Kavitha Stable Matchings with One-Sided Ties and Approximate Popularity 10.4230/LIPIcs.FSTTCS.2022.22
• Arindam Khan, Eklavya Sharma, and K. V. N. Sreenivas Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing 10.4230/LIPIcs.FSTTCS.2022.23
• Pascal Koiran and Subhayan Saha Black Box Absolute Reconstruction for Sums of Powers of Linear Forms 10.4230/LIPIcs.FSTTCS.2022.24
• Oded Lachish, Felix Reidl, and Chhaya Trehan When You Come at the King You Best Not Miss 10.4230/LIPIcs.FSTTCS.2022.25
• Ramita Maharjan and Thomas Watson Complexity of Fault Tolerant Query Complexity 10.4230/LIPIcs.FSTTCS.2022.26
• Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, and Gaurav Viramgami Romeo and Juliet Meeting in Forest like Regions 10.4230/LIPIcs.FSTTCS.2022.27
• Vijay V. Vazirani New Characterizations of Core Imputations of Matching and b-Matching Games 10.4230/LIPIcs.FSTTCS.2022.28
• Ali Ahmadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi, and Ðorđe Žikelić Algorithms and Hardness Results for Computing Cores of Markov Chains 10.4230/LIPIcs.FSTTCS.2022.29
• Guy Avni and Suman Sadhukhan Computing Threshold Budgets in Discrete-Bidding Games 10.4230/LIPIcs.FSTTCS.2022.30
• Dylan Bellier, Sophie Pinchinat, and François Schwarzentruber Dependency Matrices for Multiplayer Strategic Dependencies 10.4230/LIPIcs.FSTTCS.2022.31
• Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, and Ocan Sankur Semilinear Representations for Series-Parallel Atomic Congestion Games 10.4230/LIPIcs.FSTTCS.2022.32
• Benjamin Bordais, Patricia Bouyer, and Stéphane Le Roux Playing (Almost-)Optimally in Concurrent Büchi and Co-Büchi Games 10.4230/LIPIcs.FSTTCS.2022.33
• Olivier Carton Ambiguity Through the Lens of Measure Theory 10.4230/LIPIcs.FSTTCS.2022.34
• Abhishek De, Farzad Jafarrahmani, and Alexis Saurin Phase Semantics for Linear Logic with Least and Greatest Fixed Points 10.4230/LIPIcs.FSTTCS.2022.35
• Rüdiger Ehlers and Sven Schewe Natural Colors of Infinite Words 10.4230/LIPIcs.FSTTCS.2022.36
• Bernd Finkbeiner and Noemi Passing Synthesizing Dominant Strategies for Liveness 10.4230/LIPIcs.FSTTCS.2022.37
• Moses Ganardi, Louis Jachiet, Markus Lohrey, and Thomas Schwentick Low-Latency Sliding Window Algorithms for Formal Languages 10.4230/LIPIcs.FSTTCS.2022.38
• Mohit Garg and Suneel Sarswat The Design and Regulation of Exchanges: A Formal Approach 10.4230/LIPIcs.FSTTCS.2022.39
• Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, and Martin Zimmermann Parikh Automata over Infinite Words 10.4230/LIPIcs.FSTTCS.2022.40
• Florent Koechlin New Analytic Techniques for Proving the Inherent Ambiguity of Context-Free Languages 10.4230/LIPIcs.FSTTCS.2022.41
• Orna Kupferman and Ofer Leshkowitz Synthesis of Privacy-Preserving Systems 10.4230/LIPIcs.FSTTCS.2022.42
• Thomas Place and Marc Zeitoun A Generic Polynomial Time Approach to Separation by First-Order Logic Without Quantifier Alternation 10.4230/LIPIcs.FSTTCS.2022.43
• K. S. Thejaswini, Pierre Ohlmann, and Marcin Jurdziński A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games 10.4230/LIPIcs.FSTTCS.2022.44