Abstract is missing.
- Quadratic Vertex Kernel for Split Vertex DeletionAkanksha Agrawal, Sushmita Gupta, Pallavi Jain 0001, R. Krithika 0001. 1-12 [doi]
- The Temporal Explorer Who Returns to the BaseEleni C. Akrida, George B. Mertzios, Paul G. Spirakis. 13-24 [doi]
- Minimum Convex Partition of Point SetsAllan S. Barboza, Cid C. de Souza, Pedro J. de Rezende. 25-37 [doi]
- Parameterized Complexity of Safe SetRémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi. 38-49 [doi]
- Parameterized Complexity of DiameterMatthias Bentert, André Nichterlein. 50-61 [doi]
- Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid ConstraintsRené van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche. 62-74 [doi]
- Project GamesVittorio Bilò, Laurent Gourvès, Jérôme Monnot. 75-86 [doi]
- Subgraph Isomorphism on Graph Classes that Exclude a SubstructureHans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden. 87-98 [doi]
- Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge ColorsLaurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge. 99-111 [doi]
- k -cuts on a PathXing Shi Cai, Luc Devroye, Cecilia Holmgren, Fiona Skerman. 112-123 [doi]
- Extension of Vertex Cover and Independent Set in Some Classes of GraphsKatrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora. 124-136 [doi]
- On Hedonic Games with Common Ranking PropertyBugra Caskurlu, Fatih Erdem Kizilkaya. 137-148 [doi]
- Complexity of Scheduling for DARP with Soft Ride TimesJanka Chlebíková, Clément Dallard, Niklas Paulsen. 149-160 [doi]
- Vertex Deletion on Split Graphs: Beyond 4-Hitting SetPratibha Choudhary, Pallavi Jain 0001, R. Krithika, Vibha Sahlot. 161-173 [doi]
- Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency RequirementsSerafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Tomasz Jurdzinski, Alfredo Navarra, Tomasz Radzik, Grzegorz Stachowiak. 174-186 [doi]
- Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability (Extended Abstract)Miguel Coviello Gonzalez, Marek Chrobak. 187-198 [doi]
- Searching by Heterogeneous AgentsDariusz Dereniowski, Lukasz Kuszner, Robert Ostrowski. 199-211 [doi]
- Finding a Mediocre PlayerAdrian Dumitrescu. 212-223 [doi]
- Covering Tours and Cycle Covers with Turn Costs: Hardness and ApproximationSándor P. Fekete, Dominik Krupke. 224-236 [doi]
- The Parameterized Position Heap of a TrieNoriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 237-248 [doi]
- Parameterized Algorithms for Generalizations of Directed Feedback Vertex SetAlexander Göke, Dániel Marx, Matthias Mnich. 249-261 [doi]
- Shortest Reconfiguration Sequence for Sliding Tokens on SpidersDuc A. Hoang, Amanj Khorramian, Ryuhei Uehara. 262-273 [doi]
- Turing Tumble Is P(SPACE)-CompleteMatthew P. Johnson. 274-285 [doi]
- Linear-Time In-Place DFS and BFS on the Word RAMFrank Kammer, Andrej Sajenko. 286-298 [doi]
- A Faster Algorithm for the Strongly Stable b-Matching ProblemAdam Kunysz. 299-310 [doi]
- Eternal Domination in GridsFionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes. 311-322 [doi]
- On the Necessary Memory to Compute the Plurality in Multi-agent SystemsEmanuele Natale, Iliad Ramezani. 323-338 [doi]
- Complexity of Vertex Switching on Edge-Bicolored GraphsHo Lam Pang, Leizhen Cai. 339-351 [doi]
- Independent Lazy Better-Response Dynamics on Network GamesPaolo Penna, Laurent Viennot. 352-364 [doi]
- Subset Feedback Vertex Set in Chordal and Split GraphsGeevarghese Philip, Varun Rajan, Saket Saurabh 0001, Prafullkumar Tale. 365-376 [doi]