List of Accepted Papers

• Baruch Schieber, Bhargav Samineni, and Soroush Vahidi. Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput.

• Ameet Gadekar. On the parameterized complexity of Compact Set Packing.

• Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer, Johannes Obenaus, Rosna Paul, and Birgit Vogtenhuber. Flipping Plane Spanning Paths.

• Koshiro Kumagai, Diptarama Hendrian, Ryo Yoshinaka, and Ayumi Shinohara. Inferring strings from position heaps in linear time.

• Guilherme D. Da Fonseca, Yan Gerard, and Bastien Rivier. On the Longest Flip Sequence to Untangle Segments in the Plane.

• Huong Luu and Marek Chrobak. Better Hardness Results for the Minimum Spanning Tree Congestion Problem.

• Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, and Takashi Horiyama. Internal Longest Palindrome Queries in Optimal Time.

• Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung, and Wiktor Zuba. Finding the Cyclic Covers of a String.

• Stephane Durocher, Mark Keil, and Debajyoti Mondal. Minimum Ply Covering of Points with Unit Squares.

• Rin Saito, Hiroshi Eto, Takehiro Ito, and Ryuhei Uehara. Reconfiguration of vertex-disjoint shortest paths on graphs.

• Tetsuya Araki and Shin-Ichi Nakano. Away from Each Other.

• Gennaro Cordasco, Luisa Gargano, and Adele Rescigno. Groups Burning: Analyzing Spreading Processes in Community-based Networks.

• Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, and Xiao Zhou. Parameterized Complexity of Optimizing List Vertex-Coloring Through Reconfiguration.

• Ulrich Meyer, Hung Tran, and Konstantinos Tsakalidis. Certifying Induced Subgraphs in Large Graphs.

• Martin Gronemann, Martin Nöllenburg, and Anaïs Villedieu. Splitting Plane Graphs to Outerplanarity.

• A. Karim Abu-Affash, Paz Carmi, and Meytal Maman. Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree.

• A Mohanapriya, Renjith P, and N Sadagopan. Roman $k$-domination: Split graphs and Bipartite graphs.

• Giuseppe F. Italiano, Athanasios L. Konstantinidis, and Charis Papadopoulos. Structural Parameterization of Cluster Deletion.

• Takumi Shiota and Toshiki Saitoh. Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms.

• Ildikó Schlotter. Recognizing when a preference system is close to admitting a master list.

• N.R. Aravind and Roopam Saxena. Parameterized Complexity of Path Set Packing.

• Duc A. Hoang. On The Complexity of Distance-$d$ Independent Set Reconfiguration.

• Bengt J. Nilsson and Christiane Schmidt. $k$-Transmitter Watchman Routes.

• Arash Vaezi, Bodhayan Roy, and Mohammad Ghodsi. Reflective Guarding a Gallery.

• Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, and Yui Yoshioka. Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs.

• Varunkumar Jayapaul, Seungbum Jo, Krishna V. Palem, and Srinivasa Rao Satti. Energy Efficient Sorting, Selection and Searching.

• Kaustav Paul and Arti Pandey. Some Algorithmic Results for Eternal vertex cover Problem in graphs.

• Angelo Monti and Blerina Sinaimeri. On star-multi-interval pairwise compatibility graphs.

• Virginia Ardévol Martínez, Florian Sikora, and Stéphane Vialette. Parity Permutation Pattern Matching.

• Prashant Gokhale, Mark Keil, and Debajyoti Mondal. Improved and Generalized Algorithms for Burning a Planar Point Set.