- Gregory Gutin, Eun Jung Kim, Stefan Szeider and Anders Yeo. Probabilistic Approach to Problems Parameterized Above Tight Lower Bound
- Lukasz Kowalik, Tomasz Walen, Marjaz Krnc and Rok Erman. Improved induced matchings in sparse graphs
- Shai Gutner. Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor
- Petr Golovach and Dimitrios Thilikos. Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms
- Peter Damaschke. Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
- Peter Damaschke. Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover
- Karol Suchan and Yngve Villanger. Computing pathwidth faster than 2n
- Stefan Kratsch and Magnus Wahlström. Two Edge Modification Problems Without Polynomial Kernels
- Robert Ganian, Petr Hlineny, Joachim Kneis, Alexander Langer, Jan Obdržálek and Peter Rossmanith. On Digraph Width Measures in Parameterized Algorithmics
- Somnath Sikdar, Daniel Lokshtanov, Venkatesh Raman and Saket Saurabh. On the Directed Degree-Preserving Spanning Tree Problem
- Mikko Koivisto. Partitioning into Sets of Bounded Cardinality
- Jan Arne Telle, Binh-Minh Bui-Xuan and Martin Vatshelle. Boolean-width of graphs
- Gregory Gutin, Daniel Karapetyan and Igor Razgon. FPT Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs
- Michael Fellows, Danny Hermelin and Frances A. Rosamond. Well-Quasi-Ordering Bounded Treewidth Graphs
- Daniel Lokshtanov and Saket Saurabh. Even Faster Algorithm for Set Splitting!
- Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad Kanj, Frances Rosamond and Ondřej Suchý. What Makes Equitable Connected Partition Easy
- Daniel Raible, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Peter Rossmanith and Mathieu Liedloff. An exact algorithm for the Maximum Leaf Spanning Tree problem
- Sebastian Böcker, Falk Hüffner, Anke Truss and Magnus Wahlström. A faster fixed-parameter approach to drawing binary tanglegrams
- Jean Daligault and Stephan Thomasse. On finding directed trees with many leaves
- Dániel Marx and Ildi Schlotter. Stable Assignment with Couples: Parameterized Complexity and Local Search
- Panos Giannopoulos, Christian Knauer and Günter Rote. The parameterized complexity of some geometric problems in unbounded dimension
- Martin Furer, Serge Gaspers and Shiva Kasiviswanathan. An Exponential Time 2-Approximation Algorithm for Bandwidth
- Hans L. Bodlaender, Daniel Lokshtanov and Eelko Penninkx. Planar Capacitated Dominating Set is W[1]-hard
- Narges Simjour. Improved Parameterized Algorithms for the Kemeny Aggregation Problem
- Chris Calabro, Russell Impagliazzo and Ramamohan Paturi. The complexity of satisfiability of small depth circuits
|
|