Guy Kortsarz and Zeev Nutov. Bounded Degree Group Steiner problems
Ewa Drgas-Burchardt, Hanna Furmanczyk and Elżbieta Sidorowicz. Equitable d-degenerate choosability of graphs
Vicente Acuña, Leandro I. S. De Lima, Giuseppe F. Italiano, Luca Pepè Sciarria, Marie-France Sagot and Blerina Sinaimeri. A family of tree-based generators for bubbles in directed graphs
Best Student Paper Award (shared) – Florent Foucaud, Benjamin Gras, Anthony Perez and Florian Sikora. On the complexity of Broadcast Domination and Multipacking in digraphs
Ioannis Lamprou, Ioannis Sigalas and Vassilis Zissimopoulos. Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
Best Paper Award – Peter Damaschke. Two Robots Patrolling on a Line: Integer Version and Approximability
Peter Damaschke. Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges
Koki Hamada, Shuichi Miyazaki and Kazuya Okamoto. Strongly Stable and Maximum Weakly Stable Noncrossing Matchings
Nina Chiarelli, Matjaž Krnc, Martin Milanič, Ulrich Pferschy, Nevena Pivač and Joachim Schauer. Fair packing of independent sets
Bogdan Alecu, Vadim Lozin and Dominique de Werra. The micro-world of cographs
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono and Yota Otachi. Parameterized Complexity of (A,l)-Path Packing
Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze and Peter Rossmanith. Further Results on Online Node- and Edge-Deletion Problems with Advice
Alexandre Blanché, Haruka Mizuta, Paul Ouvrard and Akira Suzuki. Decremental Optimization of Dominating Sets Under the Reconfiguration Framework
Ananya Christman, Christine Chung, Nicholas Jaczko, Tianzhi Li, Scott Westvold and Xinyue Xu. New Bounds for Maximizing Revenue in Online Dial-a-Ride
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias Kotsireas and Vijay Ganesh. Nonexistence Certificates for Ovals in a Projective Plane of Order Ten
Julien Bensmail, Foivos Fioravantes and Nicolas Nisse. On Proper Labellings of Graphs with Minimum Label Sum
B S Panda and Juhi Chaudhary. Acyclic Matching in Some Subclasses of Graphs
Vahan Mkrtchyan, Garik Petrosyan, K. Subramani and Piotr Wojciechowski. Parameterized algorithms for partial vertex covers in bipartite graphs
Tibor Jordan, Yusuke Kobayashi, Ryoga Mahara and Kazuhisa Makino. The Steiner problem for count matroids
Gennaro Cordasco, Luisa Gargano and Adele Rescigno. Iterated Type Partitions
Dimitri Lajou, Hervé Hocquard and Borut Lužar. Between proper and strong edge-colorings of subcubic graphs
Victor Campos, Raul Lopes, Andrea Marino and Ana Silva. Edge-Disjoint Branchings in Temporal Graphs
Benoît Groz, Frederik Mallmann-Trenn, Claire Mathieu and Victor Verdugo. Skyline Computation with Noisy Comparisons
Toni Böhnlein and Oliver Schaudt. On the Complexity of Stackelberg Matroid Pricing Problems
Toru Hasunuma. Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit and Saket Saurabh. On the Complexity of Singly Connected Vertex Deletion
Best Student Paper Award (shared) – Pratibha Choudhary. Polynomial Time Algorithms for Tracking Path Problems
Sankardeep Chakraborty, Kunihiko Sadakane and Srinivasa Rao Satti. Optimal In-place Algorithms for Basic Graph Problems
Erin Lanus and Charles Colbourn. Algorithms for Constructing Anonymizing Arrays
Kishen Gowda, Neeldhara Misra and Vraj Patel. A Parameterized Perspective on Attacking and Defending Elections
