Abstract is missing.
- Coordinating Swarms of Objects at Extreme DimensionsSándor P. Fekete. 3-13 [doi]
- A Family of Tree-Based Generators for Bubbles in Directed GraphsVicente Acuña, Leandro Lima, Giuseppe F. Italiano, Luca Pepè Sciarria, Marie-France Sagot, Blerina Sinaimeri. 17-29 [doi]
- The Micro-world of CographsBogdan Alecu, Vadim V. Lozin, Dominique de Werra. 30-42 [doi]
- Parameterized Complexity of (A, ℓ )-Path PackingRémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi 0001, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi. 43-55 [doi]
- On Proper Labellings of Graphs with Minimum Label SumJulien Bensmail, Foivos Fioravantes, Nicolas Nisse. 56-68 [doi]
- Decremental Optimization of Dominating Sets Under the Reconfiguration FrameworkAlexandre Blanché, Haruka Mizuta, Paul Ouvrard, Akira Suzuki. 69-82 [doi]
- On the Complexity of Stackelberg Matroid Pricing ProblemsToni Böhnlein, Oliver Schaudt. 83-96 [doi]
- Nonexistence Certificates for Ovals in a Projective Plane of Order TenCurtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh. 97-111 [doi]
- Edge-Disjoint Branchings in Temporal GraphsVictor A. Campos, Raul Lopes, Andrea Marino, Ana Silva. 112-125 [doi]
- Optimal In-place Algorithms for Basic Graph ProblemsSankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti. 126-139 [doi]
- Further Results on Online Node- and Edge-Deletion Problems with AdviceLi-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith. 140-153 [doi]
- Fair Packing of Independent SetsNina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer. 154-165 [doi]
- Polynomial Time Algorithms for Tracking Path ProblemsPratibha Choudhary. 166-179 [doi]
- New Bounds for Maximizing Revenue in Online Dial-a-RideAnanya Christman, Christine Chung, Nicholas Jaczko, Tianzhi Li, Scott Westvold, Xinyue Xu, David S. Yuen. 180-194 [doi]
- Iterated Type PartitionsGennaro Cordasco, Luisa Gargano, Adele A. Rescigno. 195-210 [doi]
- Two Robots Patrolling on a Line: Integer Version and ApproximabilityPeter Damaschke. 211-223 [doi]
- Ordering a Sparse Graph to Minimize the Sum of Right Ends of EdgesPeter Damaschke. 224-236 [doi]
- On the Complexity of Singly Connected Vertex DeletionAvinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh 0001. 237-250 [doi]
- Equitable d-degenerate Choosability of GraphsEwa Drgas-Burchardt, Hanna Furmanczyk, Elzbieta Sidorowicz. 251-263 [doi]
- On the Complexity of Broadcast Domination and Multipacking in DigraphsFlorent Foucaud, Benjamin Gras 0002, Anthony Perez 0001, Florian Sikora. 264-276 [doi]
- A Parameterized Perspective on Attacking and Defending ElectionsKishen N. Gowda, Neeldhara Misra, Vraj Patel. 277-288 [doi]
- Skyline Computation with Noisy ComparisonsBenoît Groz, Frederik Mallmann-Trenn, Claire Mathieu, Victor Verdugo. 289-303 [doi]
- Strongly Stable and Maximum Weakly Stable Noncrossing MatchingsKoki Hamada, Shuichi Miyazaki, Kazuya Okamoto. 304-315 [doi]
- Connectivity Keeping Trees in 2-Connected Graphs with Girth ConditionsToru Hasunuma. 316-329 [doi]
- The Steiner Problem for Count MatroidsTibor Jordán, Yusuke Kobayashi, Ryoga Mahara, Kazuhisa Makino. 330-342 [doi]
- Bounded Degree Group Steiner Tree ProblemsGuy Kortsarz, Zeev Nutov. 343-354 [doi]
- Between Proper and Strong Edge-Colorings of Subcubic GraphsHervé Hocquard, Dimitri Lajou, Borut Luzar. 355-367 [doi]
- Improved Budgeted Connected Domination and Budgeted Edge-Vertex DominationIoannis Lamprou, Ioannis Sigalas, Vassilis Zissimopoulos. 368-381 [doi]
- Algorithms for Constructing Anonymizing ArraysErin Lanus, Charles J. Colbourn. 382-394 [doi]
- Parameterized Algorithms for Partial Vertex Covers in Bipartite GraphsVahan Mkrtchyan, Garik Petrosyan, K. Subramani, Piotr J. Wojciechowski. 395-408 [doi]
- Acyclic Matching in Some Subclasses of GraphsB. S. Panda, Juhi Chaudhary. 409-421 [doi]