| Position-Based Matching with Multi-Modal Preferences. | 0 | 0.34 | 2022 |
| Constrained Stable Marriage with Free Edges or Few Blocking Pairs. | 0 | 0.34 | 2021 |
| Sorting A Permutation By Best Short Swaps | 0 | 0.34 | 2021 |
| Parameterized Complexity of Shift Bribery in Iterative Elections | 0 | 0.34 | 2020 |
| A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem. | 0 | 0.34 | 2019 |
| On the complexity of bribery with distance restrictions. | 0 | 0.34 | 2019 |
| Can a permutation be sorted by best short swaps?. | 0 | 0.34 | 2018 |
| On the kernelization of split graph problems. | 0 | 0.34 | 2018 |
| ID Repair for Trajectories with Transition Graphs. | 0 | 0.34 | 2018 |
| An Optimal Algorithm For Small Group Multicast In Wireless Sensor Networks | 0 | 0.34 | 2018 |
| Parameterized Complexity of Voter Control in Multi-Peaked Elections. | 0 | 0.34 | 2018 |
| The control complexity of r-approval: from the single-peaked case to the general case | 8 | 0.46 | 2017 |
| Parameterized Complexity of Winner Determination in Minimax Committee Elections. | 1 | 0.37 | 2016 |
| How Hard is Bribery in Party Based Elections? | 3 | 0.39 | 2015 |
| An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs | 1 | 0.35 | 2015 |
| Parameterized Complexity of Control and Bribery for d-Approval Elections. | 2 | 0.38 | 2015 |
| How Hard is Control in Multi-Peaked Elections: A Parameterized Study | 8 | 0.46 | 2015 |
| Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges. | 18 | 0.77 | 2014 |
| Controlling Two-Stage Voting Rules. | 1 | 0.35 | 2014 |
| On Star-Cover and Path-Cover of a Tree. | 0 | 0.34 | 2014 |
| Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs. | 1 | 0.36 | 2014 |
| Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks | 13 | 0.59 | 2014 |
| How Credible is the Prediction of a Party-Based Election? | 3 | 0.49 | 2014 |
| Multiple graph edit distance: simultaneous topological alignment of multiple protein-protein interaction networks with an evolutionary algorithm | 8 | 0.46 | 2014 |
| Local search for string problems: Brute-force is essentially optimal | 0 | 0.34 | 2014 |
| Controlling elections with bounded single-peaked width. | 12 | 0.56 | 2014 |
| Algorithms for parameterized maximum agreement forest problem on multiple trees. | 5 | 0.45 | 2014 |
| Efficient Large-scale bicluster editing. | 0 | 0.34 | 2014 |
| An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs. | 1 | 0.39 | 2013 |
| Parameterized complexity of Min-power multicast problems in wireless ad hoc networks | 7 | 0.51 | 2013 |
| Complexity of Sincere-Strategy Preference-Based Approval Control in k-Peaked Elections | 1 | 0.35 | 2013 |
| Neighborhood-Preserving mapping between trees | 0 | 0.34 | 2013 |
| NABEECO: biological network alignment with bee colony optimization algorithm | 3 | 0.38 | 2013 |
| Covering tree with stars | 2 | 0.37 | 2013 |
| Possible Winner Problems on Partial Tournaments: A Parameterized Study. | 2 | 0.38 | 2013 |
| Exact algorithms for weighted and unweighted borda manipulation problems | 2 | 0.37 | 2013 |
| Planar graph vertex partition for linear problem kernels | 14 | 0.71 | 2013 |
| The parameterized complexity of local search for TSP, more refined | 3 | 0.38 | 2013 |
| Kernelization and Parameterized Complexity of Star Editing and Union Editing. | 0 | 0.34 | 2012 |
| A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments | 2 | 0.36 | 2012 |
| Data Reduction and Problem Kernels (Dagstuhl Seminar 12241). | 7 | 0.48 | 2012 |
| Integrated Simultaneous Analysis Of Different Biomedical Data Types With Exact Weighted Bi-Cluster Editing | 1 | 0.36 | 2012 |
| Complexity and parameterized algorithms for Cograph Editing | 14 | 0.70 | 2012 |
| Editing Graphs into Disjoint Unions of Dense Clusters | 10 | 0.58 | 2011 |
| On the parameterized complexity of consensus clustering | 2 | 0.37 | 2011 |
| Average parameterization and partial kernelization for computing medians | 17 | 0.75 | 2011 |
| A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems | 8 | 0.58 | 2011 |
| Parameterized Complexity of Arc-Weighted Directed Steiner Problems | 4 | 0.40 | 2011 |
| Cograph editing: complexity and parameterized algorithms | 6 | 0.53 | 2011 |
| An improved kernel for planar connected dominating set | 5 | 0.49 | 2011 |
