A practical fpt algorithm for Flow Decomposition and transcript assembly K Kloster, P Kuinke, MP O'Brien, F Reidl, FS Villaamil, BD Sullivan, ... 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and …, 2018 | 20 | 2018 |
Complexity of independency and cliquy trees K Casel, J Dreier, H Fernau, M Gobbert, P Kuinke, FS Villaamil, ... Discrete Applied Mathematics 272, 2-15, 2020 | 10 | 2020 |
Overlapping communities in social networks J Dreier, P Kuinke, R Przybylski, F Reidl, P Rossmanith, S Sikdar arXiv preprint arXiv:1412.4973, 2014 | 7 | 2014 |
Local structure theorems for erdős–rényi graphs and their algorithmic applications J Dreier, P Kuinke, BL Xuan, P Rossmanith SOFSEM 2018: Theory and Practice of Computer Science: 44th International …, 2018 | 6 | 2018 |
The Complexity of Packing Edge-Disjoint Paths J Dreier, J Fuchs, TA Hartmann, P Kuinke, P Rossmanith, B Tauer, ... 14th International Symposium on Parameterized and Exact Computation (IPEC …, 2019 | 4 | 2019 |
First-order model-checking in random graphs and complex networks J Dreier, P Kuinke, P Rossmanith arXiv preprint arXiv:2006.14488, 2020 | 3 | 2020 |
Maximum shallow clique minors in preferential attachment graphs have polylogarithmic size J Dreier, P Kuinke, P Rossmanith Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2020 | 3 | 2020 |
Survey of parameter-preserving reductions P Kuinke Bachelor thesis, RWTH Aachen University, 2013 | 2 | 2013 |
The Fine Structure of Preferential Attachment Graphs I: Somewhere-Denseness J Dreier, P Kuinke, P Rossmanith arXiv preprint arXiv:1803.11114, 2018 | 1 | 2018 |
14th International Symposium on Parameterized and Exact Computation (IPEC 2019) BA Berendsohn, L Kozma, D Marx, S Bessy, M Bougeret, ADA Carneiro, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2019 | | 2019 |