Session 1 – Distributed Algorithms

Chair: Nader H. Bshouty

Asynchronous Fully Decentralized SGD in the Cluster-Based Model (10:00 – 10:30)
Hagit Attiya and Noa Schiller

Dynamic Scheduling of Transactional Memory (10:30 – 11:00) 
Costas Busch, Bogdan S. Chlebus, Dariusz R. Kowalski and Pavan Poudel

Improved Deterministic Leader Election in Diameter-Two Networks (11:00 – 11:30) 
Manish Kumar, Anisur Rahaman Molla and Sumathi Sivasubramaniam

Communication Efficient Distributed Graph Clustering and Sparsification under Duplication Models (11:30 – 12:00)
Chun Jiang Zhou

LUNCH

Session 2 – Complexity and Approximation

Chair: Costas Busch

BEST PAPER AWARD – Approximating Power Node Deletion Problems (14:00 – 14:30)
Toshihiro Fujito, Kento Mukae and Junya Tsuzuki

The Power of the Binary Value Principle (14:30 – 15:00)
Yaroslav Alekseev and Edward Hirsch 

On the Parameterized Complexity of the Structure of Linear Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves (15:00 – 15:30)
Emmanuel Sam, Michael Fellows, Peter A. Golovach and Frances Rosamond

Independent Set under a Change Constraint from an Initial Solution (15:30 – 16:00)
Yuichi Asahiro, Hiroshi Eto, Kana Korenaga Guohui Li, Eijkman Milano and Reo Nounoue

COFFEE BREAK

Session 3 – Graph Algorithms 1

Chair: Paul G. Spirakis

How Vulnerable is an Undirected Planar Graph with Respect to Max Flow  (16:30 – 17:00)
Lorenzo Balzotti and Paolo G. Franciosa

Dynamic Flows with Time-Dependent Capacities (17:00 – 17:30)
Thomas Blasius, Adrian Feilhauer and Jannik Westenfelder

 PRESENTATION     |     FULL PAPER

                            Maxflows in Parametric Graph Templates (17:30 – 18:00)
Tai Ben-Nun, Lukas Gianinazzi, Torsten Hoefler and Yishai Oltchik 

                        Broadcasting in Random Graphs (18:00 – 18:30)
Hovhannes Harutyunya and Narek Novhannisyan

Session 4 – Graph Algorithms 2

Chair: Vicky G. Papadopoulou

        Partitioning Subclasses of Chordal Graphs with Few Deletions (10:00 – 10:30)
Satyabrata Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh and Shaily Verma   

Maintaining Triconnected Components under Node Expansion (10:30 – 11:00)
Simon D. Fink and Ignaz Rutter

Dynamic Coloring on Restricted Graph Classes (11:00 – 11:30)
Sriram Bhyravarapu, Swati Kumari and Vinod Reddy

Enumeration of Minimal Tropical Connected Sets (11:30 – 12:00)
Ivan Bliznets, Danil Sagunov and Eugene Tagin 

 Session 5 – Graph Algorithms 3

Chair: Giuseppe Persiano

                           Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond (14:00 – 14:30)
Tesshu Hanaka, Hirotaka Ono, Yota Otachi and Saeki Uda 

                        Non-Crossing Shortest Path Lengths in Planar Graphs in Linear Time (14:30 – 15:00)
Lorenzo Balzotti and Paolo G. Franciosa

             Parameterizing Path Partitions (15:00 – 15:30)
Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya and Rajath Rao.    

                           Efficiently Enumerating All Spanning Trees of a Plane 3-Tree (15:30 – 16:00)
Muhammad Nur Yanhaona, Asswad Sarker Nomaan and Md. Saidur Rahman

PRESENTATION   |   FULL PAPER

TOUR & CONFERENCE DINNER

Session 6 – Potpuri

Chair: Friedhelm Meyer auf der Heide 

                      BEST PAPER AWARD – On one-sided testing affine subspaces (10:00 – 10:30)
Nader H. Bshouty 

                           Fast Cauchy Sum Algorithms for Polynomial Zeros and Matrix Eigenvalues (10:30 – 11:00)
Victor Pan, Soo Go, Qi Luan and Liang Zhao 

 PRESENTATION     |     FULL PAPER

                          Phase transition in count approximation by Count-Min sketch with conservative updates (11:00 – 11:30)
Eric Fusy and Gregory. Kucherov

                          Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic                                       Precision (11:30 – 12:00)
Pascal Koiran and Subhayan Saha

                           Minimum-link $C$-Oriented Paths Visiting a Sequence of Regions in the Plane (12:00 – 12:30)
Kerem Geva, Matthew Katz, Joseph Mitchell and Eli Packer

CLOSING