Table of Contents

• Online Piercing of Geometric ObjectsMinati De, Saksham Jain, Sarat Varma Kallepalli, Satyam Singh. [doi]
• Phase Semantics for Linear Logic with Least and Greatest Fixed PointsAbhishek De 0001, Farzad Jafar-Rahmani, Alexis Saurin. [doi]
• The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs (Invited Talk)Patricia Bouyer, Mickael Randour, Pierre Vandenhove. [doi]
• When You Come at the King You Best Not MissOded Lachish, Felix Reidl, Chhaya Trehan. [doi]
• Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut FunctionsCalvin Beideman, Karthekeyan Chandrasekaran, Chandra Chekuri, Chao Xu 0002. [doi]
• Complexity of Spatial GamesKrishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda. [doi]
• A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity GamesK. S. Thejaswini, Pierre Ohlmann, Marcin Jurdzinski. [doi]
• Complexity of Fault Tolerant Query ComplexityRamita Maharjan, Thomas Watson 0001. [doi]
• Semilinear Representations for Series-Parallel Atomic Congestion GamesNathalie Bertrand 0001, Nicolas Markey, Suman Sadhukhan, Ocan Sankur. [doi]
• More Verifier Efficient Interactive Protocols for Bounded SpaceJoshua Cook. [doi]
• Ambiguity Through the Lens of Measure TheoryOlivier Carton. [doi]
• On the VNP-Hardness of Some Monomial Symmetric PolynomialsRadu Curticapean, Nutan Limaye, Srikanth Srinivasan 0001. [doi]
• Packing Arc-Disjoint 4-Cycles in Oriented GraphsJasine Babu, R. Krithika 0001, Deepak Rajendraprasad. [doi]
• Synthesizing Dominant Strategies for LivenessBernd Finkbeiner, Noemi Passing. [doi]
• New Characterizations of Core Imputations of Matching and b-Matching GamesVijay V. Vazirani. [doi]
• Degree-Restricted Strength Decompositions and Algebraic Branching ProgramsFulvio Gesmundo, Purnata Ghosal, Christian Ikenmeyer, Vladimir Lysikov. [doi]
• Parikh Automata over Infinite WordsShibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann 0002. [doi]
• The DAG Visit Approach for Pebbling and I/O Lower BoundsGianfranco Bilardi, Lorenzo De Stefani. [doi]
• A Structural and Algorithmic Study of Stable Matching Lattices of "Nearby" Instances, with ApplicationsRohith Reddy Gangam, Tung Mai, Nitya Raju, Vijay V. Vazirani. [doi]
• Half-Guarding Weakly-Visible Polygons and TerrainsNandhana Duraisamy, Hannah Miller Hillberg, Ramesh K. Jallu, Erik Krohn, Anil Maheshwari, Subhas C. Nandy, Alex Pahlow. [doi]
• New Analytic Techniques for Proving the Inherent Ambiguity of Context-Free LanguagesFlorent Koechlin. [doi]
• Dependency Matrices for Multiplayer Strategic DependenciesDylan Bellier, Sophie Pinchinat, François Schwarzentruber. [doi]
• Why MCSP Is a More Important Problem Than SAT (Invited Talk)Rahul Santhanam. [doi]
• Geometry Meets Vectors: Approximation Algorithms for Multidimensional PackingArindam Khan 0001, Eklavya Sharma, K. V. N. Sreenivas. [doi]
• Robustly Separating the Arithmetic Monotone Hierarchy via Graph Inner-ProductArkadev Chattopadhyay, Utsab Ghosal, Partha Mukhopadhyay. [doi]
• Improved Quantum Query Upper Bounds Based on Classical Decision TreesArjan Cornelissen, Nikhil S. Mande, Subhasree Patro. [doi]
• Black Box Absolute Reconstruction for Sums of Powers of Linear FormsPascal Koiran, Subhayan Saha. [doi]
• Stable Matchings with One-Sided Ties and Approximate PopularityTelikepalli Kavitha. [doi]
• Romeo and Juliet Meeting in Forest like RegionsNeeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami. [doi]
• Natural Colors of Infinite WordsRüdiger Ehlers, Sven Schewe. [doi]
• Derandomization via Symmetric Polytopes: Poly-Time Factorization of Certain Sparse PolynomialsPranav Bisht, Nitin Saxena 0001. [doi]
• Inscribing or Circumscribing a Histogon to a Convex PolygonJaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn. [doi]
• Synthesis of Privacy-Preserving SystemsOrna Kupferman, Ofer Leshkowitz. [doi]
• Counting and Sampling from Substructures Using Linear Algebraic QueriesArijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar. [doi]
• The Design and Regulation of Exchanges: A Formal ApproachMohit Garg 0003, Suneel Sarswat. [doi]
• Algorithms for Uncertain Environments: Going Beyond the Worst-Case (Invited Talk)Anupam Gupta 0001. [doi]
• On Solving Sparse Polynomial Factorization Related ProblemsPranav Bisht, Ilya Volkovich. [doi]
• A Generic Polynomial Time Approach to Separation by First-Order Logic Without Quantifier AlternationThomas Place, Marc Zeitoun. [doi]
• Playing (Almost-)Optimally in Concurrent Büchi and Co-Büchi GamesBenjamin Bordais, Patricia Bouyer, Stéphane Le Roux 0001. [doi]
• Algorithms and Hardness Results for Computing Cores of Markov ChainsAli Ahmadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi, Ðorde Zikelic. [doi]
• Expanders in Higher Dimensions (Invited Talk)Irit Dinur. [doi]
• Low-Latency Sliding Window Algorithms for Formal LanguagesMoses Ganardi, Louis Jachiet, Markus Lohrey, Thomas Schwentick. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Computing Threshold Budgets in Discrete-Bidding GamesGuy Avni, Suman Sadhukhan. [doi]
• A Simple Polynomial Time Algorithm for Max Cut on Laminar Geometric Intersection GraphsUtkarsh Joshi, Saladi Rahul, Josson Joe Thoppil. [doi]