| On the Parameterized Cluster Editing with Vertex Splitting Problem. | 0 | 0.34 | 2019 |
| Efficient parallel algorithms for parameterized problems | 0 | 0.34 | 2019 |
| Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework. | 0 | 0.34 | 2018 |
| Special Issue on Reconfiguration Problems. | 0 | 0.34 | 2018 |
| Efficient heuristic algorithms for positive-influence dominating set in social networks | 0 | 0.34 | 2018 |
| Accelerating Vertex Cover Optimization on a GPU Architecture | 0 | 0.34 | 2018 |
| A Dynamically Turbo-Charged Greedy Heuristic for Graph Coloring. | 0 | 0.34 | 2018 |
| Partitioning a graph into degenerate subgraphs. | 0 | 0.34 | 2018 |
| On the Complexity of Multi-Parameterized Cluster Editing. | 0 | 0.34 | 2017 |
| Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis. | 0 | 0.34 | 2017 |
| Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity. | 0 | 0.34 | 2017 |
| Building Clusters with Lower-Bounded Sizes. | 0 | 0.34 | 2016 |
| Enumerating minimal dominating sets in chordal graphs. | 3 | 0.40 | 2016 |
| On the Parameterized Parallel Complexity and the Vertex Cover Problem. | 1 | 0.35 | 2016 |
| Partitioning a graph into disjoint cliques and a triangle-free graph | 3 | 0.57 | 2015 |
| On scalable parallel recursive backtracking | 6 | 0.43 | 2015 |
| Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks | 1 | 0.35 | 2015 |
| Highly Scalable Parallel Search-Tree Algorithms: The Virtual Topology Approach | 0 | 0.34 | 2015 |
| On the Complexity of QoS-Aware Service Selection Problem. | 0 | 0.34 | 2015 |
| On the parameterized complexity of dynamic problems | 5 | 0.45 | 2015 |
| On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism. | 0 | 0.34 | 2014 |
| Data Reductions and Combinatorial Bounds for Improved Approximation Algorithms. | 1 | 0.35 | 2014 |
| NP-hardness results for partitioning graphs into disjoint cliques and a triangle-free subgraph. | 2 | 0.38 | 2014 |
| Approximation Algorithms Inspired by Kernelization Methods. | 1 | 0.35 | 2014 |
| A Hybrid Graph Representation for Exact Graph Algorithms. | 0 | 0.34 | 2014 |
| Maximum common induced subgraph parameterized by vertex cover | 1 | 0.35 | 2014 |
| Forbidden subgraph characterization of (P3-free, K3-free)-colourable cographs. | 0 | 0.34 | 2014 |
| An Easy-to-use Scalable Framework for Parallel Recursive Backtracking. | 1 | 0.41 | 2013 |
| The Multi-parameterized Cluster Editing Problem. | 2 | 0.45 | 2013 |
| An improved kernel for the undirected planar feedback vertex set problem | 2 | 0.39 | 2012 |
| Immersion Containment and Connectivity in Color-Critical Graphs. | 0 | 0.34 | 2012 |
| Almost Exact Graph 3-Coloring in O(1.277^n) Time. | 0 | 0.34 | 2012 |
| An exact algorithm for connected red–blue dominating set | 3 | 0.40 | 2011 |
| Charge and reduce: A fixed-parameter algorithm for String-to-String Correction | 4 | 0.47 | 2011 |
| A hybrid graph representation for recursive backtracking algorithms | 2 | 0.37 | 2010 |
| A kernelization algorithm for d-Hitting Set | 61 | 1.94 | 2010 |
| A fixed-parameter algorithm for string-to-string correction | 0 | 0.34 | 2010 |
| An improved kernelization algorithm for r-Set Packing | 6 | 0.48 | 2010 |
| A Quadratic Kernel for 3-Set Packing | 2 | 0.46 | 2009 |
| A bounded search tree algorithm for parameterized face cover | 0 | 0.34 | 2008 |
| Kernelization algorithms for d-hitting set problems | 27 | 1.75 | 2007 |
| Linear-time algorithms for problems on planar graphs with fixed disk dimension | 0 | 0.34 | 2007 |
| Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems | 0 | 0.34 | 2007 |
| The buffered work-pool approach for search-tree based optimization algorithms | 1 | 0.41 | 2007 |
| Crown Structures for Vertex Cover Kernelization | 44 | 1.73 | 2007 |
| The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover | 16 | 0.95 | 2007 |
| Kernels: annotated, proper and induced | 15 | 0.96 | 2006 |
| Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs | 0 | 0.34 | 2006 |
| Scalable Parallel Algorithms for FPT Problems | 38 | 2.34 | 2006 |
| A new approach and faster exact methods for the maximum common subgraph problem | 14 | 0.75 | 2005 |
