Accepted Papers
Exact and Approximate High-Multiplicity Scheduling on Identical Machines
Klaus Jansen, Kai Kahler and Esther Zwanger
Unit refutations in Horn constraint systems
Piotr Wojciechowski and K. Subramani.
On Exact Learning of $d$-Monotone Functions
Nader Bshouty.
Computational Complexity of Combinatorial Distance Matrix Realisation
David Fairbairn, George Mertzios and Norbert Peyerimhoff.
Online Range Assignment Problems
Paz Carmi, Matthew Katz and Idan Tomer.
General Position Subset Selection in Line Arrangements
Adrian Dumitrescu.
Branching Programs with Extended Memory: New Insights
Suryajith Chillara and Nithish Raja.
Tatami Printer: Physical ZKPs for Tatami Puzzles
Suthee Ruangwises.
On the Price of Anarchy in Packet Routing Games with FIFO
Daniel Schmand, Torben Schürenberg and Martin Strehler.
On the Computational Complexity of Graph Reconstruction
Cristina Bazgan, Morgan Chopin, André Nichterlein and Camille Richer.
Efficient Certifying Algorithms for Linear Classification
Vincenzo Bonifaci and Sara Galatro.
Improved Sublinear-time Moment Estimation using Weighted Sampling
Anup Bhattacharya and Pinki Pradhan.
On the Structural Parameterizations of Locating-Dominating Set and Test Cover
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar and Prafullkumar Tale.
Improved bounds for group testing in arbitrary hypergraphs
Annalisa De Bonis.
A Parameterized Perspective of All-Colors
Peter Strulo, Václav Blažej and Satyabrata Jana.
On the Discrete and Semi-Continuous Versions of the Two Watchtowers Problem in the Plane
Leonidas Palios.
Degree Realization by Bipartite Cactus Graphs
Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran and Dror Rawitz.
On Two Simple[st] Learning Tasks
Omrit Filtser, Kien Huynh, Anastasia Lemetti, Joseph Mitchell, Tatiana Polishchuk and Valentin Polishchuk.
Dynamic Filter and Retrieval with One Access to Modifiable Memory
Ioana Bercea, Guy Even, Tomer Even and Gabriel Marques Domingues.
Longest path transversals in claw-free and $P_5$-free graphs
Paloma Lima and Amir Nikabadi.
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.
On The Computational Complexity of Games with Uncertainty
Bruce M. Kapron and Koosha Samieefar.
Happy set problems on cubic graphs and convex bipartite graphs
Yuichi Asahiro, Hiroshi Eto, Guohui Lin, Eiji Miyano and Yudai Oka.
Network Creation Games with 2-Neighborhood Maximization
Merlin de la Haye, Pascal Lenzner, Daniel Schmand and Nicole Schröder.
Almost-catalytic Computation
Sagar Bisoyi, Krishnamoorthy Dinesh, Bhabya Deep Rai and Jayalal Sarma.
The Complexity of Landmark Hub Labeling
Louann Coste, Ruoying Li, Sabine Storandt and Tobias Töpfer.
Improved Bounds for Geodetic Hulls
Gregor Diatzko, Sabine Storandt and Tobias Töpfer.
Disjoint Temporal Walks Under Waiting Time Constraints
Allen Ibiapina, Raul Lopes, Andrea Marino and Ana Silva.
A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering
Kensuke Oowa, Peter Fulla and Takuro Fukunaga.
Bounded degree QBF and positional games
Nacim Oijid.
Subsequence Matching and LCS with Segment Number Constraints
Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka and Ayumi Shinohara.
Fast Geographic Routing in Fixed-Growth Graphs
Ofek Gila, Michael Goodrich, Abraham Illickan and Vinesh Sridhar.
Arithmetic Circuits with Division
Silas Cato Sacher.
Pinwheel Covering
Akitoshi Kawamura, Yusuke Kobayashi and Yosuke Kusano.
On the Hardness of the Drone Delivery Problem
Simon Bartlmae, Andreas Hene and Kelin Luo.
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.
Burning Path-like and Clique-like Graphs
Radhika Aggarwal, Pradeesha Ashok and Dhairya Gupta.
Online Bichromatic Piercing Set Problem
Minati De and Ratnadip Mandal.
Packing dimers to maximum occupancy under soft-core constraints
Robert Barish and Tetsuo Shibuya.
Atoms versus Avoiding Simplicial Vertices
Karl Boddy, Konrad K. Dabrowski and Daniel Paulusma.
Supereulerian Testing on Semi-Eulerian Graphs
Wing-Kai Hon, Meng-Tsung Tsai and Ching-Yu Yang.
Perpetual Scheduling with Explorable Uncertainty
William Evans and Seyed Ali Tabatabaee.
Exact and Parameterized Algorithms for Window Minimization in Bipartite Arrangement
Shashank Chauhan, Tanmay Inamdar, Lawqueen Kanesh and Sanjukta Roy.