Table of Contents

• Online Scheduling on Identical Machines with a Metric State SpaceHiromichi Goko, Akitoshi Kawamura, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita. [doi]
• Isolation Schemes for Problems on Decomposable GraphsJesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Scheduling with Communication Delay in Near-Linear TimeQuanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang. [doi]
• On Explicit Constructions of Extremely Depth Robust GraphsJeremiah Blocki, Mike Cinkoske, Seunghoon Lee, Jin-Young Son. [doi]
• The Aperiodic Domino Problem in Higher DimensionAntonin Callard, Benjamin Hellouin de Menibus. [doi]
• Near-Optimal Algorithms for Point-Line Covering ProblemsJianer Chen, Qin Huang, Iyad Kanj, Ge Xia. [doi]
• A Simplicial Model for KB4_n: Epistemic Logic with Agents That May DieÉric Goubault, Jérémy Ledent, Sergio Rajsbaum. [doi]
• Classes of Intersection Digraphs with Good Algorithmic PropertiesLars Jaffke, O-joung Kwon, Jan Arne Telle. [doi]
• Cardinality Constrained Scheduling in Online ModelsLeah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder. [doi]
• On Finer Separations Between Subclasses of Read-Once Oblivious ABPsC. Ramya, Anamay Tengse. [doi]
• Approximability of Robust Network Design: The Directed CaseYacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay. [doi]
• Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination ProblemsLawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh 0001. [doi]
• On Robustness for the Skolem and Positivity ProblemsS. Akshay 0001, Hugo Bazille, Blaise Genest, Mihir Vahanwala. [doi]
• Sharp Indistinguishability Bounds from Non-Uniform ApproximationsChristopher Williamson. [doi]
• Superlinear Lower Bounds Based on ETHAndrás Z. Salamon, Michael Wehar. [doi]
• Optimal Oracles for Point-To-Set PrinciplesDonald M. Stull. [doi]
• Delay-Robust Routes in Temporal GraphsEugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken. [doi]
• Mapping Networks via Parallel kth-Hop Traceroute QueriesRamtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda. [doi]
• Faster Counting and Sampling Algorithms Using Colorful Decision OracleAnup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra. [doi]
• Compact Representation for Matrices of Bounded Twin-WidthMichal Pilipczuk, Marek Sokolowski, Anna Zych-Pawlewicz. [doi]
• Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most kMamadou Moustapha Kanté, Eun Jung Kim 0002, O-joung Kwon, Sang-il Oum. [doi]
• Deterministic Distributed Symmetry Breaking at the Example of Distributed Graph Coloring (Invited Talk)Fabian Kuhn. [doi]
• Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median GraphsPierre Bergé, Guillaume Ducoffe , Michel Habib. [doi]
• Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse PreserversDavide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci 0001, Guido Proietti, Mirko Rossi. [doi]
• Reconfiguration of Spanning Trees with Degree Constraint or Diameter ConstraintNicolas Bousquet, Takehiro Ito, Yusuke Kobayashi 0001, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa. [doi]
• Centralized, Parallel, and Distributed Multi-Source Shortest Paths via Hopsets and Rectangular Matrix MultiplicationMichael Elkin, Ofer Neiman. [doi]
• Local Limit of Random Discrete Surface with (Or Without!) a Statistical Physics Model (Invited Talk)Marie Albenque. [doi]
• On Testing Decision TreeNader H. Bshouty, Catherine A. Haddad-Zaknoon. [doi]
• One-To-Two-Player Lifting for Mildly Growing MemoryAlexander Kozachinskiy. [doi]
• The Ideal Membership Problem and Abelian GroupsAndrei A. Bulatov, Akbar Rafiey. [doi]
• Towards Uniform Certification in QBFLeroy Chew, Friedrich Slivovsky. [doi]
• Depth Lower Bounds in Stabbing Planes for Combinatorial PrinciplesStefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin. [doi]
• Improved Quantum Lower and Upper Bounds for Matrix ScalingSander Gribling, Harold Nieuwboer. [doi]
• Generalization Guarantees for Data-Driven Mechanism Design (Invited Talk)Maria-Florina Balcan. [doi]
• One-Way Communication Complexity and Non-Adaptive Decision TreesNikhil S. Mande, Swagato Sanyal, Suhail Sherif. [doi]
• Satisfiability of Circuits and Equations over Finite Malcev AlgebrasPawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski. [doi]
• Determining a Slater Winner Is Complete for Parallel Access to NPMichael Lampis. [doi]
• Star Transposition Gray Codes for Multiset PermutationsPetr Gregor, Torsten Mütze, Arturo I. Merino. [doi]
• A Relativization Perspective on Meta-ComplexityHanlin Ren, Rahul Santhanam. [doi]
• If VNP Is Hard, Then so Are Equations for ItMrinal Kumar 0001, C. Ramya, Ramprasad Saptharishi, Anamay Tengse. [doi]
• Existential Definability over the Subword OrderingPascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche. [doi]
• Covering Many (Or Few) Edges with k Vertices in Sparse GraphsTomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer. [doi]
• Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by CutwidthCarla Groenland, Isja Mannens, Jesper Nederlof, Krisztina Szilágyi. [doi]
• NP-Completeness of Perfect Matching Index of Cubic GraphsMartin Skoviera, Peter Varsa. [doi]
• Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with TiesHiromichi Goko, Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi. [doi]
• Fairly Popular Matchings and OptimalityTelikepalli Kavitha. [doi]
• Detours in Directed GraphsFedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh 0001. [doi]
• Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard OrderNikolay Bazhenov, Dariusz Kalocinski, Michal Wroclawski. [doi]
• Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-Shortest Induced PathsYung-Chung Chiu 0001, Hsueh-I Lu. [doi]
• Symmetry and Quantum Query-To-Communication SimulationSourav Chakraborty 0001, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf. [doi]
• Characterizing Omega-Regularity Through Finite-Memory Determinacy of Games on Infinite GraphsPatricia Bouyer, Mickael Randour, Pierre Vandenhove. [doi]
• Extending the Reach of the Point-To-Set PrincipleJack H. Lutz, Neil Lutz, Elvira Mayordomo. [doi]
• High Quality Consistent Digital Curved Rays via Vector Field RoundingTakeshi Tokuyama, Ryo Yoshimura. [doi]
• Improved Ackermannian Lower Bound for the Petri Nets Reachability ProblemSlawomir Lasota 0001. [doi]
• Oritatami Systems Assemble Shapes No Less Complex Than Tile Assembly Model (ATAM)Daria Pchelina, Nicolas Schabanel, Shinnosuke Seki, Guillaume Theyssier. [doi]
• A 10-Approximation of the π/2-MSTAhmad Biniaz, Majid Daliri, Amir Hossein Moradpour. [doi]
• Probabilistic vs Deterministic GamblersLaurent Bienvenu, Valentino Delle Rose, Tomasz Steifer. [doi]
• Analyzing XOR-Forrelation Through Stochastic CalculusXinyu Wu. [doi]
• Linear Space Data Structures for Finite Groups with Constant Query-TimeBireswar Das, Anant Kumar, Shivdutt Sharma, Dhara Thakkar. [doi]