| Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory J Baste, MR Fellows, L Jaffke, T Masarık, M de Oliveira Oliveira, G Philip, ... IJCAI 2020, 1119--1125, 2020 | 68 | 2020 |
| Mim-width III. Graph powers and generalized distance domination problems L Jaffke, O Kwon, TJF Strømme, JA Telle Theoretical Computer Science 796, 216-236, 2019 | 64* | 2019 |
| Mim-width I. Induced path problems L Jaffke, O Kwon, JA Telle Discrete Applied Mathematics 278, 153-168, 2019 | 57* | 2019 |
| Mim-width II. The feedback vertex set problem L Jaffke, O Kwon, JA Telle Algorithmica 82 (1), 118-145, 2019 | 55* | 2019 |
| Fine-grained parameterized complexity analysis of graph coloring problems L Jaffke, BMP Jansen Discrete Applied Mathematics 327, 33-46, 2023 | 48* | 2023 |
| Diverse pairs of matchings FV Fomin, PA Golovach, L Jaffke, G Philip, D Sagunov arXiv preprint arXiv:2009.04567, 2020 | 36* | 2020 |
| FPT algorithms for diverse collections of hitting sets J Baste, L Jaffke, T Masařík, G Philip, G Rote Algorithms 12 (12), 254, 2019 | 36 | 2019 |
| What is known about vertex cover kernelization? MR Fellows, L Jaffke, AI Király, FA Rosamond, M Weller Adventures Between Lower Bounds and Higher Altitudes: Essays Dedicated to …, 2018 | 32 | 2018 |
| A logic-based algorithmic meta-theorem for mim-width B Bergougnoux, J Dreier, L Jaffke Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 26 | 2023 |
| XNLP-completeness for parameterized problems on graphs with a linear structure HL Bodlaender, C Groenland, H Jacob, L Jaffke, PT Lima Algorithmica, 1-42, 2024 | 19 | 2024 |
| Hedonic seat arrangement problems HL Bodlaender, T Hanaka, L Jaffke, H Ono, Y Otachi, TC van der Zanden arXiv preprint arXiv:2002.10898, 2020 | 18 | 2020 |
| A unifying framework for characterizing and computing width measures E Eiben, R Ganian, T Hamm, L Jaffke, O Kwon arXiv preprint arXiv:2109.14610, 2021 | 17 | 2021 |
| Well-partitioned chordal graphs J Ahn, L Jaffke, O Kwon, PT Lima Discrete Mathematics 345 (10), 112985, 2022 | 11 | 2022 |
| Bounded Width Graph Classes in Parameterized Algorithms L Jaffke University of Bergen, Norway, 2020 | 11 | 2020 |
| A tight quasi-polynomial bound for Global Label Min-Cut L Jaffke, PT Lima, T Masařík, M Pilipczuk, US Souza Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 10 | 2023 |
| Classes of intersection digraphs with good algorithmic properties L Jaffke, O Kwon, JA Telle Journal of Graph Theory 106 (1), 110-148, 2024 | 9 | 2024 |
| Typical Sequences Revisited—Computing Width Parameters of Graphs HL Bodlaender, L Jaffke, JA Telle Theory of Computing Systems 67 (1), 52-88, 2023 | 9* | 2023 |
| b-Coloring Parameterized by Clique-Width L Jaffke, PT Lima, D Lokshtanov Theory of Computing Systems 68 (4), 1049-1081, 2024 | 8 | 2024 |
| Treewidth is NP-complete on cubic graphs (and related results) HL Bodlaender, É Bonnet, L Jaffke, D Knop, PT Lima, M Milanič, ... arXiv preprint arXiv:2301.10031, 2023 | 8 | 2023 |
| Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation M Hatzel, L Jaffke, PT Lima, T Masařík, M Pilipczuk, R Sharma, M Sorge Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 8 | 2023 |
O-joung KwonHanyang UniversityDirección de correo verificada de hanyang.ac.kr