| Chess Is Hard Even for a Single Player. | 0 | 0.34 | 2022 |
| On Fair Division with Binary Valuations Respecting Social Networks. | 0 | 0.34 | 2022 |
| Imbalance parameterized by twin cover revisited | 0 | 0.34 | 2021 |
| On the Parameterized Complexity of Spanning Trees with Small Vertex Covers. | 0 | 0.34 | 2020 |
| Color spanning objects: Algorithms and hardness results. | 0 | 0.34 | 2020 |
| Special Issue "New Frontiers In Parameterized Complexity And Algorithms": Foreward By The Guest Editors | 0 | 0.34 | 2020 |
| On the complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules | 0 | 0.34 | 2020 |
| Parameterized complexity of happy coloring problems | 0 | 0.34 | 2020 |
| A Parameterized Perspective On Protecting Elections | 0 | 0.34 | 2019 |
| On structural parameterizations of firefighting. | 0 | 0.34 | 2019 |
| On the Parameterized Complexity of Party Nominations. | 0 | 0.34 | 2019 |
| Deleting to Structured Trees. | 0 | 0.34 | 2019 |
| On the Complexity of Two Dots for Narrow Boards and Few Colors. | 1 | 0.41 | 2018 |
| On Structural Parameterizations of Firefighting. | 0 | 0.34 | 2018 |
| Saving Critical Nodes with Firefighters is FPT. | 0 | 0.34 | 2017 |
| On the Exact Amount of Missing Information that makes Finding Possible Winners Hard. | 3 | 0.39 | 2017 |
| On the Complexity of Chamberlin-Courant on Almost Structured Profiles. | 1 | 0.35 | 2017 |
| Parameterized Dichotomy of Choosing Committees Based on Approval Votes in the Presence of Outliers. | 3 | 0.39 | 2017 |
| On Structural Parameterizations of Graph Motif and Chromatic Number. | 0 | 0.34 | 2017 |
| Color Spanning Objects: Algorithms and Hardness Results. | 0 | 0.34 | 2016 |
| The Runaway Rectangle Escape Problem. | 0 | 0.34 | 2016 |
| On the Computational Hardness of Manipulating Pairwise Voting Rules. | 0 | 0.34 | 2016 |
| Preference Elicitation For Single Crossing Domain. | 4 | 0.42 | 2016 |
| Kernelization complexity of Possible Winner and Coalitional Manipulation problems in voting | 4 | 0.51 | 2016 |
| Two Dots is NP-complete. | 0 | 0.34 | 2016 |
| Complexity of Manipulation with Partial Information in Voting. | 2 | 0.38 | 2016 |
| Elicitation for Preferences Single Peaked on Trees. | 2 | 0.37 | 2016 |
| Randomised Procedures for Initialising and Switching Actions in Policy Iteration. | 2 | 0.43 | 2016 |
| Frugal Bribery in Voting. | 7 | 0.45 | 2015 |
| Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints | 0 | 0.34 | 2015 |
| Solving d-SAT via backdoors to small treewidth | 9 | 0.50 | 2015 |
| On Choosing Committees Based on Approval Votes in the Presence of Outliers | 1 | 0.36 | 2015 |
| Manipulation is Harder with Incomplete Votes. | 0 | 0.34 | 2015 |
| Graph Modification Problems: A Modern Perspective | 0 | 0.34 | 2015 |
| Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets | 3 | 0.37 | 2015 |
| UNO Gets Easier for a Single Player. | 0 | 0.34 | 2014 |
| Backdoors into Heterogeneous Classes of SAT and CSP. | 5 | 0.42 | 2014 |
| Complexity of Kernelization in the Possible Winner Problem. | 0 | 0.34 | 2014 |
| Detecting Possible Manipulators in Elections. | 1 | 0.44 | 2014 |
| The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles. | 3 | 0.41 | 2014 |
| On the d-Runaway Rectangle Escape Problem. | 0 | 0.34 | 2014 |
| An Erdős--Ko--Rado theorem for matchings in the complete graph | 0 | 0.34 | 2013 |
| Imbalance is fixed parameter tractable | 2 | 0.43 | 2013 |
| On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges. | 6 | 0.48 | 2013 |
| Upper and lower bounds for weak backdoor set detection | 1 | 0.36 | 2013 |
| Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets. | 6 | 0.47 | 2013 |
| Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles. | 2 | 0.42 | 2013 |
| On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem. | 0 | 0.34 | 2013 |
| Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. | 4 | 0.43 | 2013 |
| Hardness of r-dominating set on Graphs of Diameter (r + 1). | 6 | 0.57 | 2013 |
