| 2010 | A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application. Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo |
| 2010 | An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion. Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
| 2010 | Are There Any Good Digraph Width Measures? Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
| 2010 | Cluster Editing: Kernelization Based on Edge Cuts. Yixin Cao, Jianer Chen |
| 2010 | Computing the Deficiency of Housing Markets with Duplicate Houses. Katarína Cechlárová, Ildikó Schlotter |
| 2010 | Enumerate and Measure: Improving Parameter Budget Management. Daniel Binkele-Raible, Henning Fernau |
| 2010 | Exponential Time Complexity of Weighted Counting of Independent Sets. Christian Hoffmann |
| 2010 | Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting. Jesper Nederlof, Johan M. M. van Rooij |
| 2010 | Multivariate Complexity Analysis of Swap Bribery. Britta Dorn, Ildikó Schlotter |
| 2010 | On the (Non-)existence of Polynomial Kernels for Sylvain Guillemot, Christophe Paul, Anthony Perez |
| 2010 | On the Exact Complexity of Evaluating Quantified Chris Calabro, Russell Impagliazzo, Ramamohan Paturi |
| 2010 | On the Grundy Number of a Graph. Frédéric Havet, Leonardo Sampaio Rocha |
| 2010 | On the Kernelization Complexity of Colorful Motifs. Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan |
| 2010 | Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo |
| 2010 | Parameterized Complexity Results in Symmetry Breaking. Toby Walsh |
| 2010 | Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings Venkatesh Raman, Saket Saurabh |
| 2010 | Parameterizing by the Number of Numbers. Michael R. Fellows, Serge Gaspers, Frances A. Rosamond |
| 2010 | Partial Kernelization for Rank Aggregation: Theory and Experiments. Nadja Betzler, Robert Bredereck, Rolf Niedermeier |
| 2010 | Proper Interval Vertex Deletion. Yngve Villanger |
| 2010 | Protrusions in Graphs and Their Applications. Fedor V. Fomin |
| 2010 | Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier. M. Praveen |
| 2010 | The Complexity of Satisfaction on Sparse Graphs. Anuj Dawar |
| 2010 | The Exponential Time Complexity of Computing the Probability That a Graph Is Connected. Thore Husfeldt, Nina Taslaman |