| Publication | Date of Publication | Type |
|---|
| On MAX-SAT with cardinality constraint | 2024-12-12 | Paper |
| Meta-theorems for parameterized streaming algorithms | 2024-11-28 | Paper |
| Deleting, eliminating and decomposing to hereditary classes are all FPT-equivalent | 2024-07-19 | Paper |
| Subexponential Parameterized algorithms on disk graphs (extended abstract) | 2024-07-19 | Paper |
| On MAX-SAT with cardinality constraint | 2024-07-19 | Paper |
| Backdoor sets on nowhere dense SAT | 2024-06-24 | Paper |
| Parameterized algorithms for minimum sum vertex cover | 2024-05-31 | Paper |
| Max-SAT with cardinality constraint parameterized by the number of clauses | 2024-05-31 | Paper |
| Parameterized approximation scheme for biclique-free max \(k\)-weight SAT and max coverage | 2024-05-14 | Paper |
| A framework for approximation schemes on disk graphs | 2024-05-14 | Paper |
| Improved FPT Algorithms for Deletion to Forest-Like Structures | 2024-04-24 | Paper |
| Diverse collections in matroids and graphs | 2024-02-21 | Paper |
| Socially fair matching: exact and approximation algorithms | 2024-01-16 | Paper |
| An ETH-tight algorithm for bidirected Steiner connectivity | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147415 | 2024-01-15 | Paper |
| Improved FPT Algorithms for Deletion to Forest-Like Structures. | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6089671 | 2023-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6089666 | 2023-11-13 | Paper |
| ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs | 2023-11-02 | Paper |
| Low-Rank Binary Matrix Approximation in Column-Sum Norm. | 2023-10-31 | Paper |
| List homomorphism: beyond the known boundaries | 2023-07-26 | Paper |
| On the optimality of pseudo-polynomial algorithms for integer programming | 2023-03-01 | Paper |
| Parameterization Above a Multiplicative Guarantee | 2023-02-03 | Paper |
| Parameterized complexity of list coloring and max coloring | 2022-11-11 | Paper |
| Parameterized complexity of set-restricted disjoint paths on chordal graphs | 2022-11-11 | Paper |
| Partial vertex cover on graphs of bounded degeneracy | 2022-11-11 | Paper |
| Target set selection parameterized by vertex cover and more | 2022-10-04 | Paper |
| Multiplicative Parameterization Above a Guarantee | 2022-09-24 | Paper |
| Fast exact algorithms for survivable network design with uniform requirements | 2022-08-18 | Paper |
| Structural parameterizations with modulator oblivion | 2022-08-03 | Paper |
| On the Parameterized Complexity of [1,j]-Domination Problems | 2022-07-21 | Paper |
| Decomposition of Map Graphs with Applications. | 2022-07-21 | Paper |
| Quick separation in chordal and split graphs | 2022-07-18 | Paper |
| Complexity of the Steiner Network Problem with Respect to the Number of Terminals | 2022-07-18 | Paper |
| Gerrymandering on graphs: computational complexity and parameterized algorithms | 2022-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5077647 | 2022-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075790 | 2022-05-11 | Paper |
| A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs | 2022-04-20 | Paper |
| On the parameterized complexity of reconfiguration of connected dominating sets | 2022-03-25 | Paper |
| 2-Approximating Feedback Vertex Set in Tournaments | 2022-02-16 | Paper |
| On the Optimality of Pseudo-polynomial Algorithms for Integer Programming | 2021-08-04 | Paper |
| Parameterized Low-Rank Binary Matrix Approximation | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993296 | 2021-06-15 | Paper |
| Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems | 2021-05-03 | Paper |
| Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms | 2021-05-03 | Paper |
| Simultaneous feedback edge set: a parameterized perspective | 2021-03-26 | Paper |
| 2-Approximating Feedback Vertex Set in Tournaments | 2021-02-02 | Paper |
| Hitting topological minors is FPT | 2021-01-19 | Paper |
| Parameterized low-rank binary matrix approximation | 2021-01-15 | Paper |
| Going Far from Degeneracy | 2020-10-29 | Paper |
| Lossy Kernels for Connected Dominating Set on Sparse Graphs | 2020-08-05 | Paper |
| Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? | 2020-06-09 | Paper |
| Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs | 2020-05-27 | Paper |
| Communication Complexity of Pairs of Graph Families with Applications | 2020-05-26 | Paper |
| Linear representation of transversal matroids and gammoids parameterized by rank | 2020-04-07 | Paper |
| Parameterized complexity of geometric covering problems having conflicts | 2020-01-16 | Paper |
| On the parameterized complexity of \([1,j]\)-domination problems | 2019-12-27 | Paper |
| Communication Complexity and Graph Families | 2019-12-16 | Paper |
| Approximation Schemes for Low-rank Binary Matrix Approximation Problems | 2019-12-02 | Paper |
| Finding, hitting and packing cycles in subexponential time on unit disk graphs | 2019-11-07 | Paper |
| On the parameterized complexity of edge-linked paths | 2019-10-22 | Paper |
| On the complexity of Mixed Dominating Set | 2019-10-22 | Paper |
| Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity | 2019-10-15 | Paper |
| Parameterized computational geometry via decomposition theorems | 2019-10-15 | Paper |
| On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets | 2019-10-01 | Paper |
| Lossy Kernels for Connected Dominating Set on Sparse Graphs | 2019-09-30 | Paper |
| Editing to Connected F-Degree Graph | 2019-08-29 | Paper |
| Rank Vertex Cover as a Natural Problem for Algebraic Compression | 2019-08-29 | Paper |
| Harmonious coloring: parameterized algorithms and upper bounds | 2019-05-17 | Paper |
| Parameterized algorithms for list \(K\)-cycle | 2019-03-11 | Paper |
| Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree | 2019-02-06 | Paper |
| Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs | 2019-01-11 | Paper |
| Deterministic Truncation of Linear Matroids | 2018-11-13 | Paper |
| Representative Families of Product Families | 2018-11-05 | Paper |
| Long directed \((s,t)\)-path: FPT algorithm | 2018-10-19 | Paper |
| Finding even subgraphs even faster | 2018-09-07 | Paper |
| Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms | 2018-08-02 | Paper |
| Fréchet distance between a line and avatar point set | 2018-07-26 | Paper |
| On the kernelization complexity of string problems | 2018-05-17 | Paper |
| Reconfiguration on sparse graphs | 2018-05-08 | Paper |
| Fréchet Distance Between a Line and Avatar Point Set | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636486 | 2018-04-19 | Paper |
| Parameterized Algorithms for List K-Cycle | 2018-04-19 | Paper |
| Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs | 2018-03-21 | Paper |
| Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms | 2018-03-15 | Paper |
| Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems | 2018-01-30 | Paper |
| Editing to Connected f-Degree Graph | 2018-01-24 | Paper |
| Mixed Dominating Set: a parameterized perspective | 2018-01-04 | Paper |
| Linear representation of transversal matroids and gammoids parameterized by rank | 2017-10-23 | Paper |
| Quick but odd growth of cacti | 2017-10-10 | Paper |
| B-chromatic number: Beyond NP-hardness | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363780 | 2017-09-29 | Paper |
| Fast exact algorithms for survivable network design with uniform requirements | 2017-09-22 | Paper |
| Parameterized complexity of geometric covering problems having conflicts | 2017-09-22 | Paper |
| Lossy kernelization | 2017-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5275384 | 2017-07-13 | Paper |
| Finding Even Subgraphs Even Faster | 2017-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2963917 | 2017-02-21 | Paper |
| Harmonious Coloring: Parameterized Algorithms and Upper Bounds | 2016-12-22 | Paper |
| On the parameterized complexity of b-\textsc{chromatic number} | 2016-11-14 | Paper |
| Reconfiguration on sparse graphs | 2015-10-30 | Paper |
| On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids | 2015-10-30 | Paper |
| Deterministic Truncation of Linear Matroids | 2015-10-27 | Paper |
| Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree | 2015-10-27 | Paper |
| Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets | 2015-10-21 | Paper |
| Faster parameterized algorithms for deletion to split graphs | 2015-06-25 | Paper |
| Representative Sets of Product Families | 2014-10-08 | Paper |
| On the Kernelization Complexity of String Problems | 2014-09-26 | Paper |
| Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs | 2013-12-06 | Paper |
| Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule? | 2013-09-20 | Paper |
| On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles | 2012-09-25 | Paper |
| Faster Parameterized Algorithms for Deletion to Split Graphs | 2012-08-14 | Paper |
