Abstract is missing.
- The Complexity of Satisfaction on Sparse GraphsAnuj Dawar. 1-2 [doi]
- On the Kernelization Complexity of Colorful MotifsAbhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan. 14-25 [doi]
- Partial Kernelization for Rank Aggregation: Theory and ExperimentsNadja Betzler, Robert Bredereck, Rolf Niedermeier. 26-37 [doi]
- Enumerate and Measure: Improving Parameter Budget ManagementDaniel Binkele-Raible, Henning Fernau. 38-49 [doi]
- On the Exact Complexity of Evaluating Quantified ::::k::::-CNFChris Calabro, Russell Impagliazzo, Ramamohan Paturi. 50-59 [doi]
- Cluster Editing: Kernelization Based on Edge CutsYixin Cao, Jianer Chen. 60-71 [doi]
- Computing the Deficiency of Housing Markets with Duplicate HousesKatarína Cechlárová, Ildikó Schlotter. 72-83 [doi]
- A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic ApplicationRobert Crowston, Gregory Gutin, Mark Jones, Anders Yeo. 84-94 [doi]
- An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex DeletionMarek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk. 95-106 [doi]
- Multivariate Complexity Analysis of Swap BriberyBritta Dorn, Ildikó Schlotter. 107-122 [doi]
- Parameterizing by the Number of NumbersMichael R. Fellows, Serge Gaspers, Frances A. Rosamond. 123-134 [doi]
- Are There Any Good Digraph Width Measures?Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar. 135-146 [doi]
- On the (Non-)existence of Polynomial Kernels for ::::P::::::::::l::::::-free Edge Modification ProblemsSylvain Guillemot, Christophe Paul, Anthony Perez. 147-157 [doi]
- Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint ProgrammingGregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo. 158-169 [doi]
- On the Grundy Number of a GraphFrédéric Havet, Leonardo Sampaio. 170-179 [doi]
- Exponential Time Complexity of Weighted Counting of Independent SetsChristian Hoffmann. 180-191 [doi]
- The Exponential Time Complexity of Computing the Probability That a Graph Is ConnectedThore Husfeldt, Nina Taslaman. 192-203 [doi]
- Inclusion/Exclusion Branching for Partial Dominating Set and Set SplittingJesper Nederlof, Johan M. M. van Rooij. 204-215 [doi]
- Small Vertex Cover Makes Petri Net Coverability and Boundedness EasierM. Praveen. 216-227 [doi]