Abstract is missing.
- The Path Taken for k-PathAndreas Björklund. 1 [doi]
- Randomized Techniques for Parameterized AlgorithmsDániel Marx. 2 [doi]
- Finding a Maximum Induced Degenerate Subgraph Faster Than 2 nMarcin Pilipczuk, Michal Pilipczuk. 3-12 [doi]
- The Exponential Time Hypothesis and the Parameterized Clique ProblemYijia Chen, Kord Eickmeyer, Jörg Flum. 13-24 [doi]
- New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating setBruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao. 25-36 [doi]
- A New Algorithm for Parameterized MAX-SATIvan Bliznets, Alexander Golovnev. 37-48 [doi]
- Restricted and Swap Common Superstring: A Parameterized ViewPaola Bonizzoni, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis. 49-60 [doi]
- Nonblocker in H-Minor Free Graphs: Kernelization Meets DischargingLukasz Kowalik. 61-72 [doi]
- Some Definitorial Suggestions for Parameterized Proof ComplexityJörg Flum, Moritz Müller. 73-84 [doi]
- An Exact Algorithm for Subset Feedback Vertex Set on Chordal GraphsPetr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei. 85-96 [doi]
- Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help?Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk. 97-108 [doi]
- A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink PairsCédric Bentz. 109-119 [doi]
- Instance Compression for the Polynomial Hierarchy and beyondChiranjit Chakraborty, Rahul Santhanam. 120-134 [doi]
- Polynomial Time and Parameterized Approximation Algorithms for BoxicityAbhijin Adiga, Jasine Babu, L. Sunil Chandran. 135-146 [doi]
- Homomorphic Hashing for Sparse Coefficient ExtractionPetteri Kaski, Mikko Koivisto, Jesper Nederlof. 147-158 [doi]
- Fast Monotone Summation over Disjoint SetsPetteri Kaski, Mikko Koivisto, Janne H. Korhonen. 159-170 [doi]
- Weighted Counting of k-Matchings Is #W[1]-HardMarkus Bläser, Radu Curticapean. 171-181 [doi]
- Computing Directed Pathwidth in O(1.89 n ) TimeKenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano. 182-193 [doi]
- MSOL Restricted Contractibility to Planar GraphsJames Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil. 194-205 [doi]
- On the Space Complexity of Parameterized ProblemsMichael Elberfeld, Christoph Stockhusen, Till Tantau. 206-217 [doi]
- On Tractable Parameterizations of Graph IsomorphismAdam Bouland, Anuj Dawar, Eryk Kopczynski. 218-230 [doi]
- Parameterized Algorithmics and Computational Experiments for Finding 2-ClubsSepp Hartung, Christian Komusiewicz, André Nichterlein. 231-241 [doi]
- Finding Dense Subgraphs of Sparse GraphsChristian Komusiewicz, Manuel Sorge. 242-251 [doi]
- Enumerating Neighbour and Closest StringsNaomi Nishimura, Narges Simjour. 252-263 [doi]
- An Improved Kernel for the Undirected Planar Feedback Vertex Set ProblemFaisal N. Abu-Khzam, Mazen Bou Khuzam. 264-273 [doi]