| Publication | Date of Publication | Type |
|---|
| On the parameterized complexity of deletion to \(\mathcal{H}\)-free strong components | 2024-12-18 | Paper |
| Finding a highly connected Steiner subgraph and its applications | 2024-12-03 | Paper |
| Meta-theorems for parameterized streaming algorithms | 2024-11-28 | Paper |
| An exact algorithm for knot-free vertex deletion | 2024-08-06 | Paper |
| Deleting, eliminating and decomposing to hereditary classes are all FPT-equivalent | 2024-07-19 | Paper |
| Backdoor sets on nowhere dense SAT | 2024-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147261 | 2024-01-15 | Paper |
| On the Parameterized Complexity of Clique Elimination Distance | 2023-11-13 | Paper |
| On the lossy kernelization for connected treedepth deletion set | 2023-05-05 | Paper |
| On the optimality of pseudo-polynomial algorithms for integer programming | 2023-03-01 | Paper |
| On the Complexity of Recovering Incidence Matrices | 2023-02-07 | Paper |
| Distance from triviality 2.0: hybrid parameterizations | 2022-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089249 | 2022-07-18 | Paper |
| A fixed-parameter tractable algorithm for elimination distance to bounded degree graphs | 2022-04-20 | Paper |
| On the optimality of pseudo-polynomial algorithms for integer programming | 2021-08-04 | Paper |
| Reducing CMSO model checking to highly connected graphs | 2021-07-28 | Paper |
| Brief announcement: Treewidth modulator: emergency exit for DFVS | 2021-07-28 | Paper |
| On structural parameterizations of the edge disjoint paths problem | 2021-06-11 | Paper |
| Towards a polynomial kernel for directed feedback vertex set | 2021-04-19 | Paper |
| Parameterized Complexity and Approximability of Directed Odd Cycle Transversal | 2021-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136298 | 2020-11-25 | Paper |
| On the approximate compressibility of connected vertex cover | 2020-10-12 | Paper |
| A New Perspective on FO Model Checking of Dense Graph Classes | 2020-09-11 | Paper |
| A characterization of König-Egerváry graphs with extendable vertex covers | 2020-08-04 | Paper |
| Path-contractions, edge deletions and connectivity preservation | 2020-05-27 | Paper |
| A Linear-Time Parameterized Algorithm for Node Unique Label Cover | 2020-05-27 | Paper |
| Towards a polynomial kernel for directed feedback vertex set | 2020-05-26 | Paper |
| Lossy Kernels for Hitting Subgraphs | 2020-05-26 | Paper |
| Linear representation of transversal matroids and gammoids parameterized by rank | 2020-04-07 | Paper |
| Faster graph bipartization | 2020-02-24 | Paper |
| Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS | 2020-01-16 | Paper |
| Alternative parameterizations of \textsc{Metric Dimension} | 2020-01-16 | Paper |
| On approximate preprocessing for domination and hitting subgraphs with connected deletion sets | 2019-08-07 | Paper |
| Linear time parameterized algorithms via skew-symmetric multicuts | 2019-06-20 | Paper |
| On the complexity landscape of connected \(f\)-factor problems | 2019-05-17 | Paper |
| Backdoors for linear temporal logic | 2019-02-14 | Paper |
| Path-contractions, edge deletions and connectivity preservation | 2019-01-25 | Paper |
| Linear time parameterized algorithms for \textsc{Subset Feedback Vertex Set} | 2018-11-12 | Paper |
| Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts | 2018-11-12 | Paper |
| Discovering archipelagos of tractability for constraint satisfaction and counting | 2018-11-05 | Paper |
| Faster parameterized algorithms using linear programming | 2018-10-30 | Paper |
| Discovering archipelagos of tractability for constraint satisfaction and counting | 2018-07-16 | Paper |
| On the kernelization complexity of string problems | 2018-05-17 | Paper |
| Reconfiguration on sparse graphs | 2018-05-08 | Paper |
| A New Perspective on FO Model Checking of Dense Graph Classes | 2018-04-23 | Paper |
| Combining treewidth and backdoors for CSP | 2018-04-19 | Paper |
| Strong parameterized deletion: bipartite graphs | 2018-04-19 | Paper |
| On the complexity landscape of connected \(f\)-factor problems | 2018-03-21 | Paper |
| Parameterized algorithms for survivable network design with uniform demands | 2018-03-15 | Paper |
| When recursion is better than iteration: a linear-time algorithm for acyclicity with few error vertices | 2018-03-15 | Paper |
| Backdoor treewidth for SAT | 2017-11-15 | Paper |
| Linear representation of transversal matroids and gammoids parameterized by rank | 2017-10-23 | Paper |
| Solving d-SAT via Backdoors to Small Treewidth | 2017-10-05 | Paper |
| Lossy kernelization | 2017-08-17 | Paper |
| Hitting selected (odd) cycles | 2017-08-14 | Paper |
| Faster exact algorithms for some terminal set problems | 2017-06-30 | Paper |
| Metric Dimension of Bounded Tree-length Graphs | 2017-06-14 | Paper |
| Vertex Exponential Algorithms for Connected f-Factors | 2017-04-25 | Paper |
| Partially Polynomial Kernels for Set Cover and Test Cover | 2017-02-21 | Paper |
| Backdoors to q-Horn | 2017-01-30 | Paper |
| A faster parameterized algorithm for Group Feedback Edge Set | 2016-12-22 | Paper |
| Partially polynomial kernels for set cover and test cover | 2016-07-22 | Paper |
| A parameterized algorithm for mixed-cut | 2016-05-03 | Paper |
| Backdoors to q-Horn | 2016-03-23 | Paper |
| Reconfiguration on sparse graphs | 2015-10-30 | Paper |
| On the parameterized complexity of \textsc{Girth} and \textsc{Connectivity} problems on linear matroids | 2015-10-30 | Paper |
| Linear time parameterized algorithms for subset feedback vertex set | 2015-10-27 | Paper |
| Metric dimension of bounded width graphs | 2015-09-16 | Paper |
| Faster parameterized algorithms for deletion to split graphs | 2015-06-25 | Paper |
| Parameterized approximations via \(d\)-skew-symmetric multicut | 2014-10-14 | Paper |
| On the kernelization complexity of string problems | 2014-09-26 | Paper |
| Parameterized algorithms to preserve connectivity | 2014-07-01 | Paper |
| Hardness of \(r\)-dominating set on graphs of diameter \((r + 1)\) | 2013-12-10 | Paper |
| Faster exact algorithms for some terminal set problems | 2013-12-10 | Paper |
| A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments | 2013-12-02 | Paper |
| Parameterized Complexity of Directed Steiner Tree on Sparse Graphs | 2013-09-17 | Paper |
| Parameterized tractability of multiway cut with parity constraints | 2013-08-12 | Paper |
| Parameterized algorithms for even cycle transversal | 2012-11-06 | Paper |
| LP can be a cure for parameterized problems | 2012-08-23 | Paper |
| Faster parameterized algorithms for deletion to split graphs | 2012-08-14 | Paper |
| A polynomial kernel for Feedback Arc Set on bipartite tournaments | 2011-12-16 | Paper |
| Paths, flowers and vertex cover | 2011-09-16 | Paper |
| On the Kernelization Complexity of Colorful Motifs | 2010-12-07 | Paper |
