Session 1 – Scheduling

Chair: Vincenzo Bonifaci

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
Klaus Jansen, Kai Kahler and Esther Zwanger.

Perpetual Scheduling with Explorable Uncertainty
William Evans and Seyed Ali Tabatabaee.

Pinwheel Covering
Akitoshi Kawamura, Yusuke Kobayashi and Yosuke Kusano.

Session 2: Models of computation and complexity

Chair: Nader Bshouty

Branching Programs with Extended Memory: New Insights
Suryajith Chillara and Nithish Raja.

Almost-catalytic Computation
Sagar Bisoyi, Krishnamoorthy Dinesh, Bhabya Deep Rai and Jayalal Sarma.

Bounded degree QBF and positional games
Nacim Oijid.

Arithmetic Circuits with Division
Silas Cato Sacher.

LUNCH

Session 3: Complexity and Learning

Chair: Loukas Georgiadis

Computational Complexity of Combinatorial Distance Matrix Realisation
David Fairbairn, George Mertzios and Norbert Peyerimhoff.

On Exact Learning of $d$-Monotone Functions
Nader Bshouty.

Efficient Certifying Algorithms for Linear Classification
Vincenzo Bonifaci and Sara Galatro.

On Two Simple[st] Learning Tasks
Omrit Filtser, Kien Huynh, Anastasia Lemetti, Joseph Mitchell, Tatiana Polishchuk and Valentin Polishchuk.

COFFEE BREAK

Session 4: Graph classes and parameterized complexity

Chair: Andrea Marino

On the Structural Parameterizations of Locating-Dominating Set and Test Cover
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar and Prafullkumar Tale.

A Parameterized Perspective of All-Colors
Peter Strulo, Václav Blažej and Satyabrata Jana.

Longest path transversals in claw-free and $P_5$-free graphs
Paloma Lima and Amir Nikabadi.

Happy set problems on cubic graphs and convex bipartite graphs
Yuichi Asahiro, Hiroshi Eto, Guohui Lin, Eiji Miyano and Yudai Oka.

Session 5: Computational geometry

Chair: Kien Huynh

     General Position Subset Selection in Line Arrangements
Adrian Dumitrescu. 

On the Discrete and Semi-Continuous Versions of the Two Watchtowers Problem in the Plane
Leonidas Palios.

Online Range Assignment Problems
Paz Carmi, Matthew Katz and Idan Tomer.

Session 6: Game theory and cryptography

Chair: Loukas Georgiadis

      On the Price of Anarchy in Packet Routing Games with FIFO
Daniel Schmand, Torben Schürenberg and Martin Strehler.

On The Computational Complexity of Games with Uncertainty
Bruce M. Kapron and Koosha Samieefar.

Network Creation Games with 2-Neighborhood Maximization
Merlin de la Haye, Pascal Lenzner, Daniel Schmand and Nicole Schröder.

Tatami Printer: Physical ZKPs for Tatami Puzzles
Suthee Ruangwises.

Best Paper Awards

Chair: Irene Finocchi

Atoms versus Avoiding Simplicial Vertices 
Karl Boddy, Konrad K. Dabrowski and Daniel Paulusma.

Realizing Graphs with Cut Constraints
Lucas de Oliveira Silva, Vítor Gomes Chagas, Samuel Plaça de Paula, Greis Yvet Oropeza Quesquén and Uéverton dos Santos Souza.

Session 7: Certifying algorithms, online algorithms, and strings

Chair: Adrian Dumitrescu

Online Bichromatic Piercing Set Problem
Minati De and Ratnadip Mandal.

Subsequence Matching and LCS with Segment Number Constraints
Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka and Ayumi Shinohara.

Unit refutations in Horn constraint systems
Piotr Wojciechowski and K. Subramani.

SOCIAL EVENT (GUIDED TOUR & DINNER)

Session 8: Fixed-parameter algorithms

Chair: Tiziana Calamoneri 

A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering
Kensuke Oowa, Peter Fulla and Takuro Fukunaga.

Nonpartisan Feedback Vertex Set
Nidhi Purohit, Souvik Saha, Saket Saurabh and Anannya Upasana.

Parameterized Complexity of Disconnected Matchings
Sushmita Gupta, Pallavi Jain, Lawqueen Kanesh, Sounak Modak and Saket Saurabh.

Session 9: Graph algorithms

Chair: Irene Finocchi

Degree Realization by Bipartite Cactus Graphs
Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran and Dror Rawitz.

Disjoint Temporal Walks Under Waiting Time Constraints
Allen Ibiapina, Raul Lopes, Andrea Marino and Ana Silva.

Supereulerian Testing on Semi-Eulerian Graphs
Wing-Kai Hon, Meng-Tsung Tsai and Ching-Yu Yang.

Packing dimers to maximum occupancy under soft-core constraints
Robert Barish and Tetsuo Shibuya.

Session 10: Shortest paths and delivery

Chair: Blerina Sinaimeri

Improved Bounds for Geodetic Hulls
Gregor Diatzko, Sabine Storandt and Tobias Töpfer.

Fast Geographic Routing in Fixed-Growth Graphs
Ofek Gila, Michael Goodrich, Abraham Illickan and Vinesh Sridhar.

On the Hardness of the Drone Delivery Problem
Simon Bartlmae, Andreas Hene and Kelin Luo.

The Complexity of Landmark Hub Labeling
Louann Coste, Ruoying Li, Sabine Storandt and Tobias Töpfer.

Session 11: Graph algorithms and sublinear algorithms

Chair: Blerina Sinaimeri

On the Computational Complexity of Graph Reconstruction
Cristina Bazgan, Morgan Chopin, André Nichterlein and Camille Richer.

Burning Path-like and Clique-like Graphs
Radhika Aggarwal, Pradeesha Ashok and Dhairya Gupta.

Exact and Parameterized Algorithms for Window Minimization in Bipartite Arrangement
Shashank Chauhan, Tanmay Inamdar, Lawqueen Kanesh and Sanjukta Roy.

Improved Sublinear-time Moment Estimation using Weighted Sampling
Anup Bhattacharya and Pinki Pradhan. 

Conference closing