| Publication | Date of Publication | Type |
|---|
| Spartan bipartite graphs are essentially elementary | 2024-12-03 | Paper |
| Parameterized aspects of distinct Kemeny rank aggregation | 2024-11-07 | Paper |
| Romeo and Juliet meeting in forest like regions | 2024-10-24 | Paper |
| Chess is hard even for a single player | 2024-10-07 | Paper |
| Romeo and Juliet meeting in forest like regions | 2024-09-12 | Paper |
| Parameterized aspects of distinct Kemeny rank aggregation | 2024-05-31 | Paper |
| The price of equity with binary valuations and few agent types | 2024-05-29 | Paper |
| Chess is hard even for a single player | 2024-05-16 | Paper |
| Finding perfect matching cuts faster | 2023-12-22 | Paper |
| Spartan Bipartite Graphs are Essentially Elementary | 2023-08-08 | Paper |
| On fair division with binary valuations respecting social networks | 2023-05-08 | Paper |
| On the exact amount of missing information that makes finding possible winners hard | 2023-04-21 | Paper |
| Eternal vertex cover on bipartite graphs | 2022-11-11 | Paper |
| A Parameterized Perspective on Attacking and Defending Elections | 2022-10-13 | Paper |
| Fair division is hard even for amicable agents | 2022-03-24 | Paper |
| Exact multi-covering problems with geometric sets | 2022-02-14 | Paper |
| Imbalance parameterized by twin cover revisited | 2021-11-18 | Paper |
| A parameterized perspective on protecting elections | 2021-06-22 | Paper |
| Imbalance parameterized by twin cover revisited | 2021-04-21 | Paper |
| On the complexity of optimal matching reconfiguration | 2020-10-22 | Paper |
| Robustness radius for Chamberlin-Courant on restricted domains | 2020-10-22 | Paper |
| Parameterized complexity of happy coloring problems | 2020-08-17 | Paper |
| On the complexity of Two Dots for narrow boards and few colors | 2020-08-11 | Paper |
| On the parameterized complexity of spanning trees with small vertex covers | 2020-07-21 | Paper |
| Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? | 2020-06-09 | Paper |
| On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard | 2020-05-26 | Paper |
| Color spanning objects: algorithms and hardness results | 2020-05-18 | Paper |
| Deleting to structured trees | 2020-02-24 | Paper |
| On the parameterized complexity of party nominations | 2020-01-27 | Paper |
| The parameterized complexity of dominating set and friends revisited for structured graphs | 2019-10-22 | Paper |
| On the parameterized complexity of edge-linked paths | 2019-10-22 | Paper |
| Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers | 2019-08-13 | Paper |
| On structural parameterizations of firefighting | 2019-06-06 | Paper |
| Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs | 2019-01-11 | Paper |
| On the complexity of Chamberlin-Courant on almost structured profiles | 2018-10-25 | Paper |
| On the parameterized complexity of colorful components and related problems | 2018-09-06 | Paper |
| The parameterized complexity of happy colorings | 2018-06-15 | Paper |
| On structural parameterizations of firefighting | 2018-06-05 | Paper |
| Complexity of manipulation with partial information in voting | 2018-04-16 | Paper |
| Solving d-SAT via Backdoors to Small Treewidth | 2017-10-05 | Paper |
| Two Dots is NP-complete | 2017-07-17 | Paper |
| Frugal bribery in voting | 2017-05-11 | Paper |
| On structural parameterizations of graph motif and chromatic number | 2017-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2963917 | 2017-02-21 | Paper |
| Backdoors into heterogeneous classes of SAT and CSP | 2016-12-28 | Paper |
| Color spanning objects: algorithms and hardness results | 2016-03-23 | Paper |
| Hitting forbidden minors: approximation and kernelization | 2016-03-04 | Paper |
| Kernelization complexity of possible winner and coalitional manipulation problems in voting | 2016-01-21 | Paper |
| Unique covering problems with geometric sets | 2015-10-29 | Paper |
| Deterministic algorithms for matching and packing problems based on representative sets | 2015-10-21 | Paper |
| Parameterized algorithms and kernels for 3-hitting set with parity constraints | 2015-09-21 | Paper |
| On the parameterized complexity of finding separators with non-hereditary properties | 2015-09-02 | Paper |
| The kernelization complexity of connected domination in graphs with (no) small cycles | 2014-12-02 | Paper |
| Vertex Cover Gets Faster and Harder on Low Degree Graphs | 2014-09-26 | Paper |
| An Erdős-Ko-Rado theorem for matchings in the complete graph | 2014-06-11 | Paper |
| Imbalance is fixed parameter tractable | 2014-04-14 | Paper |
| Solving min ones 2-SAT as fast as vertex cover | 2014-01-16 | Paper |
| On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges | 2013-12-10 | Paper |
| Hardness of \(r\)-dominating set on graphs of diameter \((r + 1)\) | 2013-12-10 | Paper |
| Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs | 2013-12-06 | Paper |
| Quadratic upper bounds on the Erdős--Pósa property for a generalization of packing and covering cycles | 2013-11-15 | Paper |
| On the parameterized complexity of the maximum edge 2-coloring problem | 2013-09-20 | Paper |
| Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? | 2013-09-20 | Paper |
| The parameterized complexity of unique coverage and its variants | 2013-08-05 | Paper |
| Upper and lower bounds for weak backdoor set detection | 2013-08-05 | Paper |
| Hitting and Piercing Rectangles Induced by a Point Set | 2013-06-11 | Paper |
| FPT algorithms for connected feedback vertex set | 2012-12-21 | Paper |
| On parameterized independent feedback vertex set | 2012-11-27 | Paper |
| On the parameterized complexity of finding separators with non-hereditary properties | 2012-11-06 | Paper |
| Lower bounds on kernelization | 2012-10-16 | Paper |
| Kernelization -- preprocessing with a guarantee | 2012-09-05 | Paper |
| The effect of girth on the kernelization complexity of connected dominating set | 2012-08-29 | Paper |
| Hitting forbidden minors: approximation and kernelization | 2012-01-23 | Paper |
| Algorithmic aspects of dominator colorings in graphs | 2012-01-13 | Paper |
| On parameterized independent feedback vertex set | 2011-08-17 | Paper |
| On the Kernelization Complexity of Colorful Motifs | 2010-12-07 | Paper |
| Solving \textsc{minones-2-sat} as fast as \textsc{vertex cover} | 2010-09-03 | Paper |
| Imbalance is fixed parameter tractable | 2010-07-20 | Paper |
| FPT algorithms for connected feedback vertex set | 2010-02-09 | Paper |
| The complexity ecology of parameters: An illustration using bounded max leaf number | 2009-10-19 | Paper |
| The Budgeted Unique Coverage Problem and Color-Coding | 2009-08-18 | Paper |
| Graph Layout Problems Parameterized by Vertex Cover | 2009-01-29 | Paper |
