| A single-exponential time 2-approximation algorithm for treewidth T Korhonen SIAM Journal on Computing, FOCS21-174-FOCS21-194, 2023 | 97 | 2023 |
| MaxPre: an extended MaxSAT preprocessor T Korhonen, J Berg, P Saikko, M Järvisalo International Conference on Theory and Applications of Satisfiability …, 2017 | 37 | 2017 |
| Grid induced minor theorem for graphs of small degree T Korhonen Journal of Combinatorial Theory, Series B 160, 206-214, 2023 | 33 | 2023 |
| Integrating tree decompositions into decision heuristics of propositional model counters T Korhonen, M Järvisalo 27th International Conference on Principles and Practice of Constraint …, 2021 | 32 | 2021 |
| Fast FPT-approximation of branchwidth FV Fomin, T Korhonen Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 24 | 2022 |
| Computing tree decompositions with small independence number C Dallard, FV Fomin, PA Golovach, T Korhonen, M Milanič arXiv preprint arXiv:2207.09993, 2022 | 17 | 2022 |
| An improved parameterized algorithm for treewidth T Korhonen, D Lokshtanov Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 528-541, 2023 | 15 | 2023 |
| Solving Graph Problems via Potential Maximal Cliques: An Experimental Evaluation of the Bouchitté--Todinca Algorithm T Korhonen, J Berg, M Järvisalo Journal of Experimental Algorithmics (JEA) 24, 1-19, 2019 | 15 | 2019 |
| Enumerating potential maximal cliques via SAT and ASP T Korhonen, J Berg, M Järvisalo Proceedings of the International Joint Conference on Artificial Intelligence …, 2019 | 8 | 2019 |
| New width parameters for independent set: One-sided-mim-width and neighbor-depth B Bergougnoux, T Korhonen, I Razgon International Workshop on Graph-Theoretic Concepts in Computer Science, 72-85, 2023 | 7 | 2023 |
| Fixed-parameter tractability of maximum colored path and beyond FV Fomin, PA Golovach, T Korhonen, K Simonov, G Stamoulis Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 7 | 2023 |
| PACE solver description: Sms T Korhonen 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020 | 7* | 2020 |
| Listing small minimal separators of a graph T Korhonen arXiv preprint arXiv:2012.09153, 2020 | 6 | 2020 |
| Tight lower bounds for problems parameterized by rank-width B Bergougnoux, T Korhonen, J Nederlof arXiv preprint arXiv:2210.02117, 2022 | 5 | 2022 |
| Loandra: PMRES extended with preprocessing entering MaxSAT evaluation 2017 J Berg, T Korhonen, M Järvisalo MaxSAT Evaluation 2017, 13, 2017 | 5 | 2017 |
| Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition T Korhonen, D Lokshtanov Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 4 | 2024 |
| Dynamic treewidth T Korhonen, K Majewski, W Nadara, M Pilipczuk, M Sokołowski 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 4 | 2023 |
| Lower bounds on dynamic programming for maximum weight independent set T Korhonen arXiv preprint arXiv:2102.06901, 2021 | 4 | 2021 |
| On Induced Versions of Menger's Theorem on Sparse Graphs P Gartland, T Korhonen, D Lokshtanov arXiv preprint arXiv:2309.08169, 2023 | 3 | 2023 |
| Finding optimal triangulations parameterized by edge clique cover T Korhonen Algorithmica 84 (8), 2242-2270, 2022 | 3* | 2022 |
Matti JärvisaloProfessor, University of Helsinki在 helsinki.fi 的电子邮件经过验证
