Accepted Papers

·       Yaroslav Alekseev and Edward A. Hirsch. The power of the Binary Value Principle

·       Nader Bshouty. On One-Sided Testing Affine Subspaces

·       Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano and Reo Nonoue. Independent Set under a Change Constraint from an Initial Solution

·       Victor Pan, Soo Go, Qi Luan and Liang Zhao. Fast Subdivision Root-finding for a Black Box Polynomial: Cauchy Sum Algorithms

·       Hovhannes Harutyunyan and Narek Hovhannisyan. Broadcasting in Split Graphs

·       Muhammad Nur Yanhaona, Asswad Sarker Nomaan and Md. Saidur Rahman. Efficiently Enumerating All Spanning Trees of a Plane 3-Tree

·       Manish Kumar, Anisur Rahaman Molla and Sumathi Sivasubramaniam. Improved Deterministic Leader Election in Diameter-Two Networks

·       Satyabrata Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh and Shaily Verma. Partitioning Subclasses of Chordal Graphs with Few Deletions

·       Lorenzo Balzotti and Paolo G. Franciosa. Non-Crossing Shortest Paths Lengths in Planar Graphs in Linear Time

·       Costas Busch, Bogdan S. Chlebus, Dariusz R. Kowalski and Pavan Poudel. Stable Scheduling in Transactional Memory

·       Chun Jiang Zhu. Communication-Efficient Distributed Graph Clustering and Sparsification under Duplication Models

·       Eric Fusy and Gregory. Kucherov. Phase transition in count approximation by Count-Min sketch with conservative updates

·       Hagit Attiya and Noa Schiller. Asynchronous Fully-Decentralized SGD in the Cluster-Based Model

·       Tai Ben-Nun, Lukas Gianinazzi, Torsten Hoefler and Yishai Oltchik. Maxflows in Parametric Graph Templates

·       Pascal Koiran and Subhayan Saha. Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision

·       Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya and Rajath Rao. Parameterizing Path Partitions

·       Simon D. Fink and Ignaz Rutter. Maintaining Triconnected Components under Node Expansion

·       Sriram Bhyravarapu, Swati Kumari and Vinod Reddy. Dynamic Coloring on Restricted Graph Classes

·       Ivan Bliznets, Danil Sagunov and Eugene Tagin. Enumeration of Minimal Tropical Connected Sets

·       Kerem Geva, Matthew Katz, Joseph Mitchell and Eli Packer. Minimum-link $C$-Oriented Paths Visiting a Sequence of Regions in the Plane

·       Emmanuel Sam, Michael Fellows, Petr A. Golovach and Frances Rosamond. On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves

·       Lorenzo Balzotti and Paolo G. Franciosa. How Vulnerable is an Undirected Planar Graph with respect to Max Flow

·       Toshihiro Fujito, Kento Mukae and Junya Tsuzuki. Approximating Power Node-Deletion Problems

·       Thomas Blasius, Adrian Feilhauer and Jannik Westenfelder. Dynamic Flows with Time-Dependent Capacities

·       Tesshu Hanaka, Hirotaka Ono, Yota Otachi and Saeki Uda. Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond