Abstract is missing.
- Graph Covers: Where Topology Meets Computer Science, and Simple Means DifficultJan Kratochvíl. 3-11 [doi]
- The Family of Fan-Planar GraphsMichael Kaufmann 0001. 12-19 [doi]
- Minimum Ply Covering of Points with Unit SquaresStephane Durocher, J. Mark Keil, Debajyoti Mondal. 23-35 [doi]
- Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prismsTakumi Shiota, Toshiki Saitoh. 36-48 [doi]
- Flipping Plane Spanning PathsOswin Aichholzer, Kristin Knorr, Wolfgang Mulzer, Johannes Obenaus, Rosna Paul, Birgit Vogtenhuber. 49-60 [doi]
- Away from Each OtherTetsuya Araki, Shin-Ichi Nakano. 61-70 [doi]
- Piercing Diametral Disks Induced by Edges of Maximum Spanning TreesA. Karim Abu-Affash, Paz Carmi, Meytal Maman. 71-77 [doi]
- Reflective Guarding a GalleryArash Vaezi, Bodhayan Roy, Mohammad Ghodsi. 78-89 [doi]
- Improved and Generalized Algorithms for Burning a Planar Point SetPrashant Gokhale, J. Mark Keil, Debajyoti Mondal. 90-101 [doi]
- On the Longest Flip Sequence to Untangle Segments in the PlaneGuilherme Dias da Fonseca, Yan Gerard, Bastien Rivier. 102-112 [doi]
- Inferring Strings from Position Heaps in Linear TimeKoshiro Kumagai, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara. 115-126 [doi]
- Internal Longest Palindrome Queries in Optimal TimeKazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama. 127-138 [doi]
- Finding the Cyclic Covers of a StringRoberto Grossi, Costas S. Iliopoulos, Jesper Jansson 0001, Zara Lim, Wing-Kin Sung, Wiktor Zuba. 139-150 [doi]
- Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect GraphsJun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka. 151-163 [doi]
- Better Hardness Results for the Minimum Spanning Tree Congestion ProblemHuong Luu, Marek Chrobak. 167-178 [doi]
- Energy Efficient Sorting, Selection and SearchingVarunkumar Jayapaul, Seungbum Jo, Krishna Palem, Srinivasa Rao Satti. 179-190 [doi]
- Reconfiguration of Vertex-Disjoint Shortest Paths on GraphsRin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara. 191-201 [doi]
- k-Transmitter Watchman RoutesBengt J. Nilsson, Christiane Schmidt 0001. 202-213 [doi]
- Splitting Plane Graphs to OuterplanarityMartin Gronemann, Martin Nöllenburg, Anaïs Villedieu. 217-228 [doi]
- Certifying Induced Subgraphs in Large GraphsUlrich Meyer 0001, Hung Tran, Konstantinos Tsakalidis. 229-241 [doi]
- Some Algorithmic Results for Eternal Vertex Cover Problem in GraphsKaustav Paul, Arti Pandey. 242-253 [doi]
- On the Complexity of Distance-d Independent Set ReconfigurationDuc A. Hoang. 254-266 [doi]
- On Star-Multi-interval Pairwise Compatibility GraphsAngelo Monti, Blerina Sinaimeri. 267-278 [doi]
- Parameterized Complexity of Optimizing List Vertex-Coloring Through ReconfigurationYusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou 0001. 279-290 [doi]
- Parameterized Complexity of Path Set PackingN. R. Aravind, Roopam Saxena. 291-302 [doi]
- Interweaving Real-Time Jobs with Energy Harvesting to Maximize ThroughputBaruch Schieber, Bhargav Samineni, Soroush Vahidi. 305-316 [doi]
- Recognizing When a Preference System is Close to Admitting a Master ListIldikó Schlotter. 317-329 [doi]
- Groups Burning: Analyzing Spreading Processes in Community-Based NetworksGennaro Cordasco, Luisa Gargano, Adele A. Rescigno. 330-342 [doi]
- Roman k-Domination: Hardness, Approximation and Parameterized ResultsA. Mohanapriya, P. Renjith, N. Sadagopan. 343-355 [doi]
- On the Parameterized Complexity of Compact Set PackingAmeet Gadekar. 359-370 [doi]
- Structural Parameterization of Cluster DeletionGiuseppe F. Italiano, Athanasios L. Konstantinidis, Charis Papadopoulos. 371-383 [doi]
- Parity Permutation Pattern MatchingVirginia Ardévol Martínez, Florian Sikora, Stéphane Vialette. 384-395 [doi]