Track A

• Eklavya Sharma
  Harmonic Algorithms for Packing d-dimensional Cuboids Into Bins

• Eric Allender, Mahdi Cheraghchi, Dimitrios Myrisiotis, Harsha Tirumala and Ilya Volkovich
  One-way Functions and a Conditional Variant of MKTP

• Jaikumar Radhakrishnan and Aravind Srinivasan
  Property B: Two-coloring non-uniform hypergraphs

• Susanne Albers and Maximilian Janke
  Scheduling under random-order arrival

• Georgiy Klimenko and Benjamin Raichel
  Fast and Exact Convex Hull Simplification

• Sylvia Boyd, Joe Cheriyan, Arash Haddadan and Sharat Ibrahimpur
  Approximation Algorithms for Flexible Graph Connectivity

• Daniel Lokshtanov, Saket Saurabh, Subhash Suri and Jie Xue
  An ETH-tight Algorithm for Multi-Team Formation

• Fedor Fomin, Petr Golovach, Tanmay Inamdar and Saket Saurabh
  ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space

• Suryajith Chillara
  Functional lower bounds for restricted arithmetic circuits of depth four

• Sourav Chakraborty, Nikhil S Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar and Swagato Sanyal
  Tight Chang's-lemma-type bounds for Boolean functions

• Xin Li and Yu Zheng
  Lower Bounds and Improved Algorithms for Asymmetric Streaming Edit Distance and Longest Common Subsequence

• Yang Du and Ilya Volkovich
  Approximating the Number of Prime Factors Given an Oracle to Euler’s Totient Function

• Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon and Andreas Wiese
  Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time

• Telikepalli Kavitha
  Matchings, Critical Nodes, and Popular Solutions

• Taekang Eom, Seungjun Lee and Hee-Kap Ahn
  Largest similar copies of convex polygons in polygonal domains

• Floyd Zweydinger, Andre Esser and Robert Kübler
  A Faster Algorithm for Finding Closest Pairs in Hamming Metric

• Yogesh Dahiya and Meena Mahajan
  On (Simple) Decision Tree Rank

• Diptarka Chakraborty, Debarati Das and Robert Krauthgamer
  Approximate Trace Reconstruction via Median String (in Average-Case)

• Arkadev Chattopadhyay, Ankit Garg and Suhail Sherif
  Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture

• Daniel Lokshtanov and Vaishali Surianarayanan
  Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable

• Jugal Garg, Pooja Kulkarni and Aniket Murhekar
  On Fair and Efficient Allocations of Indivisible Public Goods

• Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma and Raghunath Tewari
  Reachability and Matching in Single Crossing Minor Free Graphs

• Akhil Jalan and Dana Moshkovitz
  Near-Optimal Cayley Expanders for Abelian Groups

• Chetan Gupta, Rahul Jain and Raghunath Tewari
  Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs

• Shashwat Banchhor, Rishikesh Gajjala, Yogish Sabharwal and Sandeep Sen
  Generalizations of Length Limited Huffman Coding for Hierarchical Memory Settings

• Diptarka Chakraborty, Kshitij Gajjar and Agastya Vibhuti Jha
  Approximating the Center Ranking under Ulam

• Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan and Ankita Sarkar
  Popular Matchings in the Hospital-Residents Problem with Two-sided Lower Quotas

---

Track B

• Jonni Virtema, Jana Hofmann, Bernd Finkbeiner, Juha Kontinen and Fan Yang
  Linear-time Temporal Logic with Team Semantics: Expressivity and Complexity

• Bartosz Bednarczyk, Maja Orłowska, Anna Pacanowska and Tony Tan
  On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics

• Liam Jordon and Philippe Moser. Normal Sequences with Non-Maximal Automatic 2 Complexity

• Christopher Hugenroth
  Separating Regular Languages over Infinite Words with respect to the Wagner hierarchy

• Krishnendu Chatterjee, Rasmus Ibsen-Jensen and Andreas Pavlogiannis
  Quantitative Verification on Product Graphs of Small Treewidth

• Dongho Lee, Valentin Perrelle and Benoît Valiron
  Concrete Categorical Model of a Quantum Circuit Description Language with Measurement

• Nicolas Bedon
  Branching Automata and Poset Automata

• Raúl Gutiérrez, Salvador Lucas and Miguel Vítores
  Confluence of Conditional Rewriting in Logic Form

• Kentaro Kikuchi and Takahito Aoto
  Simple Derivation Systems for Proving Sufficient Completeness of Non-terminating Term Rewriting Systems

• Sławomir Lasota and Mohnish Pattathurajan.
  Parikh images of register automata

• Stefan Kiefer and Qiyi Tang
  Approximate Bisimulation Minimisation

• Benedikt Bollig, Arnaud Sangnier and Olivier Stietel
  Local First-Order Logic with Two Data Values

• Filippo Bonchi, Alessandro Di Giorgio and Pawel Sobocinski
  Diagrammatic Polyhedral Algebra

• Emmanuel Filiot and Sarah Winter
  Synthesizing computable functions from rational specifications over infinite words

• S. Akshay, Blaise Genest, Loic Helouet, Krishna S and Sparsa Roychowdhury
  Resilience of Timed Systems

• Karoliina Lehtinen and Udi Boker
  Good for Gameness vs. History Determinism in Quantitative Automata

• Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismael Jecker, Mateus De Oliveira Oliveira and Petra Wolf
  On the Complexity of Intersection Non-emptiness for Star-Free Language Classes

• A. R. Balasubramanian.
  Complexity of Coverability in Bounded Path Broadcast Networks

• Benjamin Bordais, Patricia Bouyer and Stéphane Le Roux.
  From Local to Global Determinacy in Concurrent Graph Games

• Raveendra Holla, Nabarun Deka and Deepak Dsouza
  On the Expressive Equivalence of TPTL in the Pointwise and Continuous Semantics

---