Ikuti
Tuukka Korhonen
Judul
Dikutip oleh
Dikutip oleh
Tahun
A single-exponential time 2-approximation algorithm for treewidth
T Korhonen
SIAM Journal on Computing, FOCS21-174-FOCS21-194, 2023
1212023
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
502021
Grid induced minor theorem for graphs of small degree
T Korhonen
Journal of Combinatorial Theory, Series B 160, 206-214, 2023
442023
MaxPre: an extended MaxSAT preprocessor
T Korhonen, J Berg, P Saikko, M Järvisalo
International Conference on Theory and Applications of Satisfiability …, 2017
422017
An improved parameterized algorithm for treewidth
T Korhonen, D Lokshtanov
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 528-541, 2023
312023
Fast FPT-approximation of branchwidth
FV Fomin, T Korhonen
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
312022
Computing tree decompositions with small independence number
C Dallard, FV Fomin, PA Golovach, T Korhonen, M Milanič
arXiv preprint arXiv:2207.09993, 2022
232022
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
192019
Fixed-parameter tractability of maximum colored path and beyond
FV Fomin, PA Golovach, T Korhonen, K Simonov, G Stamoulis
ACM Transactions on Algorithms 20 (4), 1-48, 2024
132024
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
112023
Minor containment and disjoint paths in almost-linear time
T Korhonen, M Pilipczuk, G Stamoulis
2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 53-61, 2024
102024
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
102024
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
102023
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
102019
PACE solver description: SMS
T Korhonen
15th International Symposium on Parameterized and Exact Computation (IPEC …, 2020
8*2020
Listing small minimal separators of a graph
T Korhonen
arXiv preprint arXiv:2012.09153, 2020
72020
SharpSAT-TD in model counting competitions 2021-2023
T Korhonen, M Järvisalo
arXiv preprint arXiv:2308.15819, 2023
62023
Tight lower bounds for problems parameterized by rank-width
B Bergougnoux, T Korhonen, J Nederlof
arXiv preprint arXiv:2210.02117, 2022
62022
On Induced Versions of Menger's Theorem on Sparse Graphs
P Gartland, T Korhonen, D Lokshtanov
arXiv preprint arXiv:2309.08169, 2023
52023
Finding optimal triangulations parameterized by edge clique cover
T Korhonen
Algorithmica 84 (8), 2242-2270, 2022
5*2022
Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.
Artikel 1–20