| Publication | Date of Publication | Type |
|---|
| Knapsack: connectedness, path, and shortest-path | 2024-05-31 | Paper |
| Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams | 2024-01-08 | Paper |
| Parameter analysis for guarding terrains | 2023-11-02 | Paper |
| Parameterized Study of Steiner Tree on Unit Disk Graphs | 2023-11-02 | Paper |
| Almost optimal query algorithm for hitting set using a subset query | 2023-07-10 | Paper |
| An ETH-Tight Exact Algorithm for Euclidean TSP | 2023-06-09 | Paper |
| Parameterized study of Steiner tree on unit disk graphs | 2023-04-21 | Paper |
| Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices | 2023-02-03 | Paper |
| FPT Algorithms for Embedding into Low-Complexity Graphic Metrics | 2022-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091015 | 2022-07-21 | Paper |
| Parameter analysis for guarding terrains | 2022-03-22 | Paper |
| Exact multi-covering problems with geometric sets | 2022-02-14 | Paper |
| Parameterized Complexity of Conflict-Free Graph Coloring | 2021-09-17 | Paper |
| FPT algorithms for embedding into low complexity graphic metrics | 2021-08-04 | Paper |
| Subexponential algorithms for rectilinear Steiner tree and arborescence problems | 2021-05-03 | Paper |
| Fixed parameter tractability of graph deletion problems over data streams | 2021-04-21 | Paper |
| Communication complexity of pairs of graph families with applications | 2020-05-26 | Paper |
| Kernelization of the subset general position problem in geometry | 2020-05-26 | Paper |
| Faster graph bipartization | 2020-02-24 | Paper |
| Tight kernels for covering and hitting: point hyperplane cover and polynomial point hitting set | 2020-02-12 | Paper |
| Parameterized complexity of conflict-free graph coloring | 2020-01-16 | Paper |
| Communication complexity and graph families | 2019-12-16 | Paper |
| Harmonious coloring: parameterized algorithms and upper bounds | 2019-05-17 | Paper |
| Exact algorithms for terrain guarding | 2018-11-13 | Paper |
| Exact algorithms for terrain guarding | 2018-08-13 | Paper |
| Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs | 2018-06-05 | Paper |
| Parameterized algorithms on perfect graphs for deletion to \((r,\ell)\)-graphs | 2018-03-21 | Paper |
| Subexponential algorithms for rectilinear Steiner tree and arborescence problems | 2018-01-30 | Paper |
| Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover} | 2017-11-09 | Paper |
| Quick but odd growth of cacti | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363780 | 2017-09-29 | Paper |
| Parameterized algorithms for deletion to \((r,\ell)\)-graphs | 2017-07-13 | Paper |
| Parameterized complexity of strip packing and minimum volume packing | 2017-01-09 | Paper |
| Harmonious coloring: parameterized algorithms and upper bounds | 2016-12-22 | Paper |
| A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion | 2016-05-03 | Paper |
| Parameterized complexity of \textsc{Red Blue Set Cover} for lines | 2016-05-03 | Paper |
| Exact and FPT algorithms for MAX-conflict free coloring in hypergraphs | 2016-01-11 | Paper |
| Unique covering problems with geometric sets | 2015-10-29 | Paper |
| Faster parameterized algorithms for deletion to split graphs | 2015-06-25 | Paper |
| Approximation algorithms for maximum independent set of a unit disk graph | 2014-12-15 | Paper |
| Parameterized approximations via \(d\)-skew-symmetric multicut | 2014-10-14 | Paper |
| Faster parameterized algorithms for deletion to split graphs | 2012-08-14 | Paper |
| New lower bound on Max Cut of hypergraphs with an application to \(r\)-Set Splitting | 2012-06-29 | Paper |
